| Interface Summary | |
|---|---|
| Collection<E> | The root interface in the collection hierarchy. |
| Comparator<T> | A comparison function, which imposes a total ordering on some collection of objects. |
| Enumeration<E> | An object that implements the Enumeration interface generates a series of elements, one at a time. |
| Iterator<E> | An iterator over a collection. |
| List<E> | An ordered collection (also known as a sequence). |
| ListIterator<E> | An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator's current position in the list. |
| Map<K,V> | An object that maps keys to values. |
| Map.Entry<K,V> | A map entry (key-value pair). |
| Set<E> | A collection that contains no duplicate elements. |
| SortedMap<K,V> | 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<E> | 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<E> | This class provides a skeletal implementation of the Collection interface, to minimize the effort required to implement this interface. |
| AbstractList<E> | 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<K,V> | This class provides a skeletal implementation of the Map interface, to minimize the effort required to implement this interface. |
| 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). |
| AbstractSet<E> | This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface. |
| ArrayList<E> | Resizable-array implementation of the List 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. |
| Dictionary<K,V> |
The Dictionary class is the abstract parent of any
class, such as Hashtable, which maps keys to values.
|
| HashMap<K,V> | Hash table based implementation of the Map interface. |
| HashSet<E> | This class implements the Set interface, backed by a hash table (actually a HashMap instance). |
| Hashtable<K,V> | This class implements a hashtable, which maps keys to values. |
| IdentityHashMap<K,V> | This class implements the Map interface with a hash table, using reference-equality in place of object-equality when comparing keys (and values). |
| LinkedHashMap<K,V> |
Hash table and linked list implementation of the Map interface, with predictable iteration order. |
| LinkedHashSet<E> |
Hash table and linked list implementation of the Set interface, with predictable iteration order. |
| LinkedList<E> | Linked list implementation of the List interface. |
| Stack<E> |
The Stack class represents a last-in-first-out
(LIFO) stack of objects. |
| TreeMap<K,V> | Red-Black tree based implementation of the SortedMap interface. |
| TreeSet<E> | This class implements the Set interface, backed by a TreeMap instance. |
| Vector<E> |
The Vector class implements a growable array of
objects. |
| WeakHashMap<K,V> | A hashtable-based Map implementation with weak keys. |