A reference to a hash table bucket containing a T.
The global memory allocator.
A reference to an empty bucket into which an can be inserted.
Probe sequence based on triangular numbers, which is guaranteed (since our
table size is a power of two) to visit every group of elements exactly once.
Iterator which consumes elements without freeing the table storage.
Iterator which consumes a table and returns elements.
Iterator which returns a raw pointer to every full bucket in the table.
Iterator over occupied buckets that could match a given hash.
Iterator over a sub-range of a table. Unlike RawIter this iterator does
not track an item count.
A raw hash table with an unsafe API.
Non-generic part of RawTable which allows functions to be instantiated only once regardless
of how many different key-value types are used.
Helper which allows the max calculation for ctrl_align to be statically computed for each T
while keeping the rest of calculate_layout_for independent of T