|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
CompletionService usage that allows a
collection of jobs to be issued to an Executor and return an
Iterable of the results that is in the order that the results return.AsyncCompletion.AtomicInteger with richer functionality.AtomicLong with richer functionality.AtomicReference classes and the like.BlockingReference.newSRSW() instead.
BlockingReference.newSRSW() instead.
BooleanLatch is a reusable latch that resets after it is released
and waited on.CopyOnWriteMap.Builder for a CopyOnWriteMap instance.
CopyOnWriteSortedMap.Builder for a CopyOnWriteSortedMap instance.
Callable, and keyed by an Object Map in which all mutative operations (the
"destructive" operations described by Map put, remove and so on) are
implemented by making a fresh copy of the underlying map.CopyOnWriteMap with the supplied Map to
initialize the values.
CopyOnWriteMap.
CopyOnWriteMap and specify all the options.CopyOnWriteMap and
CopyOnWriteSortedMap directly.SortedMap in which all mutative operations
(the "destructive" operations described by SortedMap put, remove and
so on) are implemented by making a fresh copy of the underlying map.CopyOnWriteMap.
CopyOnWriteMap with the supplied Map to
initialize the values.
CopyOnWriteSortedMap and specify all the options.Suppliers.compose(Function, com.google.common.base.Supplier)
where the supplier is
Suppliers.ofInstance(Object)
reference but if it
matches the oldValue argument, compare-and-set it to one created by the
new value supplier.
reference and if
it matches the old value argument, compare-and-set it to the new value
and return that instead.
array reference
but if it matches the oldValue argument, compare-and-set it to one
created by the new value supplier.
array reference
but if it matches the oldValue argument, compare-and-set it the new
value.
reference but if it
matches the oldValue argument, compare-and-set it the new value.
reference but if it
matches the oldValue argument, compare-and-set it to one created by the
newValue Supplier.
reference but if it
matches the oldValue argument, compare-and-set it to one created by the
newValue Supplier.
reference but if it
is null, compare-and-set it to one created by the new value
Supplier.
reference but if it
is null, compare-and-set it the new value.
array reference
but if it is null, compare-and-set it to one created by the new value
Supplier.
array reference
but if it is null, compare-and-set it the new value
Timeout that uses nanosecond precision.
Timeout that uses nanosecond precision.
new value supplier and return
that instead.
new value supplier and return
that instead.
Callables, note will cause
nulls in the resulting iterable!
jobs on the contained Executor and
return a lazily evaluated Iterable of the results in the order
they return in (fastest first).
LazyReference.create() reference been initialized.
ResettableLazyReference.create() reference been initialized.
LazyReference.create() method threw an exception,
this wraps it.AsyncCompletion that limits the number of jobs
executed to the underlying executor to a hard limit.
Function that returns a ManagedLock
instead.read/write locksManagedLocks insteadManagedLock that manages the supplied Lock.
ManagedLock allows callables, runnables and suppliers to be run under a lock that is
resolved against an input object.read/write locksManagedLock and ManagedLock.ReadWrite
instances.ManagedLock.ReadWrite that manages the supplied
ReadWriteLock.
Suppliers.ofInstance(Object) instead.
ThreadFactory with the required name prefix.
ThreadFactory with the required name prefix and type (user
or daemon).
ThreadFactory with the required name prefix, type and
priority.
CopyOnWriteMap with an underlying HashMap.
CopyOnWriteMap with an underlying HashMap
using the supplied map as the initial values.
CopyOnWriteMap.newHashMap() instead.
CopyOnWriteMap.newHashMap(Map) instead.
CopyOnWriteMap with an underlying
LinkedHashMap.
CopyOnWriteMap with an underlying
LinkedHashMap using the supplied map as the initial values.
CopyOnWriteMap.newLinkedMap() instead.
CopyOnWriteMap.newLinkedMap(Map) instead.
ManagedLock that manages a ReentrantLock.
CopyOnWriteSortedMap.newTreeMap() instead.
CopyOnWriteSortedMap.newTreeMap(Map) instead.
CopyOnWriteSortedMap.newTreeMap(Comparator)
instead.
CopyOnWriteSortedMap.newTreeMap(Map, Comparator)
instead.
CopyOnWriteSortedMap where the underlying map
instances are TreeMap and the sort uses the key's natural order.
CopyOnWriteSortedMap where the underlying map
instances are TreeMap, the sort uses the key's natural order and
the initial values are supplied.
CopyOnWriteSortedMap where the underlying map
instances are TreeMap.
CopyOnWriteSortedMap where the underlying map
instances are TreeMap, the sort uses the key's natural order and
the initial values are supplied.
PhasedLatch is a shared latch that resets after it is released and
can be reused.CountDownLatch.InterruptedException.TimeoutException as an unchecked
exception.SettableFuture.get() and SettableFuture.get(long, TimeUnit)
SettableFuture.get() and SettableFuture.get(long, TimeUnit)
SettableFuture is a Future implementation where the
responsibility for producing the result is external to the future instance,
unlike FutureTask where the future holds the operation (a
Callable or Runnable instance) and the first thread that
calls FutureTask.run() executes the operation.Supplier produces.Suppliers instead,
see the methods for the alternatives provided.ThreadFactory instances.TimeoutException.
ManagedLocks.weakManagedLockFactory() instead.
ManagedLocks.weakManagedLockFactory(Function)
instead.
Function for resolving managed locks
.
ManagedLocks.weakManagedLockFactory(Function, Supplier) with the
default lock factory.
ManagedLocks.weakManagedLockFactory(Function) using the
identity function for striping, essentially
meaning that unique input will have its own lock.
Function for resolving managed read-write locks.
ManagedLocks.weakReadWriteManagedLockFactory(Function, Supplier) that uses
default locks
ManagedLocks.weakReadWriteManagedLockFactory(Function) that uses the
identity function for striping, essentially
meaning that unique input will have its own lock.
Supplier under a lock determined by the
descriptor.
Callable under a lock determined by the
descriptor.
Runnable under a lock determined by the
descriptor.
Callable under a lock determined by the
descriptor.
Supplier under a lock determined by the
descriptor.
Runnable under a lock determined by the
descriptor.
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||