All Classes and Interfaces

Class	Description
AbstractUnmodifiableCollection<E>	A subclass of AbstractCollection that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AbstractUnmodifiableList<E>	A subclass of AbstractList that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AbstractUnmodifiableMap<K,V>	A subclass of AbstractMap that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AbstractUnmodifiableQueue<E>	A subclass of AbstractQueue that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AbstractUnmodifiableSequentialList<E>	A subclass of AbstractSequentialList that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AbstractUnmodifiableSet<E>	A subclass of AbstractSet that overrides the various mutator methods to mark them as deprecated and unconditionally throw UnsupportedOperationException.
AmortizedPQueue<E>
ConsPStack<E>	A simple persistent stack.
Empty	A static utility class for getting empty PCollections backed by the 'default' implementations.
HashPMap<K,V>	A persistent map from keys to values.
HashPMap.SequenceIterator<E>
HashTreePBag	A static convenience class for creating efficient persistent bags.
HashTreePMap	A static convenience class for creating efficient persistent maps.
HashTreePSet	A static convenience class for creating efficient persistent sets.
IntTree<V>	A non-public utility class for persistent balanced tree maps with integer keys.
IntTree.EntryIterator<V>
IntTreePMap<V>	An efficient persistent map from integer keys to values.
KVTree<K,V>	A persistent (immutable, purely functional) balanced-binary-tree implementation, with such functionality as is needed to support implementations of PSortedMap and PSortedSet, namely TreePMap and TreePSet.
KVTree.EntryIterator<K,V>	An iterator over the mappings of a KVTree.
KVTree.IteratorType	Whether an iterator returns entries or just keys.
KVTree.SearchType
MapPBag<E>	A map-backed persistent bag.
MapPSet<E>	A map-backed persistent set.
MapPSet.In
OrderedPMap<K,V>	Like PMap but preserves insertion order.
OrderedPSet<E>	Like PSet but preserves insertion order.
PBag<E>	An unordered collection allowing duplicate elements.
PCollection<E>	An immutable, persistent collection of elements of type E.
PMap<K,V>	An immutable, persistent map from keys of type K to values of type V.
PQueue<E>	A persistent queue.
PSequence<E>	An immutable, persistent indexed collection.
PSet<E>	An immutable, persistent set, containing no duplicate elements.
PSortedMap<K,V>	An immutable, persistent map from keys of type K to values of type V, with keys arranged in sorted order (according to some Comparator), and with various methods to obtain specific mappings or ranges of mappings based on this ordering (such as the least key greater than some instance of type K, or the sub-map with keys between two instances of type K).
PSortedSet<E>	An immutable, persistent set of distinct elements, with elements arranged in sorted order (according to some Comparator), and with various methods to obtain specific elements or ranges of elements based on this ordering (such as the least element greater than some value, or the set of elements between two values).
PStack<E>	An immutable, persistent stack.
PVector<E>	An immutable, persistent list.
TreePMap<K,V>	An implementation of PSortedMap based on a self-balancing binary search tree.
TreePSet<E>	An implementation of PSortedSet based on a self-balancing binary search tree.
TreePVector<E>	A persistent vector of elements.