Package edu.emory.mathcs.backport.java.util
| Interface Summary |
|---|
| Deque |
A linear collection that supports element insertion and removal at
both ends. |
| NavigableMap |
A java.util.SortedMap extended with navigation methods returning the
closest matches for given search targets. |
| NavigableSet |
A java.util.SortedSet extended with navigation methods reporting
closest matches for given search targets. |
| Queue |
A collection designed for holding elements prior to processing.
|
| Class Summary |
|---|
| AbstractCollection |
Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent collections.
|
| AbstractList |
Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent lists.
|
| AbstractMap |
Convenience base class for map implementations that provides helper classes
representing simple map entries, both mutable and immutable.
|
| AbstractMap.SimpleEntry |
An Entry maintaining a key and a value. |
| AbstractMap.SimpleImmutableEntry |
An Entry maintaining an immutable key and value, This class
does not support method setValue. |
| AbstractQueue |
This class provides skeletal implementations of some Queue
operations. |
| AbstractSequentialList |
Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent lists.
|
| AbstractSet |
Overrides toArray() and toArray(Object[]) in AbstractCollection to provide
implementations valid for concurrent sets.
|
| ArrayDeque |
Resizable-array implementation of the Deque interface. |
| Arrays | |
| Collections |
Augments java.util.Collections with methods added in Java 5.0
and higher. |
| LinkedList | |
| PriorityQueue |
An unbounded queue that supports element retrieval
in the order of relative priority. |
| TreeMap |
Sorted map implementation based on a red-black tree and implementing
all the methods from the NavigableMap interface.
|
| TreeMap.Entry | |
| TreeSet | |