|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
Collection-Util API.
See:
Description
| Class Summary | |
|---|---|
| AbstractBlockingQueueFactory | This is the abstract base implementation of the BlockingQueueFactory
interface. |
| AbstractClassHierarchieMap<E> | This is the abstract base class for a simplified Map that associates
elements (<E>) with Class objects. |
| AbstractConcurrentMapFactory | This is the abstract base implementation of the ConcurrentMapFactory
interface. |
| AbstractDequeFactory | This is the abstract base implementation of the DequeFactory
interface. |
| AbstractIterator<E> | This is an abstract base implementation of the Iterator interface. |
| AbstractLinkedNode<V,NODE extends AbstractLinkedNode<V,NODE>> | This is the abstract base-implementation of the LinkedNode interface. |
| AbstractListFactory | This is the abstract base implementation of the ListFactory
interface. |
| AbstractMapFactory | This is the abstract base implementation of the MapFactory interface. |
| AbstractQueueFactory | This is the abstract base implementation of the QueueFactory
interface. |
| AbstractSetFactory | This is the abstract base implementation of the SetFactory interface. |
| AbstractSimpleMap<KEY,VALUE> | This is the abstract base implementation for a simple Map. |
| AbstractSortedMapFactory | This is the abstract base implementation of the SortedMapFactory
interface. |
| AbstractSortedSetFactory | This is the abstract base implementation of the SortedSetFactory
interface. |
| AbstractTreeNode<NODE extends AbstractTreeNode<NODE>> | This is the abstract base implementation of the TreeNode interface. |
| AdvancedClassHierarchieMap<E> | This class extends AbstractClassHierarchieMap with the ability to
replace elements (<E>) on recursive
puts if the new element has a
more general type. |
| AppendingList<E> | This is an implementation of the List interface that gives a
read-only view on other lists that appear as if they were concatenated. |
| ArrayListFactory | This is an implementation of the
ListFactory interface that creates
instances of ArrayList. |
| BasicDoubleLinkedNode<V> | This is a basic implementation of the DoubleLinkedNode interface. |
| BasicLinkedNode<V> | This is the basic implementation of the
LinkedNode interface. |
| CollectionList<E> | This is an implementation of the List interface that adapts
another Collection as delegate. |
| ConcurrentHashMapFactory | This is an implementation of the
ConcurrentMapFactory interface that
creates instances of ConcurrentHashMap. |
| ConcurrentLinkedQueueFactory | This is an implementation of the
QueueFactory interface that creates
instances of ConcurrentLinkedQueue. |
| EmptyIterator | This is an implementation of the Iterator interface that is always
empty. |
| FilteredIterable<E> | This is an implementation of an Iterator that adapts another
Iterator but only iterates the elements that are
accepted by a given Filter. |
| FilteredIterator<E> | This is an implementation of an Iterator that adapts another
Iterator but only iterates the elements that are
accepted by a given Filter. |
| HashKey<T> | This is a simple class that allows to use any object
as hash-key. |
| HashMapFactory | This is an implementation of the
MapFactory interface that creates
instances of HashMap. |
| HashSetFactory | This is an implementation of the
SetFactory interface that creates
instances of HashSet. |
| LinkedBlockingQueueFactory | This is an implementation of the
BlockingQueueFactory interface that
creates instances of LinkedBlockingQueue. |
| LinkedListDequeFactory | This is an implementation of the
DequeFactory interface that creates
instances of LinkedList. |
| LinkedListQueueFactory | This is an implementation of the
QueueFactory interface that creates
instances of LinkedList. |
| NodeCycle<V> | This class is used to detect and represent a cyclic dependency of nodes. |
| RankMap<E> | This class is like a Map that maps elements (<E>)
to an int value that represents the rank of the according element. |
| RankMap.Ranking | This inner class represents the RankMap.Ranking.rank of an element. |
| ReadOnlyIterator<E> | This is an implementation of the Iterator interface that
gives a read-only view on an existing Iterator instance. |
| SimpleClassHierarchieMap<E> | This is a simple implementation of AbstractClassHierarchieMap. |
| SingleElementIterator<E> | This is an implementation of the Iterator interface that
iterates a single element. |
| TreeMapFactory | This is an implementation of the
SortedMapFactory interface that
creates instances of TreeMap. |
| TreeSetFactory | This is an implementation of the
SortedSetFactory interface that
creates instances of TreeSet. |
| Exception Summary | |
|---|---|
| NodeCycleException | A NodeCycleException is thrown if a chain of nodes has a cyclic
dependency. |
Contains public implementations of the
Collection-Util API.
Collection-Util API.HashKey,
EmptyIterator,
RankMap,
AbstractClassHierarchieMap,
and AbstractIterator.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||