Safe Haskell	Safe-Inferred
Language	Haskell2010

Polysemy.Conc.Queue

Description

Synopsis

loopOr :: Member (Queue d) r => Sem r Bool -> (d -> Sem r Bool) -> Sem r ()
loop :: Member (Queue d) r => (d -> Sem r ()) -> Sem r ()
readMaybe :: Member (Queue d) r => Sem r (Maybe d)
tryReadMaybe :: Member (Queue d) r => Sem r (Maybe d)
data Queue d :: Effect
module Polysemy.Conc.Data.QueueResult
module Polysemy.Conc.Data.QueueResult

Documentation

loopOr :: Member (Queue d) r => Sem r Bool -> (d -> Sem r Bool) -> Sem r () Source #

Read from a Queue repeatedly until it is closed.

When an element is received, call action and recurse if it returns True. When no element is available, evaluate na and recurse if it returns True.

loop :: Member (Queue d) r => (d -> Sem r ()) -> Sem r () Source #

Read from a Queue repeatedly until it is closed.

When an element is received, call action and recurse.

readMaybe :: Member (Queue d) r => Sem r (Maybe d) Source #

Read from a Queue and convert the result to Maybe, returning Nothing if the queue has been closed, and blocking until an element is available.

tryReadMaybe :: Member (Queue d) r => Sem r (Maybe d) Source #

Read from a Queue and convert the result to Maybe, returning Nothing if there is no element available or the queue has been closed.

data Queue d :: Effect Source #

Abstracts queues like TBQueue.

For documentation on the constructors, see the module Polysemy.Conc.Data.Queue.

import Polysemy.Conc (Queue, QueueResult)
import Polysemy.Conc.Effect.Queue as Queue

prog :: Member (Queue Int) r => Sem r (QueueResult Int)
prog = do
  Queue.write 5
  Queue.write 10
  Queue.read >>= \case
    QueueResult.Success i -> fmap (i +) <$> Queue.read
    r -> pure r

module Polysemy.Conc.Data.QueueResult