Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

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

    hledger-lib Hledger.Utils

    Like mapM but uses sequence'.

  2. mapAccumL :: (a -> Char -> (a, Char)) -> a -> JSString -> (a, JSString)

    jsaddle Data.JSString

    O(n) Like a combination of map and foldl'. Applies a function to each element of a JSString, passing an accumulating parameter from left to right, and returns a final JSString. Performs replacement on invalid scalar values.

  3. mapAccumR :: (a -> Char -> (a, Char)) -> a -> JSString -> (a, JSString)

    jsaddle Data.JSString

    The mapAccumR function behaves like a combination of map and a strict foldr; it applies a function to each element of a JSString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new JSString. Performs replacement on invalid scalar values.

  4. mapAccumL :: (a -> Char -> (a, Char)) -> a -> Stream Char -> (a, JSString)

    jsaddle Data.JSString.Internal.Fusion

    O(n) Like a combination of map and foldl'. Applies a function to each element of a Text, passing an accumulating parameter from left to right, and returns a final JSString.

  5. mappendL :: m -> (m :+: n) -> m :+: n

    monoid-extras Data.Monoid.Coproduct

    Prepend a value from the left monoid.

  6. mappendR :: n -> (m :+: n) -> m :+: n

    monoid-extras Data.Monoid.Coproduct

    Prepend a value from the right monoid.

  7. mapEvent :: forall (m :: Type -> Type) e e' value . Monad m => (e -> e') -> ResultT e m value -> ResultT e' m value

    morpheus-graphql-core Data.Morpheus.Internal.Ext

    No documentation available.

  8. mapApplySplit :: Ord a => a -> (c -> c -> c) -> (b -> c) -> (Map a b -> Map a c) -> Map a b -> Map a c

    numeric-prelude MathObj.PartialFraction

    Apply a function on a specific element if it exists, and another function to the rest of the map.

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

    numeric-prelude NumericPrelude

    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.

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

Page 165 of many | Previous | Next