| Package | Description |
|---|---|
| org.apache.commons.collections4 |
This package contains the interfaces and utilities shared across all the subpackages of this component.
|
| org.apache.commons.collections4.bidimap | |
| org.apache.commons.collections4.map | |
| org.apache.commons.collections4.trie |
This package contains implementations of the
Trie interface.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
BidiMap<K
Defines a map that allows bidirectional lookup between key and values.
|
interface |
BoundedMap<K
Defines a map that is bounded in size.
|
interface |
IterableSortedMap<K
|
interface |
MultiMap<K
Deprecated.
since 4.1, use
MultiValuedMap instead
|
interface |
OrderedBidiMap<K
Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
|
interface |
OrderedMap<K
Defines a map that maintains order and allows both forward and backward iteration through that order.
|
interface |
SortedBidiMap<K
Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.
|
interface |
Trie<K
Defines the interface for a prefix tree, an ordered tree data structure.
|
| Modifier and Type | Method and Description |
|---|---|
static <K |
MapUtils.fixedSizeMap(Map
Returns a fixed-sized map backed by the given map.
|
static <K |
MapUtils.iterableMap(Map
Get the specified
Map as an
IterableMap.
|
static <K |
MapUtils.lazyMap(Map
Returns a "lazy" map whose values will be created on demand.
|
static <K |
MapUtils.lazyMap(Map
Returns a "lazy" map whose values will be created on demand.
|
static <K |
MapUtils.predicatedMap(Map
Returns a predicated (validating) map backed by the given map.
|
static <K |
SplitMapUtils.readableMap(Get
Get the specified
Get as an instance of
IterableMap.
|
static <K |
MapUtils.transformedMap(Map
Returns a transformed map backed by the given map.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractBidiMapDecorator<K
Provides a base decorator that enables additional functionality to be added to a BidiMap via decoration.
|
class |
AbstractDualBidiMap<K
Abstract
BidiMap implemented using two maps.
|
class |
AbstractOrderedBidiMapDecorator<K
Provides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.
|
class |
AbstractSortedBidiMapDecorator<K
Provides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.
|
class |
DualHashBidiMap<K
|
class |
DualLinkedHashBidiMap<K
Implementation of
BidiMap that uses two
LinkedHashMap instances.
|
class |
DualTreeBidiMap<K
|
protected static class |
DualTreeBidiMap
Internal sorted map view.
|
class |
TreeBidiMap<K extends Comparable
Red-Black tree-based implementation of BidiMap where all objects added implement the
Comparable interface.
|
class |
UnmodifiableBidiMap<K
Decorates another
BidiMap to ensure it can't be altered.
|
class |
UnmodifiableOrderedBidiMap<K
Decorates another
OrderedBidiMap to ensure it can't be altered.
|
class |
UnmodifiableSortedBidiMap<K
Decorates another
SortedBidiMap to ensure it can't be altered.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractHashedMap<K
An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
|
class |
AbstractIterableMap<K
Provide a basic
IterableMap implementation.
|
class |
AbstractLinkedMap<K
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.
|
class |
AbstractMapDecorator<K
Provides a base decorator that enables additional functionality to be added to a Map via decoration.
|
class |
AbstractOrderedMapDecorator<K
Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
|
class |
AbstractReferenceMap<K
An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.
|
class |
AbstractSortedMapDecorator<K
Provides a base decorator that enables additional functionality to be added to a Map via decoration.
|
class |
CaseInsensitiveMap<K
A case-insensitive
Map.
|
class |
CompositeMap<K
Decorates a map of other maps to provide a single unified view.
|
class |
DefaultedMap<K
Decorates another
Map returning a default value if the map does not contain the requested key.
|
class |
FixedSizeMap<K
Decorates another
Map to fix the size, preventing add/remove.
|
class |
FixedSizeSortedMap<K
Decorates another
SortedMap to fix the size blocking add/remove.
|
class |
Flat3Map<K
A
Map implementation that stores data in simple fields until the size is greater than 3.
|
class |
HashedMap<K
A
Map implementation that is a general purpose alternative to
HashMap.
|
class |
LazyMap<K
Decorates another
Map to create objects in the map on demand.
|
class |
LazySortedMap<K
Decorates another
SortedMap to create objects in the map on demand.
|
class |
LinkedMap<K
A
Map implementation that maintains the order of the entries.
|
class |
ListOrderedMap<K
Decorates a
Map to ensure that the order of addition is retained using a
List to maintain order.
|
class |
LRUMap<K
A
Map implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.
|
class |
MultiKeyMap<K
A
Map implementation that uses multiple keys to map the value.
|
class |
MultiValueMap<K
Deprecated.
since 4.1, use
MultiValuedMap instead
|
class |
PassiveExpiringMap<K
Decorates a
Map to evict expired entries once their expiration time has been reached.
|
class |
PredicatedMap<K
Decorates another
Map to validate that additions match a specified predicate.
|
class |
PredicatedSortedMap<K
Decorates another
SortedMap to validate that additions match a specified predicate.
|
class |
ReferenceIdentityMap<K
A
Map implementation that allows mappings to be removed by the garbage collector and matches keys and values based on
== not
equals().
|
class |
ReferenceMap<K
A
Map implementation that allows mappings to be removed by the garbage collector.
|
class |
SingletonMap<K
A
Map implementation that holds a single item and is fixed size.
|
class |
StaticBucketMap<K
A StaticBucketMap is an efficient, thread-safe implementation of
java.util.Map that performs well in in a highly thread-contentious environment.
|
class |
TransformedMap<K
Decorates another
Map to transform objects that are added.
|
class |
TransformedSortedMap<K
Decorates another
SortedMap to transform objects that are added.
|
class |
UnmodifiableMap<K
Decorates another
Map to ensure it can't be altered.
|
class |
UnmodifiableOrderedMap<K
Decorates another
OrderedMap to ensure it can't be altered.
|
class |
UnmodifiableSortedMap<K
Decorates another
SortedMap to ensure it can't be altered.
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractBitwiseTrie<K
|
class |
PatriciaTrie<E>
Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).
|
class |
UnmodifiableTrie<K
An unmodifiable
Trie.
|