AbstractQueue |
An abstract implementation of a Queue.
|
CollectionException |
A generic collection exception.
|
ConcurrentNavigableMap |
|
ConcurrentReferenceHashMap.HashEntry |
ConcurrentReferenceHashMap list entry.
|
ConcurrentReferenceHashMap.HashIterator |
|
ConcurrentReferenceHashMap.KeyReference |
|
ConcurrentReferenceHashMap.Option |
|
ConcurrentReferenceHashMap.ReferenceType |
An option specifying which Java reference type should be used to refer
to a key and/or value.
|
ConcurrentReferenceHashMap.Segment |
Segments are specialized versions of hash tables.
|
ConcurrentReferenceHashMap.SimpleEntry |
|
ConcurrentSkipListMap |
|
ConcurrentSkipListMap.ConcurrentSkipListSubMap.EntrySetView |
|
ConcurrentSkipListMap.ConcurrentSkipListSubMap.KeySetView |
|
ConcurrentSkipListMap.DescendingEntrySet |
|
ConcurrentSkipListMap.DescendingKeySet |
|
ConcurrentSkipListMap.DescendingSubMapEntryIterator |
|
ConcurrentSkipListMap.DescendingSubMapKeyIterator |
|
ConcurrentSkipListMap.EntryIter |
Entry iterators use the same trick as in ConcurrentHashMap and
elsewhere of using the iterator itself to represent entries,
thus avoiding having to create entry objects in next().
|
ConcurrentSkipListMap.EntrySet |
|
ConcurrentSkipListMap.HeadIndex |
Nodes heading each level keep track of their level.
|
ConcurrentSkipListMap.Index |
Index nodes represent the levels of the skip list.
|
ConcurrentSkipListMap.Iter |
Base of ten kinds of iterator classes:
ascending: {map, submap} X {key, value, entry}
descending: {map, submap} X {key, entry}
|
ConcurrentSkipListMap.KeySet |
|
ConcurrentSkipListMap.Node |
Nodes hold keys and values, and are singly linked in sorted
order, possibly with some intervening marker nodes.
|
ConcurrentSkipListMap.SnapshotEntry |
An immutable representation of a key-value mapping as it
existed at some point in time.
|
ConcurrentSkipListMap.SubMapEntryIterator |
|
ConcurrentSkipListMap.SubMapKeyIterator |
|
ConcurrentSkipListMap.SubMapValueIterator |
|
ConcurrentSkipListMap.Values |
|
EmptyCollectionException |
Thrown to indicate that an operation can not be performed on an empty
collection.
|
FastCopyHashMap.Entry |
|
FastCopyHashMap.EntrySet |
|
FastCopyHashMap.FastCopyHashMapIterator |
|
FastCopyHashMap.KeySet |
|
FastCopyHashMap.SimpleEntry |
|
FastCopyHashMap.Values |
|
FullCollectionException |
Thrown to indicate that an operation can not be performed on a full
collection.
|
MapDelegateSet |
Set implemented by a backing Map.
|
NavigableMap |
A SortedMap extended with navigation methods returning the
closest matches for given search targets.
|
Queue |
An iterface used to implement a first-in, first-out container.
|
ReferenceValueHashMap |
This Map will remove entries when the value in the map has been
cleaned from garbage collection
|
ReferenceValueMap |
This Map will remove entries when the value in the map has been
cleaned from garbage collection
|
ReferenceValueTreeMap |
This Map will remove entries when the value in the map has been
cleaned from garbage collection
|
SecurityActions.GetClassLoaderAction |
|
SoftValueRef |
Soft value ref.
|
ValueRef |
ValueRef.
|
WeakIdentityHashMap.Entry |
The entries in this hash table extend WeakReference, using its main ref
field as the key.
|
WeakIdentityHashMap.HashIterator |
|
WeakValueRef |
Weak value ref.
|