Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. mapM_ :: (Vector v a, Applicative f) => (a -> f b) -> v a -> f ()

    fixed-vector Data.Vector.Fixed

    Apply monadic action to each element of vector and ignore result.

  2. mapM_ :: forall (n :: PeanoNum) f a b . (ArityPeano n, Applicative f) => (a -> f b) -> ContVec n a -> f ()

    fixed-vector Data.Vector.Fixed.Cont

    Apply monadic action to each element of vector and ignore result.

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

    mixed-types-num Numeric.MixedTypes.PreludeHiding

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

    nonempty-vector Data.Vector.NonEmpty

    O(n) Apply the monadic action to all elements of a non-empty vector and ignore the results.

    >>> mapM_ (const $ Just ()) (unsafeFromList [1..3])
    Just ()
    
    >>> mapM_ (const Nothing) (unsafeFromList [1..3])
    Nothing
    

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

    LambdaHack Game.LambdaHack.Core.Prelude

    This has a more specific type (unit result) than normally, to catch errors.

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

    incipit-base Incipit.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.

  7. mapM_ :: MonadParallel m => (a -> m b) -> [a] -> m ()

    monad-parallel Control.Monad.Parallel

    Like mapM_, but applying the function to the individual list items in parallel.

  8. mapM_ :: (Generator c, Monad m) => (Elem c -> m b) -> c -> m ()

    reducers Data.Generator.Combinators

    Efficiently mapReduce a Generator using the Action monoid. A specialized version of its namesake from Data.Foldable and Control.Monad

    mapReduceWith getAction
    

  9. mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()

    streamly-core Streamly.Internal.Data.Stream

    Execute a monadic action for each element of the Stream

  10. mapM_ :: Monad m => (a -> m b) -> StreamK m a -> m ()

    streamly-core Streamly.Internal.Data.StreamK

    Apply a monadic action to each element of the stream and discard the output of the action.

Page 8 of many | Previous | Next