|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IterableGet | |
---|---|
org.apache.commons.collections4 | This package contains the interfaces and utilities shared across all the subpackages of this component. |
org.apache.commons.collections4.bidimap | This package contains implementations of the
BidiMap ,
OrderedBidiMap and
SortedBidiMap interfaces. |
org.apache.commons.collections4.map | This package contains implementations of the Map ,
IterableMap ,
OrderedMap and
SortedMap interfaces. |
org.apache.commons.collections4.splitmap | The "split map" concept is that of an object that implements
the Put and
Get interfaces,
with differing generic types. |
org.apache.commons.collections4.trie | This package contains implementations of the
Trie interface. |
Uses of IterableGet in org.apache.commons.collections4 |
---|
Subinterfaces of IterableGet in org.apache.commons.collections4 | |
---|---|
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>
SortedMap + OrderedMap . |
interface |
MultiMap<K,V>
Defines a map that holds a collection of values against each key. |
interface |
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. |
Uses of IterableGet in org.apache.commons.collections4.bidimap |
---|
Classes in org.apache.commons.collections4.bidimap that implement IterableGet | |
---|---|
class |
AbstractBidiMapDecorator<K,V>
Provides a base decorator that enables additional functionality to be added to a BidiMap via decoration. |
class |
AbstractDualBidiMap<K,V>
Abstract BidiMap 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>
Implementation of BidiMap that uses two HashMap instances. |
class |
DualLinkedHashBidiMap<K,V>
Implementation of BidiMap that uses two LinkedHashMap instances. |
class |
DualTreeBidiMap<K,V>
Implementation of BidiMap that uses two TreeMap instances. |
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 the Comparable interface. |
class |
UnmodifiableBidiMap<K,V>
Decorates another BidiMap to ensure it can't be altered. |
class |
UnmodifiableOrderedBidiMap<K,V>
Decorates another OrderedBidiMap to ensure it can't be altered. |
class |
UnmodifiableSortedBidiMap<K,V>
Decorates another SortedBidiMap to ensure it can't be altered. |
Uses of IterableGet in org.apache.commons.collections4.map |
---|
Classes in org.apache.commons.collections4.map that implement IterableGet | |
---|---|
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 basic IterableMap 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-insensitive Map . |
class |
CompositeMap<K,V>
Decorates a map of other maps to provide a single unified view. |
class |
DefaultedMap<K,V>
Decorates another Map returning a default value if the map
does not contain the requested key. |
class |
FixedSizeMap<K,V>
Decorates another Map to fix the size, preventing add/remove. |
class |
FixedSizeSortedMap<K,V>
Decorates another SortedMap to fix the size blocking add/remove. |
class |
Flat3Map<K,V>
A Map implementation that stores data in simple fields until
the size is greater than 3. |
class |
HashedMap<K,V>
A Map implementation that is a general purpose alternative
to HashMap . |
class |
LazyMap<K,V>
Decorates another Map to create objects in the map on demand. |
class |
LazySortedMap<K,V>
Decorates another SortedMap to create objects in the map on demand. |
class |
LinkedMap<K,V>
A Map implementation that maintains the order of the entries. |
class |
ListOrderedMap<K,V>
Decorates a Map to ensure that the order of addition is retained
using a List to maintain order. |
class |
LRUMap<K,V>
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,V>
A Map implementation that uses multiple keys to map the value. |
class |
MultiValueMap<K,V>
A MultiValueMap decorates another map, allowing it to have more than one value for a key. |
class |
PassiveExpiringMap<K,V>
Decorates a Map to evict expired entries once their expiration
time has been reached. |
class |
PredicatedMap<K,V>
Decorates another Map to validate that additions
match a specified predicate. |
class |
PredicatedSortedMap<K,V>
Decorates another SortedMap to validate that additions
match a specified predicate. |
class |
ReferenceIdentityMap<K,V>
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,V>
A Map implementation that allows mappings to be
removed by the garbage collector. |
class |
SingletonMap<K,V>
A Map implementation that holds a single item and is fixed size. |
class |
StaticBucketMap<K,V>
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,V>
Decorates another Map to transform objects that are added. |
class |
TransformedSortedMap<K,V>
Decorates another SortedMap to transform objects that are added. |
class |
UnmodifiableMap<K,V>
Decorates another Map to ensure it can't be altered. |
class |
UnmodifiableOrderedMap<K,V>
Decorates another OrderedMap to ensure it can't be altered. |
class |
UnmodifiableSortedMap<K,V>
Decorates another SortedMap to ensure it can't be altered. |
Uses of IterableGet in org.apache.commons.collections4.splitmap |
---|
Classes in org.apache.commons.collections4.splitmap that implement IterableGet | |
---|---|
class |
AbstractIterableGetMapDecorator<K,V>
IterableGet that uses a Map Get |
class |
TransformedSplitMap<J,K,U,V>
Decorates another Map to transform objects that are added. |
Uses of IterableGet in org.apache.commons.collections4.trie |
---|
Classes in org.apache.commons.collections4.trie that implement IterableGet | |
---|---|
class |
AbstractBitwiseTrie<K,V>
This class provides some basic Trie functionality and
utility methods for actual bitwise Trie implementations. |
class |
PatriciaTrie<E>
Implementation of a PATRICIA Trie (Practical Algorithm to Retrieve Information Coded in Alphanumeric). |
class |
UnmodifiableTrie<K,V>
An unmodifiable Trie . |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |