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
HashMap
where the value is()
. - A hash table implemented with quadratic probing and SIMD lookup.
- macros 🔒
- map 🔒
- Experimental and unsafe
RawTable
API. This module is only available if theraw
feature is enabled. - set 🔒
- table 🔒
Structs§
- A hash map implemented with quadratic probing and SIMD lookup.
- A hash set implemented as a
HashMap
where the value is()
. - Low-level hash table with explicit hashing.
Enums§
- The error type for
try_reserve
methods.
Traits§
- Key equivalence trait.