java.util
public
interface
java.util.RandomAccess
RandomAccess is implemented by List
implementations that support
fast (usually constant time) random access.
Known Indirect Subclasses
ArrayList<E> |
ArrayList is an implementation of List, backed by an array. |
CopyOnWriteArrayList<E> |
Implements a ArrayList variant that is thread-safe. |
Stack<E> |
Stack is a Last-In/First-Out(LIFO) data structure which
represents a stack of objects. |
Vector<E> |
Vector is a variable size contiguous indexable array of Objects. |
Summary
Details