Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. tryRead :: Element a -> IO (Maybe a)

    unagi-chan Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed

    No documentation available.

  2. tryReadChan :: UnagiPrim a => OutChan a -> IO (Element a)

    unagi-chan Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed

    Returns immediately with an Element a future, which returns one unique element when it becomes available via tryRead. Note: This is a destructive operation. See Element for more details. Note re. exceptions: When an async exception is raised during a tryReadChan the message that the read would have returned is likely to be lost, just as it would be when raised directly after this function returns.

  3. tryReadNext :: Stream a -> IO (Next a)

    unagi-chan Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed

    No documentation available.

  4. tryRead :: Element a -> IO (Maybe a)

    unagi-chan Control.Concurrent.Chan.Unagi.Unboxed

    No documentation available.

  5. tryReadChan :: UnagiPrim a => OutChan a -> IO (Element a, IO a)

    unagi-chan Control.Concurrent.Chan.Unagi.Unboxed

    Returns immediately with:

    • an Element a future, which returns one unique element when it becomes available via tryRead.
    • a blocking IO action that returns the element when it becomes available.
    Note: This is a destructive operation. See Element for more details. If you're using this function exclusively you might find the implementation in Control.Concurrent.Chan.Unagi.NoBlocking.Unboxed is faster. Note re. exceptions: When an async exception is raised during a tryReadChan the message that the read would have returned is likely to be lost, just as it would be when raised directly after this function returns.

  6. unsafeReadSTArray :: forall (m :: Type -> Type) s i e . Applicative m => STArray s i e -> Int -> STT s m e

    STMonadTrans Control.Monad.ST.Trans

    No documentation available.

  7. data Nonthreadsafe

    abstract-deque Data.Concurrent.Deque.Class

    Only one thread at a time may access this end of the queue.

  8. data Threadsafe

    abstract-deque Data.Concurrent.Deque.Class

    Haskell IO threads (Control.Concurrent) may concurrently access this end of the queue. Note that this attribute is set separately for the left and right ends.

  9. leftThreadSafe :: DequeClass d => d elt -> Bool

    abstract-deque Data.Concurrent.Deque.Class

    Runtime indication of thread saftey for pushL (and popL). (Argument unused.)

  10. rightThreadSafe :: DequeClass d => d elt -> Bool

    abstract-deque Data.Concurrent.Deque.Class

    Runtime indication of thread saftey for tryPopR (and pushR). (Argument unused.)

Page 650 of many | Previous | Next