|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
| Interface Summary | |
|---|---|
| CompositeCollection.CollectionMutator | Pluggable strategy to handle changes to the composite. |
| MapIterator | Defines an iterator that operates over a Map. |
| Class Summary | |
|---|---|
| AbstractHashedMap | An abstract implementation of a hash-based map which provides numerous points for subclasses to override. |
| AbstractHashedMap.EntrySet | EntrySet implementation. |
| AbstractHashedMap.EntrySetIterator | EntrySet iterator. |
| AbstractHashedMap.HashEntry | HashEntry used to store the data. |
| AbstractHashedMap.HashIterator | Base Iterator |
| AbstractHashedMap.HashMapIterator | MapIterator implementation. |
| AbstractHashedMap.KeySet | KeySet implementation. |
| AbstractHashedMap.KeySetIterator | KeySet iterator. |
| AbstractHashedMap.Values | Values implementation. |
| AbstractHashedMap.ValuesIterator | Values iterator. |
| CompositeCollection | Decorates a collection of other collections to provide a single unified view. |
| EmptyMapIterator | Provides an implementation of an empty map iterator. |
| IdentityMap | A Map implementation that matches keys and values based on
== not equals(). |
| IdentityMap.IdentityEntry | HashEntry |
| IteratorChain | An IteratorChain is an Iterator that wraps a number of Iterators. |
| PrimitiveLongMap | |
| PrimitiveLongStack | |
| PriorityQueue | Binary heap implementation of Buffer that provides for removal
based on Comparator ordering. |
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||