Collection-Util API.See: Description
| Class | Description |
|---|---|
| AbstractBlockingQueueFactory |
This is the abstract base implementation of the
BlockingQueueFactory interface. |
| AbstractClassHierarchyMap<E> | |
| AbstractConcurrentMapFactory |
This is the abstract base implementation of the
ConcurrentMapFactory interface. |
| AbstractConcurrentNavigableMapFactory |
This is the abstract base implementation of the
ConcurrentNavigableMapFactory interface. |
| AbstractDequeFactory |
This is the abstract base implementation of the
DequeFactory interface. |
| AbstractGenericTreeNode<CHILD extends Node<PARENT>,PARENT extends GenericTreeNode<CHILD,PARENT>> |
This is the abstract base implementation of the
GenericTreeNode interface. |
| AbstractHashKey<T> | |
| 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. |
| AbstractNavigableMapFactory |
This is the abstract base implementation of the
NavigableMapFactory interface. |
| AbstractNavigableSetFactory |
This is the abstract base implementation of the
NavigableSetFactory 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 TreeNode<NODE>> |
This is the abstract base implementation of the
TreeNode interface. |
| AdvancedClassHierarchyMap<E> |
This class extends
AbstractClassHierarchyMap 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. |
| ArrayIterator<E> |
This class implements both
Iterator and Enumeration to iterate/enumerate a given array. |
| 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> | |
| ConcurrentHashMapFactory |
This is an implementation of
ConcurrentMapFactory that creates instances of
ConcurrentHashMap. |
| ConcurrentHashSetFactory |
This is an implementation of
ConcurrentMapFactory that creates instances of a
ConcurrentHashSet. |
| ConcurrentLinkedQueueFactory |
This is an implementation of the
QueueFactory interface that creates instances
of ConcurrentLinkedQueue. |
| ConcurrentSkipListMapFactory |
This is an implementation of
ConcurrentNavigableMapFactory that creates
instances of ConcurrentSkipListMap. |
| CustomHashKey<T> | |
| EmptyIterator |
This is an implementation of the
Iterator interface that is always empty. |
| FilteredIterable<E> | |
| FilteredIterator<E> | |
| HashKey<T> | |
| 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. |
| NavigableTreeMapFactory |
This is an implementation of the
NavigableMapFactory interface that creates
instances of TreeMap. |
| NavigableTreeSetFactory |
This is an implementation of the
NavigableSetFactory interface that creates
instances of TreeSet. |
| NodeCycle<V> |
This class is used to detect and represent a cyclic dependency of nodes.
|
| RankMap<E> | |
| RankMap.Ranking |
This inner class represents the
RankMap.Ranking.rank of an element. |
| ReadOnlyIterator<E> | |
| SimpleClassHierarchyMap<E> |
This is a simple implementation of
AbstractClassHierarchyMap. |
| SingleElementIterator<E> | |
| SortedProperties |
This class extends
Properties and makes them sorted by their keys. |
| TreeMapFactory |
This is an implementation of the
SortedMapFactory interface that creates
instances of TreeMap. |
| TreeNodeSimple<VALUE> |
This is a simple but generic implementation of
TreeNode. |
| TreeSetFactory |
This is an implementation of the
SortedSetFactory interface that creates
instances of TreeSet. |
| Exception | Description |
|---|---|
| NodeCycleException |
A
NodeCycleException is thrown if a chain of nodes has a cyclic dependency. |
Collection-Util API.
Collection-Util API. HashKey, EmptyIterator,
RankMap, AbstractClassHierarchyMap,
and AbstractIterator.Copyright © 2001–2016 mmm-Team. All rights reserved.