Build support for precomputed constant hash tables.
This module can generate constant hash tables using open addressing and quadratic probing.
The hash tables are arrays that are guaranteed to:
- Have a power-of-two size.
- Contain at least one empty slot.
Compute an open addressed, quadratically probed hash table containing
items. The returned table is a list containing the elements of the
None in unused slots.