@NonNullByDefault

Package java.util

Interface Summary

Interface	Description
Deque<E>	A linear collection that supports element insertion and removal at both ends.
NavigableMap<K,V>	A SortedMap extended with navigation methods returning the closest matches for given search targets.
NavigableSet<E>	A SortedSet extended with navigation methods reporting closest matches for given search targets.
Queue<E>	A collection designed for holding elements prior to processing.
SortedMap<K,V>	A Map that further provides a total ordering on its keys.
SortedSet<E>	A Set that further provides a total ordering on its elements.

Class Summary

Class	Description
AbstractQueue<E>	This class provides skeletal implementations of some Queue operations.
AbstractSequentialList<E>	This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list).
ArrayDeque<E>	Resizable-array implementation of the Deque interface.
Arrays	This class contains various methods for manipulating arrays (such as sorting and searching).
Collections	This class consists exclusively of static methods that operate on or return collections.
HashSet<E>	This class implements the Set interface, backed by a hash table (actually a HashMap instance).
LinkedList<E>	Doubly-linked list implementation of the List and Deque interfaces.
Objects	This class consists of static utility methods for operating on objects.
TreeMap<K,V>	A Red-Black tree based NavigableMap implementation.
TreeSet<E>	A NavigableSet implementation based on a TreeMap.