Expand description
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.
When hashing data larger than 64-bits the hasher will fallback to a secondary algorithm suitable
for arbitrary data (defaults to FxHasher).
Example
use int_hash::IntHashMap;
let mut map: IntHashMap<u32, &str> = IntHashMap::default();
map.insert(22, "abc");Enums
Very fast, very simple hash algorithm designed for use in
integer hash maps & sets.