Control.Concurrent.ST

This module provides a way to use concurrent haskell inside of ST. Using these function subverts the usual guarentee we have that ST is deterministic.

Threads

data ThreadId s

Constructors

ThreadId ThreadId#

forkST :: ST s () -> ST s (ThreadId s)

Creates a new thread to run the ST computation passed as the argument. Since using the ThreadId often leads to non-determinism, the function forkST_ is typically to be preferred.

forkST_ :: ST s () -> ST s ()

Creates a new thread to run the ST computation and discard the ThreadId.

MVar

data MVar s a

Instances

Eq (MVar s a)

Methods

(==) :: MVar s a -> MVar s a -> Bool

(/=) :: MVar s a -> MVar s a -> Bool

newEmptyMVar :: ST s (MVar s a)

newMVar :: a -> ST s (MVar s a)

takeMVar :: MVar s a -> ST s a

putMVar :: MVar s a -> a -> ST s ()

readMVar :: MVar s a -> ST s a

tryTakeMVar :: MVar s a -> ST s (Maybe a)

tryPutMVar :: MVar s a -> a -> ST s Bool

isEmptyMVar :: MVar s a -> ST s Bool

tryReadMVar :: MVar s a -> ST s (Maybe a)