| 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> |
This class provides skeletal implementations of some Queue
operations.
|
| 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.
|
| ArrayDeque<E> |
Resizable-array implementation of the Deque interface.
|
| ArrayList<E> |
ArrayList is an implementation of List, backed by an array.
|
| ArraySet<E> |
ArraySet is a generic set data structure that is designed to be more memory efficient than a
traditional HashSet.
|
| BatchUpdateException |
This exception is thrown if a problem occurs during a batch update operation.
|
| BlockingDeque<E> |
A Deque that additionally supports blocking operations that wait
for the deque to become non-empty when retrieving an element, and wait for
space to become available in the deque when storing an element.
|
| 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.
|
| ConcurrentLinkedDeque<E> |
An unbounded concurrent deque based on linked nodes.
|
| ConcurrentLinkedQueue<E> |
An unbounded thread-safe queue based on linked nodes.
|
| ConcurrentSkipListSet<E> |
A scalable concurrent NavigableSet implementation based on
a ConcurrentSkipListMap.
|
| CopyOnWriteArrayList<E> |
A thread-safe random-access list.
|
| 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.
|
| DataTruncation |
An exception which is thrown when a JDBC driver unexpectedly truncates a data
value either when reading (resulting in warning), or when writing data
(resulting in an error).
|
| DelayQueue<E extends Delayed> |
An unbounded blocking queue of
Delayed elements, in which an element can only be taken
when its delay has expired.
|
| Deque<E> |
A linear collection that supports element insertion and removal at
both ends.
|
| 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.
|
| LinkedBlockingDeque<E> |
An optionally-bounded blocking deque based on
linked nodes.
|
| 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 doubly-linked list.
|
| LinkedTransferQueue<E> |
An unbounded TransferQueue based on linked nodes.
|
| List<E> |
A List is a collection which maintains an ordering for its elements.
|
| NavigableSet<E> |
A SortedSet extended with navigation methods reporting
closest matches for given search targets.
|
| ObservableArrayList<T> |
An ObservableList implementation using ArrayList as an implementation.
|
| ObservableList<T> |
A List that notifies when changes are made.
|
| 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> |
A collection designed for holding elements prior to processing.
|
| SQLClientInfoException |
An exception, which is subclass of SQLException, is thrown when one or more
client info properties could not be set on a Connection.
|
| SQLDataException |
An exception, which is subclass of SQLException, is thrown when various data
errors arise.
|
| SQLException |
An exception that indicates a failed JDBC operation.
|
| SQLFeatureNotSupportedException |
An exception, which is subclass of SQLNonTransientException, is thrown when
various the JDBC driver does not support an optional JDBC feature.
|
| SQLIntegrityConstraintViolationException |
An exception, which is subclass of SQLNonTransientException, is thrown when
various the an integrity constraint (foreign key, primary key or unique key)
has been violated.
|
| SQLInvalidAuthorizationSpecException |
An exception, which is subclass of SQLNonTransientException, is thrown when
the authorization credentials presented during connection establishment are
not valid.
|
| SQLNonTransientConnectionException |
An exception, which is subclass of SQLException, is thrown when the
connection operation that failed will not succeed when the operation is
retried without the cause of the failure being corrected.
|
| SQLNonTransientException |
|
| SQLRecoverableException |
|
| SQLSyntaxErrorException |
|
| SQLTimeoutException |
|
| SQLTransactionRollbackException |
|
| SQLTransientConnectionException |
|
| SQLTransientException |
|
| SQLWarning |
An exception class that holds information about Database access warnings.
|
| ServiceLoader<S> |
A service-provider loader.
|
| 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.
|
| TaskStackBuilder |
Utility class for constructing synthetic back stacks for cross-task navigation
on Android 3.0 and newer.
|
| 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.
|
| TransferQueue<E> |
A BlockingQueue in which producers may wait for consumers
to receive elements.
|
| TreeSet<E> |
TreeSet is an implementation of SortedSet.
|
| Vector<E> |
Vector is an implementation of List, backed by an array and synchronized.
|