Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

   reducers	Data.Semigroup.Generator

   No documentation available.

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

   reducers	Data.Semigroup.Generator

   No documentation available.

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

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

   No documentation available.

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

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

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

   row-types	Data.Row.Variants

   A function to map over a variant given no constraint.

7. mapCV :: (AlgReal -> AlgReal) -> (Integer -> Integer) -> (Float -> Float) -> (Double -> Double) -> (FP -> FP) -> (Rational -> Rational) -> CV -> CV

   sbv	Data.SBV.Internals

   Map a unary function through a CV.

8. mapCV2 :: (AlgReal -> AlgReal -> AlgReal) -> (Integer -> Integer -> Integer) -> (Float -> Float -> Float) -> (Double -> Double -> Double) -> (FP -> FP -> FP) -> (Rational -> Rational -> Rational) -> CV -> CV -> CV

   sbv	Data.SBV.Internals

   Map a binary function through a CV.

9. map2 :: (SymVal a, SymVal b, SymVal c) => (SBV a -> SBV b -> SBV c) -> SMaybe a -> SMaybe b -> SMaybe c

   sbv	Data.SBV.Maybe

   Map over two maybe values.

10. mapAppend :: (SA -> SB) -> IO Proof

    sbv	Documentation.SBV.Examples.KnuckleDragger.Lists

    map f (xs ++ ys) == map f xs ++ map f ys
    

    >>> mapAppend (uninterpret "f")
    Inductive lemma: mapAppend
    Step: Base                            Q.E.D.
    Step: 1                               Q.E.D.
    Step: 2                               Q.E.D.
    Step: 3                               Q.E.D.
    Step: 4                               Q.E.D.
    Step: 5                               Q.E.D.
    Result:                               Q.E.D.
    [Proven] mapAppend
    

Page 299 of many | Previous | Next