|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||
See:
Description
| Interface Summary | |
|---|---|
| BlockingDeque<E> | A Deque that additionally supports operations that wait for
the deque to become non-empty when retrieving an element, and wait
for space to become available in the deque when storing an
element. |
| ConcurrentNavigableMap<K,V> | A ConcurrentMap supporting NavigableMap operations. |
| 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. |
| Class Summary | |
|---|---|
| ArrayDeque<E> | Resizable-array implementation of the Deque interface. |
| ConcurrentLinkedDeque<E> | A concurrent linked-list implementation of a Deque
(double-ended queue). |
| ConcurrentSkipListMap<K,V> | A scalable ConcurrentNavigableMap implementation. |
| ConcurrentSkipListSet<E> | A scalable concurrent NavigableSet implementation based on
a ConcurrentSkipListMap. |
| LinkedBlockingDeque<E> | An optionally-bounded blocking deque based on linked nodes. |
|
||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||