| Package | Description |
|---|---|
| java.util |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractList<E>
AbstractList is an abstract implementation of the List interface, optimized
for a backing store which supports random access. |
class |
AbstractQueue<E>
AbstractQueue is an abstract class which implements some of the methods in
Queue. |
class |
AbstractSequentialList<E>
AbstractSequentialList is an abstract implementation of the List interface.
|
class |
AbstractSet<E>
An AbstractSet is an abstract implementation of the Set interface.
|
class |
ArrayDeque<E>
An implementation of Deque, backed by an array.
|
class |
ArrayList<E>
ArrayList is an implementation of
List, backed by an array. |
class |
HashSet<E>
HashSet is an implementation of a Set.
|
class |
LinkedHashSet<E>
LinkedHashSet is a variant of HashSet.
|
class |
LinkedList<E>
LinkedList is an implementation of List, backed by a linked list.
|
class |
PriorityQueue<E>
A PriorityQueue holds elements on a priority heap, which orders the elements
according to their natural order or according to the comparator specified at
construction time.
|
class |
Stack<E>
Stack is a Last-In/First-Out(LIFO) data structure which represents a
stack of objects. |
class |
TreeSet<E>
TreeSet is an implementation of SortedSet.
|
class |
Vector<E>
Vector is a variable size contiguous indexable array of objects.
|
Copyright © 2024. All rights reserved.