AbstractCollection<E> |
Class AbstractCollection is an abstract implementation of the Collection interface. |
AbstractList<E> |
AbstractList is an abstract implementation of the List interface, optimized
for a backing store which supports random access. |
AbstractQueue<E> |
AbstractQueue is an abstract class which implements some of the methods in
Queue . |
AbstractSequentialList<E> |
AbstractSequentialList is an abstract implementation of the List interface. |
AbstractSet<E> |
An AbstractSet is an abstract implementation of the Set interface. |
ArrayBlockingQueue<E> |
A bounded blocking queue backed by an
array. |
ArrayList<E> |
ArrayList is an implementation of List , backed by an array. |
BlockingQueue<E> |
A Queue that additionally supports operations
that wait for the queue to become non-empty when retrieving an
element, and wait for space to become available in the queue when
storing an element. |
Collection<E> |
Collection is the root of the collection hierarchy. |
ConcurrentLinkedQueue<E> |
An unbounded thread-safe queue based on linked nodes. |
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. |
CopyOnWriteArraySet<E> |
A Set that uses an internal CopyOnWriteArrayList
for all of its operations. |
CursorJoiner |
Does a join on two cursors using the specified columns. |
DelayQueue<E extends Delayed> |
An unbounded blocking queue of
Delayed elements, in which an element can only be taken
when its delay has expired. |
EnumSet<E extends Enum<E>> |
An EnumSet is a specialized Set to be used with enums as keys. |
HashSet<E> |
HashSet is an implementation of a Set. |
LinkedBlockingQueue<E> |
An optionally-bounded blocking queue based on
linked nodes. |
LinkedHashSet<E> |
LinkedHashSet is a variant of HashSet. |
LinkedList<E> |
LinkedList is an implementation of List, backed by a linked list. |
List<E> |
A List is a collection which maintains an ordering for its elements. |
PriorityBlockingQueue<E> |
An unbounded blocking queue that uses
the same ordering rules as class PriorityQueue and supplies
blocking retrieval operations. |
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. |
Queue<E> |
This kind of collection provides advanced operations compared to basic
collections, such as insertion, extraction, and inspection. |
Set<E> |
A Set is a data structure which does not allow duplicate elements. |
SortedSet<E> |
SortedSet is a Set which iterates over its elements in a sorted order. |
Stack<E> |
Stack is a Last-In/First-Out(LIFO) data structure which represents a
stack of objects. |
SynchronousQueue<E> |
A blocking queue in which each insert
operation must wait for a corresponding remove operation by another
thread, and vice versa. |
TextUtils.SimpleStringSplitter |
A simple string splitter. |
TextUtils.StringSplitter |
An interface for splitting strings according to rules that are opaque to the user of this
interface. |
TreeSet<E> |
TreeSet is an implementation of SortedSet. |
Vector<E> |
Vector is a variable size contiguous indexable array of objects. |