Moduleconcurrency-1.11.0.3Haskell2010

Control.Concurrent.Classy.QSemN

Quantity semaphores in which each thread may wait for an arbitrary "amount".

Contents

General Quantity Semaphores

Synopsis

newtype QSemN
value newQSemN
value waitQSemN
value signalQSemN

Packageconcurrency-1.11.0.3
Exports4
LanguageHaskell2010
LicenceMIT
SourceQSemN.hs

General Quantity Semaphores

newtypenewtype QSemN (m :: Type -> Type)

Source#

QSemN is a quantity semaphore in which the resource is aqcuired and released in units of one. It provides guaranteed FIFO ordering for satisfying blocked waitQSemN calls.

The pattern

bracket_ (waitQSemN n) (signalQSemN n) (...)

is safe; it never loses any of the resource.

valuenewQSemN :: (MonadConc m, MonadFail m) => Int -> m (QSemN m)

Source#

Build a new QSemN with a supplied initial quantity. The initial quantity must be at least 0.

valuewaitQSemN :: MonadConc m => QSemN m -> Int -> m ()

Source#

Wait for the specified quantity to become available

valuesignalQSemN :: MonadConc m => QSemN m -> Int -> m ()

Source#

Signal that a given quantity is now available from the QSemN.