Module `hash_table`

A hash table implemented with quadratic probing and SIMD lookup.

Structs

AbsentEntry Type representing the absence of an entry, as returned by HashTable::find_entry and HashTable::get_bucket_entry.
Drain A draining iterator over the items of a HashTable.
ExtractIf A draining iterator over entries of a HashTable which don't satisfy the predicate f.
HashTable Low-level hash table with explicit hashing.
IntoIter An owning iterator over the entries of a HashTable in arbitrary order. The iterator element type is T.
Iter An iterator over the entries of a HashTable in arbitrary order. The iterator element type is &'a T.
IterBuckets An iterator producing the usize indices of all occupied buckets, within the range 0..table.num_buckets().
IterHash An iterator over the entries of a HashTable that could match a given hash. The iterator element type is &'a T.
IterHashBuckets An iterator producing the usize indices of all buckets which may match a hash.
IterHashMut A mutable iterator over the entries of a HashTable that could match a given hash. The iterator element type is &'a mut T.
IterMut A mutable iterator over the entries of a HashTable in arbitrary order. The iterator element type is &'a mut T.
OccupiedEntry A view into an occupied entry in a HashTable. It is part of the Entry enum.
UnsafeIter An unsafe iterator over the entries of a HashTable in arbitrary order. The iterator element type is NonNull<T>.
VacantEntry A view into a vacant entry in a HashTable. It is part of the Entry enum.

Entry A view into a single entry in a table, which may either be vacant or occupied.