See: Description
Interface | Description |
---|---|
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. |
Callable<V> |
A task that returns a result and may throw an exception.
|
CompletionService<V> |
A service that decouples the production of new asynchronous tasks
from the consumption of the results of completed tasks.
|
ConcurrentMap<K,V> |
A
Map providing additional atomic
putIfAbsent, remove, and replace methods. |
ConcurrentNavigableMap<K,V> |
A
ConcurrentMap supporting NavigableMap operations,
and recursively so for its navigable sub-maps. |
Delayed |
A mix-in style interface for marking objects that should be
acted upon after a given delay.
|
Executor |
An object that executes submitted
Runnable tasks. |
ExecutorService | |
ForkJoinPool.ForkJoinWorkerThreadFactory |
Factory for creating new
ForkJoinWorkerThread s. |
ForkJoinPool.ManagedBlocker |
Interface for extending managed parallelism for tasks running
in
ForkJoinPool s. |
Future<V> |
A Future represents the result of an asynchronous
computation.
|
RejectedExecutionHandler |
A handler for tasks that cannot be executed by a
ThreadPoolExecutor . |
RunnableFuture<V> | |
RunnableScheduledFuture<V> |
A
ScheduledFuture that is Runnable . |
ScheduledExecutorService |
An
ExecutorService that can schedule commands to run after a given
delay, or to execute periodically. |
ScheduledFuture<V> |
A delayed result-bearing action that can be cancelled.
|
ThreadFactory |
An object that creates new threads on demand.
|
TransferQueue<E> |
A
BlockingQueue in which producers may wait for consumers
to receive elements. |
Class | Description |
---|---|
AbstractExecutorService |
Provides default implementations of
ExecutorService
execution methods. |
ArrayBlockingQueue<E> |
A bounded blocking queue backed by an
array.
|
ConcurrentHashMap<K,V> |
A hash table supporting full concurrency of retrievals and
adjustable expected concurrency for updates.
|
ConcurrentLinkedDeque<E> |
An unbounded concurrent deque based on linked nodes.
|
ConcurrentLinkedQueue<E> |
An unbounded thread-safe queue based on linked nodes.
|
ConcurrentSkipListMap<K,V> |
A scalable concurrent
ConcurrentNavigableMap implementation. |
ConcurrentSkipListSet<E> |
A scalable concurrent
NavigableSet implementation based on
a ConcurrentSkipListMap . |
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. |
CountDownLatch |
A synchronization aid that allows one or more threads to wait until
a set of operations being performed in other threads completes.
|
CyclicBarrier |
A synchronization aid that allows a set of threads to all wait for
each other to reach a common barrier point.
|
DelayQueue<E extends Delayed> |
An unbounded blocking queue of
Delayed elements, in which an element can only be taken
when its delay has expired.
|
Exchanger<V> |
A synchronization point at which threads can pair and swap elements
within pairs.
|
ExecutorCompletionService<V> |
A
CompletionService that uses a supplied Executor
to execute tasks. |
Executors |
Factory and utility methods for
Executor , ExecutorService , ScheduledExecutorService , ThreadFactory , and Callable classes defined in this
package. |
ForkJoinPool |
An
ExecutorService for running ForkJoinTask s. |
ForkJoinTask<V> |
Abstract base class for tasks that run within a
ForkJoinPool . |
ForkJoinWorkerThread |
A thread managed by a
ForkJoinPool , which executes
ForkJoinTask s. |
FutureTask<V> |
A cancellable asynchronous computation.
|
LinkedBlockingDeque<E> |
An optionally-bounded blocking deque based on
linked nodes.
|
LinkedBlockingQueue<E> |
An optionally-bounded blocking queue based on
linked nodes.
|
LinkedTransferQueue<E> |
An unbounded
TransferQueue based on linked nodes. |
Phaser |
A reusable synchronization barrier, similar in functionality to
CyclicBarrier and
CountDownLatch
but supporting more flexible usage. |
PriorityBlockingQueue<E> |
An unbounded blocking queue that uses
the same ordering rules as class
PriorityQueue and supplies
blocking retrieval operations. |
RecursiveAction |
A recursive resultless
ForkJoinTask . |
RecursiveTask<V> |
A recursive result-bearing
ForkJoinTask . |
ScheduledThreadPoolExecutor |
A |