- addEntry
Adds an entry into this map. This implementation adds the entry to the data
storage table. Subclasse
- addMapping
Adds a new key-value mapping into this map. This implementation calls createEntry(), addEntry() and
- calculateNewCapacity
Calculates the new capacity of the map. This implementation normalizes the
capacity to a power of tw
- calculateThreshold
Calculates the new threshold of the map, where it will be resized. This
implementation uses the load
- checkCapacity
Checks the capacity of the map and enlarges it if necessary. This implementation
uses the threshold
- clear
Clears the map, resetting the size to zero and nullifying references to avoid
garbage collection iss
- containsKey
Checks whether the map contains the specified key.
- containsValue
Checks whether the map contains the specified value.
- createEntry
Creates an entry to store the key-value data. This implementation creates a new
HashEntry instance.
- createEntrySetIterator
Creates an entry set iterator. Subclasses can override this to return iterators
with different prope
- createKeySetIterator
Creates a key set iterator. Subclasses can override this to return iterators
with different properti
- createValuesIterator
Creates a values iterator. Subclasses can override this to return iterators with
different propertie