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
HashMap
where 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
HashMap
where the value is()
. - Hash
Table - Low-level hash table with explicit hashing.
Enums§
- Default
Hash Builder - Dummy default hasher for
HashMap
andHashSet
. - TryReserve
Error - The error type for
try_reserve
methods.
Traits§
- Equivalent
- Key equivalence trait.