|
|||||||||
PREV NEXT | FRAMES NO FRAMES |
BlockingReference.newSRSW()
instead.
BlockingReference.newSRSW()
instead.
BooleanLatch
is a reusable latch that resets after it is released
and waited on.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
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.
Supplier
that asks the argument function for the result using
the input argument.
Timeout
that uses nanosecond precision.
Timeout
that uses nanosecond precision.
LazyReference.create()
reference been initialized.
ResettableLazyReference.create()
reference been initialized.
LazyReference.create()
method threw an exception,
this wraps it.Function
that returns a ManagedLock
instead.read/write locks
ManagedLocks
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 locks
ManagedLock
and ManagedLock.ReadWrite
instances.ManagedLock.ReadWrite
that manages the supplied
ReadWriteLock
.
Supplier
that always returns the supplied source.
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.
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
.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.Supplier
implementations.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 |