Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. readIORefPrim :: MonadDejaFu n => ModelIORef n a -> ThreadId -> n (a, Integer)

    dejafu Test.DejaFu.Conc.Internal.Memory

    Read the local state of a IORef.

  2. readRef :: MonadDejaFu m => Ref m a -> m a

    dejafu Test.DejaFu.Types

    Read the current value in the reference.

  3. readDirectory :: FilePath -> IO (AnchoredDirTree String)

    directory-tree System.Directory.Tree

    Build an AnchoredDirTree, given the path to a directory, opening the files using readFile. Uses readDirectoryWith readFile internally and has the effect of traversing the entire directory structure. See readDirectoryWithL for lazy production of a DirTree structure.

  4. readDirectoryWith :: (FilePath -> IO a) -> FilePath -> IO (AnchoredDirTree a)

    directory-tree System.Directory.Tree

    Build a DirTree rooted at p and using f to fill the file field of File nodes. The FilePath arguments to f will be the full path to the current file, and will include the root p as a prefix. For example, the following would return a tree of full FilePaths like "../tmp/foo" and "../tmp/bar/baz":

    readDirectoryWith return "../tmp"
    
    Note though that the build function below already does this.

  5. readDirectoryWithL :: (FilePath -> IO a) -> FilePath -> IO (AnchoredDirTree a)

    directory-tree System.Directory.Tree

    A "lazy" version of readDirectoryWith that does IO operations as needed i.e. as the tree is traversed in pure code. NOTE: This function uses unsafeInterleaveIO under the hood. This means that:

    • side effects are tied to evaluation order and only run on demand
    • you might receive exceptions in pure code

  6. readTimer :: TVar Bool -> STM TimedOut

    distributed-process-client-server Control.Distributed.Process.ManagedProcess.Timer

    Reads a given TVar Bool for a timer, and returns STM TimedOut once the variable is set to true. Will retry in the meanwhile.

  7. readTBQueue :: TBQueue a -> STM a

    effectful Effectful.Concurrent.STM

    Read the next value from the TBQueue.

  8. readTChan :: TChan a -> STM a

    effectful Effectful.Concurrent.STM

    Read the next value from the TChan.

  9. readTMVar :: TMVar a -> STM a

    effectful Effectful.Concurrent.STM

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

  10. readTQueue :: TQueue a -> STM a

    effectful Effectful.Concurrent.STM

    Read the next value from the TQueue.

Page 235 of many | Previous | Next