Package java.util

Interface Summary

Interface	Description
Collection<E>	General-purpose interface for storing collections of objects.
Comparator<T>	An interface used a basis for implementing custom ordering.
Deque<E>	A collection designed for holding elements prior to processing.
Enumeration<E>	An interface to generate a series of elements, one at a time.
EventListener	A tag interface that other "listener" interfaces can extend to indicate their adherence to the observer pattern.
Iterator<E>	See the official Java API doc for details.
List<E>	Represents a sequence of objects.
ListIterator<E>	Uses Java 1.5 ListIterator for documentation.
Map<K,V>	Abstract interface for maps.
Map.Entry<K,V>	Represents an individual map entry.
NavigableMap<K,V>	Sorted map providing additional query operations and views.
NavigableSet<E>	A SortedSet with more flexible queries.
PrimitiveIterator<T,C>	See the official Java API doc for details.
PrimitiveIterator.OfDouble	See the official Java API doc for details.
PrimitiveIterator.OfInt	See the official Java API doc for details.
PrimitiveIterator.OfLong	See the official Java API doc for details.
Queue<E>	A collection designed for holding elements prior to processing.
RandomAccess	Indicates that a data structure supports constant-time random access to its contained objects.
Set<E>	Represents a set of unique objects.
SortedMap<K,V>	A map with ordering.
SortedSet<E>	A set known to be in ascending order.
Spliterator<T>	See the official Java API doc for details.
Spliterator.OfDouble	See the official Java API doc for details.
Spliterator.OfInt	See the official Java API doc for details.
Spliterator.OfLong	See the official Java API doc for details.
Spliterator.OfPrimitive<T,C,S extends Spliterator.OfPrimitive<T,C,S>>	See the official Java API doc for details.

Class Summary

