A subclass of AbstractCollection that overrides the various mutator methods to mark them as
deprecated and unconditionally throw UnsupportedOperationException.
A subclass of AbstractList that overrides the various mutator methods to mark them as deprecated
and unconditionally throw UnsupportedOperationException.
A subclass of AbstractMap that overrides the various mutator methods to mark them as deprecated
and unconditionally throw UnsupportedOperationException.
A subclass of AbstractQueue that overrides the various mutator methods to mark them as deprecated
and unconditionally throw UnsupportedOperationException.
A subclass of AbstractSequentialList that overrides the various mutator methods to mark them as
deprecated and unconditionally throw UnsupportedOperationException.
A subclass of AbstractSet that overrides the various mutator methods to mark them as deprecated
and unconditionally throw UnsupportedOperationException.
A simple persistent stack.
A persistent map from keys to values.
A non-public utility class for persistent balanced tree maps with integer keys.
An efficient persistent map from integer keys to values.
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
.
Whether an iterator returns entries or just keys.
A map-backed persistent bag.
A map-backed persistent set.
Like
PMap
but preserves insertion order.
Like
PSet
but preserves insertion order.
An unordered collection allowing duplicate elements.
An immutable, persistent collection of elements of type E.
An immutable, persistent map from keys of type K to values of type V.
An immutable, persistent indexed collection.
An immutable, persistent set, containing no duplicate elements.
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).
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).
An immutable, persistent stack.
An immutable, persistent list.
An implementation of
PSortedMap
based on a self-balancing binary search tree.
An implementation of
PSortedSet
based on a self-balancing binary search tree.
A persistent vector of elements.