Package | Description |
---|---|
java.util |
Utilities
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractList<E>
A basic implementation of most of the methods in the List interface to make
it easier to create a List based on a random-access data structure.
|
class |
AbstractQueue<E>
This class provides skeletal implementations of some
Queue
operations. |
class |
AbstractSequentialList<E>
Abstract superclass to make it easier to implement the List interface when
backed by a sequential-access store, such as a linked list.
|
class |
AbstractSet<E>
An abstract implementation of Set to make it easier to create your own
implementations.
|
class |
ArrayDeque<E>
Resizable-array implementation of the
Deque interface. |
class |
ArrayList<E>
An array-backed implementation of the List interface.
|
class |
HashSet<T>
This class provides a HashMap-backed implementation of the Set interface.
|
class |
LinkedHashSet<T>
This class provides a hashtable-backed implementation of the
Set interface, with predictable traversal order.
|
class |
LinkedList<T>
Linked list implementation of the List interface.
|
class |
PriorityQueue<E> |
class |
Stack<T> |
class |
TreeSet<T>
This class provides a TreeMap-backed implementation of the SortedSet
interface.
|
class |
Vector<T>
The
Vector classes implements growable arrays of Objects. |