Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

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

    sop-core Data.SOP

    Lift the given function.

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

    sop-core Data.SOP

    Lift the given function.

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

    sop-core Data.SOP.BasicFunctors

    Lift the given function.

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

    sop-core Data.SOP.BasicFunctors

    Lift the given function.

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

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

  7. mapEitherWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Either (g v) (h v)) -> DMap k2 f -> (DMap k2 g, DMap k2 h)

    dependent-map Data.Dependent.Map

    O(n). Map keys/values and separate the Left and Right results.

  8. mapKeysWith :: GCompare k2 => (forall (v :: k) . () => k2 v -> f v -> f v -> f v) -> (forall (v :: k) . () => k1 v -> k2 v) -> DMap k1 f -> DMap k2 f

    dependent-map Data.Dependent.Map

    O(n*log n). mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c.

  9. mapMaybeWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Maybe (g v)) -> DMap k2 f -> DMap k2 g

    dependent-map Data.Dependent.Map

    O(n). Map keys/values and collect the Just results.

  10. mapWithKey :: (forall (v :: k1) . () => k2 v -> f v -> g v) -> DMap k2 f -> DMap k2 g

    dependent-map Data.Dependent.Map

    O(n). Map a function over all values in the map.

Page 137 of many | Previous | Next