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. mapI :: (a -> Bool) -> (a -> [a]) -> [a] -> [a]

   intermediate-structures	Data.IntermediateStructures1

   Function that applies additional function f :: a -> [a] to a if p :: a -> Bool and p a = True

2. mapI_ :: (Foldable t, Monoidal f) => (a -> f ()) -> t a -> f ()

   invertible	Control.Invertible.Monoidal

   Map each element to a monoidal and sequenceI_ the results.

3. mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]

   invertible	Control.Invertible.Monoidal

   Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).

4. mapFree :: (forall a' . () => f a' -> m a') -> Free f a -> Free m a

   invertible	Control.Invertible.Monoidal.Free

   Transform the type constructor within a Free.

5. mapConstraint :: (Monad m, Functor m) => (JType -> m JType) -> Constraint -> m Constraint

   jmacro	Language.Javascript.JMacro.TypeCheck

   No documentation available.

6. mapAccum :: (a -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)

   justified-containers	Data.Map.Justified

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

7. mapAccumWithKey :: (a -> Key ph k -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)

   justified-containers	Data.Map.Justified

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

8. mapWithKey :: (Key ph k -> a -> b) -> Map ph k a -> Map ph k b

   justified-containers	Data.Map.Justified

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

9. mappingKeys :: Ord k2 => (k1 -> k2) -> Map ph k1 v -> (forall ph' . () => (Key ph k1 -> Key ph' k2, Map ph' k2 v) -> t) -> t

   justified-containers	Data.Map.Justified

   O(n*log n). mappingKeys evaluates a continuation with the map obtained by applying f to each key of s. The size of the resulting map may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the greatest of the original keys is retained. The continuation is passed two things:

   1. A function that converts evidence that a key belongs to the original map into evidence that a key belongs to the new map.
   2. The new, possibly-smaller map.

10. mappingKeysWith :: Ord k2 => (v -> v -> v) -> (k1 -> k2) -> Map ph k1 v -> (forall ph' . () => (Key ph k1 -> Key ph' k2, Map ph' k2 v) -> t) -> t

    justified-containers	Data.Map.Justified

    O(n*log n). Same as mappingKeys, except a function is used to combine values when two or more keys from the original map correspond to the same key in the final map.

Page 304 of many | Previous | Next