Hoogle Search

Within LTS Haskell 24.19 (ghc-9.10.3)

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

Exact lookup

1. concatMapM :: Monad m => (a -> m [b]) -> ConduitT a b m ()

   conduit	Data.Conduit.List

   Apply a monadic transformation to all values in a stream, concatenating the output values. Subject to fusion Since 0.3.0

2. foldMapM :: (Monad m, Monoid b) => (a -> m b) -> ConduitT a o m b

   conduit	Data.Conduit.List

   A monoidal strict left fold in a Monad. Since 1.0.8

3. concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

   extra	Control.Monad.Extra

   A version of concatMap that works with a monadic predicate.

4. mconcatMapM :: (Monad m, Monoid b) => (a -> m b) -> [a] -> m b

   extra	Control.Monad.Extra

   A version of mconcatMap that works with a monadic predicate.

5. concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

   extra	Extra

   A version of concatMap that works with a monadic predicate.

6. mconcatMapM :: (Monad m, Monoid b) => (a -> m b) -> [a] -> m b

   extra	Extra

   A version of mconcatMap that works with a monadic predicate.

7. makeBimapM :: Name -> Q Exp

   bifunctors	Data.Bifunctor.TH

   Generates a lambda expression which behaves like bimapM (without requiring a Bitraversable instance).

8. makeBimapMOptions :: Options -> Name -> Q Exp

   bifunctors	Data.Bifunctor.TH

   Like makeBimapM, but takes an Options argument.

9. graphMapModify :: (UniqFM k (Node k cls color) -> UniqFM k (Node k cls color)) -> Graph k cls color -> Graph k cls color

   ghc	GHC.Data.Graph.Base

   Modify the finite map holding the nodes in the graph.

10. fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB b

    ghc	GHC.Data.Unboxed

    No documentation available.

Page 69 of many | Previous | Next