[][src]Crate 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. 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

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.