Uses of Interface
org.apache.openjpa.lib.util.collections.IterableMap
Package
Description
General Utilities
commons-collections4 import.
-
Uses of IterableMap in org.apache.openjpa.lib.util
Modifier and TypeClassDescriptionclass
Extension of the commonsLRUMap
that can change its maximum size.class
Map in which the key, value, or both may be weak/soft references. -
Uses of IterableMap in org.apache.openjpa.lib.util.collections
Modifier and TypeInterfaceDescriptioninterface
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
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
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.Modifier and TypeClassDescriptionclass
AbstractDualBidiMap<K,
V> AbstractBidiMap
implemented using two maps.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
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
Provides a base decorator that enables additional functionality to be added to a Map via decoration.class
DualHashBidiMap<K,
V> class
DualTreeBidiMap<K,
V> protected static class
Internal sorted map view.class
LinkedMap<K,
V> AMap
implementation that maintains the order of the entries.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
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
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 anotherOrderedMap
to ensure it can't be altered.