Package org.apache.commons.collections4.map
package org.apache.commons.collections4.map
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:
- CaseInsensitiveMap - map that compares keys in a case insensitive way
- CompositeMap - map that combines multiple maps into a single view
- HashedMap - general purpose HashMap replacement supporting MapIterator
- Flat3Map - designed for good performance at size 3 or less
- LinkedMap - a hash map that maintains insertion order, supporting OrderedMapIterator
- LRUMap - a hash map that maintains a maximum size by removing the least recently used entries
- MultiKeyMap - map that provides special methods for using more than one key to access the value
- ReferenceMap - allows the garbage collector to collect keys and values using equals() for comparison
- ReferenceIdentityMap - allows the garbage collector to collect keys and values using == for comparison
- SingletonMap - a fully featured map to hold one key-value pair
- StaticBucketMap - internally synchronized and designed for thread-contentious environments
The following decorators are provided:
- Unmodifiable - ensures the collection cannot be altered
- Predicated - ensures that only elements that are valid according to a predicate can be added
- Transformed - transforms each element added
- FixedSize - ensures that the size of the map cannot change
- Defaulted - provides default values for non-existing keys
- Lazy - creates objects in the map on demand
- ListOrdered - ensures that insertion order is retained
-
ClassDescriptionAbstractHashedMap<K,
V> An abstract implementation of a hash-based map which provides numerous points for subclasses to override.AbstractIterableMap<K,V> Provide a basicIterableMap
implementation.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.AbstractMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to a Map via decoration.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.Reference type enum.Provides a base decorator that enables additional functionality to be added to a Map via decoration.CaseInsensitiveMap<K,V> A case-insensitiveMap
.CompositeMap<K,V> Decorates a map of other maps to provide a single unified view.This interface allows definition for all of the indeterminate mutators in a CompositeMap, as well as providing a hook for callbacks on key collisions.DefaultedMap<K,V> Decorates anotherMap
returning a default value if the map does not contain the requested key.Adapts a Map entrySet to the MapIterator interface.FixedSizeMap<K,V> Decorates anotherMap
to fix the size, preventing add/remove.FixedSizeSortedMap<K,V> Decorates anotherSortedMap
to fix the size blocking add/remove.Flat3Map<K,V> AMap
implementation that stores data in simple fields until the size is greater than 3.HashedMap<K,V> AMap
implementation that is a general purpose alternative toHashMap
.LazyMap<K,V> Decorates anotherMap
to create objects in the map on demand.LazySortedMap<K,V> Decorates anotherSortedMap
to create objects in the map on demand.LinkedMap<K,V> AMap
implementation that maintains the order of the entries.ListOrderedMap<K,V> Decorates aMap
to ensure that the order of addition is retained using aList
to maintain order.LRUMap<K,V> AMap
implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.MultiKeyMap<K,V> AMap
implementation that uses multiple keys to map the value.MultiValueMap<K,V> Deprecated.PassiveExpiringMap<K,V> Decorates aMap
to evict expired entries once their expiration time has been reached.AExpirationPolicy
that returns a expiration time that is a constant about of time in the future from the current time.A policy to determine the expiration time for key-value entries.PredicatedMap<K,V> Decorates anotherMap
to validate that additions match a specified predicate.PredicatedSortedMap<K,V> Decorates anotherSortedMap
to validate that additions match a specified predicate.ReferenceIdentityMap<K,V> AMap
implementation that allows mappings to be removed by the garbage collector and matches keys and values based on==
notequals()
.ReferenceMap<K,V> AMap
implementation that allows mappings to be removed by the garbage collector.SingletonMap<K,V> AMap
implementation that holds a single item and is fixed size.StaticBucketMap<K,V> A StaticBucketMap is an efficient, thread-safe implementation ofjava.util.Map
that performs well in in a highly thread-contentious environment.TransformedMap<K,V> Decorates anotherMap
to transform objects that are added.TransformedSortedMap<K,V> Decorates anotherSortedMap
to transform objects that are added.UnmodifiableEntrySet<K,V> Decorates a map entrySet
to ensure it can't be altered.UnmodifiableMap<K,V> Decorates anotherMap
to ensure it can't be altered.Decorates anotherOrderedMap
to ensure it can't be altered.Decorates anotherSortedMap
to ensure it can't be altered.
MultiValuedMap
instead