diff options
| author | Daniel Micay <danielmicay@gmail.com> | 2013-06-13 03:25:28 -0400 |
|---|---|---|
| committer | Daniel Micay <danielmicay@gmail.com> | 2013-06-13 03:25:28 -0400 |
| commit | ed7892ac00f01ceb1904b3b5049d9dd749a462bf (patch) | |
| tree | 4e247ebb9399199a8a05618355a3f56a490f78fb /src/libstd | |
| parent | 996301331e2d8ac7611d15ca82cc3ebc1abb632d (diff) | |
| download | rust-ed7892ac00f01ceb1904b3b5049d9dd749a462bf.tar.gz rust-ed7892ac00f01ceb1904b3b5049d9dd749a462bf.zip | |
hashmap: remove leftover debug!() logging
Diffstat (limited to 'src/libstd')
| -rw-r--r-- | src/libstd/hashmap.rs | 8 |
1 files changed, 1 insertions, 7 deletions
diff --git a/src/libstd/hashmap.rs b/src/libstd/hashmap.rs index c0cc92723ba..ad9620d4e7e 100644 --- a/src/libstd/hashmap.rs +++ b/src/libstd/hashmap.rs @@ -94,9 +94,7 @@ impl<K:Hash + Eq,V> HashMap<K, V> { #[inline(always)] fn next_bucket(&self, idx: uint, len_buckets: uint) -> uint { - let n = (idx + 1) % len_buckets; - debug!("next_bucket(%?, %?) = %?", idx, len_buckets, n); - n + (idx + 1) % len_buckets } #[inline(always)] @@ -215,16 +213,12 @@ impl<K:Hash + Eq,V> HashMap<K, V> { match self.bucket_for_key_with_hash(hash, &k) { TableFull => { fail!("Internal logic error"); } FoundHole(idx) => { - debug!("insert fresh (%?->%?) at idx %?, hash %?", - k, v, idx, hash); self.buckets[idx] = Some(Bucket{hash: hash, key: k, value: v}); self.size += 1; None } FoundEntry(idx) => { - debug!("insert overwrite (%?->%?) at idx %?, hash %?", - k, v, idx, hash); match self.buckets[idx] { None => { fail!("insert_internal: Internal logic error") } Some(ref mut b) => { |
