Known Indirect Subclasses
| ArrayList<E> |
ArrayList is an implementation of List, backed by an array. |
| CopyOnWriteArrayList<E> |
A thread-safe variant of ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array. |
| Stack<E> |
Stack is a Last-In/First-Out(LIFO) data structure which represents a
stack of objects. |
| Vector<E> |
Vector is an implementation of List, backed by an array and synchronized. |
|
Class Overview
RandomAccess is implemented by List implementations that support fast
(usually constant time) random access.
Summary