Uses of Interface
org.apache.openjpa.lib.util.collections.IterableMap
Packages that use IterableMap
Package
Description
General Utilities
commons-collections4 import.
-
Uses of IterableMap in org.apache.openjpa.lib.util
Classes in org.apache.openjpa.lib.util that implement IterableMapModifier and TypeClassDescriptionclassExtension of the commonsLRUMapthat can change its maximum size.classMap in which the key, value, or both may be weak/soft references. -
Uses of IterableMap in org.apache.openjpa.lib.util.collections
Subinterfaces of IterableMap in org.apache.openjpa.lib.util.collectionsModifier and TypeInterfaceDescriptioninterfaceBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values.interfaceBoundedMap<K,V> Defines a map that is bounded in size.interfaceIterableSortedMap<K,V> interfaceOrderedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.interfaceOrderedMap<K,V> Defines a map that maintains order and allows both forward and backward iteration through that order.interfaceSortedBidiMap<K,V> Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.Classes in org.apache.openjpa.lib.util.collections that implement IterableMapModifier and TypeClassDescriptionclassAbstractDualBidiMap<K,V> AbstractBidiMapimplemented using two maps.classAbstractHashedMap<K,V> An abstract implementation of a hash-based map which provides numerous points for subclasses to override.classAbstractIterableMap<K,V> Provide a basicIterableMapimplementation.classAbstractLinkedMap<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.classAbstractMapDecorator<K,V> Provides a base decorator that enables additional functionality to be added to a Map via decoration.classProvides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.classAbstractReferenceMap<K,V> An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.classProvides a base decorator that enables additional functionality to be added to a Map via decoration.classDualHashBidiMap<K,V> classDualTreeBidiMap<K,V> protected static classInternal sorted map view.classLinkedMap<K,V> AMapimplementation that maintains the order of the entries.classLRUMap<K,V> AMapimplementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.classReferenceIdentityMap<K,V> AMapimplementation that allows mappings to be removed by the garbage collector and matches keys and values based on==notequals().classReferenceMap<K,V> AMapimplementation that allows mappings to be removed by the garbage collector.classTreeBidiMap<K extends Comparable<K>,V extends Comparable<V>> Red-Black tree-based implementation of BidiMap where all objects added implement theComparableinterface.final classDecorates anotherOrderedMapto ensure it can't be altered.