|
|||||||||
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.LazyReference.create()
reference been initialized.
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
instances.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.
Timeout
that uses nanosecond precision.
Timeout
that uses nanosecond precision.
LazyReference.create()
reference been initialized.
LazyReference.create()
method threw an exception, this wraps it.LockManager
allows callables
and runnables
to be run
under a lock that is resolved against an input object.LockManager
instances.CopyOnWriteMap
with an underlying HashMap
.
CopyOnWriteMap
with an underlying HashMap
using the supplied map as the initial values.
CopyOnWriteMap
with an underlying
LinkedHashMap
.
CopyOnWriteMap
with an underlying
LinkedHashMap
using the supplied map as the initial values.
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
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.Iterable
that holds weak references
to content elements.LockManagers.weakLockManager(Function, int)
with
a default initial capacity of 128.
Lock
is resolved using a Function
that resolves to a
descriptor used to look up a Lock instance.
Callable
under a lock determined by the descriptor.
Runnable
under a lock determined by the descriptor.
|
|||||||||
PREV NEXT | FRAMES NO FRAMES |