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.
mapM :: (Monad m, Storable a, Storable b) => (a -> m b) -> Vector a -> m (Vector b)rebase Rebase.Data.Vector.Storable No documentation available.
mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m (Vector b)rebase Rebase.Data.Vector.Unboxed No documentation available.
mapM :: (Vector v a, Vector v b, Applicative f) => (a -> f b) -> v a -> f (v b)fixed-vector Data.Vector.Fixed Effectful map over vector.
-
fixed-vector Data.Vector.Fixed.Cont Effectful map over vector.
mapM :: (Monad m, Ord b) => (a -> m b) -> Heap a -> m (Heap b)heaps Data.Heap O(n log n). Traverse the elements of the heap in sorted order and produce a new heap using Monadic side-effects.
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)mixed-types-num Numeric.MixedTypes.PreludeHiding 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.mapM :: Monad m => (a -> m b) -> NonEmptyVector a -> m (NonEmptyVector b)nonempty-vector Data.Vector.NonEmpty O(n) Apply the monadic action to all elements of the non-empty vector, yielding non-empty vector of results.
>>> mapM Just (unsafeFromList [1..3]) Just [1,2,3]
>>> mapM (const Nothing) (unsafeFromList [1..3]) Nothing
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)LambdaHack Game.LambdaHack.Core.Prelude 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.mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)LambdaHack Game.LambdaHack.Core.Prelude 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.mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)incipit-base Incipit.Base 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.