|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
|---|---|
| Collection<E> | The root interface in the collection hierarchy. |
| 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. |
| 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. |
| AbstractMap.SimpleEntry<K,V> | An Entry maintaining a key and a value. |
| AbstractMap.SimpleImmutableEntry<K,V> | An Entry maintaining an immutable key and value. |
| AbstractQueue<E> | This class provides skeletal implementations of some Queue
operations. |
| ArrayDeque<E> | Resizable-array implementation of the Deque interface. |
| ArrayList<E> | Resizable-array implementation of the List interface. |
| Collections | This class consists exclusively of static methods that operate on or return collections. |
| LinkedList<E> | Linked list implementation of the List interface. |
| PriorityQueue<E> | An unbounded priority queue based on a priority heap. |
| Random | An instance of this class is used to generate a stream of pseudorandom numbers. |
| Stack<E> | The Stack class represents a last-in-first-out
(LIFO) stack of objects. |
| TreeMap<K,V> | A Red-Black tree based NavigableMap implementation. |
| TreeSet<E> | A NavigableSet implementation based on a TreeMap. |
| Vector<E> | The Vector class implements a growable array of
objects. |
Contains the collections framework, legacy collection classes, event model, date and time facilities, internationalization, and miscellaneous utility classes (a string tokenizer, a random-number generator, and a bit array).
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||