Hoogle Search

Within LTS Haskell 24.49 (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, Monad m) => (a -> m b) -> t a -> m ()

   base-compat-batteries	Control.Monad.Compat

   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.

2. mapMaybe :: (a -> Maybe b) -> Infinite a -> Infinite b

   infinite-list	Data.List.Infinite

   Apply a function to every element of an infinite list and collect Just results. This function isn't productive (e. g., head . mapMaybe f won't terminate), if no elements of the input list result in Just.

3. mapMonotonic :: (a -> c) -> Bimap a b -> Bimap c b

   bimap	Data.Bimap

   O(n). Map a strictly increasing function over all left keys in the map. The precondition is not checked. Version 0.3

4. mapMonotonicR :: (b -> c) -> Bimap a b -> Bimap a c

   bimap	Data.Bimap

   O(n). Map a strictly increasing function over all right keys in the map. The precondition is not checked. Version 0.3

5. mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Lazy

   No documentation available.

6. mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Lazy

   No documentation available.

7. mapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Strict

   No documentation available.

8. mapMaybeWithKey :: Enum k => (k -> a -> Maybe b) -> EnumMap k a -> EnumMap k b

   enummapset	Data.EnumMap.Strict

   No documentation available.

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

   ghc-internal	GHC.Internal.Control.Monad

   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. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    ghc-internal	GHC.Internal.Data.Foldable

    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.

Page 31 of many | Previous | Next