Expand description
This crate is a Rust port of Google’s high-performance SwissTable hash
map, adapted to make it a drop-in replacement for Rust’s standard HashMap
and HashSet types.
The original C++ version of SwissTable can be found here, and this CppCon talk gives an overview of how the algorithm works.
Modules§
- hash_map 
- A hash map implemented with quadratic probing and SIMD lookup.
- hash_set 
- A hash set implemented as a HashMapwhere the value is().
- hash_table 
- A hash table implemented with quadratic probing and SIMD lookup.
Structs§
- HashMap
- A hash map implemented with quadratic probing and SIMD lookup.
- HashSet
- A hash set implemented as a HashMapwhere the value is().
- HashTable 
- Low-level hash table with explicit hashing.
Enums§
- DefaultHash Builder 
- Dummy default hasher for HashMapandHashSet.
- TryReserveError 
- The error type for try_reservemethods.
Traits§
- Equivalent
- Key equivalence trait.