Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   Agda	Agda.Utils.Monad

   A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].

2. mapMaybeMM :: Monad m => (a -> m (Maybe b)) -> m [a] -> m [b]

   Agda	Agda.Utils.Monad

   A version of mapMaybeM with a computation for the input list.

3. mapMonotonic :: (Key -> Key) -> IntSet -> IntSet

   Agda	Agda.Utils.VarSet

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

4. mapMerge :: (a -> c) -> (b -> c) -> (a -> b -> c) -> Event a -> Event b -> Event c

   Yampa	FRP.Yampa

   A generic event merge-map utility that maps event occurrences, merging the results. The first three arguments are mapping functions, the third of which will only be used when both events are present. Therefore, mergeBy = mapMerge id id. Applicative-based definition: mapMerge lf rf lrf le re = (f $ le * re) | (lf $ le) | (rf $ re)

5. mapMerge :: (a -> c) -> (b -> c) -> (a -> b -> c) -> Event a -> Event b -> Event c

   Yampa	FRP.Yampa.Event

   A generic event merge-map utility that maps event occurrences, merging the results. The first three arguments are mapping functions, the third of which will only be used when both events are present. Therefore, mergeBy = mapMerge id id. Applicative-based definition: mapMerge lf rf lrf le re = (f $ le * re) | (lf $ le) | (rf $ re)

6. mapMetadata :: (m -> n) -> Response m a -> Response n a

   aws	Aws.Core

   Apply a function to the metadata.

7. mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]

   breakpoint	Debug.Breakpoint.GhcFacade

   Applicative version of mapMaybe

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

   calligraphy	Calligraphy.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.

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

   clash-prelude	Clash.HaskellPrelude

   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.

10. mapMaybeEdgeKeys :: (Edge e1, Ord n) => (e0 n -> Maybe (e1 n)) -> Graph e0 n el nl -> Graph e1 n el nl

    comfort-graph	Data.Graph.Comfort

    You may only use this for filtering edges and use more specialised types as a result. You must not alter source and target nodes of edges.

Page 53 of many | Previous | Next