|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
Map,
IterableMap,
OrderedMap and
SortedMap interfaces.
See:
Description
| Interface Summary | |
|---|---|
| CompositeMap.MapMutator<K,V> | This interface allows definition for all of the indeterminate mutators in a CompositeMap, as well as providing a hook for callbacks on key collisions. |
| Class Summary | |
|---|---|
| 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. |
| AbstractLinkedMap<K,V> | An abstract implementation of a hash-based map that links entries to create an ordered map and which provides numerous points for subclasses to override. |
| AbstractLinkedMap.EntrySetIterator<K,V> | EntrySet iterator. |
| AbstractLinkedMap.KeySetIterator<K,V> | KeySet iterator. |
| AbstractLinkedMap.LinkEntry<K,V> | LinkEntry that stores the data. |
| AbstractLinkedMap.LinkIterator<K,V> | Base Iterator that iterates in link order. |
| AbstractLinkedMap.LinkMapIterator<K,V> | MapIterator implementation. |
| AbstractLinkedMap.ValuesIterator<K,V> | Values iterator. |
| AbstractMapDecorator<K,V> | Provides a base decorator that enables additional functionality to be added to a Map via decoration. |
| AbstractOrderedMapDecorator<K,V> | Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration. |
| 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. |
| AbstractSortedMapDecorator<K,V> | Provides a base decorator that enables additional functionality to be added to a Map via decoration. |
| CaseInsensitiveMap<V> | A case-insensitive Map. |
| CompositeMap<K,V> | Decorates a map of other maps to provide a single unified view. |
| FastHashMap<K,V> | A customized implementation of java.util.HashMap designed
to operate in a multithreaded environment where the large majority of
method calls are read-only, instead of structural changes. |
| FastTreeMap<K,V> | A customized implementation of java.util.TreeMap designed
to operate in a multithreaded environment where the large majority of
method calls are read-only, instead of structural changes. |
| FixedSizeMap<K,V> | Decorates another Map to fix the size, preventing add/remove. |
| FixedSizeSortedMap<K,V> | Decorates another SortedMap to fix the size blocking add/remove. |
| Flat3Map<K,V> | A Map implementation that stores data in simple fields until
the size is greater than 3. |
| HashedMap<K,V> | A Map implementation that is a general purpose alternative
to HashMap. |
| IdentityMap<K,V> | A Map implementation that matches keys and values based
on == not equals(). |
| IdentityMap.IdentityEntry<K,V> | HashEntry |
| LazyMap<K,V> | Decorates another Map to create objects in the map on demand. |
| LazySortedMap<K,V> | Decorates another SortedMap to create objects in the map on demand. |
| LinkedMap<K,V> | A Map implementation that maintains the order of the entries. |
| ListOrderedMap<K,V> | Decorates a Map to ensure that the order of addition is retained
using a List to maintain order. |
| LRUMap<K,V> | A Map implementation with a fixed maximum size which removes
the least recently used entry if an entry is added when full. |
| MultiKeyMap<K,V> | A Map implementation that uses multiple keys to map the value. |
| PredicatedMap<K,V> | Decorates another Map to validate that additions
match a specified predicate. |
| PredicatedSortedMap<K,V> | Decorates another SortedMap to validate that additions
match a specified predicate. |
| ReferenceIdentityMap<K,V> | A Map implementation that allows mappings to be
removed by the garbage collector and matches keys and values based
on == not equals(). |
| ReferenceMap<K,V> | A Map implementation that allows mappings to be
removed by the garbage collector. |
| SingletonMap<K,V> | A Map implementation that holds a single item and is fixed size. |
| StaticBucketMap<K,V> | A StaticBucketMap is an efficient, thread-safe implementation of
java.util.Map that performs well in in a highly
thread-contentious environment. |
| TransformedMap | Decorates another Map to transform objects that are added. |
| TransformedSortedMap | Decorates another SortedMap to transform objects that are added. |
| TypedMap | Deprecated. no longer needed with Java generics. |
| TypedSortedMap | Deprecated. no longer needed with Java generics. |
| UnmodifiableEntrySet<K,V> | Decorates a map entry Set to ensure it can't be altered. |
| UnmodifiableMap<K,V> | Decorates another Map to ensure it can't be altered. |
| UnmodifiableOrderedMap<K,V> | Decorates another OrderedMap to ensure it can't be altered. |
| UnmodifiableSortedMap<K,V> | Decorates another SortedMap to ensure it can't be altered. |
This package contains implementations of the
Map,
IterableMap,
OrderedMap and
SortedMap interfaces.
A Map provides a lookup from a key to a value.
A number of implementations also support the new MapIterator interface that enables
simple iteration of map keys and values.
The following implementations are provided:
The following decorators are provided:
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||