Uses of Interface
org.apache.commons.collections4.OrderedMap
Package
Description
Interfaces and utilities shared across all packages.
Implements the
Trie
interface.-
Uses of OrderedMap in org.apache.commons.collections4
Modifier and TypeInterfaceDescriptioninterface
IterableSortedMap<K,
V> interface
OrderedBidiMap<K,
V> Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.interface
SortedBidiMap<K,
V> Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.interface
Trie<K,
V> Defines the interface for a prefix tree, an ordered tree data structure.Modifier and TypeMethodDescriptionstatic <K,
V> OrderedMap <K, V> MapUtils.orderedMap
(Map<K, V> map) Returns a map that maintains the order of keys that are added backed by the given map. -
Uses of OrderedMap in org.apache.commons.collections4.bidimap
Modifier and TypeClassDescriptionclass
Provides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.class
Provides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.class
DualTreeBidiMap<K,
V> protected static class
Internal sorted map view.class
TreeBidiMap<K extends Comparable<K>,
V extends Comparable<V>> Red-Black tree-based implementation of BidiMap where all objects added implement theComparable
interface.final class
Decorates anotherOrderedBidiMap
to ensure it can't be altered.final class
Decorates anotherSortedBidiMap
to ensure it can't be altered. -
Uses of OrderedMap in org.apache.commons.collections4.map
Modifier and TypeClassDescriptionclass
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.class
Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.class
Provides a base decorator that enables additional functionality to be added to a Map via decoration.class
FixedSizeSortedMap<K,
V> Decorates anotherSortedMap
to fix the size blocking add/remove.class
LinkedMap<K,
V> AMap
implementation that maintains the order of the entries.class
ListOrderedMap<K,
V> Decorates aMap
to ensure that the order of addition is retained using aList
to maintain order.class
LRUMap<K,
V> AMap
implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.class
SingletonMap<K,
V> AMap
implementation that holds a single item and is fixed size.final class
Decorates anotherOrderedMap
to ensure it can't be altered.final class
Decorates anotherSortedMap
to ensure it can't be altered.Modifier and TypeMethodDescriptionprotected OrderedMap
<K, V> AbstractOrderedMapDecorator.decorated()
Gets the map being decorated.static <K,
V> OrderedMap <K, V> UnmodifiableOrderedMap.unmodifiableOrderedMap
(OrderedMap<? extends K, ? extends V> map) Factory method to create an unmodifiable sorted map.Modifier and TypeMethodDescriptionstatic <K,
V> OrderedMap <K, V> UnmodifiableOrderedMap.unmodifiableOrderedMap
(OrderedMap<? extends K, ? extends V> map) Factory method to create an unmodifiable sorted map.ModifierConstructorDescriptionConstructor that wraps (not copies). -
Uses of OrderedMap in org.apache.commons.collections4.trie
Modifier and TypeClassDescriptionclass
AbstractBitwiseTrie<K,
V> class
AbstractPatriciaTrie<K,
V> This class implements the base PATRICIA algorithm and everything that is related to theMap
interface.class
PatriciaTrie<V>
Implements a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).class
UnmodifiableTrie<K,
V> An unmodifiableTrie
.