Uses of Package
org.apache.openjpa.lib.util.collections
Package
Description
OpenJPA Runtime Kernel
General Utilities
commons-collections4 import.
Concurrent Utilities
-
-
ClassDescriptionAn abstract implementation of a hash-based map which provides numerous points for subclasses to override.HashEntry used to store the data.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.LinkEntry that stores the data.An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.A MapEntry implementation for the map.Reference type enum.Defines a map that is bounded in size.Defines a map that can be iterated directly without needing to create an entry set.A
Map
implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.Defines a map that maintains order and allows both forward and backward iteration through that order.AMap
implementation that allows mappings to be removed by the garbage collector. -
ClassDescriptionDecorates another
Collection
to provide additional behaviour.AbstractBidiMap
implemented using two maps.Inner class View.Provides an implementation of an empty map iterator.An abstract implementation of a hash-based map which provides numerous points for subclasses to override.HashEntry used to store the data.Base IteratorProvide a basicIterableMap
implementation.Provides basic behaviour for decorating an iterator with extra functionality.Abstract pair class to assist with creatingKeyValue
andMap.Entry
implementations.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.LinkEntry that stores the data.Base Iterator that iterates in link order.Decorates anotherList
to provide additional behaviour.Provides a base decorator that enables additional functionality to be added to a Map via decoration.Abstract Pair class to assist with creating correctMap.Entry
implementations.Provides a base decorator that allows additional functionality to be added to aMap.Entry
.Provides a base decorator that enables additional functionality to be added to an OrderedMap via decoration.An abstract implementation of a hash-based map that allows the entries to be removed by the garbage collector.A MapEntry implementation for the map.Reference type enum.Serializable subclass of AbstractListDecorator.Serializable subclass of AbstractSetDecorator.Decorates anotherSet
to provide additional behaviour.Provides a base decorator that enables additional functionality to be added to a Map via decoration.Provides basic behaviour for decorating an iterator with extra functionality without committing the generic type of the Iterator implementation.Defines a map that allows bidirectional lookup between key and values.Defines a map that is bounded in size.AComparator
that comparesComparable
objects.Adapts a Map entrySet to the MapIterator interface.Defines a map that can be iterated directly without needing to create an entry set.Defines a simple key value pair.AMap
implementation that maintains the order of the entries.AMap
implementation with a fixed maximum size which removes the least recently used entry if an entry is added when full.Defines an iterator that operates over aMap
.Defines a map that allows bidirectional lookup between key and values and retains and provides access to an ordering.Defines an iterator that operates over an ordered container.Defines a map that maintains order and allows both forward and backward iteration through that order.Defines an iterator that operates over an orderedMap
.Defines an iterator that can be reset back to an initial state.Defines a list iterator that can be reset back to an initial state.Defines a map that allows bidirectional lookup between key and values and retains both keys and values in sorted order.Marker interface for collections, maps and iterators that are unmodifiable. -