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§
- A hash map implemented with quadratic probing and SIMD lookup.
 - A hash set implemented as a
HashMapwhere the value is(). - A hash table implemented with quadratic probing and SIMD lookup.
 - Experimental and unsafe
RawTableAPI. This module is only available if therawfeature is enabled. 
Structs§
- A hash map implemented with quadratic probing and SIMD lookup.
 - A hash set implemented as a
HashMapwhere the value is(). - Low-level hash table with explicit hashing.
 
Enums§
- The error type for
try_reservemethods. 
Traits§
- Key equivalence trait.