Control.Monad.Parallel

This module defines classes of monads that can perform multiple computations in parallel and, more importantly, combine the results of those parallel computations.

There are two classes exported by this module, MonadParallel and MonadFork. The former is more generic, but the latter is easier to use: when invoking any expensive computation that could be performed in parallel, simply wrap the call in forkExec. The function immediately returns a handle to the running computation. The handle can be used to obtain the result of the computation when needed:

  do child <- forkExec expensive
     otherStuff
     result <- child

In this example, the computations expensive and otherStuff would be performed in parallel. When using the MonadParallel class, both parallel computations must be specified at once:

  bindM2 (\ childResult otherResult -> ...) expensive otherStuff

In either case, for best results the costs of the two computations should be roughly equal.

Any monad that is an instance of the MonadFork class is also an instance of the MonadParallel class, and the following law should hold:

 bindM2 f ma mb = do {a' <- forkExec ma; b <- mb; a <- a'; f a b}

When operating with monads free of side-effects, such as Identity or Maybe, forkExec is equivalent to return and bindM2 is equivalent to \ f ma mb -> do {a <- ma; b <- mb; f a b} — the only difference is in the resource utilisation. With the IO monad, on the other hand, there may be visible difference in the results because the side effects of ma and mb may be arbitrarily reordered.

Classes

class Monad m => MonadParallel m where

Class of monads that can perform two computations in parallel and bind their results together.

Minimal complete definition

Nothing

Methods

bindM2 :: (a -> b -> m c) -> m a -> m b -> m c

Perform two monadic computations in parallel; when they are both finished, pass the results to the function. Apart from the possible ordering of side effects, this function is equivalent to \f ma mb-> do {a <- ma; b <- mb; f a b}

Instances

MonadParallel []

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> [c]) -> [a] -> [b] -> [c]

MonadParallel Maybe

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> Maybe c) -> Maybe a -> Maybe b -> Maybe c

MonadParallel IO

IO is parallelizable by forkIO.

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> IO c) -> IO a -> IO b -> IO c

MonadParallel Identity

Any monad that allows the result value to be extracted, such as Identity or Maybe monad, can implement bindM2 by using par.

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> Identity c) -> Identity a -> Identity b -> Identity c

MonadParallel m => MonadParallel (MaybeT m)

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> MaybeT m c) -> MaybeT m a -> MaybeT m b -> MaybeT m c

MonadParallel m => MonadParallel (ReaderT r m)

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> ReaderT r m c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c

MonadParallel m => MonadParallel (IdentityT m)

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> IdentityT m c) -> IdentityT m a -> IdentityT m b -> IdentityT m c

MonadParallel m => MonadParallel (ExceptT e m)

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> ExceptT e m c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c

MonadParallel ((->) r :: Type -> Type)

Defined in Control.Monad.Parallel

Methods

bindM2 :: (a -> b -> r -> c) -> (r -> a) -> (r -> b) -> r -> c

class MonadParallel m => MonadFork m where

Class of monads that can fork a parallel computation.

Minimal complete definition

Nothing

Methods

forkExec :: m a -> m (m a)

Fork a child monadic computation to be performed in parallel with the current one.

Instances

MonadFork []

Defined in Control.Monad.Parallel

Methods

forkExec :: [a] -> [[a]]

MonadFork Maybe

Defined in Control.Monad.Parallel

Methods

forkExec :: Maybe a -> Maybe (Maybe a)

MonadFork IO

IO is forkable by forkIO.

Defined in Control.Monad.Parallel

Methods

forkExec :: IO a -> IO (IO a)

MonadFork m => MonadFork (MaybeT m)

Defined in Control.Monad.Parallel

Methods

forkExec :: MaybeT m a -> MaybeT m (MaybeT m a)

MonadFork m => MonadFork (ReaderT r m)

Defined in Control.Monad.Parallel

Methods

forkExec :: ReaderT r m a -> ReaderT r m (ReaderT r m a)

MonadFork m => MonadFork (IdentityT m)

Defined in Control.Monad.Parallel

Methods

forkExec :: IdentityT m a -> IdentityT m (IdentityT m a)

MonadFork m => MonadFork (ExceptT e m)

Defined in Control.Monad.Parallel

Methods

forkExec :: ExceptT e m a -> ExceptT e m (ExceptT e m a)

MonadFork ((->) r :: Type -> Type)

Defined in Control.Monad.Parallel

Methods

forkExec :: (r -> a) -> r -> (r -> a)

bindM3 :: MonadParallel m => (a -> b -> c -> m d) -> m a -> m b -> m c -> m d

Perform three monadic computations in parallel; when they are all finished, pass their results to the function.

Control.Monad equivalents

ap :: MonadParallel m => m (a -> b) -> m a -> m b

Like ap, but evaluating the function and its argument in parallel.

forM :: MonadParallel m => [a] -> (a -> m b) -> m [b]

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

forM_ :: MonadParallel m => [a] -> (a -> m b) -> m ()

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

liftM2 :: MonadParallel m => (a -> b -> c) -> m a -> m b -> m c

Like liftM2, but evaluating its two monadic arguments in parallel.

liftM3 :: MonadParallel m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r

Like liftM3, but evaluating its three monadic arguments in parallel.

mapM :: MonadParallel m => (a -> m b) -> [a] -> m [b]

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

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

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

replicateM :: MonadParallel m => Int -> m a -> m [a]

Like replicateM, but executing the action multiple times in parallel.

replicateM_ :: MonadParallel m => Int -> m a -> m ()

Like replicateM_, but executing the action multiple times in parallel.

sequence :: MonadParallel m => [m a] -> m [a]

Like sequence, but executing the actions in parallel.

sequence_ :: MonadParallel m => [m a] -> m ()

Like sequence_, but executing the actions in parallel.