Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

1. readIArray :: (IArray a e, Ix i, Read i, Read e) => ReadPrec (a i e)

   array	Data.Array.Base

   No documentation available.

2. readArray :: (MArray a e m, Ix i) => a i e -> i -> m e

   array	Data.Array.MArray

   Read an element from a mutable array

3. readArray :: (MArray a e m, Ix i) => a i e -> i -> m e

   array	Data.Array.MArray.Safe

   Read an element from a mutable array

4. readN :: Int -> (ByteString -> a) -> Get a

   binary	Data.Binary.Get.Internal

   Return at least n bytes, maybe more. If not enough data is available the computation will escape with Partial.

5. readNWith :: Int -> (Ptr a -> IO a) -> Get a

   binary	Data.Binary.Get.Internal

   readNWith n f where f must be deterministic and not have side effects.

6. readTBQueue :: TBQueue a -> STM a

   stm	Control.Concurrent.STM.TBQueue

   Read the next value from the TBQueue.

7. readTChan :: TChan a -> STM a

   stm	Control.Concurrent.STM.TChan

   Read the next value from the TChan.

8. readTMVar :: TMVar a -> STM a

   stm	Control.Concurrent.STM.TMVar

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

9. readTQueue :: TQueue a -> STM a

   stm	Control.Concurrent.STM.TQueue

   Read the next value from the TQueue.

10. readTVar :: TVar a -> STM a

    stm	Control.Concurrent.STM.TVar

    No documentation available.

Page 72 of many | Previous | Next