Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. gmapAccumA :: forall b d a . (Data d, Applicative a) => (forall e . Data e => b -> e -> (b, a e)) -> b -> d -> (b, a d)

   syb	Data.Generics.Twins

   Applicative version

2. gmapAccumM :: (Data d, Monad m) => (forall e . Data e => a -> e -> (a, m e)) -> a -> d -> (a, m d)

   syb	Data.Generics.Twins

   gmapM with accumulation

3. gmapAccumQ :: Data d => (forall e . Data e => a -> e -> (a, q)) -> a -> d -> (a, [q])

   syb	Data.Generics.Twins

   gmapQ with accumulation

4. gmapAccumQl :: Data d => (r -> r' -> r) -> r -> (forall e . Data e => a -> e -> (a, r')) -> a -> d -> (a, r)

   syb	Data.Generics.Twins

   gmapQl with accumulation

5. gmapAccumQr :: Data d => (r' -> r -> r) -> r -> (forall e . Data e => a -> e -> (a, r')) -> a -> d -> (a, r)

   syb	Data.Generics.Twins

   gmapQr with accumulation

6. gmapAccumT :: Data d => (forall e . Data e => a -> e -> (a, e)) -> a -> d -> (a, d)

   syb	Data.Generics.Twins

   gmapT with accumulation

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

   extra	Control.Monad.Extra

   A version of concatMap that works with a monadic predicate.

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

9. mconcatMap :: Monoid b => (a -> b) -> [a] -> b

   extra	Data.List.Extra

   Version on concatMap generalised to a Monoid rather than just a list.

   mconcatMap Sum [1,2,3] == Sum 6
   \f xs -> mconcatMap f xs == concatMap f xs
   

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

    extra	Extra

    A version of concatMap that works with a monadic predicate.

Page 433 of many | Previous | Next