Box.Queue

queues Follows pipes-concurrency

Documentation

data Queue a

Queue specifies how messages are queued

Constructors

Unbounded

Bounded Int

Single

Latest a

Newest Int

New

queueC :: MonadConc m => (Committer m a -> m l) -> (Emitter m a -> m r) -> m l

create an unbounded queue, returning the emitter result

queueE :: MonadConc m => (Committer m a -> m l) -> (Emitter m a -> m r) -> m r

create an unbounded queue, returning the emitter result

waitCancel :: MonadConc m => m b -> m a -> m b

wait for the first action, and then cancel the second

ends :: MonadSTM stm => Queue a -> stm (a -> stm (), stm a)

create a queue, returning the ends

withQE :: MonadConc m => Queue a -> (Queue a -> m (Box m a a, m ())) -> (Committer m a -> m l) -> (Emitter m a -> m r) -> m r

connect a committer and emitter action via spawning a queue, and wait for both to complete.

withQC :: MonadConc m => Queue a -> (Queue a -> m (Box m a a, m ())) -> (Committer m a -> m l) -> (Emitter m a -> m r) -> m l

connect a committer and emitter action via spawning a queue, and wait for both to complete.

toBox :: MonadSTM stm => Queue a -> stm (Box stm a a, stm ())

turn a queue into a box (and a seal)

toBoxM :: MonadConc m => Queue a -> m (Box m a a, m ())

turn a queue into a box (and a seal), and lift from stm to the underlying monad.

liftB :: MonadConc m => Box (STM m) a b -> Box m a b

lift a box from STM

concurrentlyLeft :: MonadConc m => m a -> m b -> m a

run two actions concurrently, but wait and return on the left result.

concurrentlyRight :: MonadConc m => m a -> m b -> m b

run two actions concurrently, but wait and return on the right result.

fromAction :: MonadConc m => (Box m a b -> m r) -> Cont m (Box m b a)

turn a box action into a box continuation

fuseActions :: MonadConc m => (Box m a b -> m r) -> (Box m b a -> m r') -> m r'

connect up two box actions via two queues