Uses of Interface
org.apache.commons.collections4.OrderedMap
Packages that use OrderedMap
Package
Description
This package contains the interfaces and utilities shared across all the subpackages of this component.
This package contains implementations of the
Trie interface.-
Uses of OrderedMap in org.apache.commons.collections4
Subinterfaces of OrderedMap in org.apache.commons.collections4Modifier and TypeInterfaceDescriptioninterfaceIterableSortedMap<K,V> interfaceOrderedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.interfaceSortedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.interfaceTrie<K,V> Defines the interface for a prefix tree, an ordered tree data structure.Methods in org.apache.commons.collections4 that return OrderedMapModifier 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
Classes in org.apache.commons.collections4.bidimap that implement OrderedMapModifier and TypeClassDescriptionclassProvides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.classProvides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.classDualTreeBidiMap<K,V> protected static classInternal sorted map view.classTreeBidiMap<K extends Comparable<K>,V extends Comparable<V>> Red-Black tree-based implementation of BidiMap where all objects added implement theComparableinterface.final classDecorates anotherOrderedBidiMapto ensure it can't be altered.final classDecorates anotherSortedBidiMapto ensure it can't be altered. -
Uses of OrderedMap in org.apache.commons.collections4.map
Classes in org.apache.commons.collections4.map that implement OrderedMapModifier and TypeClassDescriptionclassAbstractLinkedMap<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.classProvides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.classProvides a base decorator that enables additional functionality to be added to a Map via decoration.classFixedSizeSortedMap<K,V> Decorates anotherSortedMapto fix the size blocking add/remove.classLinkedMap<K,V> AMapimplementation that maintains the order of the entries.classListOrderedMap<K,V> Decorates aMapto ensure that the order of addition is retained using aListto maintain order.classLRUMap<K,V> AMapimplementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.classSingletonMap<K,V> AMapimplementation that holds a single item and is fixed size.final classDecorates anotherOrderedMapto ensure it can't be altered.final classDecorates anotherSortedMapto ensure it can't be altered.Methods in org.apache.commons.collections4.map that return OrderedMapModifier 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.Methods in org.apache.commons.collections4.map with parameters of type OrderedMapModifier and TypeMethodDescriptionstatic <K,V> OrderedMap<K, V> UnmodifiableOrderedMap.unmodifiableOrderedMap(OrderedMap<? extends K, ? extends V> map) Factory method to create an unmodifiable sorted map.Constructors in org.apache.commons.collections4.map with parameters of type OrderedMapModifierConstructorDescriptionConstructor that wraps (not copies). -
Uses of OrderedMap in org.apache.commons.collections4.trie
Classes in org.apache.commons.collections4.trie that implement OrderedMapModifier and TypeClassDescriptionclassAbstractBitwiseTrie<K,V> classPatriciaTrie<E>Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).classUnmodifiableTrie<K,V> An unmodifiableTrie.