Package | Description |
---|---|
org.apache.openjpa.kernel |
OpenJPA Runtime Kernel
This package provides a common OpenJPA runtime environment that can be
adapted for use with various data store mechanisms.
|
org.apache.openjpa.lib.util |
General Utilities
|
org.apache.openjpa.lib.util.collections |
commons-collections4 import.
|
org.apache.openjpa.lib.util.concurrent |
Concurrent Utilities
|
Class and Description |
---|
LinkedMap
A
Map implementation that maintains the order of the entries. |
Class and Description |
---|
AbstractHashedMap
An abstract implementation of a hash-based map which provides numerous points for
subclasses to override.
|
AbstractHashedMap.HashEntry
HashEntry used to store the data.
|
AbstractLinkedMap.LinkEntry
LinkEntry that stores the data.
|
AbstractReferenceMap
An abstract implementation of a hash-based map that allows the entries to
be removed by the garbage collector.
|
AbstractReferenceMap.ReferenceEntry
A MapEntry implementation for the map.
|
AbstractReferenceMap.ReferenceStrength
Reference type enum.
|
IterableMap
Defines a map that can be iterated directly without needing to create an entry set.
|
LRUMap
A
Map implementation with a fixed maximum size which removes
the least recently used entry if an entry is added when full. |
ReferenceMap
A
Map implementation that allows mappings to be
removed by the garbage collector. |
Class and Description |
---|
AbstractCollectionDecorator
Decorates another
Collection to provide additional behaviour. |
AbstractDualBidiMap
Abstract
BidiMap implemented using two maps. |
AbstractDualBidiMap.View
Inner class View.
|
AbstractEmptyMapIterator
Provides an implementation of an empty map iterator.
|
AbstractHashedMap
An abstract implementation of a hash-based map which provides numerous points for
subclasses to override.
|
AbstractHashedMap.HashEntry
HashEntry used to store the data.
|
AbstractHashedMap.HashIterator
Base Iterator
|
AbstractIterableMap
Provide a basic
IterableMap implementation. |
AbstractIteratorDecorator
Provides basic behaviour for decorating an iterator with extra functionality.
|
AbstractKeyValue
Abstract pair class to assist with creating
KeyValue
and Map.Entry implementations. |
AbstractLinkedMap
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.LinkEntry
LinkEntry that stores the data.
|
AbstractLinkedMap.LinkIterator
Base Iterator that iterates in link order.
|
AbstractListDecorator
Decorates another
List to provide additional behaviour. |
AbstractMapDecorator
Provides a base decorator that enables additional functionality to be added
to a Map via decoration.
|
AbstractMapEntry
Abstract Pair class to assist with creating correct
Map.Entry implementations. |
AbstractMapEntryDecorator
Provides a base decorator that allows additional functionality to be
added to a
Map.Entry . |
AbstractOrderedMapDecorator
Provides a base decorator that enables additional functionality to be added
to an OrderedMap via decoration.
|
AbstractReferenceMap
An abstract implementation of a hash-based map that allows the entries to
be removed by the garbage collector.
|
AbstractReferenceMap.ReferenceEntry
A MapEntry implementation for the map.
|
AbstractReferenceMap.ReferenceStrength
Reference type enum.
|
AbstractSerializableListDecorator
Serializable subclass of AbstractListDecorator.
|
AbstractSerializableSetDecorator
Serializable subclass of AbstractSetDecorator.
|
AbstractSetDecorator
Decorates another
Set to provide additional behaviour. |
AbstractSortedMapDecorator
Provides a base decorator that enables additional functionality to be added
to a Map via decoration.
|
AbstractUntypedIteratorDecorator
Provides basic behaviour for decorating an iterator with extra functionality
without committing the generic type of the Iterator implementation.
|
BidiMap
Defines a map that allows bidirectional lookup between key and values.
|
BoundedMap
Defines a map that is bounded in size.
|
ComparableComparator
A
Comparator that compares Comparable
objects. |
DualTreeBidiMap |
EntrySetToMapIteratorAdapter
Adapts a Map entrySet to the MapIterator interface.
|
IterableMap
Defines a map that can be iterated directly without needing to create an entry set.
|
IterableSortedMap |
KeyValue
Defines a simple key value pair.
|
LinkedMap
A
Map implementation that maintains the order of the entries. |
MapBackedSet |
MapIterator
Defines an iterator that operates over a
Map . |
OrderedBidiMap
Defines a map that allows bidirectional lookup between key and values
and retains and provides access to an ordering.
|
OrderedIterator
Defines an iterator that operates over an ordered container.
|
OrderedMap
Defines a map that maintains order and allows both forward and backward
iteration through that order.
|
OrderedMapIterator
Defines an iterator that operates over an ordered
Map . |
ResettableIterator
Defines an iterator that can be reset back to an initial state.
|
ResettableListIterator
Defines a list iterator that can be reset back to an initial state.
|
SortedBidiMap
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 and Description |
---|
AbstractReferenceMap.ReferenceStrength
Reference type enum.
|
Copyright © 2006–2022 Apache Software Foundation. All rights reserved.