Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

   digraph	Data.DiGraph

   Map a function over all vertices of a graph.

6. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   dimensional	Numeric.Units.Dimensional.Prelude

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

7. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   dimensional	Numeric.Units.Dimensional.Prelude

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

8. mappend :: Monoid a => a -> a -> a

   dimensional	Numeric.Units.Dimensional.Prelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

9. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

   distribution-opensuse	OpenSuse.Prelude

   The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

10. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

    distribution-opensuse	OpenSuse.Prelude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

    Examples

    mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

Page 328 of many | Previous | Next