Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()

   extra	Extra

   Like whenJust, but where the test can be monadic.

2. whileJustM :: (Monad m, Monoid a) => m (Maybe a) -> m a

   extra	Extra

   Keep running an operation until it becomes a Nothing, accumulating the monoid results inside the Justs as the result of the overall loop.

3. setRequestManager :: Manager -> Request -> Request

   http-conduit	Network.HTTP.Simple

   Instead of using the default global Manager, use the supplied Manager.

4. setRequestMethod :: ByteString -> Request -> Request

   http-conduit	Network.HTTP.Simple

   Set the request method

5. primalityTestMillerRabin :: Int -> Integer -> Bool

   crypton	Crypto.Number.Prime

   Miller Rabin algorithm return if the number is probably prime or composite. the tries parameter is the number of recursion, that determines the accuracy of the test.

6. testMachineLog :: TestFlags -> Flag PathTemplate

   Cabal	Distribution.Simple.Setup

   No documentation available.

7. execStmt :: GhcMonad m => String -> ExecOptions -> m ExecResult

   ghc	GHC

   Run a statement in the current interactive context.

8. execStmt' :: GhcMonad m => GhciLStmt GhcPs -> String -> ExecOptions -> m ExecResult

   ghc	GHC

   Like execStmt, but takes a parsed statement as argument. Useful when doing preprocessing on the AST before execution, e.g. in GHCi (see GHCi.UI.runStmt).

9. isStmt :: ParserOpts -> String -> Bool

   ghc	GHC

   Returns True if passed string is a statement.

10. resumeStmt :: Resume -> String

    ghc	GHC

    No documentation available.

Page 25 of many | Previous | Next