user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Manually implement Hash for SmallIntMap

Browse source
This commit is contained in:
nham 2014-07-26 12:04:41 -04:00
parent 3f1c37e96d
commit fadbc0b88b
1 changed files with 20 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

32
src/libcollections/smallintmap.rs
View file

@ -24,6 +24,8 @@ use core::mem::replace;
use {Collection, Mutable, Map, MutableMap, MutableSeq};
use {vec, slice};
use vec::Vec;
use hash;
use hash::Hash;
/// A map optimized for small integer keys.
///
@ -58,7 +60,7 @@ use vec::Vec;
/// months.clear();
/// assert!(months.is_empty());
/// ```
#[deriving(Hash, PartialEq, Eq)]
#[deriving(PartialEq, Eq)]
pub struct SmallIntMap<T> {
v: Vec<Option<T>>,
}
@ -167,6 +169,12 @@ impl<V:Clone> Clone for SmallIntMap<V> {
}
}
impl <S: hash::Writer, T: Hash<S>> Hash<S> for SmallIntMap<T> {
fn hash(&self, state: &mut S) {
self.v.hash(state)
}
}
impl<V> SmallIntMap<V> {
/// Create an empty SmallIntMap.
///
@ -478,8 +486,8 @@ pub type Values<'a, T> =
#[cfg(test)]
mod test_map {
use std::prelude::*;
use std::hash;
use vec::Vec;
use hash;
use {Map, MutableMap, Mutable, MutableSeq};
use super::SmallIntMap;
@ -764,19 +772,19 @@ mod test_map {
#[test]
fn test_hash() {
let mut x = SmallIntMap::new();
let mut y = SmallIntMap::new();
let mut x = SmallIntMap::new();
let mut y = SmallIntMap::new();
assert!(hash::hash(&x) == hash::hash(&y));
x.insert(1, 'a');
x.insert(2, 'b');
x.insert(3, 'c');
assert!(hash::hash(&x) == hash::hash(&y));
x.insert(1, 'a');
x.insert(2, 'b');
x.insert(3, 'c');
y.insert(3, 'c');
y.insert(2, 'b');
y.insert(1, 'a');
y.insert(3, 'c');
y.insert(2, 'b');
y.insert(1, 'a');
assert!(hash::hash(&x) == hash::hash(&y));
assert!(hash::hash(&x) == hash::hash(&y));
}
#[test]