Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. mapM' :: (Foldable t, Applicative m, Monoid b) => (a -> m b) -> t a -> m b

   Agda	Agda.Utils.Monad

   Generalized version of traverse_ :: Applicative m => (a -> m ()) -> [a] -> m () Executes effects and collects results in left-to-right order. Works best with left-associative monoids. Note that there is an alternative

   mapM' f t = foldr mappend mempty $ mapM f t
   

   that collects results in right-to-left order (effects still left-to-right). It might be preferable for right associative monoids.

2. mapMM :: (Traversable t, Monad m) => (a -> m b) -> m (t a) -> m (t b)

   Agda	Agda.Utils.Monad

   No documentation available.

3. mapMM_ :: (Foldable t, Monad m) => (a -> m ()) -> m (t a) -> m ()

   Agda	Agda.Utils.Monad

   No documentation available.

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

   Agda	Agda.Utils.Monad

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

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

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

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

8. 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)

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

   aws	Aws.Core

   Apply a function to the metadata.

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

    breakpoint	Debug.Breakpoint.GhcFacade

    Applicative version of mapMaybe

Page 53 of many | Previous | Next