Interface | Description |
---|---|
Collection |
Interface that represents a collection of objects.
|
List |
An ordered collection (also known as a list).
|
Map |
An object that maps keys onto values.
|
Map.Entry |
A map entry (key-value pair).
|
Set |
A collection that contains no duplicates.
|
SortedMap |
A map which guarantees its key's iteration order.
|
SortedSet |
A set which guarantees its iteration order.
|
Class | Description |
---|---|
AbstractCollection |
A basic implementation of most of the methods in the Collection interface to
make it easier to create a collection.
|
AbstractList |
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.
|
AbstractMap |
An abstract implementation of Map to make it easier to create your own
implementations.
|
AbstractSequentialList |
Abstract superclass to make it easier to implement the List interface when
backed by a sequential-access store, such as a linked list.
|
AbstractSet |
An abstract implementation of Set to make it easier to create your own
implementations.
|
ArrayList |
An array-backed implementation of the List interface.
|
Collections |
Utility class consisting of static methods that operate on, or return
Collections.
|
HashMap |
This class provides a hashtable-backed implementation of the
Map interface.
|
HashSet |
This class provides a HashMap-backed implementation of the Set interface.
|
Hashtable |
A class which implements a hashtable data structure.
|
LinkedHashMap |
This class provides a hashtable-backed implementation of the
Map interface, with predictable traversal order.
|
LinkedHashSet |
This class provides a hashtable-backed implementation of the
Set interface, with predictable traversal order.
|
LinkedList |
Linked list implementation of the List interface.
|
Random |
This class generates pseudorandom numbers.
|
Stack | |
TreeMap |
This class provides a red-black tree implementation of the SortedMap
interface.
|
TreeSet |
This class provides a TreeMap-backed implementation of the SortedSet
interface.
|
Vector |
The
Vector classes implements growable arrays of Objects. |
WeakHashMap |
A weak hash map has only weak references to the key.
|