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§
- control 🔒
 - external_
trait_ 🔒impls  - 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.
 - macros 🔒
 - map 🔒
 - raw 🔒
 - raw_
entry 🔒 - scopeguard 🔒
 - set 🔒
 - table 🔒
 - util 🔒
 
Structs§
- HashMap
 - A hash map implemented with quadratic probing and SIMD lookup.
 - HashSet
 - A hash set implemented as a 
HashMapwhere the value is(). - Hash
Table  - Low-level hash table with explicit hashing.
 
Enums§
- TryReserve
Error  - The error type for 
try_reservemethods. 
Traits§
- Equivalent
 - Key equivalence trait.
 
Type Aliases§
- Default
Hash Builder  - Default hasher for 
HashMapandHashSet.