See: Description
| Interface | Description |
|---|---|
| IterableMap |
Defines a map that can be iterated directly without needing to create an entry set.
|
| KeyValue |
Defines a simple key value pair.
|
| MapIterator |
Defines an iterator that operates over a
Map. |
| ResettableIterator |
Defines an iterator that can be reset back to an initial state.
|
| Class | Description |
|---|---|
| AbstractHashedMap |
An abstract implementation of a hash-based map which provides numerous points for
subclasses to override.
|
| AbstractHashedMap.EntrySet |
EntrySet implementation.
|
| AbstractHashedMap.EntrySetIterator |
EntrySet iterator.
|
| AbstractHashedMap.HashEntry |
HashEntry used to store the data.
|
| AbstractHashedMap.HashIterator |
Base Iterator
|
| AbstractHashedMap.HashMapIterator |
MapIterator implementation.
|
| AbstractHashedMap.KeySet |
KeySet implementation.
|
| AbstractHashedMap.KeySetIterator |
KeySet iterator.
|
| AbstractHashedMap.Values |
Values implementation.
|
| AbstractHashedMap.ValuesIterator |
Values iterator.
|
| AbstractKeyValue |
Abstract pair class to assist with creating
KeyValue
and Map.Entry implementations. |
| AbstractMapEntry |
Abstract Pair class to assist with creating correct
Map.Entry implementations. |
| AbstractReferenceMap |
An abstract implementation of a hash-based map that allows the entries to
be removed by the garbage collector.
|
| AbstractReferenceMap.ReferenceEntry |
A MapEntry implementation for the map.
|
| DefaultMapEntry |
A restricted implementation of
Map.Entry that prevents
the Map.Entry contract from being broken. |
| EmptyIterator |
Provides an implementation of an empty iterator.
|
| EmptyMapIterator |
Provides an implementation of an empty map iterator.
|
| ReferenceMap |
A
Map implementation that allows mappings to be
removed by the garbage collector. |
Apache commons collection classes such as for soft-reference map implementation