All Classes and Interfaces

Class
Description
Provides default implementations of ExecutorService execution methods.
A synchronizer that may be exclusively owned by a thread.
A version of AbstractQueuedSynchronizer in which synchronization state is maintained as a long.
Provides a framework for implementing blocking locks and related synchronizers (semaphores, events, etc) that rely on first-in-first-out (FIFO) wait queues.
A bounded blocking queue backed by an array.
A boolean value that may be updated atomically.
An int value that may be updated atomically.
An int array in which elements may be updated atomically.
A reflection-based utility that enables atomic updates to designated volatile int fields of designated classes.
A long value that may be updated atomically.
A long array in which elements may be updated atomically.
A reflection-based utility that enables atomic updates to designated volatile long fields of designated classes.
An AtomicMarkableReference maintains an object reference along with a mark bit, that can be updated atomically.
An object reference that may be updated atomically.
An array of object references in which elements may be updated atomically.
A reflection-based utility that enables atomic updates to designated volatile reference fields of designated classes.
An AtomicStampedReference maintains an object reference along with an integer "stamp", that can be updated atomically.
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.
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.
A task that returns a result and may throw an exception.
Exception indicating that the result of a value-producing task, such as a FutureTask, cannot be retrieved because the task was cancelled.
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 marker interface identifying asynchronous tasks produced by async methods.
Exception thrown when an error or other exception is encountered in the course of completing a result or task.
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 hash table supporting full concurrency of retrievals and high expected concurrency for updates.
A view of a ConcurrentHashMap as a Set of keys, in which additions may optionally be enabled by mapping to a common value.
An unbounded concurrent deque based on linked nodes.
An unbounded thread-safe queue based on linked nodes.
A Map providing thread safety and atomicity guarantees.
A ConcurrentMap supporting NavigableMap operations, and recursively so for its navigable sub-maps.
A scalable concurrent ConcurrentNavigableMap implementation.
A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.
Condition factors out the Object monitor methods (wait, notify and notifyAll) into distinct objects to give the effect of having multiple wait-sets per object, by combining them with the use of arbitrary Lock implementations.
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.
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.
A mix-in style interface for marking objects that should be acted upon after a given delay.
An unbounded blocking queue of Delayed elements, in which an element can only be taken when its delay has expired.
One or more variables that together maintain a running double value updated using a supplied function.
One or more variables that together maintain an initially zero double sum.
A synchronization point at which threads can pair and swap elements within pairs.
Exception thrown when attempting to retrieve the result of a task that aborted by throwing an exception.
An object that executes submitted Runnable tasks.
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.
An Executor that provides methods to manage termination and methods that can produce a Future for tracking progress of one or more asynchronous tasks.
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.
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 Flow.Publisher and Flow.Subscriber.
An ExecutorService for running ForkJoinTasks.
Factory for creating new ForkJoinWorkerThreads.
Interface for extending managed parallelism for tasks running in ForkJoinPools.
Abstract base class for tasks that run within a ForkJoinPool.
A thread managed by a ForkJoinPool, which executes ForkJoinTasks.
A Future represents the result of an asynchronous computation.
Represents the computation state.
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.
Lock implementations provide more extensive locking operations than can be obtained using synchronized methods and statements.
Basic thread blocking primitives for creating locks and other synchronization classes.
One or more variables that together maintain a running long value updated using a supplied function.
One or more variables that together maintain an initially zero long sum.
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 ReadWriteLock maintains a pair of associated locks, one for read-only operations and one for writing.
A recursive resultless ForkJoinTask.
A recursive result-bearing ForkJoinTask.
A reentrant mutual exclusion Lock with the same basic behavior and semantics as the implicit monitor lock accessed using synchronized methods and statements, but with extended capabilities.
An implementation of ReadWriteLock supporting similar semantics to ReentrantLock.
The lock returned by method ReentrantReadWriteLock.readLock().
The lock returned by method ReentrantReadWriteLock.writeLock().
Exception thrown by an Executor when a task cannot be accepted for execution.
A handler for tasks that cannot be executed by a ThreadPoolExecutor.
A Future 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.
A ThreadPoolExecutor that can additionally schedule commands to run after a given delay, or to execute periodically.
A counting semaphore.
A capability-based lock with three modes for controlling read/write access.
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.
An object that creates new threads on demand.
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.
A handler for rejected tasks that throws a RejectedExecutionException.
A handler for rejected tasks that runs the rejected task directly in the calling thread of the execute method, unless the executor has been shut down, in which case the task is discarded.
A handler for rejected tasks that discards the oldest unhandled request and then retries execute, unless the executor is shut down, in which case the task is discarded.
A handler for rejected tasks that silently discards the rejected task.
Exception thrown when a blocking operation times out.
A TimeUnit 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.
A BlockingQueue in which producers may wait for consumers to receive elements.