|
Class Summary |
| Assertions |
Design by contract assertions. |
| BlockingReference<V> |
A Reference with queue semantics where the current reference may be retrieved
or taken instead, and if there is no current element then it will be block
until the reference becomes available. |
| BooleanLatch |
A BooleanLatch is a reusable latch that resets after it is released
and waited on. |
| ConcurrentOperationMapImpl<K,R> |
|
| CopyOnWriteMap<K,V> |
A thread-safe variant of 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. |
| CopyOnWriteMaps |
Deprecated. use the static factory methods is CopyOnWriteMap and
CopyOnWriteSortedMap directly. |
| CopyOnWriteSortedMap<K,V> |
/** A thread-safe variant of 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. |
| Functions |
|
| LazyReference<T> |
Lazily loaded reference that is not constructed until required. |
| LockManagers |
Deprecated. since 0.0.7 use ManagedLocks instead |
| ManagedLocks |
Static factory for producing ManagedLock and ManagedLock.ReadWrite
instances. |
| PhasedLatch |
A PhasedLatch is a shared latch that resets after it is released and
can be reused. |
| SettableFuture<T> |
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. |
| Suppliers |
Useful Supplier implementations. |
| Timeout |
Used to calculate elapsed time for timeouts from when it is created when
successively calling blocking methods. |