All Classes

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.ReadOnlyBigList<E>	A read-only version of Key1List.
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.ReadOnlyBooleanBigList	A read-only version of Key1List.
BooleanBinarySearch	Binary search for primitive type boolean.
BooleanGapList	Class {link BooleanGapList} combines the strengths of both ArrayList and LinkedList.
BooleanGapList.ReadOnlyList	A read-only version of 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.ReadOnlyByteBigList	A read-only version of Key1List.
ByteBinarySearch	Binary search for primitive type byte.
ByteGapList	Class {link ByteGapList} combines the strengths of both ArrayList and LinkedList.
ByteGapList.ReadOnlyList	A read-only version of 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.ReadOnlyCharBigList	A read-only version of Key1List.
CharBinarySearch	Binary search for primitive type char.
CharGapList	Class {link CharGapList} combines the strengths of both ArrayList and LinkedList.
CharGapList.ReadOnlyList	A read-only version of 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.ReadOnlyDoubleBigList	A read-only version of Key1List.
DoubleBinarySearch	Binary search for primitive type double.
DoubleGapList	Class {link DoubleGapList} combines the strengths of both ArrayList and LinkedList.
DoubleGapList.ReadOnlyList	A read-only version of 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.ReadOnlyFloatBigList	A read-only version of Key1List.
FloatBinarySearch	Binary search for primitive type float.
FloatGapList	Class {link FloatGapList} combines the strengths of both ArrayList and LinkedList.
FloatGapList.ReadOnlyList	A read-only version of 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>	Class {link GapList} combines the strengths of both ArrayList and LinkedList.
GapList.ReadOnlyList<E>	A read-only version of 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	Class IBooleanList is the abstract class which offers all interfaces implemented by ArrayList.
IBooleanList.IBooleanListableFromArray	Wrapper to treat an array as IBooleanListable.
IBooleanList.IBooleanListableFromCollection	Wrapper to treat a Collection as IBooleanListable.
IBooleanList.IBooleanListableFromList	Wrapper to treat a List as IBooleanListable.
IBooleanList.IBooleanListableFromMult	Wrapper to treat a repeated element as IBooleanListable.
IBooleanListable
IByteList	Class IByteList is the abstract class which offers all interfaces implemented by ArrayList.
IByteList.IByteListableFromArray	Wrapper to treat an array as IByteListable.
IByteList.IByteListableFromCollection	Wrapper to treat a Collection as IByteListable.
IByteList.IByteListableFromList	Wrapper to treat a List as IByteListable.
IByteList.IByteListableFromMult	Wrapper to treat a repeated element as IByteListable.
IByteListable
ICharList	Class ICharList is the abstract class which offers all interfaces implemented by ArrayList.
ICharList.ICharListableFromArray	Wrapper to treat an array as ICharListable.
ICharList.ICharListableFromCollection	Wrapper to treat a Collection as ICharListable.
ICharList.ICharListableFromList	Wrapper to treat a List as ICharListable.
ICharList.ICharListableFromMult	Wrapper to treat a repeated element as ICharListable.
ICharListable
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	Class IDoubleList is the abstract class which offers all interfaces implemented by ArrayList.
IDoubleList.IDoubleListableFromArray	Wrapper to treat an array as IDoubleListable.
IDoubleList.IDoubleListableFromCollection	Wrapper to treat a Collection as IDoubleListable.
IDoubleList.IDoubleListableFromList	Wrapper to treat a List as IDoubleListable.
IDoubleList.IDoubleListableFromMult	Wrapper to treat a repeated element as IDoubleListable.
IDoubleListable
IFloatList	Class IFloatList is the abstract class which offers all interfaces implemented by ArrayList.
IFloatList.IFloatListableFromArray	Wrapper to treat an array as IFloatListable.
IFloatList.IFloatListableFromCollection	Wrapper to treat a Collection as IFloatListable.
IFloatList.IFloatListableFromList	Wrapper to treat a List as IFloatListable.
IFloatList.IFloatListableFromMult	Wrapper to treat a repeated element as IFloatListable.
IFloatListable
IIntList	Class IIntList is the abstract class which offers all interfaces implemented by ArrayList.
IIntList.IIntListableFromArray	Wrapper to treat an array as IIntListable.
IIntList.IIntListableFromCollection	Wrapper to treat a Collection as IIntListable.
IIntList.IIntListableFromList	Wrapper to treat a List as IIntListable.
IIntList.IIntListableFromMult	Wrapper to treat a repeated element as IIntListable.
IIntListable
IList<E>	Class IList is the abstract class which offers all interfaces implemented by ArrayList.
IList.IListableFromArray<E>	Wrapper to treat an array as IListable.
IList.IListableFromCollection<E>	Wrapper to treat a Collection as IListable.
IList.IListableFromList<E>	Wrapper to treat a List as IListable.
IList.IListableFromMult<E>	Wrapper to treat a repeated element as IListable.
IListable<E>	Interface IListable offers a minimalist interface for accessing a list or an array.
IListAsDeque<E>	Class IListAsDeque implements a Deque based on a IList.
ILongList	Class ILongList is the abstract class which offers all interfaces implemented by ArrayList.
ILongList.ILongListableFromArray	Wrapper to treat an array as ILongListable.
ILongList.ILongListableFromCollection	Wrapper to treat a Collection as ILongListable.
ILongList.ILongListableFromList	Wrapper to treat a List as ILongListable.
ILongList.ILongListableFromMult	Wrapper to treat a repeated element as ILongListable.
ILongListable
ImmutableMapEntry<K,E>	Read-only implementation of Map.Entry.
IntBigList	IntBigList is a list optimized for storing large number of elements.
IntBigList.IntBlock	A block stores in maximum blockSize number of elements.
IntBigList.IntBlockNode	Implements an AVLNode storing a IntBlock.
IntBigList.ReadOnlyIntBigList	A read-only version of Key1List.
IntBinarySearch	Binary search for primitive type int.
IntGapList	Class {link IntGapList} combines the strengths of both ArrayList and LinkedList.
IntGapList.ReadOnlyList	A read-only version of 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	Class IShortList is the abstract class which offers all interfaces implemented by ArrayList.
IShortList.IShortListableFromArray	Wrapper to treat an array as IShortListable.
IShortList.IShortListableFromCollection	Wrapper to treat a Collection as IShortListable.
IShortList.IShortListableFromList	Wrapper to treat a List as IShortListable.
IShortList.IShortListableFromMult	Wrapper to treat a repeated element as IShortListable.
IShortListable
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.ReadOnlyKey1List<E,K>	A read-only version of 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.ReadOnlyKey2List<E,K1,K2>	A read-only version of Key2List.
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>	A read-only version of KeyList.
KeyListImpl<E>	A KeyList add key handling features to GapList.
KeySet<E>	KeySet implements a set.
KeySet.Builder<E>	Builder to construct KeySet instances.
Listables	Class Listables contains implementations of the IListable interface for Lists and arrays.
Listables.IListableArray<E>	Class Listables.IListableArray implements the IListable interface for arrays.
Listables.IListableList<E>	Class Listables.IListableList implements the IListable interface for Lists.
LongBigList	LongBigList is a list optimized for storing large number of elements.
LongBigList.LongBlock	A block stores in maximum blockSize number of elements.
LongBigList.LongBlockNode	Implements an AVLNode storing a LongBlock.
LongBigList.ReadOnlyLongBigList	A read-only version of Key1List.
LongBinarySearch	Binary search for primitive type long.
LongGapList	Class {link LongGapList} combines the strengths of both ArrayList and LinkedList.
LongGapList.ReadOnlyList	A read-only version of 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.ReadOnlyShortBigList	A read-only version of Key1List.
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	Class {link ShortGapList} combines the strengths of both ArrayList and LinkedList.
ShortGapList.ReadOnlyList	A read-only version of 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.