All Classes

Class	Description
ArraysHelper	The class ArraysHelper adds method for handling boolean arrays which are missing in java.util.Arrays, e.g. sort() and binarySearch().
BigList<E>	BigList is a list optimized for storing large number of elements.
BigList.ReadOnlyBigList<E>	A read-only version of Key1List.
BigLists	Helper class to create wrapper list objects wrapping primitive BigLists.
BooleanBinarySearch	Binary search for primitive type boolean.
BooleanMergeSort	This class implements a stable in-place merge sort.
ByteBinarySearch	Binary search for primitive type byte.
ByteMergeSort	This class implements a stable in-place merge sort.
CapacityHelper	The class CapacityHelper provides a method for calculating a new capacity.
CharBinarySearch	Binary search for primitive type char.
CharMergeSort	This class implements a stable in-place merge sort.
CollectionAsSet<K>	Implements a Set based on a Collection.
DoubleBinarySearch	Binary search for primitive type double.
DoubleMergeSort	This class implements a stable in-place merge sort.
DuplicateKeyException	Exception thrown if an action is not allowed due to a duplicate key error.
FloatBinarySearch	Binary search for primitive type float.
FloatMergeSort	This class implements a stable in-place merge sort.
GapList<E>	Class {link GapList} combines the strengths of both ArrayList and LinkedList.
GapList.ReadOnlyList<E>	A read-only version of GapList.
GapLists	Helper class offering various functionality: - create wrapper list objects wrapping primitive GapLists - methods interacting with CharSequence, Reader, InputStream - add methods explaining reason if fails with DuplicateKeyException
GapLists.Impl	Class GapLists.Impl makes protected members of GapListsImpl locally accessible
GapLists.PrimitiveImpl	Class GapLists.PrimitiveImpl makes protected members of GapListsPrimitiveImpl locally accessible
GapListsImpl	This class implements helper functions.
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.
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.
ImmutableIterator<E>	Iterator which prevents changes through the remove() method.
ImmutableMapEntry<K,E>	Read-only implementation of Map.Entry.
IntBinarySearch	Binary search for primitive type int.
IntMergeSort	This class implements a stable in-place merge sort.
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.Key1CollectionImplBuilder<E,K,B extends KeyCollectionImpl.KeyCollectionImplBuilder<E,B>>
KeyCollectionImpl.Key2CollectionImplBuilder<E,K1,K2,B extends KeyCollectionImpl.Key1CollectionImplBuilder<E,K1,B>>
KeyCollectionImpl.KeyCollectionImplBuilder<E,B extends KeyCollectionImpl.KeyCollectionImplBuilder<E,B>>	Implementation of builder.
KeyCollectionImpl.KeyCollectionImplBuilder.KeyMapBuilder<E,K>
KeyCollections	Helper class to instances of key list, key collection, key set with more than 2 keys.
KeyCollections.KeyNCollection<E>	Class KeyCollections.KeyNCollection implements a key collection with a dynamic number of keys.
KeyCollections.KeyNCollection.Builder<E>	Builder for KeyCollections.KeyNCollection.
KeyCollections.KeyNList<E>	Class KeyCollections.KeyNList implements a key list with a dynamic number of keys.
KeyCollections.KeyNList.Builder<E>	Builder for KeyCollections.KeyNList.
KeyCollections.KeyNSet<E>	Class KeyCollections.KeyNSet implements a key set with a dynamic number of keys.
KeyCollections.KeyNSet.Builder<E>	Builder for KeyCollections.KeyNSet.
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.ReadOnlyKeyList<E>	A read-only version of KeyList.
KeyListImpl<E>	A KeyList add key handling features to GapList.
KeyListImpl.ReadOnlyKeyListImpl<E>	A read-only version of KeyList.
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.
LongBinarySearch	Binary search for primitive type long.
LongMergeSort	This class implements a stable in-place merge sort.
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>	Class NullComparator extends an existing comparator so it can handle null values.
Option<T>	Class Option stores a single value which may also be null.
ShortBinarySearch	Binary search for primitive type short.
ShortMergeSort	This class implements a stable in-place merge sort.
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.