Add elem if not yet in table.
Add elem if not yet in table.
Returns true if a new elem was added, false otherwise.
Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.
Add an entry (an elem converted to an entry via elemToEntry) if not yet in table.
Returns true if a new elem was added, false otherwise.
Checks whether an element is contained in the hash table.
Checks whether an element is contained in the hash table.
Elems have type A, but we store AnyRef in the table.
Elems have type A, but we store AnyRef in the table. Plus we need to deal with null elems, which need to be stored as NullSentinel
Does the inverse translation of elemToEntry
Does the inverse translation of elemToEntry
Finds an entry in the hash table if such an element exists.
Finds an entry in the hash table if such an element exists.
Returns string formatted according to given format string.
Returns string formatted according to given format string.
Format strings are as for String.format
(@see java.lang.String.format).
The initial size of the hash table.
Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.
Removes an elem from the hash table returning true if the element was found (and thus removed) or false if it didn't exist.
The array keeping track of number of elements in 32 element blocks.
The array keeping track of number of elements in 32 element blocks.
The actual hash table.
The actual hash table.
The number of mappings contained in this hash table.
The number of mappings contained in this hash table.
The next size value at which to resize (capacity * load factor).
The next size value at which to resize (capacity * load factor).
An implementation class backing a
HashSet.This trait is used internally. It can be mixed in with various collections relying on hash table as an implementation.