| Interface | Description |
|---|---|
| IterableMap<K,V> |
Defines a map that can be iterated directly without needing to create an entry set.
|
| KeyValue<K,V> |
Defines a simple key value pair.
|
| MapIterator<K,V> |
Defines an iterator that operates over a
Map. |
| Class | Description |
|---|---|
| AbstractHashMap<K,V> |
An abstract implementation of a hash-based map which provides numerous points for
subclasses to override.
|
| AbstractHashMap.EntrySet<K,V> |
EntrySet implementation.
|
| AbstractHashMap.EntrySetIterator<K,V> |
EntrySet iterator.
|
| AbstractHashMap.HashEntry<K,V> |
HashEntry used to store the data.
|
| AbstractHashMap.HashIterator<K,V,T> |
Base Iterator.
|
| AbstractHashMap.HashMapIterator<K,V> |
MapIterator implementation.
|
| AbstractHashMap.KeySet<K,V> |
KeySet implementation.
|
| AbstractHashMap.KeySetIterator<K,V> |
KeySet iterator.
|
| AbstractHashMap.Values<K,V> |
Values implementation.
|
| AbstractHashMap.ValuesIterator<K,V> |
Values iterator.
|
| EmptyMapIterator<K,V> |
MapIterator implementation that has no elements. |
| ImmutableMap<K,V> |
Map implementation that doesn't allow any data modifications to be done. |
| SoftHashMap<K,V> |
Map implementation that holds soft references its values.
|
| StrictHashMap<K,V> |
Map implementation that uses direct objects comparison for keys and values instead of relying on Object.equals(Object). |
Copyright © 2020. All rights reserved.