Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. type family XXStmtLR x x' b

    ghc Language.Haskell.Syntax.Extension

    No documentation available.

  2. data BlockedIndefinitelyOnSTM

    lifted-base Control.Exception.Lifted

    The thread is waiting to retry an STM transaction, but there are no other references to any TVars involved, so it can't ever continue.

  3. BlockedIndefinitelyOnSTM :: BlockedIndefinitelyOnSTM

    lifted-base Control.Exception.Lifted

    No documentation available.

  4. toListM :: Monad m => Producer a m () -> m [a]

    pipes Pipes.Prelude

    Convert an effectful Producer into a list Note: toListM is not an idiomatic use of pipes, but I provide it for simple testing purposes. Idiomatic pipes style consumes the elements immediately as they are generated instead of loading all elements into memory.

  5. toListM' :: Monad m => Producer a m r -> m ([a], r)

    pipes Pipes.Prelude

    Convert an effectful Producer into a list alongside the return value Note: toListM' is not an idiomatic use of pipes, but I provide it for simple testing purposes. Idiomatic pipes style consumes the elements immediately as they are generated instead of loading all elements into memory.

  6. constM :: Monad m => m b -> m (a -> b)

    smallcheck Test.SmallCheck.Series

    constM = liftM const
    

  7. listM :: Applicative m => Depth -> Series m a -> m [a]

    smallcheck Test.SmallCheck.Series

    Monadic version of list.

  8. listModuleTree :: ModuleInfo -> [Text]

    haskell-gi Data.GI.CodeGen.Code

    Return the list of modules writeModuleTree would write, without actually writing anything to disk.

  9. postmapM :: Monad m => (a -> m r) -> FoldM m x a -> FoldM m x r

    foldl Control.Foldl

    (postmapM f folder) returns a new FoldM where f is applied to the final value.

    postmapM pure = id
    
    postmapM (f >=> g) = postmapM g . postmapM f
    
    postmapM k (pure r) = lifts (k r)
    

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

    cryptonite 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.

Page 44 of many | Previous | Next