Control.Parallel

parTraverse :: forall b a t m f. Parallel f m => Traversable t => (a -> m b) -> t a -> m (t b)

Traverse a collection in parallel.

parTraverse_ :: forall b a t m f. Parallel f m => Foldable t => (a -> m b) -> t a -> m Unit

Traverse a collection in parallel, discarding any results.

parSequence :: forall f m t a. Parallel f m => Traversable t => t (m a) -> m (t a)

parSequence_ :: forall f m t a. Parallel f m => Foldable t => t (m a) -> m Unit

newtype ParCont m a

The ParCont type constructor provides an Applicative instance based on ContT Unit m, which waits for multiple continuations to be resumed simultaneously.

ParCont sections of code can be embedded in sequential code by using the parallel and sequential functions:

loadModel :: ContT Unit (Eff (ajax :: AJAX)) Model
loadModel = do
  token <- authenticate
  sequential $
    Model <$> parallel (get "/products/popular/" token)
          <*> parallel (get "/categories/all" token)

Constructors

• ParCont (ContT Unit m a)

Instances

• Newtype (ParCont m a) _
• (MonadEff eff m) => Functor (ParCont m)
• (MonadEff eff m) => Apply (ParCont m)
• (MonadEff eff m) => Applicative (ParCont m)
• (MonadEff eff m) => Alt (ParCont m)
• (MonadEff eff m) => Plus (ParCont m)
• (MonadEff eff m) => Alternative (ParCont m)
• (MonadEff eff m) => Parallel (ParCont m) (ContT Unit m)

class (Monad m, Applicative f) <= Parallel f m | m -> f, f -> m where

The Parallel class abstracts over monads which support parallel composition via some related Applicative.

Members

• parallel :: m ~> f
• sequential :: f ~> m

Instances

• (Parallel f m) => Parallel (Compose f (Either e)) (ExceptT e m)
• (Parallel f m) => Parallel (ReaderT e f) (ReaderT e m)
• (Monoid w, Parallel f m) => Parallel (WriterT w f) (WriterT w m)
• (Parallel f m) => Parallel (Compose f Maybe) (MaybeT m)
• (MonadEff eff m) => Parallel (ParCont m) (ContT Unit m)