All Classes
-
All Classes Interface Summary Class Summary Exception Summary Class Description AbstractBuilder<E,R> AbstractDefaultTree<K,V> AbstractDerivedKeyTree<K,V> AbstractIndexedList<E> AbstractIterable<E> AbstractLinkedList<E> AbstractList<E> AbstractMap<K,V> AbstractSelfBuilder<E,R> AbstractSet<E> AbstractSortedMap<K,V> AbstractSortedSet<E> AbstractTraversable<E> AbstractTree<K,V> Adapters ArrayList<E> ArrayList
is anIndexedList
implementation backed by an array.ArrayLists ArrayLists
is the preferred method of constructing instances ofArrayList
.BlackTree<K,V> Break Builder<E,R> Builders
provide efficient implementations for incrementally building persistent collections.BuilderFactory<E,R> BuilderFactory
defines a factory interface for creatingBuilder
instances.CompactHashMap<K,V> CompactHashMapIterator<K,V> CompactHashMapIterator.Pointer Cons<E> Cons constructs a new list by prepending a new element to an existing listConsList<E> ConsList
is a functionalLinkedList
implementation that constructs a list by prepending an element to another list.ConsListIterator<E> DefaultBlackTree<K,V> DefaultRedTree<K,V> DefaultTreeFactory DerivedKeyBlackTree<K,V> DerivedKeyFactory DerivedKeyHashMap<K,V> DerivedKeyHashMap
is aHashMap
variant where the key for theMap
is derived from the value stored.DerivedKeyRedTree<K,V> EntriesIterator<K,V> Function<P,R> A generic function interface that takes a single parameter.HashMap<K,V> HashMap
is an implementation ofMap
based on a hash trie.HashMap.Itr<K,V> HashMap1<K,V> HashMapCollision1<K,V> HashSet<E> HashSet
is an implementation ofSet
backed by aHashMap
.HashTrieMap<K,V> IdentityKeyFunction<E> IdentityKeyFunction
is aKeyFunction
where the value can be used as a key.IndexedList<E> IndexedList
implementations guarantee fast random access to elements viaList.get(int)
.IndexedLists IndexedLists
is the preferred method of constructing instances ofIndexedList
.Iterable<E> Iterable
defines collections that can be accessed via anIterator
.Iterables KeyFunction<K,V> KeyFunction
defines the interface for extracting a key from a value.KeysIterator<K,V> LinkedList<E> LinkedList
implementations guarantee fast access to the head viaList.first()
and tail viaLinkedList.tail()
.LinkedLists LinkedLists
is the preferred method of constructing instances ofLinkedList
.List<E> List
defines an sequence of elements where the order is preserved.ListAdapater<E> ListMap<K,V> ListMapIterator<K,V> Note: this currently iterates in reverse orderMap<K,V> Map
defines the interface for maps that associate keys with values.MapAdapter<K,V> MappedIterable<T,F> Maps Maps
is the preferred method of constructing instances ofMap
.Nil<E> Nil is the empty listPair<C1,C2> Pair
is a generic container for two components of specified types.RedBlackTree<K,V> RedTree<K,V> Set<E> Set defines the interface for a unique set of values as defined byObject.equals(Object)
.SetAdapater<E> Sets Sets
is the preferred method of constructing instances ofSet
.SortedMap<K,V> SortedMap defines the interface for maps that are sorted by their key.SortedMapAdapter<K,V> SortedMaps SortedMaps
is the preferred method of constructing instances ofSortedMap
.SortedSet<E> SortedSet
defines the interface for sets that are sorted.SortedSetAdapter<E> SortedSets SortedSets
is the preferred method of constructing instances ofSortedSet
.Traversable<E> Traversable
is the root of the collection hierarchy.Tree<K,V> TreeFactory TreeIterator<K,V,R> TreeMap<K,V> TreeSet<E> TreeSet
is an implementation ofSortedSet
backed by aTreeMap
.ValuesIterator<K,V> Vector<E> Vector is a general-purpose, immutable data structure.VectorBuilder<E> VectorIterator<E> VectorPointer<E> Zipper<K,V>