Class	Description
AbstractCollection	Skeletal implementation of the Collection interface.
AbstractCollection<E>	Skeletal implementation of the Collection interface.
AbstractHashMap	Implementation of Map interface based on a hash table.
AbstractList<E>	Skeletal implementation of the List interface.
AbstractList	Skeletal implementation of the List interface.
AbstractMap	Skeletal implementation of the Map interface.
AbstractMap<K,V>	Skeletal implementation of the Map interface.
AbstractMap.SimpleEntry<K,V>	A mutable Map.Entry shared by several Map implementations.
AbstractMap.SimpleImmutableEntry<K,V>	An immutable Map.Entry shared by several Map implementations.
AbstractMapEntry	Basic Map.Entry implementation that implements hashCode, equals, and toString.
AbstractNavigableMap	Skeletal implementation of a NavigableMap.
AbstractQueue	Skeletal implementation of the Queue interface.
AbstractQueue<E>	Skeletal implementation of the Queue interface.
AbstractSequentialList<E>	Skeletal implementation of the List interface.
AbstractSequentialList	Skeletal implementation of the List interface.
AbstractSet	Skeletal implementation of the Set interface.
AbstractSet<E>	Skeletal implementation of the Set interface.
ArrayDeque	A Deque based on circular buffer that is implemented with an array and head/tail pointers.
ArrayDeque<E>	A Deque based on circular buffer that is implemented with an array and head/tail pointers.
ArrayList<E>	Resizeable array implementation of the List interface.
ArrayList	Resizeable array implementation of the List interface.
Arrays	Utility methods related to native arrays.
Arrays	Utility methods related to native arrays.
BitSet	This implementation uses a dense array holding bit groups of size 31 to keep track of when bits are set to true or false.
BitSet	This implementation uses a dense array holding bit groups of size 31 to keep track of when bits are set to true or false.
Collection	General-purpose interface for storing collections of objects.
Collections	Utility methods that operate on collections.
Collections	Utility methods that operate on collections.
Comparator	An interface used a basis for implementing custom ordering.
Comparators
ConcurrentModificationDetector	A helper to detect concurrent modifications to collections.
ConcurrentModificationException	See the official Java API doc for details.
Date	Represents a date and time.
Date	Represents a date and time.
Deque	A collection designed for holding elements prior to processing.
DoubleSummaryStatistics	See the official Java API doc for details.
DoubleSummaryStatistics	See the official Java API doc for details.
EmptyStackException	See the official Java API doc for details.
Enumeration	An interface to generate a series of elements, one at a time.
EnumMap<K extends Enum<K>,V>	A Map of Enums.
EnumMap	A Map of Enums.
EnumSet<E extends Enum<E>>	A Set of Enums.
EnumSet	A Set of Enums.
EventListener	A tag interface that other "listener" interfaces can extend to indicate their adherence to the observer pattern.
EventObject	Available as a superclass of event objects.
EventObject	Available as a superclass of event objects.
HashMap<K,V>	Implementation of Map interface based on a hash table.
HashMap	Implementation of Map interface based on a hash table.
HashSet	Implements a set in terms of a hash table.
HashSet<E>	Implements a set in terms of a hash table.
IdentityHashMap	Map using reference equality on keys.
IdentityHashMap<K,V>	Map using reference equality on keys.
InternalHashCodeMap	A simple wrapper around JavaScriptObject to provide Map-like semantics for any key type.
InternalJsMap
InternalJsMapFactory	A factory to create JavaScript Map instances.
InternalStringMap	A simple wrapper around JavaScript Map for key type is string.
IntSummaryStatistics	See the official Java API doc for details.
IntSummaryStatistics	See the official Java API doc for details.
Iterator	See the official Java API doc for details.
LinkedHashMap<K,V>	Hash table implementation of the Map interface with predictable iteration order.
LinkedHashMap	Hash table implementation of the Map interface with predictable iteration order.
LinkedHashSet	Hash table and linked-list implementation of the Set interface with predictable iteration order.
LinkedHashSet<E>	Hash table and linked-list implementation of the Set interface with predictable iteration order.
LinkedList	Linked list implementation.
LinkedList<E>	Linked list implementation.
List	Represents a sequence of objects.
ListIterator	Uses Java 1.5 ListIterator for documentation.
Locale	A very simple emulation of Locale for shared-code patterns like String.toUpperCase(Locale.US).
Locale	A very simple emulation of Locale for shared-code patterns like String.toUpperCase(Locale.US).
LongSummaryStatistics	See the official Java API doc for details.
LongSummaryStatistics	See the official Java API doc for details.
Map	Abstract interface for maps.
MissingResourceException	See the official Java API doc for details.
NavigableMap	Sorted map providing additional query operations and views.
NavigableSet	A SortedSet with more flexible queries.
NoSuchElementException	See the official Java API doc for details.
Objects	See the official Java API doc for details.
Objects	See the official Java API doc for details.
Optional	See the official Java API doc for details.
Optional<T>	See the official Java API doc for details.
OptionalDouble	See the official Java API doc for details.
OptionalDouble	See the official Java API doc for details.
OptionalInt	See the official Java API doc for details.
OptionalInt	See the official Java API doc for details.
OptionalLong	See the official Java API doc for details.
OptionalLong	See the official Java API doc for details.
PrimitiveIterator	See the official Java API doc for details.
PriorityQueue<E>	An unbounded priority queue based on a priority heap.
PriorityQueue	An unbounded priority queue based on a priority heap.
Queue	A collection designed for holding elements prior to processing.
Random	This class provides methods that generates pseudo-random numbers of different types, such as int, long, double, and float.
Random	This class provides methods that generates pseudo-random numbers of different types, such as int, long, double, and float.
RandomAccess	Indicates that a data structure supports constant-time random access to its contained objects.
Set	Represents a set of unique objects.
SortedMap	A map with ordering.
SortedSet	A set known to be in ascending order.
Spliterator	See the official Java API doc for details.
Spliterators	See the official Java API doc for details.
Spliterators	See the official Java API doc for details.
Spliterators.AbstractDoubleSpliterator	See the official Java API doc for details.
Spliterators.AbstractIntSpliterator	See the official Java API doc for details.
Spliterators.AbstractLongSpliterator	See the official Java API doc for details.
Spliterators.AbstractSpliterator<T>	See the official Java API doc for details.
Stack<E>	Maintains a last-in, first-out collection of objects.
Stack	Maintains a last-in, first-out collection of objects.
StringJoiner	See the official Java API doc for details.
StringJoiner	See the official Java API doc for details.
TooManyListenersException	Thrown when the subject of an observer cannot support additional observers.
TreeMap	Implements a TreeMap using a red-black tree.
TreeMap<K,V>	Implements a TreeMap using a red-black tree.
TreeSet	Implements a set using a TreeMap.
TreeSet<E>	Implements a set using a TreeMap.
Vector	To keep performance characteristics in line with Java community expectations, Vector is a wrapper around ArrayList.
Vector<E>	To keep performance characteristics in line with Java community expectations, Vector is a wrapper around ArrayList.

Exception Summary

Exception	Description
ConcurrentModificationException	See the official Java API doc for details.
EmptyStackException	See the official Java API doc for details.
MissingResourceException	See the official Java API doc for details.
NoSuchElementException	See the official Java API doc for details.
TooManyListenersException	Thrown when the subject of an observer cannot support additional observers.