AbstractCollection<E> |
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> |
An abstract class which gives out skeletal implementations for some methods
in Queue which include add, remove, and element that are based on offer,
poll, and peek except that they throw exception to indicate the occurrence of
some error instead of the return value of false or null. |
AbstractSequentialList<E> |
AbstractSequentialList is an abstract implementation of the List interface. |
AbstractSet<E> |
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> |
Implements a ArrayList variant that is thread-safe. |
CopyOnWriteArraySet<E> |
A Set that uses 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>> |
|
HashSet<E> |
HashSet is an implementation of Set. |
LinkedBlockingQueue<E> |
An optionally-bounded blocking queue based on
linked nodes. |
LinkedHashSet<E> |
LinkedHashSet is a variant on HashSet. |
LinkedList<E> |
LinkedList is an implementation of List, backed by a linked list. |
List<E> |
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> |
PriorityQueue holds elements on a priority heap, which orders elements
according to the comparator specified at construction or their natural order. |
Queue<E> |
A kind of collection provides advanced operations than other basic
collections, such as insertion, extraction, and inspection. |
Set<E> |
Set is a collection which does not allow duplicate elements. |
SortedSet<E> |
SortedSet is a Set which iterates its elements in 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
put must wait for a take, 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. |