56 lines
1.4 KiB
Rust
56 lines
1.4 KiB
Rust
use std::iter;
|
|
|
|
pub fn simple_hash(s: &str) -> usize {
|
|
let mut h: u32 = 5381;
|
|
for c in s.chars() {
|
|
h = (h ^ c as u32).wrapping_add(h.rotate_right(6));
|
|
}
|
|
h as usize
|
|
}
|
|
|
|
/// Compute an open addressed, quadratically probed hash table containing
|
|
/// `items`. The returned table is a list containing the elements of the
|
|
/// iterable `items` and `None` in unused slots.
|
|
pub fn generate_table<'cont, T, I: iter::Iterator<Item = &'cont T>, H: Fn(&T) -> usize>(
|
|
items: I,
|
|
num_items: usize,
|
|
hash_function: H,
|
|
) -> Vec<Option<&'cont T>> {
|
|
let size = (1.20 * num_items as f64) as usize;
|
|
// TODO do we really need the multiply by two here?
|
|
let size = if size.is_power_of_two() {
|
|
size * 2
|
|
} else {
|
|
size.next_power_of_two()
|
|
};
|
|
|
|
let mut table = vec![None; size];
|
|
|
|
for i in items {
|
|
let mut h = hash_function(&i) % size;
|
|
let mut s = 0;
|
|
while table[h].is_some() {
|
|
s += 1;
|
|
h = (h + s) % size;
|
|
}
|
|
table[h] = Some(i);
|
|
}
|
|
|
|
table
|
|
}
|
|
|
|
#[test]
|
|
fn test_generate_table() {
|
|
let v = vec!["Hello".to_string(), "world".to_string()];
|
|
let table = generate_table(v.iter(), v.len(), |s| simple_hash(&s));
|
|
assert_eq!(
|
|
table,
|
|
vec![
|
|
None,
|
|
Some(&"Hello".to_string()),
|
|
Some(&"world".to_string()),
|
|
None
|
|
]
|
|
);
|
|
}
|