A hash table using open hashing with linear scan which is also very space efficient
at small sizes. The implementations of hash and isEqual are left open. They have
to be provided by subclasses.
- Value parameters:
- capacityMultiple
The minimum multiple of capacity relative to used elements. The hash table will be re-sized once the number of elements multiplied by capacityMultiple exceeds the current size of the hash table. However, a table of size up to DenseLimit will be re-sized only once the number of elements reaches the table's size.
- initialCapacity
Indicates the initial number of slots in the hash table. The actual number of slots is always a power of 2, so the initial size of the table will be the smallest power of two that is equal or greater than the given
initialCapacity. Minimum value is 4.
- Companion:
- object
Value members
Concrete methods
Remove all elements from this table and set back to initial configuration
Remove all elements from this table and set back to initial configuration