Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

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

2. mapExceptionContext :: (ExceptionContext -> ExceptionContext) -> SomeException -> SomeException

   ghc-internal	GHC.Internal.Exception.Type

   No documentation available.

3. mapConcurrently :: (Traversable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m (t b)

   lifted-async	Control.Concurrent.Async.Lifted

   Generalized version of mapConcurrently.

4. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m ()

   lifted-async	Control.Concurrent.Async.Lifted

   Generalized version of mapConcurrently_.

5. mapConcurrently :: (Traversable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m (t b)

   lifted-async	Control.Concurrent.Async.Lifted.Safe

   Generalized version of mapConcurrently.

6. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m ()

   lifted-async	Control.Concurrent.Async.Lifted.Safe

   Generalized version of mapConcurrently_.

7. mapIO :: forall r ix b r' a m . (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

   massiv	Data.Massiv.Array

   Map an IO action over an Array. Underlying computation strategy is respected and will be parallelized when requested. Unfortunately no fusion is possible and new array will be create upon each call.

8. mapIO_ :: forall r ix e a m . (Load r ix e, MonadUnliftIO m) => (e -> m a) -> Array r ix e -> m ()

   massiv	Data.Massiv.Array

   Similar to mapIO, but ignores the result of mapping action and does not create a resulting array, therefore it is faster. Use this instead of mapIO when result is irrelevant. Most importantly it will follow the iteration logic outlined by the supplied array.

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

10. mapM_ :: (Source r a, Index ix, Monad m) => (a -> m b) -> Array r ix a -> m ()

    massiv	Data.Massiv.Array

    Map a monadic function over an array sequentially, while discarding the result.

    Examples

    >>> import Data.Massiv.Array as A
    
    >>> rangeStepM Par (Ix1 10) 12 60 >>= A.mapM_ print
    10
    22
    34
    46
    58
    

Page 200 of many | Previous | Next