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

queue :: MonadConc m => (Committer (STM m) a -> m l) -> (Emitter (STM m) a -> m r) -> m (l, r)

create an unbounded queue

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

create an unbounded queue, returning the committer result

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

create an unbounded queue, returning the emitter result

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

create an unbounded queue, returning the emitter result

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

create an unbounded queue, returning the emitter result

queueCLog :: (Show a, MonadConc m, MonadIO m) => (Committer m a -> m l) -> (Emitter m a -> m r) -> m l

create an unbounded queue, returning the committer result

queueELog :: (Show a, MonadConc m, MonadIO 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

toBoxLog :: (Show a, MonadIO m, MonadConc m) => Queue a -> m (Box m a a, m ())

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

create a queue, returning the ends