Clears all data, without resizing.

reserves space for the specified number of elements. Makes sure the old data fits. Exactly the same as rehash(c). Use rehash(0) to shrink to fit.

allocates, but does NOT initialize. Use in-place new constructor, e.g. T* obj = pool.allocate(); ::new (static_cast<void*>(obj)) T();

Returns 1 if key is found, 0 otherwise.

does not actually deallocate but puts it in store. make sure you have already called the destructor! e.g. with obj->~T(); pool.deallocate(obj);

default constructed iterator can be compared to itself, but WON'T return true when compared to end().

WARNING: Underflow if numBytes < ALIGNMENT! This is guarded in addOrFree().

Adds an already allocated block of memory to the allocator. This allocator is from now on responsible for freeing the data (with free()). If the provi

we are not using the data, so just free it.

NOLINTNEXTLINE(modernize-use-nodiscard)

If possible reallocates the map to a smaller one. This frees the underlying table. Does not do anything if load_factor is too large for decreasing the

doesn't do anything

fast forward to the next non-free info byte I've tried a few variants that don't depend on intrinsics, but unfortunately they are quite a bit slower t

True if resize was possible, false otherwise

inserts a keyval that is guaranteed to be new, e.g. when the hashmap is resized. @return True on success, false if something went wrong

Average number of elements per bucket. Since we allow only 1 per bucket

forwards the index by one, wrapping around at the end