Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapClassifier :: Applicative m => (forall a . () => o a -> m (o' a)) -> forall a . () => Classifier_ o a -> m (Classifier_ o' a)

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

2. mapSome :: (forall (x :: k) . () => f x -> g x) -> Some f -> Some g

   recover-rtti	Debug.RecoverRTTI

   No documentation available.

3. mapFrom :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> c -> m -> m

   reducers	Data.Generator

   No documentation available.

4. mapReduce :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> c -> m

   reducers	Data.Generator

   No documentation available.

5. mapReduceWith :: (Generator c, Reducer e m, Monoid m) => (m -> n) -> (Elem c -> e) -> c -> n

   reducers	Data.Generator

   No documentation available.

6. mapTo :: (Generator c, Reducer e m, Monoid m) => (Elem c -> e) -> m -> c -> m

   reducers	Data.Generator

   No documentation available.

7. mapM_ :: (Generator c, Monad m) => (Elem c -> m b) -> c -> m ()

   reducers	Data.Generator.Combinators

   Efficiently mapReduce a Generator using the Action monoid. A specialized version of its namesake from Data.Foldable and Control.Monad

   mapReduceWith getAction
   

8. mapFrom1 :: (Generator1 c, Reducer e m) => (Elem c -> e) -> c -> m -> m

   reducers	Data.Semigroup.Generator

   No documentation available.

9. mapReduce1 :: (Generator1 c, Reducer e m) => (Elem c -> e) -> c -> m

   reducers	Data.Semigroup.Generator

   No documentation available.

10. mapReduceWith1 :: (Generator1 c, Reducer e m) => (m -> n) -> (Elem c -> e) -> c -> n

    reducers	Data.Semigroup.Generator

    No documentation available.

Page 255 of many | Previous | Next