package concurrent
- Alphabetic
- Public
- Protected
Type Members
- final class ConcurrentMap[K, V] extends AnyVal
Wrapper over
java.util.concurrent.ConcurrentHashMap
. - final class ConcurrentSet[A] extends AnyVal
A
ConcurrentSet
is a Set wrapper overjava.util.concurrent.ConcurrentHashMap
. - final class CountdownLatch extends AnyRef
A synchronization aid that allows one or more fibers to wait until a set of operations being performed in other fibers completes.
A synchronization aid that allows one or more fibers to wait until a set of operations being performed in other fibers completes.
A
CountDownLatch
is initialized with a given count. Theawait
method block until the current count reaches zero due to invocations of thecountDown
method, after which all waiting fibers are released and any subsequent invocations ofawait
return immediately. This is a one-shot phenomenon -- the count cannot be reset. If you need a version that resets the count, consider using a CyclicBarrier.A
CountDownLatch
is a versatile synchronization tool and can be used for a number of purposes. ACountDownLatch
initialized with a count of one serves as a simple on/off latch, or gate: all fibers invokingawait
wait at the gate until it is opened by a fiber invokingcountDown
. ACountDownLatch
initialized to N can be used to make one fiber wait until N fibers have completed some action, or some action has been completed N times.A useful property of a
CountDownLatch
is that it doesn't require that fibers callingcountDown
wait for the count to reach zero before proceeding, it simply prevents any fiber from proceeding past anawait
until all fibers could pass. - final class CyclicBarrier extends AnyRef
A synchronization aid that allows a set of fibers to all wait for each other to reach a common barrier point.
A synchronization aid that allows a set of fibers to all wait for each other to reach a common barrier point.
CyclicBarriers are useful in programs involving a fixed sized party of fibers that must occasionally wait for each other. The barrier is called cyclic because it can be re-used after the waiting fibers are released.
A CyclicBarrier supports an optional action command that is run once per barrier point, after the last fiber in the party arrives, but before any fibers are released. This barrier action is useful for updating shared-state before any of the parties continue.
- final class MVar[A] extends AnyRef
An
MVar[A]
is a mutable location that is either empty or contains a value of typeA
.An
MVar[A]
is a mutable location that is either empty or contains a value of typeA
. It has two fundamental operations:put
which fills anMVar
if it is empty and blocks otherwise, andtake
which empties anMVar
if it is full and blocks otherwise. They can be used in multiple different ways:- As synchronized mutable variables,
- As channels, with
take
andput
asreceive
andsend
, and - As a binary semaphore
MVar[Unit]
, withtake
andput
aswait
andsignal
.
They were introduced in the paper "Concurrent Haskell" by Simon Peyton Jones, Andrew Gordon and Sigbjorn Finne.
- final class ReentrantLock extends AnyRef
Value Members
- case object BuildInfo extends Product with Serializable
This object was generated by sbt-buildinfo.
- object ConcurrentMap
- object ConcurrentSet
- object CountdownLatch
- object CyclicBarrier
- object MVar
- object ReentrantLock