Package java.util

Interface Summary

Collection	The root interface in the collection hierarchy.
Comparator	A comparison function, which imposes a total ordering on some collection of objects.
Enumeration	An object that implements the Enumeration interface generates a series of elements, one at a time.
Iterator	An iterator over a collection.
List	An ordered collection (also known as a sequence).
ListIterator	An iterator for lists that allows the programmer to traverse the list in either direction and modify the list during iteration.
Map	An object that maps keys to values.
Map.Entry	A map entry (key-value pair).
Set	A collection that contains no duplicate elements.
SortedMap	A map that further guarantees that it will be in ascending key order, sorted according to the natural ordering of its keys (see the Comparable interface), or by a comparator provided at sorted map creation time.
SortedSet	A set that further guarantees that its iterator will traverse the set in ascending element order, sorted according to the natural ordering of its elements (see Comparable), or by a Comparator provided at sorted set creation time.

Class Summary

AbstractCollection	This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface.
AbstractList	This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "random access" data store (such as an array).
AbstractMap	This class provides a skeletal implementation of the Map interface, to minimize the effort required to implement this interface.
AbstractSequentialList	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).
AbstractSet	This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface.
ArrayList	Resizable-array implementation of the List interface.
Arrays	This class contains various methods for manipulating arrays (such as sorting and searching).
BitSet	This class implements a vector of bits that grows as needed.
Collections	This class consists exclusively of static methods that operate on or return collections.
Dictionary	The Dictionary class is the abstract parent of any class, such as Hashtable, which maps keys to values.
HashMap	Hash table based implementation of the Map interface.
HashSet	This class implements the Set interface, backed by a hash table (actually a HashMap instance).
Hashtable	This class implements a hashtable, which maps keys to values.
LinkedList	Linked list implementation of the List interface.
Random	An instance of this class is used to generate a stream of pseudorandom numbers.
Stack	The Stack class represents a last-in-first-out (LIFO) stack of objects.
StringTokenizer	The string tokenizer class allows an application to break a string into tokens.
TreeMap	Red-Black tree based implementation of the SortedMap interface.
TreeSet	This class implements the Set interface, backed by a TreeMap instance.
Vector	The Vector class implements a growable array of objects.

Exception Summary

ConcurrentModificationException	This exception may be thrown by methods that have detected concurrent modification of a backing object when such modification is not permissible.
EmptyStackException	Thrown by methods in the Stack class to indicate that the stack is empty.
MissingResourceException	Signals that a resource is missing.
NoSuchElementException	Thrown by the nextElement method of an Enumeration to indicate that there are no more elements in the enumeration.