Crate ahash

AHash is a high performance keyed hash function.

It quickly provides a high quality hash where the result is not predictable without knowing the Key. AHash works with HashMap to hash keys, but without allowing for the possibility that an malicious user can induce a collision.

How aHash works

When it is available aHash uses the hardware AES instructions to provide a keyed hash function. When it is not, aHash falls back on a slightly slower alternative algorithm.

Because aHash does not have a fixed standard for its output, it is able to improve over time. But this also means that different computers or computers using different versions of ahash may observe different hash values for the same input.

Re-exports

• pub use crate::random_state::RandomState;

Modules

• random_state

Structs

• AHashMap
  A HashMap using RandomState to hash the items. (Requires the std feature to be enabled.)
• AHashSet
  A HashSet using RandomState to hash the items. (Requires the std feature to be enabled.)
• AHasher
  A Hasher for hashing an arbitrary stream of bytes.

Traits

• HashMapExt
  A convenience trait that can be used together with the type aliases defined to get access to the new() and with_capacity() methods for the HashMap type alias.
• HashSetExt
  A convenience trait that can be used together with the type aliases defined to get access to the new() and with_capacity() methods for the HashSet type aliases.

Type Aliases

• HashMap
  Type alias for HashMap<K, V, ahash::RandomState>
• HashSet
  Type alias for HashSet<K, ahash::RandomState>