|
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. |
| 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). |
| AbstractSet<E> |
This class provides a skeletal implementation of the Set
interface to minimize the effort required to implement this
interface. |
| LinkedList<E> |
Linked list implementation of the List interface. |
| PriorityQueue<E> |
An unbounded priority queue based on a priority
heap. |