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. mapMaybe :: (v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

2. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

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

   protolude	Protolude

   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.

4. mapMaybe :: (a -> Maybe b) -> [a] -> [b]

   protolude	Protolude

   The mapMaybe function is a version of map which can throw out elements. In particular, the functional argument returns something of type Maybe b. If this is Nothing, no element is added on to the result list. If it is Just b, then b is included in the result list.

   Examples

   Using mapMaybe f x is a shortcut for catMaybes $ map f x in most cases:

   >>> import GHC.Internal.Text.Read ( readMaybe )
   
   >>> let readMaybeInt = readMaybe :: String -> Maybe Int
   
   >>> mapMaybe readMaybeInt ["1", "Foo", "3"]
   [1,3]
   
   >>> catMaybes $ map readMaybeInt ["1", "Foo", "3"]
   [1,3]
   

   If we map the Just constructor, the entire list should be returned:

   >>> mapMaybe Just [1,2,3]
   [1,2,3]
   

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

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

7. mapMixedAmount :: (Amount -> Amount) -> MixedAmount -> MixedAmount

   hledger-lib	Hledger.Data.Amount

   Apply a transform to a mixed amount's component Amounts.

8. mapM' :: Monad f => (a -> f b) -> [a] -> f [b]

   hledger-lib	Hledger.Utils

   Like mapM but uses sequence'.

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

   numeric-prelude	NumericPrelude

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

    numeric-prelude	NumericPrelude.Base

    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 32 of many | Previous | Next