Expand description

A hash table implemented with quadratic probing and SIMD lookup.

Structs

  • Type representing the absence of an entry, as returned by HashTable::find_entry.
  • A draining iterator over the items of a HashTable.
  • A draining iterator over entries of a HashTable which don’t satisfy the predicate f.
  • Low-level hash table with explicit hashing.
  • An owning iterator over the entries of a HashTable in arbitrary order. The iterator element type is T.
  • An iterator over the entries of a HashTable in arbitrary order. The iterator element type is &'a T.
  • A mutable iterator over the entries of a HashTable in arbitrary order. The iterator element type is &'a mut T.
  • A view into an occupied entry in a HashTable. It is part of the Entry enum.
  • A view into a vacant entry in a HashTable. It is part of the Entry enum.

Enums

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