Crate int_hash[−][src]
Very fast, very simple hash algorithm designed for use in integer hash maps & sets.
This crate attempts to provide the fastest option for integer key hashmaps. So the algorithm may change if a better method is found for this use case.
Example
use int_hash::IntHashMap; let mut map: IntHashMap<u32, &str> = IntHashMap::default(); map.insert(22, "abc");
Limitations
Valid for use only with integer sized data, ie <= 16 bytes. This is enforced with debug assertions.
Structs
IntHasher |
Very fast, very simple hash algorithm designed for use in integer hash maps & sets. |
Type Definitions
IntBuildHasher |
IntHasher builder. |
IntHashMap |
Type alias for a hashmap using IntHasher hashing. |
IntHashSet |
Type alias for a hashmap using IntHasher hashing. |