Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. omapME :: (Monad m, MonoTraversable mono) => (Element mono -> m (Element mono)) -> ConduitT mono mono m ()

   conduit	Data.Conduit.Combinators

   Apply a monadic monomorphic transformation to all elements in a chunked stream. Unlike mapME, this will work on types like ByteString and Text which are MonoFunctor but not Functor. Subject to fusion

2. concatMapMS :: (Monad m, MonoFoldable mono) => (a -> m mono) -> StreamConduit a m (Element mono)

   conduit	Data.Conduit.Combinators.Stream

   No documentation available.

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

   conduit	Data.Conduit.Internal.List.Stream

   No documentation available.

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

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

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

   extra	Control.Monad.Extra

   A version of concatMap that works with a monadic predicate.

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

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

   extra	Extra

   A version of concatMap that works with a monadic predicate.

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

   extra	Extra

   A version of mconcatMap that works with a monadic predicate.

10. makeBimapM :: Name -> Q Exp

    bifunctors	Data.Bifunctor.TH

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

Page 69 of many | Previous | Next