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. mapReduceWith :: (Generator c, Reducer e m, Monoid m) => (m -> n) -> (Elem c -> e) -> c -> n

   reducers	Data.Generator

   No documentation available.

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

   reducers	Data.Generator

   No documentation available.

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

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

   reducers	Data.Semigroup.Generator

   No documentation available.

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

   reducers	Data.Semigroup.Generator

   No documentation available.

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

   reducers	Data.Semigroup.Generator

   No documentation available.

7. mapTo1 :: (Generator1 c, Reducer e m) => (Elem c -> e) -> m -> c -> m

   reducers	Data.Semigroup.Generator

   No documentation available.

8. mapKeysToAttributeName :: Map Text v -> Map AttributeName v

   reflex-dom-core	Reflex.Dom.Builder.Class

   No documentation available.

9. map' :: forall f (r :: Row Type) . FreeForall r => (forall a . () => a -> f a) -> Rec r -> Rec (Map f r)

   row-types	Data.Row.Records

   A function to map over a record given no constraint.

10. mapF :: forall k c (g :: k -> k) (ϕ :: Row (k -> Type)) (ρ :: Row k) . BiForall ϕ ρ c => (forall (h :: k -> Type) (a :: k) . c h a => h a -> h (g a)) -> Rec (Ap ϕ ρ) -> Rec (Ap ϕ (Map g ρ))

    row-types	Data.Row.Records

    A function to map over a Ap record given constraints.

Page 258 of many | Previous | Next