ArrayList | A MutableList implemented using a backing Array . |
HashMap | A MutableMap implemented as a hash map stored in an
Array of singly linked lists of
Entry s. E |
HashSet | A MutableSet implemented as a hash set stored in an
Array of singly linked lists. E |
Hashtable | Performance-related settings for a hashtable based
collection like HashMap or HashSet . |
IdentityMap | An identity map implemented as a hash map stored in an
Array of singly linked lists of Entry s. T |
IdentitySet | An identity set implemented as a hash set stored in an
Array of singly linked lists. T |
LinkedList | A MutableList implemented as a singly linked list. |
ListMutator | Protocol for mutation of a MutableList . |
MapMutator | Protocol for mutation of a MutableMap . |
MutableList | A List supporting addition, insertion, removal, and
replacement of its elements. |
MutableMap | A Map supporting addition of new entries and removal of
existing entries. |
MutableSet | A Set supporting addition of new elements and removal
of existing elements. |
PriorityQueue | A Queue implemented using a backing Array where
the front of the queue is the smallest element according
to the order r… |
Queue | Abstract supertype of datastructures that can
be used as FIFO queues. |
SetMutator | Protocol for mutation of a MutableSet . |
SingletonMap | A Map with exactly one SingletonMap.entry . |
SingletonSet | A Set with exactly one SingletonSet.element . |
SortedMap | A Map that maintains its entries in sorted order. |
SortedSet | A Set that maintains its entries in sorted order. |
Stability | |
Stack | Abstract supertype of datastructures that can be
used as LIFO stacks. |
TreeMap | A MutableMap implemented using a red/black tree.
E |
TreeSet | A MutableSet implemented using a red/black tree.
E |
frequencies() | Produces a Map mapping elements to frequencies, where
each entry maps a distinct member of the given iterable
elements t… |
group() | Produces a Map grouping the given elements into
sequences under the group keys provided by the given
grouping function. |
linked | |
naturalOrderTreeMap() | Create a TreeMap with comparable keys,
sorted by the natural ordering of the keys. |
naturalOrderTreeSet() | Create a TreeSet with comparable keys,
sorted by the natural ordering of the keys. |
partition() | Groups the given elements into two sequences, the first
containing elements selected by the given predicate
function,… |
unlinked | |
unmodifiableList() | Wrap the given List , preventing attempts to narrow the
returned List to MutableList . |
unmodifiableMap() | Wrap the given Map , preventing attempts to narrow the
returned Map to MutableMap . |
unmodifiableSet() | Wrap the given Set , preventing attempts to narrow the
returned Set to MutableSet . |