| Package | Description |
|---|---|
| java.util |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractList<E>
This class provides a skeletal implementation of the
List
interface to minimize the effort required to implement this interface
backed by a "random access" data store (such as an array). |
class |
AbstractQueue<E>
This class provides skeletal implementations of some
Queue
operations. |
class |
AbstractSequentialList<E>
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).
|
class |
AbstractSet<E>
This class provides a skeletal implementation of the Set
interface to minimize the effort required to implement this
interface.
|
class |
ArrayDeque<E>
Resizable-array implementation of the
Deque interface. |
class |
ArrayList<E>
Resizable-array implementation of the List interface.
|
class |
HashSet<E>
This class implements the Set interface, backed by a hash table
(actually a HashMap instance).
|
class |
LinkedList<E>
Doubly-linked list implementation of the
List and Deque
interfaces. |
class |
PriorityQueue<E>
An unbounded priority queue based on a priority heap.
|
class |
Stack<E>
The
Stack class represents a last-in-first-out
(LIFO) stack of objects. |
class |
Vector<E>
The
Vector class implements a growable array of
objects. |
Copyright © 2013 API Design. All Rights Reserved.