Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

  1. mapKeysMonotonic :: (Ord k1, Ord k2) => (k1 -> k2) -> IntervalMap k1 a -> IntervalMap k2 a

    data-interval Data.IntervalMap.Strict

    mapKeysMonotonic f s is the map obtained by applying f to each key of s. f must be strictly monotonic. That is, for any values x and y, if x < y then f x < f y.

  2. mapDecision :: (a -> b) -> (b -> a) -> Decision a -> Decision b

    decidable Data.Type.Predicate

    Map over the value inside a Decision.

  3. mapRefuted :: (a -> b) -> Refuted b -> Refuted a

    decidable Data.Type.Predicate

    Change the target of a Refuted with a contravariant mapping function.

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

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

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

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

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

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

  7. mapKeysWith :: GCompare k2 => (forall (v :: k) . () => k2 v -> f v -> f v -> f v) -> (forall (v :: k) . () => k1 v -> k2 v) -> MonoidalDMap k1 f -> MonoidalDMap k2 f

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    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.

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

    dependent-monoidal-map Data.Dependent.Map.Monoidal

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

  9. mapWithKey :: (forall (v :: k1) . () => k2 v -> f v -> g v) -> MonoidalDMap k2 f -> MonoidalDMap k2 g

    dependent-monoidal-map Data.Dependent.Map.Monoidal

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

  10. mapVertices :: (Eq b, Hashable b) => (a -> b) -> DiGraph a -> DiGraph b

    digraph Data.DiGraph

    Map a function over all vertices of a graph.

Page 288 of many | Previous | Next