All Classes and Interfaces

Class
Description
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
ArrayList is an IndexedList implementation backed by an array.
ArrayLists is the preferred method of constructing instances of ArrayList.
 
 
Builders provide efficient implementations for incrementally building persistent collections.
BuilderFactory defines a factory interface for creating Builder instances.
 
 
 
Cons constructs a new list by prepending a new element to an existing list
ConsList is a functional LinkedList implementation that constructs a list by prepending an element to another list.
 
 
 
 
 
 
DerivedKeyHashMap is a HashMap variant where the key for the Map is derived from the value stored.
 
 
A generic function interface that takes a single parameter.
HashMap is an implementation of Map based on a hash trie.
 
 
 
HashSet is an implementation of Set backed by a HashMap.
 
IdentityKeyFunction is a KeyFunction where the value can be used as a key.
IndexedList implementations guarantee fast random access to elements via List.get(int).
IndexedLists is the preferred method of constructing instances of IndexedList.
Iterable defines collections that can be accessed via an Iterator.
 
KeyFunction defines the interface for extracting a key from a value.
 
LinkedList implementations guarantee fast access to the head via List.first() and tail via LinkedList.tail().
LinkedLists is the preferred method of constructing instances of LinkedList.
List defines an sequence of elements where the order is preserved.
 
 
Note: this currently iterates in reverse order
Map defines the interface for maps that associate keys with values.
 
 
Maps is the preferred method of constructing instances of Map.
Nil is the empty list
Pair is a generic container for two components of specified types.
 
 
Set defines the interface for a unique set of values as defined by Object.equals(Object).
 
Sets is the preferred method of constructing instances of Set.
SortedMap defines the interface for maps that are sorted by their key.
 
SortedMaps is the preferred method of constructing instances of SortedMap.
SortedSet defines the interface for sets that are sorted.
 
SortedSets is the preferred method of constructing instances of SortedSet.
Traversable is the root of the collection hierarchy.
 
 
 
TreeMap is an implementation of SortedMap based on a red-black tree.
TreeSet is an implementation of SortedSet backed by a TreeMap.
 
Vector is a general-purpose, immutable data structure.