## Uses of Package
com.google.common.util.concurrent

Packages that use com.google.common.util.concurrent
com.google.common.cache: This package contains caching utilities.
com.google.common.util.concurrent: Concurrency utilities.

Classes in com.google.common.util.concurrent used by com.google.common.cache
ListenableFuture A `Future` that accepts completion listeners.

Classes in com.google.common.util.concurrent used by com.google.common.util.concurrent
AbstractFuture An abstract implementation of the `ListenableFuture` interface.
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.
AsyncFunction Transforms a value, possibly asynchronously.
AtomicLongMap A map containing `long` values that can be atomically updated.
CheckedFuture A `CheckedFuture` is a `ListenableFuture` that includes versions of the `get` methods that can throw a checked exception.
CycleDetectingLockFactory The `CycleDetectingLockFactory` creates `ReentrantLock`s and `ReentrantReadWriteLock`s 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.
ForwardingCheckedFuture A future which forwards all its method calls to another future.
ForwardingExecutorService An executor service which forwards all its method calls to another executor service.
ForwardingFuture A `ForwardingFuture.SimpleForwardingFuture` which forwards all its method calls to another future.
ForwardingListenableFuture A `ForwardingListenableFuture.SimpleForwardingListenableFuture` which forwards all its method calls to another future.
ForwardingListenableFuture.SimpleForwardingListenableFuture A simplified version of `ForwardingListenableFuture` where subclasses can pass in an already constructed `ListenableFuture` as the delegate.
FutureCallback A callback for accepting the results of a `Future` computation asynchronously.
ListenableFuture A `Future` that accepts completion listeners.
ListenableFutureTask A `FutureTask` that also implements the `ListenableFuture` interface.
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.start()` and `Service.stop()` 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.
SettableFuture A `ListenableFuture` whose result may be set by a `SettableFuture.set(Object)` or `SettableFuture.setException(Throwable)` call.
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 If no backing thread factory is provided, a default backing thread factory is used as if by calling `setThreadFactory(` `Executors.defaultThreadFactory()` `)`.
TimeLimiter Produces proxies that impose a time limit on method calls to the proxied object.

Copyright © 2010-2012. All Rights Reserved.