All Classes Interface Summary Class Summary Enum Summary Exception Summary
| Class |
Description |
| ArraysHelper |
The class ArraysHelper adds method for handling boolean arrays which are missing in java.util.Arrays, e.g.
|
| BigList<E> |
BigList is a list optimized for storing large number of elements.
|
| BigList.Block<T> |
A block stores in maximum blockSize number of elements.
|
| BigList.BlockNode<E> |
Implements an AVLNode storing a Block.
|
| BigList.ImmutableBigList<E> |
An immutable version of a BigList.
|
| BigLists |
Helper class to create wrapper list objects wrapping primitive BigLists.
|
| BooleanBigList |
BooleanBigList is a list optimized for storing large number of elements.
|
| BooleanBigList.BooleanBlock |
A block stores in maximum blockSize number of elements.
|
| BooleanBigList.BooleanBlockNode |
Implements an AVLNode storing a BooleanBlock.
|
| BooleanBigList.ImmutableBooleanBigList |
An immutable version of a BooleanBigList.
|
| BooleanBinarySearch |
Binary search for primitive type boolean.
|
| BooleanGapList |
BooleanGapList combines the strengths of both ArrayList and LinkedList.
|
| BooleanGapList.ImmutableBooleanGapList |
An immutable version of a BooleanGapList.
|
| BooleanMergeSort |
This class implements a stable in-place merge sort.
|
| BooleanObjBigList |
BooleanObjBigList implements the List interface and uses an instance
of BooleanBigList for storage.
|
| BooleanObjBigList.ImmutableBooleanObjBigList |
An immutable version of a BigList.
|
| BooleanObjGapList |
BooleanObjGapList implements the List interface and uses an instance
of BooleanGapList for storage.
|
| BooleanObjGapList.ImmutableBooleanObjGapList |
An immutable version of a GapList.
|
| ByteBigList |
ByteBigList is a list optimized for storing large number of elements.
|
| ByteBigList.ByteBlock |
A block stores in maximum blockSize number of elements.
|
| ByteBigList.ByteBlockNode |
Implements an AVLNode storing a ByteBlock.
|
| ByteBigList.ImmutableByteBigList |
An immutable version of a ByteBigList.
|
| ByteBinarySearch |
Binary search for primitive type byte.
|
| ByteGapList |
ByteGapList combines the strengths of both ArrayList and LinkedList.
|
| ByteGapList.ImmutableByteGapList |
An immutable version of a ByteGapList.
|
| ByteMergeSort |
This class implements a stable in-place merge sort.
|
| ByteObjBigList |
ByteObjBigList implements the List interface and uses an instance
of ByteBigList for storage.
|
| ByteObjBigList.ImmutableByteObjBigList |
An immutable version of a BigList.
|
| ByteObjGapList |
ByteObjGapList implements the List interface and uses an instance
of ByteGapList for storage.
|
| ByteObjGapList.ImmutableByteObjGapList |
An immutable version of a GapList.
|
| CharBigList |
CharBigList is a list optimized for storing large number of elements.
|
| CharBigList.CharBlock |
A block stores in maximum blockSize number of elements.
|
| CharBigList.CharBlockNode |
Implements an AVLNode storing a CharBlock.
|
| CharBigList.ImmutableCharBigList |
An immutable version of a CharBigList.
|
| CharBinarySearch |
Binary search for primitive type char.
|
| CharGapList |
CharGapList combines the strengths of both ArrayList and LinkedList.
|
| CharGapList.ImmutableCharGapList |
An immutable version of a CharGapList.
|
| CharMergeSort |
This class implements a stable in-place merge sort.
|
| CharObjBigList |
CharObjBigList implements the List interface and uses an instance
of CharBigList for storage.
|
| CharObjBigList.ImmutableCharObjBigList |
An immutable version of a BigList.
|
| CharObjGapList |
CharObjGapList implements the List interface and uses an instance
of CharGapList for storage.
|
| CharObjGapList.ImmutableCharObjGapList |
An immutable version of a GapList.
|
| CollectionAsSet<K> |
Implements a Set based on a Collection.
|
| DoubleBigList |
DoubleBigList is a list optimized for storing large number of elements.
|
| DoubleBigList.DoubleBlock |
A block stores in maximum blockSize number of elements.
|
| DoubleBigList.DoubleBlockNode |
Implements an AVLNode storing a DoubleBlock.
|
| DoubleBigList.ImmutableDoubleBigList |
An immutable version of a DoubleBigList.
|
| DoubleBinarySearch |
Binary search for primitive type double.
|
| DoubleGapList |
DoubleGapList combines the strengths of both ArrayList and LinkedList.
|
| DoubleGapList.ImmutableDoubleGapList |
An immutable version of a DoubleGapList.
|
| DoubleMergeSort |
This class implements a stable in-place merge sort.
|
| DoubleObjBigList |
DoubleObjBigList implements the List interface and uses an instance
of DoubleBigList for storage.
|
| DoubleObjBigList.ImmutableDoubleObjBigList |
An immutable version of a BigList.
|
| DoubleObjGapList |
DoubleObjGapList implements the List interface and uses an instance
of DoubleGapList for storage.
|
| DoubleObjGapList.ImmutableDoubleObjGapList |
An immutable version of a GapList.
|
| DuplicateKeyException |
Exception thrown if an action is not allowed due to a duplicate key error.
|
| FloatBigList |
FloatBigList is a list optimized for storing large number of elements.
|
| FloatBigList.FloatBlock |
A block stores in maximum blockSize number of elements.
|
| FloatBigList.FloatBlockNode |
Implements an AVLNode storing a FloatBlock.
|
| FloatBigList.ImmutableFloatBigList |
An immutable version of a FloatBigList.
|
| FloatBinarySearch |
Binary search for primitive type float.
|
| FloatGapList |
FloatGapList combines the strengths of both ArrayList and LinkedList.
|
| FloatGapList.ImmutableFloatGapList |
An immutable version of a FloatGapList.
|
| FloatMergeSort |
This class implements a stable in-place merge sort.
|
| FloatObjBigList |
FloatObjBigList implements the List interface and uses an instance
of FloatBigList for storage.
|
| FloatObjBigList.ImmutableFloatObjBigList |
An immutable version of a BigList.
|
| FloatObjGapList |
FloatObjGapList implements the List interface and uses an instance
of FloatGapList for storage.
|
| FloatObjGapList.ImmutableFloatObjGapList |
An immutable version of a GapList.
|
| GapList<E> |
GapList combines the strengths of both ArrayList and LinkedList.
|
| GapList.ImmutableGapList<E> |
An immutable version of a GapList.
|
| GapListPrimitives |
This class implements helper for primitives.
|
| GapLists |
Helper class offering various functionality:
- create wrapper list objects wrapping primitive GapLists
- methods interacting with CharSequence, Reader, InputStream
|
| GapLists.CollectorImpl<T,A,R> |
|
| IBooleanList |
IBooleanList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IBooleanList.IReadOnlyBooleanList |
|
| IBooleanList.IReadOnlyBooleanListFromArray |
|
| IBooleanList.IReadOnlyBooleanListFromCollection |
|
| IBooleanList.IReadOnlyBooleanListFromList |
|
| IBooleanList.IReadOnlyBooleanListFromMult |
|
| IByteList |
IByteList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IByteList.IReadOnlyByteList |
|
| IByteList.IReadOnlyByteListFromArray |
|
| IByteList.IReadOnlyByteListFromCollection |
|
| IByteList.IReadOnlyByteListFromList |
|
| IByteList.IReadOnlyByteListFromMult |
|
| ICharList |
ICharList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| ICharList.IReadOnlyCharList |
|
| ICharList.IReadOnlyCharListFromArray |
|
| ICharList.IReadOnlyCharListFromCollection |
|
| ICharList.IReadOnlyCharListFromList |
|
| ICharList.IReadOnlyCharListFromMult |
|
| ICollection<E> |
IList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| ICollectionTools |
ICollectionTools offers default implementations of Collection functionality.
|
| IdentMapper<E> |
Identity mapper.
|
| IDoubleList |
IDoubleList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IDoubleList.IReadOnlyDoubleList |
|
| IDoubleList.IReadOnlyDoubleListFromArray |
|
| IDoubleList.IReadOnlyDoubleListFromCollection |
|
| IDoubleList.IReadOnlyDoubleListFromList |
|
| IDoubleList.IReadOnlyDoubleListFromMult |
|
| IFloatList |
IFloatList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IFloatList.IReadOnlyFloatList |
|
| IFloatList.IReadOnlyFloatListFromArray |
|
| IFloatList.IReadOnlyFloatListFromCollection |
|
| IFloatList.IReadOnlyFloatListFromList |
|
| IFloatList.IReadOnlyFloatListFromMult |
|
| IIntList |
IIntList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IIntList.IReadOnlyIntList |
|
| IIntList.IReadOnlyIntListFromArray |
|
| IIntList.IReadOnlyIntListFromCollection |
|
| IIntList.IReadOnlyIntListFromList |
|
| IIntList.IReadOnlyIntListFromMult |
|
| IList<E> |
IList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IList.IReadOnlyList<E> |
|
| IList.IReadOnlyListFromArray<E> |
|
| IList.IReadOnlyListFromCollection<E> |
|
| IList.IReadOnlyListFromList<E> |
|
| IList.IReadOnlyListFromMult<E> |
|
| ILongList |
ILongList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| ILongList.IReadOnlyLongList |
|
| ILongList.IReadOnlyLongListFromArray |
|
| ILongList.IReadOnlyLongListFromCollection |
|
| ILongList.IReadOnlyLongListFromList |
|
| ILongList.IReadOnlyLongListFromMult |
|
| ImmutableMapEntry<K,E> |
Read-only implementation of Map.Entry.
|
| IntBigList |
IntBigList is a list optimized for storing large number of elements.
|
| IntBigList.ImmutableIntBigList |
An immutable version of a IntBigList.
|
| IntBigList.IntBlock |
A block stores in maximum blockSize number of elements.
|
| IntBigList.IntBlockNode |
Implements an AVLNode storing a IntBlock.
|
| IntBinarySearch |
Binary search for primitive type int.
|
| IntGapList |
IntGapList combines the strengths of both ArrayList and LinkedList.
|
| IntGapList.ImmutableIntGapList |
An immutable version of a IntGapList.
|
| IntMergeSort |
This class implements a stable in-place merge sort.
|
| IntObjBigList |
IntObjBigList implements the List interface and uses an instance
of IntBigList for storage.
|
| IntObjBigList.ImmutableIntObjBigList |
An immutable version of a BigList.
|
| IntObjGapList |
IntObjGapList implements the List interface and uses an instance
of IntGapList for storage.
|
| IntObjGapList.ImmutableIntObjGapList |
An immutable version of a GapList.
|
| IShortList |
IShortList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
|
| IShortList.IReadOnlyShortList |
|
| IShortList.IReadOnlyShortListFromArray |
|
| IShortList.IReadOnlyShortListFromCollection |
|
| IShortList.IReadOnlyShortListFromList |
|
| IShortList.IReadOnlyShortListFromMult |
|
| Key1Collection<E,K> |
Key1Collection implements a collection with 1 key.
|
| Key1Collection.Builder<E,K> |
Builder to construct Key1Collection instances.
|
| Key1List<E,K> |
Key1List implements a key list with 1 key.
|
| Key1List.Builder<E,K> |
Builder to construct Key1List instances.
|
| Key1List.ImmutableKey1List<E,K> |
An immutable version of a Key1List.
|
| Key1Set<E,K> |
Key1Set implements a set.
|
| Key1Set.Builder<E,K> |
Builder to construct Key1Set instances.
|
| Key2Collection<E,K1,K2> |
Key2Collection implements a collection with 2 keys.
|
| Key2Collection.Builder<E,K1,K2> |
Builder to construct Key2Collection instances.
|
| Key2List<E,K1,K2> |
Key2List implements a key list with 2 keys.
|
| Key2List.Builder<E,K1,K2> |
Builder to construct Key2List instances.
|
| Key2List.ImmutableKey2List<E,K1,K2> |
An immutable version of a Key1List.
|
| Key2Set<E,K1,K2> |
Key2Set implements a set.
|
| Key2Set.Builder<E,K1,K2> |
Builder to construct Key2Set instances.
|
| KeyCollection<E> |
KeyCollection implements a collection.
|
| KeyCollection.Builder<E> |
Builder to construct KeyCollection instances.
|
| KeyCollectionAsMap<K,E> |
Implements a Map based on a key map in a KeyCollection or KeyList.
|
| KeyCollectionAsSet<E> |
Implements a Set based on a Collection.
|
| KeyCollectionImpl<E> |
Add:
- validation fails: null / constraint
- duplicate not allowed (mode replace)
Triggers:
- triggers are called after the add/remove operation has finished
- if an exception is thrown in the trigger, the change already made to the collection is not undone
|
| KeyCollectionImpl.BuilderImpl<E> |
Implementation of builder.
|
| KeyCollectionImpl.BuilderImpl.KeyMapBuilder<E,K> |
|
| KeyCollectionImpl.KeyMap<E,K> |
|
| KeyCollectionImpl.KeyMap.KeyMapCountIter<E,K> |
|
| KeyCollectionImpl.KeyMap.KeyMapIter<E,K> |
|
| KeyCollectionImpl.KeyMapList<E> |
List type used to store multiple elements.
|
| KeyException |
All exceptions thrown in KeyCollection/KeyList implementations are of type KeyException.
|
| KeyList<E> |
KeyList implements a list.
|
| KeyList.Builder<E> |
Builder to construct KeyList instances.
|
| KeyList.ImmutableKeyList<E> |
An immutable version of a Key1List.
|
| KeyListImpl<E> |
A KeyList add key handling features to GapList.
|
| KeySet<E> |
KeySet implements a set.
|
| KeySet.Builder<E> |
Builder to construct KeySet instances.
|
| LongBigList |
LongBigList is a list optimized for storing large number of elements.
|
| LongBigList.ImmutableLongBigList |
An immutable version of a LongBigList.
|
| LongBigList.LongBlock |
A block stores in maximum blockSize number of elements.
|
| LongBigList.LongBlockNode |
Implements an AVLNode storing a LongBlock.
|
| LongBinarySearch |
Binary search for primitive type long.
|
| LongGapList |
LongGapList combines the strengths of both ArrayList and LinkedList.
|
| LongGapList.ImmutableLongGapList |
An immutable version of a LongGapList.
|
| LongMergeSort |
This class implements a stable in-place merge sort.
|
| LongObjBigList |
LongObjBigList implements the List interface and uses an instance
of LongBigList for storage.
|
| LongObjBigList.ImmutableLongObjBigList |
An immutable version of a BigList.
|
| LongObjGapList |
LongObjGapList implements the List interface and uses an instance
of LongGapList for storage.
|
| LongObjGapList.ImmutableLongObjGapList |
An immutable version of a GapList.
|
| MergeSort<E> |
This class implements a stable in-place merge sort.
|
| MutableInt |
A mutable int wrapper.
|
| NaturalComparator<T> |
The NaturalComparator will compare object using their natural order.
|
| NullComparator<T> |
A NullComparator extends an existing comparator so it can handle null values.
|
| Option<T> |
Class Option stores a single value which may also be null. |
| ShortBigList |
ShortBigList is a list optimized for storing large number of elements.
|
| ShortBigList.ImmutableShortBigList |
An immutable version of a ShortBigList.
|
| ShortBigList.ShortBlock |
A block stores in maximum blockSize number of elements.
|
| ShortBigList.ShortBlockNode |
Implements an AVLNode storing a ShortBlock.
|
| ShortBinarySearch |
Binary search for primitive type short.
|
| ShortGapList |
ShortGapList combines the strengths of both ArrayList and LinkedList.
|
| ShortGapList.ImmutableShortGapList |
An immutable version of a ShortGapList.
|
| ShortMergeSort |
This class implements a stable in-place merge sort.
|
| ShortObjBigList |
ShortObjBigList implements the List interface and uses an instance
of ShortBigList for storage.
|
| ShortObjBigList.ImmutableShortObjBigList |
An immutable version of a BigList.
|
| ShortObjGapList |
ShortObjGapList implements the List interface and uses an instance
of ShortGapList for storage.
|
| ShortObjGapList.ImmutableShortObjGapList |
An immutable version of a GapList.
|
| SingletonComparator<T> |
Abstract base class for implementing a singleton comparator.
|
| SortedLists |
Static methods pertaining to sorted List instances.
|
| SortedLists.KeyAbsentBehavior |
A specification for which index to return if the list contains no elements that compare as
equal to the key.
|
| SortedLists.KeyPresentBehavior |
A specification for which index to return if the list contains at least one element that
compares as equal to the key.
|