Add entry to table pre: no entry with same key exists
Remove all entries from table
An iterator returning all entries.
Find entry with given key in table, null if not found.
Find entry with given key in table, or add new one if not found.
Avoid iterator for a 2x faster traversal.
Returns string formatted according to given
The initial size of the hash table.
Remove entry from table if present.
The array keeping track of the number of elements in 32 element blocks.
The actual hash table.
The number of mappings contained in this hash table.
The next size value at which to resize (capacity * load factor).