Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. reads :: Read a => ReadS a

   rebase	Rebase.Prelude

   equivalent to readsPrec with a precedence of 0.

2. readsPrec :: Read a => Int -> ReadS a

   rebase	Rebase.Prelude

   attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty. Derived instances of Read and Show satisfy the following:

   • (x,"") is an element of (readsPrec d (showsPrec d x "")).
   That is, readsPrec parses the string produced by showsPrec, and delivers the value that showsPrec started with.

3. readRef :: MonadRef m => Ref m a -> m a

   ref-tf	Control.Monad.Ref

   Read the value of a reference

4. readerS :: forall (m :: Type -> Type) cl a r b . Monad m => ClSF m cl (a, r) b -> ClSF (ReaderT r m) cl a b

   rhine	FRP.Rhine.ClSF.Reader

   Create ("wrap") a ReaderT layer in the monad stack of a behaviour. Each tick, the ReaderT side effect is performed by passing the original behaviour the extra r input.

5. readBinary :: FilePath -> Sh ByteString

   shelly	Shelly

   Wraps readFile.

6. readfile :: FilePath -> Sh Text

   shelly	Shelly

   No documentation available.

7. readBinary :: MonadSh m => FilePath -> m ByteString

   shelly	Shelly.Lifted

   No documentation available.

8. readfile :: MonadSh m => FilePath -> m Text

   shelly	Shelly.Lifted

   No documentation available.

9. readBinary :: FilePath -> Sh ByteString

   shelly	Shelly.Pipe

   see readBinary

10. readfile :: FilePath -> Sh Text

    shelly	Shelly.Pipe

    see readFile

Page 228 of many | Previous | Next