Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. mapM :: forall m (v :: Type -> Type) a b (n :: Nat) . (Monad m, Vector v a, Vector v b) => (a -> m b) -> Vector v n a -> m (Vector v n b)

    vector-sized Data.Vector.Generic.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  2. mapM :: forall m a b (n :: Nat) . (Monad m, Prim a, Prim b) => (a -> m b) -> Vector n a -> m (Vector n b)

    vector-sized Data.Vector.Primitive.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  3. mapM :: forall m a b (n :: Nat) . Monad m => (a -> m b) -> Vector n a -> m (Vector n b)

    vector-sized Data.Vector.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  4. mapM :: forall m a b (n :: Nat) . (Monad m, Storable a, Storable b) => (a -> m b) -> Vector n a -> m (Vector n b)

    vector-sized Data.Vector.Storable.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  5. mapM :: forall m a b (n :: Nat) . (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector n a -> m (Vector n b)

    vector-sized Data.Vector.Unboxed.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  6. mapM :: forall m a b (n :: Nat) . Monad m => (a -> m b) -> ListN n a -> m (ListN n b)

    basement Basement.Sized.List

    Map each element of a List to a monadic action, evaluate these actions sequentially and collect the results

  7. mapM :: forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, Monad m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map a monadic action over an array sequentially.

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

    ghc-internal GHC.Internal.Base

    mapM f is equivalent to sequence . map f.

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

    ghc-internal GHC.Internal.Control.Monad

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

    ghc-internal GHC.Internal.Data.Traversable

    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.

Page 4 of many | Previous | Next