| Class and Description |
|---|
| 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).
|
| ArrayDeque
Resizable-array implementation of the
Deque interface. |
| Deque
A linear collection that supports element insertion and removal at
both ends.
|
| NavigableMap
A
SortedMap extended with navigation methods returning the
closest matches for given search targets. |
| NavigableSet
A
SortedSet extended with navigation methods reporting
closest matches for given search targets. |
| Queue
A collection designed for holding elements prior to processing.
|
| SortedMap
A
Map that further provides a total ordering on its keys. |
| SortedSet
A
Set that further provides a total ordering on its elements. |