Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Lifted TBQueue
operations.
Synopsis
- data TBQueue a
- newTBQueue :: MonadBase STM μ => Natural -> μ (TBQueue α)
- newTBQueueIO :: MonadBase IO μ => Natural -> μ (TBQueue α)
- readTBQueue :: MonadBase STM μ => TBQueue α -> μ α
- tryReadTBQueue :: MonadBase STM μ => TBQueue α -> μ (Maybe α)
- peekTBQueue :: MonadBase STM μ => TBQueue α -> μ α
- tryPeekTBQueue :: MonadBase STM μ => TBQueue α -> μ (Maybe α)
- flushTBQueue :: MonadBase STM μ => TBQueue α -> μ [α]
- writeTBQueue :: MonadBase STM μ => TBQueue α -> α -> μ ()
- unGetTBQueue :: MonadBase STM μ => TBQueue α -> α -> μ ()
- isEmptyTBQueue :: MonadBase STM μ => TBQueue α -> μ Bool
- isFullTBQueue :: MonadBase STM μ => TBQueue α -> μ Bool
Documentation
TBQueue
is an abstract type representing a bounded FIFO channel.
Since: stm-2.4
newTBQueue :: MonadBase STM μ => Natural -> μ (TBQueue α) Source #
A lifted version of newTBQueue
.
newTBQueueIO :: MonadBase IO μ => Natural -> μ (TBQueue α) Source #
A lifted version of newTBQueueIO
.
readTBQueue :: MonadBase STM μ => TBQueue α -> μ α Source #
A lifted version of readTBQueue
.
tryReadTBQueue :: MonadBase STM μ => TBQueue α -> μ (Maybe α) Source #
A lifted version of tryReadTBQueue
.
peekTBQueue :: MonadBase STM μ => TBQueue α -> μ α Source #
A lifted version of peekTBQueue
.
tryPeekTBQueue :: MonadBase STM μ => TBQueue α -> μ (Maybe α) Source #
A lifted version of tryPeekTBQueue
.
flushTBQueue :: MonadBase STM μ => TBQueue α -> μ [α] Source #
A lifted version of flushTBQueue
.
writeTBQueue :: MonadBase STM μ => TBQueue α -> α -> μ () Source #
A lifted version of writeTBQueue
.
unGetTBQueue :: MonadBase STM μ => TBQueue α -> α -> μ () Source #
A lifted version of unGetTBQueue
.
isEmptyTBQueue :: MonadBase STM μ => TBQueue α -> μ Bool Source #
A lifted version of isEmptyTBQueue
.
isFullTBQueue :: MonadBase STM μ => TBQueue α -> μ Bool Source #
A lifted version of isFullTBQueue
.