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.

  1. mapAccumRWithKey :: forall k a b c . (a -> k -> b -> (a, c)) -> a -> MonoidalMap k b -> (a, MonoidalMap k c)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  2. mapAccumWithKey :: forall k a b c . (a -> k -> b -> (a, c)) -> a -> MonoidalMap k b -> (a, MonoidalMap k c)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  3. mapEither :: forall k a b c . (a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  4. mapEitherWithKey :: (k -> a -> Either b c) -> MonoidalMap k a -> (MonoidalMap k b, MonoidalMap k c)

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  5. mapKeys :: forall k1 k2 a . Ord k2 => (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  6. mapKeysMonotonic :: (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a

    monoidal-containers Data.Map.Monoidal.Strict

    O(n). mapKeysMonotonic f s == mapKeys f s, but works only when f is strictly increasing (both monotonic and injective). That is, for any values x and y, if x < y then f x < f y and f is injective (i.e. it never maps two input keys to the same output key). The precondition is not checked. Semi-formally, we have: 

    and [x < y ==> f x < f y | x <- ls, y <- ls]
==> mapKeysMonotonic f s == mapKeys f s
where ls = keys s
    This means that f maps distinct original keys to distinct resulting keys. This function has better performance than mapKeys. 
    mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")]) == fromList [(6, "b"), (10, "a")]
valid (mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")])) == True
valid (mapKeysMonotonic (\ _ -> 1)     (fromList [(5,"a"), (3,"b")])) == False

  7. mapKeysWith :: forall k1 k2 a . Ord k2 => (a -> a -> a) -> (k1 -> k2) -> MonoidalMap k1 a -> MonoidalMap k2 a

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  8. mapMaybe :: forall k a b . (a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  9. mapMaybeWithKey :: (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  10. mapWithKey :: (k -> a -> b) -> MonoidalMap k a -> MonoidalMap k b

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

Page 200 of many | Previous | Next