Uses of Interface
org.apache.commons.collections4.Put
-
Packages that use Put 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.splitmap org.apache.commons.collections4.trie This package contains implementations of theTrie
interface. -
-
Uses of Put in org.apache.commons.collections4
Subinterfaces of Put in org.apache.commons.collections4 Modifier and Type Interface Description interface
BidiMap<K,V>
Defines a map that allows bidirectional lookup between key and values.interface
BoundedMap<K,V>
Defines a map that is bounded in size.interface
IterableMap<K,V>
Defines a map that can be iterated directly without needing to create an entry set.interface
IterableSortedMap<K,V>
interface
MultiMap<K,V>
Deprecated.since 4.1, useMultiValuedMap
insteadinterface
OrderedBidiMap<K,V>
Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.interface
OrderedMap<K,V>
Defines a map that maintains order and allows both forward and backward iteration through that order.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.Methods in org.apache.commons.collections4 with parameters of type Put Modifier and Type Method Description static <K,V>
Map<K,V>SplitMapUtils. writableMap(Put<K,V> put)
-
Uses of Put in org.apache.commons.collections4.bidimap
Classes in org.apache.commons.collections4.bidimap that implement Put Modifier and Type Class Description class
AbstractBidiMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to a BidiMap via decoration.class
AbstractDualBidiMap<K,V>
AbstractBidiMap
implemented using two maps.class
AbstractOrderedBidiMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to an OrderedBidiMap via decoration.class
AbstractSortedBidiMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to a SortedBidiMap via decoration.class
DualHashBidiMap<K,V>
class
DualLinkedHashBidiMap<K,V>
Implementation ofBidiMap
that uses twoLinkedHashMap
instances.class
DualTreeBidiMap<K,V>
protected static class
DualTreeBidiMap.ViewMap<K,V>
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.class
UnmodifiableBidiMap<K,V>
Decorates anotherBidiMap
to ensure it can't be altered.class
UnmodifiableOrderedBidiMap<K,V>
Decorates anotherOrderedBidiMap
to ensure it can't be altered.class
UnmodifiableSortedBidiMap<K,V>
Decorates anotherSortedBidiMap
to ensure it can't be altered. -
Uses of Put in org.apache.commons.collections4.map
Classes in org.apache.commons.collections4.map that implement Put Modifier and Type Class Description class
AbstractHashedMap<K,V>
An abstract implementation of a hash-based map which provides numerous points for subclasses to override.class
AbstractIterableMap<K,V>
Provide a basicIterableMap
implementation.class
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
AbstractMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to a Map via decoration.class
AbstractOrderedMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.class
AbstractReferenceMap<K,V>
An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.class
AbstractSortedMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to a Map via decoration.class
CaseInsensitiveMap<K,V>
A case-insensitiveMap
.class
CompositeMap<K,V>
Decorates a map of other maps to provide a single unified view.class
DefaultedMap<K,V>
Decorates anotherMap
returning a default value if the map does not contain the requested key.class
FixedSizeMap<K,V>
Decorates anotherMap
to fix the size, preventing add/remove.class
FixedSizeSortedMap<K,V>
Decorates anotherSortedMap
to fix the size blocking add/remove.class
Flat3Map<K,V>
AMap
implementation that stores data in simple fields until the size is greater than 3.class
HashedMap<K,V>
AMap
implementation that is a general purpose alternative toHashMap
.class
LazyMap<K,V>
Decorates anotherMap
to create objects in the map on demand.class
LazySortedMap<K,V>
Decorates anotherSortedMap
to create objects in the map on demand.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
MultiKeyMap<K,V>
AMap
implementation that uses multiple keys to map the value.class
MultiValueMap<K,V>
Deprecated.since 4.1, useMultiValuedMap
insteadclass
PassiveExpiringMap<K,V>
Decorates aMap
to evict expired entries once their expiration time has been reached.class
PredicatedMap<K,V>
Decorates anotherMap
to validate that additions match a specified predicate.class
PredicatedSortedMap<K,V>
Decorates anotherSortedMap
to validate that additions match a specified predicate.class
ReferenceIdentityMap<K,V>
AMap
implementation that allows mappings to be removed by the garbage collector and matches keys and values based on==
notequals()
.class
ReferenceMap<K,V>
AMap
implementation that allows mappings to be removed by the garbage collector.class
SingletonMap<K,V>
AMap
implementation that holds a single item and is fixed size.class
StaticBucketMap<K,V>
A StaticBucketMap is an efficient, thread-safe implementation ofjava.util.Map
that performs well in in a highly thread-contentious environment.class
TransformedMap<K,V>
Decorates anotherMap
to transform objects that are added.class
TransformedSortedMap<K,V>
Decorates anotherSortedMap
to transform objects that are added.class
UnmodifiableMap<K,V>
Decorates anotherMap
to ensure it can't be altered.class
UnmodifiableOrderedMap<K,V>
Decorates anotherOrderedMap
to ensure it can't be altered.class
UnmodifiableSortedMap<K,V>
Decorates anotherSortedMap
to ensure it can't be altered. -
Uses of Put in org.apache.commons.collections4.splitmap
Classes in org.apache.commons.collections4.splitmap that implement Put Modifier and Type Class Description class
TransformedSplitMap<J,K,U,V>
Decorates anotherMap
to transform objects that are added. -
Uses of Put in org.apache.commons.collections4.trie
Classes in org.apache.commons.collections4.trie that implement Put Modifier and Type Class Description class
AbstractBitwiseTrie<K,V>
class
PatriciaTrie<E>
Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric).class
UnmodifiableTrie<K,V>
An unmodifiableTrie
.
-