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. tryReadTQueue :: TQueue a -> STM (Maybe a)

    stm Control.Concurrent.STM.TQueue

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

  2. createTheyReadWeWritePipe :: IO (CommunicationHandle, Handle)

    process System.Process.CommunicationHandle

    Create a pipe (theyRead,weWrite) that the current process can write to, and whose read end can be passed to a child process in order to send data to it. The returned Handle does not have any finalizers attached to it; use hClose to close it. See CommunicationHandle.

  3. createWeReadTheyWritePipe :: IO (Handle, CommunicationHandle)

    process System.Process.CommunicationHandle

    Create a pipe (weRead,theyWrite) that the current process can read from, and whose write end can be passed to a child process in order to receive data from it. The returned Handle does not have any finalizers attached to it; use hClose to close it. See CommunicationHandle.

  4. openCommunicationHandleRead :: CommunicationHandle -> IO Handle

    process System.Process.CommunicationHandle

    Turn the CommunicationHandle into a Handle that can be read from in the current process. The returned Handle does not have any finalizers attached to it; use hClose to close it.

  5. tryReadMVar :: PrimMonad m => MVar (PrimState m) a -> m (Maybe a)

    primitive Data.Primitive.MVar

    A non-blocking version of readMVar. The tryReadMVar function returns immediately, with Nothing if the MVar was empty, or Just a if the MVar was full with contents a.

    • It is single-wakeup instead of multiple-wakeup.
    • In the presence of other threads calling putMVar, tryReadMVar may block.
    • If another thread puts a value in the MVar in between the calls to tryTakeMVar and putMVar, that value may be overridden.

  6. atomicReadInt :: PrimMonad m => PrimVar (PrimState m) Int -> m Int

    primitive Data.Primitive.PrimVar

    Given a reference, atomically read an element.

  7. data ThreadId#

    ghc-prim GHC.Prim

    (In a non-concurrent implementation, this can be a singleton type, whose (unique) value is returned by myThreadId#. The other operations can be omitted.)

  8. atomicReadIntArray# :: MutableByteArray# d -> Int# -> State# d -> (# State# d, Int# #)

    ghc-prim GHC.Prim

    Given an array and an offset in machine words, read an element. The index is assumed to be in bounds. Implies a full memory barrier. Warning: this can fail with an unchecked exception.

  9. atomicReadWordAddr# :: Addr# -> State# d -> (# State# d, Word# #)

    ghc-prim GHC.Prim

    Given an address, read a machine word. Implies a full memory barrier. Warning: this can fail with an unchecked exception.

  10. isCurrentThreadBound# :: State# RealWorld -> (# State# RealWorld, Int# #)

    ghc-prim GHC.Prim

    No documentation available.

Page 451 of many | Previous | Next