Class Summary |
AbstractCollection<AnyType> |
AbstractCollection provides default implementations for
some of the easy methods in the Collection interface. |
ArrayList<AnyType> |
The ArrayList implements a growable array. |
Arrays |
Instanceless class that contains static methods
to manipulate arrays. |
Collections |
Instanceless class contains static methods that operate on collections. |
HashMap<KeyType,ValueType> |
Hash table implementation of the Map. |
HashSet<AnyType> |
HashSet implementation. |
LinkedList<AnyType> |
LinkedList class implements a doubly-linked list. |
PriorityQueue<AnyType> |
PriorityQueue class implemented via the binary heap. |
Random |
|
Stack<AnyType> |
Stack class. |
TreeMap<KeyType,ValueType> |
Balanced search tree implementation of the Map. |
TreeSet<AnyType> |
Balanced search tree implementation of SortedSet. |