diff options
| author | Will Crichton <wcrichto@cs.stanford.edu> | 2021-08-26 11:46:00 -0700 |
|---|---|---|
| committer | Will Crichton <wcrichto@cs.stanford.edu> | 2021-08-26 11:46:00 -0700 |
| commit | 8767b00d67a561af5a4e97d4ccbc8f53f931df2a (patch) | |
| tree | 6516fb5eb2aad3f384dd96af329c3e9569fb9fea | |
| parent | ce37f0a35559fb5396881f3d9a547f161b1e822d (diff) | |
| download | rust-8767b00d67a561af5a4e97d4ccbc8f53f931df2a.tar.gz rust-8767b00d67a561af5a4e97d4ccbc8f53f931df2a.zip | |
Formatting
| -rw-r--r-- | compiler/rustc_index/src/bit_set.rs | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/compiler/rustc_index/src/bit_set.rs b/compiler/rustc_index/src/bit_set.rs index 610421f8060..f5768198f34 100644 --- a/compiler/rustc_index/src/bit_set.rs +++ b/compiler/rustc_index/src/bit_set.rs @@ -274,7 +274,7 @@ fn sparse_intersect<T: Idx>( // Optimization of dense/sparse intersection. The resulting set is // 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, -// then returned as the new set. +// then returned as the new set. fn dense_sparse_intersect<T: Idx>( dense: &BitSet<T>, sparse: &SparseBitSet<T>, @@ -312,7 +312,7 @@ impl<T: Idx> BitRelations<HybridBitSet<T>> for BitSet<T> { HybridBitSet::Sparse(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, // the BitSet is cleared and `updated` is copied into `self`. self.clear(); |
