Expand description
A hash table implemented with quadratic probing and SIMD lookup.
Structs§
- Absent
Entry - Type representing the absence of an entry, as returned by
HashTable::find_entry. - Drain
- A draining iterator over the items of a
HashTable. - Extract
If - A draining iterator over entries of a
HashTablewhich don’t satisfy the predicatef. - Hash
Table - Low-level hash table with explicit hashing.
- Into
Iter - An owning iterator over the entries of a
HashTablein arbitrary order. The iterator element type isT. - Iter
- An iterator over the entries of a
HashTablein arbitrary order. The iterator element type is&'a T. - Iter
Hash - An iterator over the entries of a
HashTablethat could match a given hash. The iterator element type is&'a T. - Iter
Hash Mut - A mutable iterator over the entries of a
HashTablethat could match a given hash. The iterator element type is&'a mut T. - IterMut
- A mutable iterator over the entries of a
HashTablein arbitrary order. The iterator element type is&'a mut T. - Occupied
Entry - A view into an occupied entry in a
HashTable. It is part of theEntryenum. - Vacant
Entry - A view into a vacant entry in a
HashTable. It is part of theEntryenum.
Enums§
- Entry
- A view into a single entry in a table, which may either be vacant or occupied.