Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])

   prelude-compat	Data.List2010

   No documentation available.

2. mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])

   prelude-compat	Data.List2010

   No documentation available.

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

   prelude-compat	Prelude2010

   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.

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

   prelude-compat	Prelude2010

   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.

5. mapLeft :: Bifunctor p => (a -> b) -> p a c -> p b c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for first.

6. mapRight :: Bifunctor p => (b -> c) -> p a b -> p a c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for second.

7. mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b)

   rebase	Rebase.Data.Vector

   No documentation available.

8. mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()

   rebase	Rebase.Data.Vector

   No documentation available.

9. mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector

   No documentation available.

10. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Vector a -> m (Vector b)

    rebase	Rebase.Data.Vector

    No documentation available.

Page 204 of many | Previous | Next