int_hash

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 in the Rust language. So the algorithm may change if a better method is found for this use case.

use int_hash::IntHashMap;
let mut map: IntHashMap<u32, &str> = IntHashMap::default();
map.insert(22, "abc");

Limitations

int_hash is valid for use only with integer sized data, ie <= 16 bytes. This is enforced with debug assertions.

Benchmark Performance

For more info see the the full benchmark report.