| 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. |
| ResettableIterator<E> |
Defines an iterator that can be reset back to an initial state.
|
| Class | Description |
|---|---|
| AbstractHashedMap<K,V> |
An abstract implementation of a hash-based map which provides numerous points
for subclasses to override.
|
| AbstractHashedMap.EntrySet<K,V> |
EntrySet implementation.
|
| AbstractHashedMap.EntrySetIterator<K,V> |
EntrySet iterator.
|
| AbstractHashedMap.HashEntry<K,V> |
HashEntry used to store the data.
|
| AbstractHashedMap.HashIterator<K,V> |
Base Iterator
|
| AbstractHashedMap.HashMapIterator<K,V> |
MapIterator implementation.
|
| AbstractHashedMap.KeySet<K,V> |
KeySet implementation.
|
| AbstractHashedMap.KeySetIterator<K,V> |
KeySet iterator.
|
| AbstractHashedMap.Values<K,V> |
Values implementation.
|
| AbstractHashedMap.ValuesIterator<K,V> |
Values iterator.
|
| AbstractKeyValue<K,V> |
Abstract pair class to assist with creating KeyValue and MapEntry
implementations.
|
| AbstractMapEntry<K,V> |
Abstract Pair class to assist with creating correct Map Entry
implementations.
|
| AbstractReferenceMap<K,V> |
An abstract implementation of a hash-based map that allows the entries to be
removed by the garbage collector.
|
| AbstractReferenceMap.ReferenceEntry<K,V> |
A MapEntry implementation for the map.
|
| DefaultMapEntry<K,V> |
A restricted implementation of
Map.Entry that prevents the
MapEntry contract from being broken. |
| EmptyIterator<E> |
Provides an implementation of an empty iterator.
|
| EmptyMapIterator |
Provides an implementation of an empty map iterator.
|
| ReferenceMap<K,V> |
A
Map implementation that allows mappings to be removed by the
garbage collector. |
Copyright © 2014. All Rights Reserved.