| 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 |
IterableSortedMap<K
|
interface |
OrderedBidiMap<K
Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
|
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.orderedMap(Map
Returns a map that maintains the order of keys that are added backed by the given map.
|
| Modifier and Type | Class and Description |
|---|---|
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 |
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 |
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 |
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 |
AbstractOrderedMapDecorator<K
Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
|
class |
AbstractSortedMapDecorator<K
Provides a base decorator that enables additional functionality to be added to a Map via decoration.
|
class |
FixedSizeSortedMap<K
Decorates another
SortedMap to fix the size blocking add/remove.
|
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 |
SingletonMap<K
A
Map implementation that holds a single item and is fixed size.
|
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 | Method and Description |
|---|---|
protected OrderedMap |
AbstractOrderedMapDecorator.decorated()
Gets the map being decorated.
|
static <K |
UnmodifiableOrderedMap.unmodifiableOrderedMap(OrderedMap
Factory method to create an unmodifiable sorted map.
|
| Modifier and Type | Method and Description |
|---|---|
static <K |
UnmodifiableOrderedMap.unmodifiableOrderedMap(OrderedMap
Factory method to create an unmodifiable sorted map.
|
| Constructor and Description | |
|---|---|
AbstractOrderedMapDecorator(OrderedMap
Constructor that wraps (not copies).
|
| 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.
|