| Interface | Description |
|---|---|
| AsyncCollection<T> |
Collection where elements come asynchronously.
|
| AsyncCollection.OneByOne<T> |
AsyncCollection but where elements are expected to come only one by one instead of by bunch.
|
| AsyncCollection.OneByOne.Refreshable<T> |
A refreshable collection is a collection that can be restarted, with new elements coming and replacing the previous ones.
|
| CollectionListener<T> |
A collection listener allows to signal the following events:
new elements, elements removed, and elements changed.
|
| Class | Description |
|---|---|
| ArrayIterator<T> |
Iterate on an array.
|
| ArrayIterator.Generic |
Iterate on an array of any type by using the reflection methods (java.lang.reflect.Array).
|
| ArrayUtil |
Utility methods for arrays.
|
| AsyncCollection.Aggregator<T> |
Aggregates several AsyncCollection into a single one:
each time new elements come, the newElements method is called into the main collection,
then the done method is called on the main collection only after the done method
has been called nbSubCollection times.
|
| AsyncCollection.Keep<T> |
Implementation that keeps the elements in a list.
|
| AsyncCollection.Listen<T> |
Simple implementation with a listener on both operations: newElements and done.
|
| CollectionListener.Keep<T> |
Keeps a collection of elements, such as listeners can be added asynchronously.
|
| CollectionsUtil |
Utility methods on collections.
|
| CollectionsUtil.IteratorToEnumeration<T> |
Convert an iterator to an enumeration.
|
| CompoundCollection<T> |
Allows to add elements, iterables and enumerations, then iterate on them like this is a single list.
|
| LinkedArrayList<T> |
This implementation of List uses a linked list of arrays.
|
| LinkedIterators<T> |
Makes an iterator from a list of iterators.
|
| ListOfArrays<T> |
Allows to add arrays, then iterate on them like this is a single list.
|
| Tree<T> |
Tree structure where each node contains an element of type T, and sub-nodes as a Tree.
|
| Tree.Node<T> |
Tree node.
|
| Tree.WithParent<T> |
Tree with a reference to the parent.
|
| TurnArray<T> |
Implementation of Deque using an array in an efficient way.
|
Copyright © 2019. All rights reserved.