java.util.concurrent

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.

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.

A task that returns a result and may throw an exception.

A marker interface identifying asynchronous tasks produced by async methods.

A service that decouples the production of new asynchronous tasks from the consumption of the results of completed tasks.

A stage of a possibly asynchronous computation, that performs an action or computes a value when another CompletionStage completes.

A Map providing thread safety and atomicity guarantees.

A ConcurrentMap supporting NavigableMap operations, and recursively so for its navigable sub-maps.

A mix-in style interface for marking objects that should be acted upon after a given delay.

An object that executes submitted Runnable tasks.

An Executor that provides methods to manage termination and methods that can produce a Future for tracking progress of one or more asynchronous tasks.

A component that acts as both a Subscriber and Publisher.

A producer of items (and related control messages) received by Subscribers.

A receiver of messages.

Message control linking a Publisher and Subscriber.

Factory for creating new ForkJoinWorkerThreads.

Interface for extending managed parallelism for tasks running in ForkJoinPools.

A represents the result of an asynchronous computation.

A handler for tasks that cannot be executed by a ThreadPoolExecutor.

A Future that is Runnable.

A ScheduledFuture that is Runnable.

An ExecutorService that can schedule commands to run after a given delay, or to execute periodically.

A delayed result-bearing action that can be cancelled.

An object that creates new threads on demand.

A BlockingQueue in which producers may wait for consumers to receive elements.

Provides default implementations of ExecutorService execution methods.

A bounded blocking queue backed by an array.

A Future that may be explicitly completed (setting its value and status), and may be used as a CompletionStage, supporting dependent functions and actions that trigger upon its completion.

A hash table supporting full concurrency of retrievals and high expected concurrency for updates.

An unbounded concurrent deque based on linked nodes.

An unbounded thread-safe queue based on linked nodes.

A scalable concurrent ConcurrentNavigableMap implementation.

A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.

A thread-safe variant of java.util.ArrayList in which all mutative operations (add, set, and so on) are implemented by making a fresh copy of the underlying array.

A Set that uses an internal CopyOnWriteArrayList for all of its operations.

A synchronization aid that allows one or more threads to wait until a set of operations being performed in other threads completes.

A ForkJoinTask with a completion action performed when triggered and there are no remaining pending actions.

A synchronization aid that allows a set of threads to all wait for each other to reach a common barrier point.

An unbounded blocking queue of Delayed elements, in which an element generally becomes eligible for removal when its delay has expired.

A synchronization point at which threads can pair and swap elements within pairs.

A CompletionService that uses a supplied Executor to execute tasks.

Factory and utility methods for Executor, ExecutorService, ScheduledExecutorService, ThreadFactory, and Callable classes defined in this package.

Interrelated interfaces and static methods for establishing flow-controlled components in which Publishers produce items consumed by one or more Subscribers, each managed by a Subscription.

An ExecutorService for running ForkJoinTasks.

Abstract base class for tasks that run within a ForkJoinPool.

A thread managed by a ForkJoinPool, which executes ForkJoinTasks.

A cancellable asynchronous computation.

An optionally-bounded blocking deque based on linked nodes.

An optionally-bounded blocking queue based on linked nodes.

An unbounded TransferQueue based on linked nodes.

A reusable synchronization barrier, similar in functionality to CyclicBarrier and CountDownLatch but supporting more flexible usage.

An unbounded blocking queue that uses the same ordering rules as class PriorityQueue and supplies blocking retrieval operations.

A recursive resultless ForkJoinTask.

A recursive result-bearing ForkJoinTask.

A ThreadPoolExecutor that can additionally schedule commands to run after a given delay, or to execute periodically.

A counting semaphore.

A Flow.Publisher that asynchronously issues submitted (non-null) items to current subscribers until it is closed.

A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.

A random number generator (with period 264) isolated to the current thread.

An ExecutorService that executes each submitted task using one of possibly several pooled threads, normally configured using Executors factory methods.

Exception thrown when a thread tries to wait upon a barrier that is in a broken state, or which enters the broken state while the thread is waiting.

Exception indicating that the result of a value-producing task, such as a FutureTask, cannot be retrieved because the task was cancelled.

Exception thrown when an error or other exception is encountered in the course of completing a result or task.

Exception thrown when attempting to retrieve the result of a task that aborted by throwing an exception.

Exception thrown by an Executor when a task cannot be accepted for execution.

Exception thrown when a blocking operation times out.

A represents time durations at a given unit of granularity and provides utility methods to convert across units, and to perform timing and delay operations in these units.