Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapSome :: (forall (t :: k) . () => f t -> g t) -> Some f -> Some g

   some	Data.Some

   Map over argument.

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

   some	Data.Some.Church

   Map over argument.

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

   some	Data.Some.GADT

   Map over argument.

4. mapSome :: (forall (t :: k) . () => f t -> g t) -> Some f -> Some g

   some	Data.Some.Newtype

   Map over argument.

5. mapII :: (a -> b) -> I a -> I b

   sop-core	Data.SOP

   Lift the given function.

6. mapIII :: (a -> b -> c) -> I a -> I b -> I c

   sop-core	Data.SOP

   Lift the given function.

7. mapII :: (a -> b) -> I a -> I b

   sop-core	Data.SOP.BasicFunctors

   Lift the given function.

8. mapIII :: (a -> b -> c) -> I a -> I b -> I c

   sop-core	Data.SOP.BasicFunctors

   Lift the given function.

9. mapAccumLWithKey :: (forall (v :: k1) . () => a -> k2 v -> f v -> (a, g v)) -> a -> DMap k2 f -> (a, DMap k2 g)

   dependent-map	Data.Dependent.Map

   O(n). The function mapAccumLWithKey threads an accumulating argument through the map in ascending order of keys.

10. mapAccumRWithKey :: (forall (v :: k1) . () => a -> k2 v -> f v -> (a, g v)) -> a -> DMap k2 f -> (a, DMap k2 g)

    dependent-map	Data.Dependent.Map

    O(n). The function mapAccumRWithKey threads an accumulating argument through the map in descending order of keys.

Page 136 of many | Previous | Next