nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-11-22 06:44:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

Formatting

Browse Source
This commit is contained in:
Will Crichton 2021-08-26 11:46:00 -07:00
parent ce37f0a355
commit 8767b00d67
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
compiler/rustc_index/src/bit_set.rs
View File

@ -274,7 +274,7 @@ fn sparse_intersect<T: Idx>(
// Optimization of dense/sparse intersection. The resulting set is // Optimization of dense/sparse intersection. The resulting set is
// guaranteed to be at most the size of the sparse set, and hence can be // guaranteed to be at most the size of the sparse set, and hence can be
// represented as a sparse set. Therefore the sparse set is copied and filtered, // represented as a sparse set. Therefore the sparse set is copied and filtered,
// then returned as the new set. // then returned as the new set.
fn dense_sparse_intersect<T: Idx>( fn dense_sparse_intersect<T: Idx>(
dense: &BitSet<T>, dense: &BitSet<T>,
sparse: &SparseBitSet<T>, sparse: &SparseBitSet<T>,
@ -312,7 +312,7 @@ impl<T: Idx> BitRelations<HybridBitSet<T>> for BitSet<T> {
HybridBitSet::Sparse(sparse) => { HybridBitSet::Sparse(sparse) => {
let (updated, changed) = dense_sparse_intersect(self, sparse); let (updated, changed) = dense_sparse_intersect(self, sparse);
// We can't directly assign the BitSet to the SparseBitSet, and // We can't directly assign the BitSet to the SparseBitSet, and
// doing `*self = updated.to_dense()` would cause a drop / reallocation. Instead, // doing `*self = updated.to_dense()` would cause a drop / reallocation. Instead,
// the BitSet is cleared and `updated` is copied into `self`. // the BitSet is cleared and `updated` is copied into `self`.
self.clear(); self.clear();