Documentation

Switch the value of returned TVar from initial value False to True after a given number of microseconds. The caveats associated with threadDelay also apply.

Write the supplied value into a TVar.

Return the current value stored in a TVar.

Return the current value stored in a TVar. This is equivalent to

 readTVarIO = atomically . readTVar

but works much faster, because it doesn't perform a complete transaction, it just reads the current value of the TVar.

IO version of newTVar. This is useful for creating top-level TVars using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Create a new TVar holding a value supplied

Exception handling within STM actions.

catchSTM m f catches any exception thrown by m using throwSTM, using the function f to handle the exception. If an exception is thrown, any changes made by m are rolled back, but changes prior to m persist.

A variant of throw that can only be used within the STM monad.

Throwing an exception in STM aborts the transaction and propagates the exception. If the exception is caught via catchSTM, only the changes enclosed by the catch are rolled back; changes made outside of catchSTM persist.

If the exception is not caught inside of the STM, it is re-thrown by atomically, and the entire STM is rolled back.

Although throwSTM has a type that is an instance of the type of throw, the two functions are subtly different:

throw e    `seq` x  ===> throw e
throwSTM e `seq` x  ===> x

The first example will cause the exception e to be raised, whereas the second one won't. In fact, throwSTM will only cause an exception to be raised when it is used within the STM monad. The throwSTM variant should be used in preference to throw to raise an exception within the STM monad because it guarantees ordering with respect to other STM operations, whereas throw does not.

Compose two alternative STM actions (GHC only).

If the first action completes without retrying then it forms the result of the orElse. Otherwise, if the first action retries, then the second action is tried in its place. If both actions retry then the orElse as a whole retries.

Retry execution of the current memory transaction because it has seen values in TVars which mean that it should not continue (e.g. the TVars represent a shared buffer that is now empty). The implementation may block the thread until one of the TVars that it has read from has been updated. (GHC only)

A monad supporting atomic memory transactions.

Shared memory locations that support atomic memory transactions.

Check that the boolean condition is true and, if not, retry.

In other words, check b = unless b retry.

Since: stm-2.1.1

TArray is a transactional array, supporting the usual MArray interface for mutable arrays.

It is currently implemented as Array ix (TVar e), but it may be replaced by a more efficient implementation in the future (the interface will remain the same, however).

Make a Weak pointer to a TVar, using the second argument as a finalizer to run when TVar is garbage-collected

Since: stm-2.4.3

Swap the contents of a TVar for a new value.

Since: stm-2.3

Like modifyTVar' but the function is a simple state transition that can return a side value which is passed on as the result of the STM.

Since: stm-2.5.0

Strict version of modifyTVar.

Since: stm-2.3

Mutate the contents of a TVar. N.B., this version is non-strict.

Since: stm-2.3

Returns True if the supplied TQueue is empty.

Put a data item back onto a channel, where it will be the next item read.

A version of peekTQueue which does not retry. Instead it returns Nothing if no value is available.

Get the next value from the TQueue without removing it, retrying if the channel is empty.

Efficiently read the entire contents of a TQueue into a list. This function never retries.

Since: stm-2.4.5

A version of readTQueue which does not retry. Instead it returns Nothing if no value is available.

Read the next value from the TQueue.

Write a value to a TQueue.

IO version of newTQueue. This is useful for creating top-level TQueues using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Build and returns a new instance of TQueue

TQueue is an abstract type representing an unbounded FIFO channel.

Since: stm-2.4

Make a Weak pointer to a TMVar, using the second argument as a finalizer to run when the TMVar is garbage-collected.

Since: stm-2.4.4

Check whether a given TMVar is empty.

Swap the contents of a TMVar for a new value.

A version of readTMVar which does not retry. Instead it returns Nothing if no value is available.

Since: stm-2.3

This is a combination of takeTMVar and putTMVar; ie. it takes the value from the TMVar, puts it back, and also returns it.

A version of putTMVar that does not retry. The tryPutTMVar function attempts to put the value a into the TMVar, returning True if it was successful, or False otherwise.

Put a value into a TMVar. If the TMVar is currently full, putTMVar will retry.

A version of takeTMVar that does not retry. The tryTakeTMVar function returns Nothing if the TMVar was empty, or Just a if the TMVar was full with contents a. After tryTakeTMVar, the TMVar is left empty.

Return the contents of the TMVar. If the TMVar is currently empty, the transaction will retry. After a takeTMVar, the TMVar is left empty.

IO version of newEmptyTMVar. This is useful for creating top-level TMVars using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Create a TMVar which is initially empty.

IO version of newTMVar. This is useful for creating top-level TMVars using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Create a TMVar which contains the supplied value.

A TMVar is a synchronising variable, used for communication between concurrent threads. It can be thought of as a box, which may be empty or full.

Clone a TChan: similar to dupTChan, but the cloned channel starts with the same content available as the original channel.

Since: stm-2.4

Returns True if the supplied TChan is empty.

Put a data item back onto a channel, where it will be the next item read.

Duplicate a TChan: the duplicate channel begins empty, but data written to either channel from then on will be available from both. Hence this creates a kind of broadcast channel, where data written by anyone is seen by everyone else.

A version of peekTChan which does not retry. Instead it returns Nothing if no value is available.

Since: stm-2.3

Get the next value from the TChan without removing it, retrying if the channel is empty.

Since: stm-2.3

A version of readTChan which does not retry. Instead it returns Nothing if no value is available.

Since: stm-2.3

Read the next value from the TChan.

Write a value to a TChan.

IO version of newBroadcastTChan.

Since: stm-2.4

Create a write-only TChan. More precisely, readTChan will retry even after items have been written to the channel. The only way to read a broadcast channel is to duplicate it with dupTChan.

Consider a server that broadcasts messages to clients:

serve :: TChan Message -> Client -> IO loop
serve broadcastChan client = do
    myChan <- dupTChan broadcastChan
    forever $ do
        message <- readTChan myChan
        send client message

The problem with using newTChan to create the broadcast channel is that if it is only written to and never read, items will pile up in memory. By using newBroadcastTChan to create the broadcast channel, items can be garbage collected after clients have seen them.

Since: stm-2.4

IO version of newTChan. This is useful for creating top-level TChans using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Build and return a new instance of TChan

TChan is an abstract type representing an unbounded FIFO channel.

Returns True if the supplied TBQueue is full.

Since: stm-2.4.3

Returns True if the supplied TBQueue is empty.

Return the length of a TBQueue.

Since: stm-2.5.0.0

Put a data item back onto a channel, where it will be the next item read. Blocks if the queue is full.

A version of peekTBQueue which does not retry. Instead it returns Nothing if no value is available.

Get the next value from the TBQueue without removing it, retrying if the channel is empty.

Efficiently read the entire contents of a TBQueue into a list. This function never retries.

Since: stm-2.4.5

A version of readTBQueue which does not retry. Instead it returns Nothing if no value is available.

Read the next value from the TBQueue.

Write a value to a TBQueue; blocks if the queue is full.

IO version of newTBQueue. This is useful for creating top-level TBQueues using unsafePerformIO, because using atomically inside unsafePerformIO isn't possible.

Builds and returns a new instance of TBQueue.

TBQueue is an abstract type representing a bounded FIFO channel.

Since: stm-2.4