| Package | Description |
|---|---|
| com.google.common.cache |
This package contains caching utilities.
|
| com.google.common.util.concurrent |
Concurrency utilities.
|
| Class and Description |
|---|
| ListenableFuture
A
Future that accepts completion listeners. |
| Class and Description |
|---|
| AbstractFuture
An abstract implementation of
ListenableFuture, intended for advanced users only. |
| AbstractScheduledService.CustomScheduler.Schedule
A value object that represents an absolute delay until a task should be invoked.
|
| AbstractScheduledService.Scheduler
A scheduler defines the policy for how the
AbstractScheduledService should run its
task. |
| AsyncCallable
Computes a value, possibly asynchronously.
|
| AsyncFunction
Transforms a value, possibly asynchronously.
|
| AtomicLongMap
A map containing
long values that can be atomically updated. |
| CycleDetectingLockFactory
The
CycleDetectingLockFactory creates ReentrantLock instances and ReentrantReadWriteLock instances that detect potential deadlock by checking for cycles in lock
acquisition order. |
| CycleDetectingLockFactory.Policies
Pre-defined
CycleDetectingLockFactory.Policy implementations. |
| CycleDetectingLockFactory.Policy
Encapsulates the action to be taken when a potential deadlock is encountered.
|
| CycleDetectingLockFactory.PotentialDeadlockException
Represents a detected cycle in lock acquisition ordering.
|
| CycleDetectingLockFactory.WithExplicitOrdering
A
CycleDetectingLockFactory.WithExplicitOrdering provides the additional enforcement of
an application-specified ordering of lock acquisitions. |
| ExecutionSequencer
Serializes execution of a set of operations.
|
| FluentFuture
A
ListenableFuture that supports fluent chains of operations. |
| ForwardingExecutorService
An executor service which forwards all its method calls to another executor service.
|
| ForwardingFuture
A
Future which forwards all its method calls to another future. |
| ForwardingListenableFuture
A
ListenableFuture which forwards all its method calls to another future. |
| FutureCallback
A callback for accepting the results of a
Future computation
asynchronously. |
| Futures.FutureCombiner
A helper to create a new
ListenableFuture whose result is generated from a combination
of input futures. |
| ListenableFuture
A
Future that accepts completion listeners. |
| ListenableFutureTask
A
FutureTask that also implements the ListenableFuture interface. |
| ListenableScheduledFuture
Helper interface to implement both
ListenableFuture and ScheduledFuture. |
| ListeningExecutorService
An
ExecutorService that returns ListenableFuture instances. |
| ListeningScheduledExecutorService
A
ScheduledExecutorService that returns ListenableFuture instances from its
ExecutorService methods. |
| Monitor
A synchronization abstraction supporting waiting on arbitrary boolean conditions.
|
| Monitor.Guard
A boolean condition for which a thread may wait.
|
| RateLimiter
A rate limiter.
|
| Service
An object with an operational state, plus asynchronous
Service.startAsync() and Service.stopAsync() lifecycle methods to transition between states. |
| Service.Listener
A listener for the various state changes that a
Service goes through in its lifecycle. |
| Service.State
The lifecycle states of a service.
|
| ServiceManager
A manager for monitoring and controlling a set of services.
|
| ServiceManager.Listener
A listener for the aggregate state changes of the services that are under management.
|
| SettableFuture
A
ListenableFuture whose result can be set by a SettableFuture.set(Object), SettableFuture.setException(Throwable) or SettableFuture.setFuture(ListenableFuture) call. |
| SimpleTimeLimiter
A TimeLimiter that runs method calls in the background using an
ExecutorService. |
| Striped
A striped
Lock/Semaphore/ReadWriteLock. |
| ThreadFactoryBuilder
A ThreadFactory builder, providing any combination of these features:
whether threads should be marked as daemon threads
a naming format
a thread priority
an uncaught exception handler
a backing thread factory
|
| TimeLimiter
Imposes a time limit on method calls.
|
Copyright © 2010–2019. All rights reserved.