Package org.apache.openjpa.lib.util.collections

commons-collections4 import. todo: this can be simplified/reduced to openjpa usage (drop abstractions + not used methods).

Interface Summary

Interface	Description
BidiMap<K,V>	Defines a map that allows bidirectional lookup between key and values.
BoundedMap<K,V>	Defines a map that is bounded in size.
IterableMap<K,V>	Defines a map that can be iterated directly without needing to create an entry set.
IterableSortedMap<K,V>	SortedMap + OrderedMap.
KeyValue<K,V>	Defines a simple key value pair.
MapIterator<K,V>	Defines an iterator that operates over a Map.
OrderedBidiMap<K,V>	Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.
OrderedIterator<E>	Defines an iterator that operates over an ordered container.
OrderedMap<K,V>	Defines a map that maintains order and allows both forward and backward iteration through that order.
OrderedMapIterator<K,V>	Defines an iterator that operates over an ordered Map.
ResettableIterator<E>	Defines an iterator that can be reset back to an initial state.
ResettableListIterator<E>	Defines a list iterator that can be reset back to an initial state.
SortedBidiMap<K,V>	Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.
Unmodifiable	Marker interface for collections, maps and iterators that are unmodifiable.

Class Summary

Class	Description
AbstractCollectionDecorator<E>	Decorates another Collection to provide additional behaviour.
AbstractDualBidiMap<K,V>	Abstract BidiMap implemented using two maps.
AbstractDualBidiMap.BidiMapIterator<K,V>	Inner class MapIterator.
AbstractDualBidiMap.EntrySet<K,V>	Inner class EntrySet.
AbstractDualBidiMap.EntrySetIterator<K,V>	Inner class EntrySetIterator.
AbstractDualBidiMap.KeySet<K>	Inner class KeySet.
AbstractDualBidiMap.KeySetIterator<K>	Inner class KeySetIterator.
AbstractDualBidiMap.MapEntry<K,V>	Inner class MapEntry.
AbstractDualBidiMap.Values<V>	Inner class Values.
AbstractDualBidiMap.ValuesIterator<V>	Inner class ValuesIterator.
AbstractDualBidiMap.View<K,V,E>	Inner class View.
AbstractEmptyMapIterator<K,V>	Provides an implementation of an empty map iterator.
AbstractHashedMap<K,V>	An abstract implementation of a hash-based map which provides numerous points for subclasses to override.
AbstractHashedMap.EntrySet<K,V>	EntrySet implementation.
AbstractHashedMap.EntrySetIterator<K,V>	EntrySet iterator.
AbstractHashedMap.HashEntry<K,V>	HashEntry used to store the data.
AbstractHashedMap.HashIterator<K,V>	Base Iterator
AbstractHashedMap.HashMapIterator<K,V>	MapIterator implementation.
AbstractHashedMap.KeySet<K>	KeySet implementation.
AbstractHashedMap.KeySetIterator<K>	KeySet iterator.
AbstractHashedMap.Values<V>	Values implementation.
AbstractHashedMap.ValuesIterator<V>	Values iterator.
AbstractIterableMap<K,V>	Provide a basic IterableMap implementation.
AbstractIteratorDecorator<E>	Provides basic behaviour for decorating an iterator with extra functionality.
AbstractKeyValue<K,V>	Abstract pair class to assist with creating KeyValue and Map.Entry implementations.
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.
AbstractLinkedMap.EntrySetIterator<K,V>	EntrySet iterator.
AbstractLinkedMap.KeySetIterator<K>	KeySet iterator.
AbstractLinkedMap.LinkEntry<K,V>	LinkEntry that stores the data.
AbstractLinkedMap.LinkIterator<K,V>	Base Iterator that iterates in link order.
AbstractLinkedMap.LinkMapIterator<K,V>	MapIterator implementation.
AbstractLinkedMap.ValuesIterator<V>	Values iterator.
AbstractListDecorator<E>	Decorates another List to provide additional behaviour.
AbstractMapDecorator<K,V>	Provides a base decorator that enables additional functionality to be added to a Map via decoration.
AbstractMapEntry<K,V>	Abstract Pair class to assist with creating correct Map.Entry implementations.
AbstractMapEntryDecorator<K,V>	Provides a base decorator that allows additional functionality to be added to a Map.Entry.
AbstractOrderedMapDecorator<K,V>	Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.
AbstractReferenceMap<K,V>	An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.
AbstractReferenceMap.ReferenceEntry<K,V>	A MapEntry implementation for the map.
AbstractSerializableListDecorator<E>	Serializable subclass of AbstractListDecorator.
AbstractSerializableSetDecorator<E>	Serializable subclass of AbstractSetDecorator.
AbstractSetDecorator<E>	Decorates another Set to provide additional behaviour.
AbstractSortedMapDecorator<K,V>	Provides a base decorator that enables additional functionality to be added to a Map via decoration.
AbstractSortedMapDecorator.SortedMapIterator<K,V>	OrderedMapIterator implementation.
AbstractUntypedIteratorDecorator<I,O>	Provides basic behaviour for decorating an iterator with extra functionality without committing the generic type of the Iterator implementation.
ComparableComparator<E extends java.lang.Comparable<? super E>>	A Comparator that compares Comparable objects.
ComparatorChain<E>	A ComparatorChain is a Comparator that wraps one or more Comparators in sequence.
DefaultMapEntry<K,V>	A restricted implementation of Map.Entry that prevents the Map.Entry contract from being broken.
DualHashBidiMap<K,V>	Implementation of BidiMap that uses two HashMap instances.
DualTreeBidiMap<K,V>	Implementation of BidiMap that uses two TreeMap instances.
DualTreeBidiMap.BidiOrderedMapIterator<K,V>	Inner class MapIterator.
DualTreeBidiMap.ViewMap<K,V>	Internal sorted map view.
EmptyIterator<E>	Provides an implementation of an empty iterator.
EmptyMapIterator<K,V>	Provides an implementation of an empty map iterator.
EmptyOrderedIterator<E>	Provides an implementation of an empty ordered iterator.
EmptyOrderedMapIterator<K,V>	Provides an implementation of an empty ordered map iterator.
EntrySetToMapIteratorAdapter<K,V>	Adapts a Map entrySet to the MapIterator interface.
FilterIterator<E>	Decorates another Iterator using a predicate to filter elements.
IteratorChain<E>	An IteratorChain is an Iterator that wraps a number of Iterators.
LinkedMap<K,V>	A Map implementation that maintains the order of the entries.
ListIteratorWrapper<E>	Converts an Iterator into a ResettableListIterator.
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.
MapBackedSet<E,V>
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().
ReferenceMap<K,V>	A Map implementation that allows mappings to be removed by the garbage collector.
TreeBidiMap<K extends java.lang.Comparable<K>,V extends java.lang.Comparable<V>>	Red-Black tree-based implementation of BidiMap where all objects added implement the Comparable interface.
UnmodifiableCollection<E>	Decorates another Collection to ensure it can't be altered.
UnmodifiableEntrySet<K,V>	Decorates a map entry Set to ensure it can't be altered.
UnmodifiableIterator<E>	Decorates an iterator such that it cannot be modified.
UnmodifiableList<E>	Decorates another List to ensure it can't be altered.
UnmodifiableListIterator<E>	Decorates a list iterator such that it cannot be modified.
UnmodifiableMapEntry<K,V>	A Map.Entry that throws UnsupportedOperationException when setValue is called.
UnmodifiableOrderedMap<K,V>	Decorates another OrderedMap to ensure it can't be altered.
UnmodifiableOrderedMapIterator<K,V>	Decorates an ordered map iterator such that it cannot be modified.
UnmodifiableSet<E>	Decorates another Set to ensure it can't be altered.

Enum Summary

Enum	Description
AbstractReferenceMap.ReferenceStrength	Reference type enum.