#hash-map #hash #chaining #map #separate #key-hash #hash-key

yanked schm

Simplified HashMap implementation handling collision by separate chaining

0.1.2 Apr 30, 2022
0.1.1 Apr 30, 2022
0.1.0 Apr 30, 2022

#23 in #hash-key

MIT license

7KB
150 lines

schm

A basic example of hash collision using two strings:

use std::{
    collections::hash_map::DefaultHasher,
    hash::{Hash, Hasher},
};

const DEFAULT_CAPACITY: u64 = 17;

fn hash_to_index<T: Hash>(key: T) -> u64 {
    let mut state = DefaultHasher::new();
    key.hash(&mut state);
    state.finish() % DEFAULT_CAPACITY
}

fn main() {
    let a = hash_to_index("orange"); //  Calculates to '8'
    let b = hash_to_index("blueberry"); //  Calculates to '8'

    assert_eq!(a, b)
}

Here, collision is completely handled due to separate chaining:

use schm::HashMap;

fn main() {
    let mut map = HashMap::new();

    map.insert("orange", "ORANGE");
    map.insert("blueberry", "BLUEBERRY");

    assert_eq!(map.get("orange"), Some("ORANGE"));
    assert_eq!(map.get("blueberry"), Some("BLUEBERRY"));
}

No runtime deps