All Classes and Interfaces

Class
Description
General-purpose array utilities and constants.
General-purpose collection utilities and constants.
Allows peeking the first element of iteration.
A compact Set implementation that stores the elements in hashCode order.
A compact SortedSet implementation that stores the elements in order.
Automatically extends the size of the list instead of throwing exceptions on set, add, and addAll.
Bridges the gap between Enumeration and Iterator in the opposite direction of Collections.enumeration(Collection);
Orders objects by hashCode.
Allows any object to be used as a hash key, with identity used for IdentityKey.hashCode() and IdentityKey.equals(java.lang.Object).
An ArrayList that stores things using int[] instead of Object[].
A primitive collection.
A List that stores things using int[] instead of Object[].
Provides access to an associated list of int's and long's.
An ArrayList that stores things using long[] instead of Object[].
A primitive collection.
A List that stores things using long[] instead of Object[].
MinimalList provides a set of static methods to dynamically choose the most efficient List implementation.
MinimalMap provides a set of static methods to dynamically choose the most efficient Map implementation.
A registry of objects by their class, along with all their parent classes and interfaces, up to and including an upper bound.
 
A registry of objects by their class, along with all their parent classes and interfaces, up to and including an upper bound.
General-purpose utilities for working with Set.
A SortedArrayList stores its elements in hashCode order and provides means of quickly locating objects.
A SortedIntArrayList stores is elements in numerical order and provides means of quickly locating objects.
A SortedLongArrayList stores is elements in numerical order and provides means of quickly locating objects.
Deprecated.
A union set that assumes objects of different classes are not equal.
A union set that assumes objects of different classes are not equal.
 
 
A set of values will be obtained from the call to the method.
A single value will be obtained from the call to the method.
In order to efficiently provide a union of fewer, larger sets, this provides a set view on top of other sets.
An unmodifiable compact Set implementation that stores the elements in hashCode order.