| 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.
|
| Class | Description |
|---|---|
| AbstractQueue<E> |
This class provides skeletal implementations of some
Queue
operations. |
| ArrayDeque<E> |
Resizable-array implementation of the
Deque interface. |
| PriorityQueue<E> |
An unbounded priority queue based on a priority heap.
|