All Classes and Interfaces
Class
Description
The class ArraysHelper adds method for handling boolean arrays which are missing in java.util.Arrays, e.g.
BigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a Block.
A read-only version of
Key1List.Helper class to create wrapper list objects wrapping primitive BigLists.
BooleanBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a BooleanBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type boolean.
Class {link BooleanGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
BooleanGapList.This class implements a stable in-place merge sort.
BooleanObjBigList implements the List interface and uses an instance
of BooleanBigList for storage.
An immutable version of a BigList.
BooleanObjGapList implements the List interface and uses an instance
of BooleanGapList for storage.
An immutable version of a GapList.
ByteBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a ByteBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type byte.
Class {link ByteGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
ByteGapList.This class implements a stable in-place merge sort.
ByteObjBigList implements the List interface and uses an instance
of ByteBigList for storage.
An immutable version of a BigList.
ByteObjGapList implements the List interface and uses an instance
of ByteGapList for storage.
An immutable version of a GapList.
CharBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a CharBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type char.
Class {link CharGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
CharGapList.This class implements a stable in-place merge sort.
CharObjBigList implements the List interface and uses an instance
of CharBigList for storage.
An immutable version of a BigList.
CharObjGapList implements the List interface and uses an instance
of CharGapList for storage.
An immutable version of a GapList.
Implements a Set based on a Collection.
DoubleBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a DoubleBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type double.
Class {link DoubleGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
DoubleGapList.This class implements a stable in-place merge sort.
DoubleObjBigList implements the List interface and uses an instance
of DoubleBigList for storage.
An immutable version of a BigList.
DoubleObjGapList implements the List interface and uses an instance
of DoubleGapList for storage.
An immutable version of a GapList.
Exception thrown if an action is not allowed due to a duplicate key error.
FloatBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a FloatBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type float.
Class {link FloatGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
FloatGapList.This class implements a stable in-place merge sort.
FloatObjBigList implements the List interface and uses an instance
of FloatBigList for storage.
An immutable version of a BigList.
FloatObjGapList implements the List interface and uses an instance
of FloatGapList for storage.
An immutable version of a GapList.
Class {link GapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
GapList.This class implements helper for primitives.
Helper class offering various functionality:
- create wrapper list objects wrapping primitive GapLists
- methods interacting with CharSequence, Reader, InputStream
- create wrapper list objects wrapping primitive GapLists
- methods interacting with CharSequence, Reader, InputStream
Class
IBooleanList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IBooleanListable.Wrapper to treat a
Collection as IBooleanListable.Wrapper to treat a
List as IBooleanListable.Wrapper to treat a repeated element as
IBooleanListable.Class
IByteList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IByteListable.Wrapper to treat a
Collection as IByteListable.Wrapper to treat a
List as IByteListable.Wrapper to treat a repeated element as
IByteListable.Class
ICharList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
ICharListable.Wrapper to treat a
Collection as ICharListable.Wrapper to treat a
List as ICharListable.Wrapper to treat a repeated element as
ICharListable.IList is an abstract class which offers all interfaces offered by both ArrayList and LinkedList.
ICollectionTools offers default implementations of Collection functionality.
Identity mapper.
Class
IDoubleList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IDoubleListable.Wrapper to treat a
Collection as IDoubleListable.Wrapper to treat a
List as IDoubleListable.Wrapper to treat a repeated element as
IDoubleListable.Class
IFloatList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IFloatListable.Wrapper to treat a
Collection as IFloatListable.Wrapper to treat a
List as IFloatListable.Wrapper to treat a repeated element as
IFloatListable.Class
IIntList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IIntListable.Wrapper to treat a
Collection as IIntListable.Wrapper to treat a
List as IIntListable.Wrapper to treat a repeated element as
IIntListable.Class
IList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IListable.Wrapper to treat a
Collection as IListable.Wrapper to treat a repeated element as
IListable.Interface
IListable offers a minimalist interface for accessing a list or an array.Class
ILongList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
ILongListable.Wrapper to treat a
Collection as ILongListable.Wrapper to treat a
List as ILongListable.Wrapper to treat a repeated element as
ILongListable.Read-only implementation of Map.Entry.
IntBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a IntBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type int.
Class {link IntGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
IntGapList.This class implements a stable in-place merge sort.
IntObjBigList implements the List interface and uses an instance
of IntBigList for storage.
An immutable version of a BigList.
IntObjGapList implements the List interface and uses an instance
of IntGapList for storage.
An immutable version of a GapList.
Class
IShortList is the abstract class which offers all interfaces implemented by ArrayList.Wrapper to treat an array as
IShortListable.Wrapper to treat a
Collection as IShortListable.Wrapper to treat a
List as IShortListable.Wrapper to treat a repeated element as
IShortListable.Key1Collection implements a collection with 1 key.
Builder to construct Key1Collection instances.
Key1List implements a key list with 1 key.
Builder to construct Key1List instances.
A read-only version of
Key1List.Key1Set implements a set.
Builder to construct Key1Set instances.
Key2Collection implements a collection with 2 keys.
Builder to construct Key2Collection instances.
Key2List implements a key list with 2 keys.
Builder to construct Key2List instances.
A read-only version of
Key2List.Key2Set implements a set.
Builder to construct Key2Set instances.
KeyCollection implements a collection.
Builder to construct KeyCollection instances.
Implements a Map based on a key map in a KeyCollection or KeyList.
Implements a Set based on a Collection.
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
Implementation of builder.
List type used to store multiple elements.
All exceptions thrown in KeyCollection/KeyList implementations are of type KeyException.
KeyList implements a list.
Builder to construct KeyList instances.
A read-only version of
KeyList.A KeyList add key handling features to GapList.
KeySet implements a set.
Builder to construct KeySet instances.
Class
Listables.IListableArray implements the IListable interface for arrays.LongBigList is a list optimized for storing large number of elements.
A block stores in maximum blockSize number of elements.
Implements an AVLNode storing a LongBlock.
A read-only version of
.
invalid reference
Key1ListBinary search for primitive type long.
Class {link LongGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
LongGapList.This class implements a stable in-place merge sort.
LongObjBigList implements the List interface and uses an instance
of LongBigList for storage.
An immutable version of a BigList.
LongObjGapList implements the List interface and uses an instance
of LongGapList for storage.
An immutable version of a GapList.
This class implements a stable in-place merge sort.
A mutable
int wrapper.The NaturalComparator will compare object using their natural order.
A NullComparator extends an existing comparator so it can handle null values.
Class
Option stores a single value which may also be null.ShortBigList is a list optimized for storing large number of elements.
A read-only version of
.
invalid reference
Key1ListA block stores in maximum blockSize number of elements.
Implements an AVLNode storing a ShortBlock.
Binary search for primitive type short.
Class {link ShortGapList} combines the strengths of both
ArrayList and LinkedList.A read-only version of
ShortGapList.This class implements a stable in-place merge sort.
ShortObjBigList implements the List interface and uses an instance
of ShortBigList for storage.
An immutable version of a BigList.
ShortObjGapList implements the List interface and uses an instance
of ShortGapList for storage.
An immutable version of a GapList.
Abstract base class for implementing a singleton comparator.
Static methods pertaining to sorted
List instances.A specification for which index to return if the list contains no elements that compare as
equal to the key.
A specification for which index to return if the list contains at least one element that
compares as equal to the key.