Control.ParDual.Class

You can find here functions such as parMap2, parTraverse, parBitraverse, etc.

Documentation

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

The ParDual class abstracts over Monads that have a dual Applicative instance that acts in a different useful way.

E.g., the duality between Either and Validation. As well as the duality between IO and Concurrently.

It can also be seen as an isomorphism defined at the class level.

Minimal complete definition

parallel, sequential

Methods

parallel :: forall a. m a -> f a

A natural transformation from m to f

sequential :: forall a. f a -> m a

A natural transformation from f to m

parMap2 :: m a0 -> m a1 -> (a0 -> a1 -> a) -> m a

It is the analogue to using <$> and <*> for the dual Applicative of the current Monad, as defined by the relationship defined by the ParDual instance.

parMap3 :: m a0 -> m a1 -> m a2 -> (a0 -> a1 -> a2 -> a) -> m a

It is the analogue to using <$> and <*> for the dual Applicative of the current Monad, as defined by the relationship defined by the ParDual instance.

parMap4 :: m a0 -> m a1 -> m a2 -> m a3 -> (a0 -> a1 -> a2 -> a3 -> a) -> m a

It is the analogue to using <$> and <*> for the dual Applicative of the current Monad, as defined by the relationship defined by the ParDual instance.

parMap5 :: m a0 -> m a1 -> m a2 -> m a3 -> m a4 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a) -> m a

It is the analogue to using <$> and <*> for the dual Applicative of the current Monad, as defined by the relationship defined by the ParDual instance.

parMap6 :: m a0 -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a5 -> a) -> m a

It is the analogue to using <$> and <*> for the dual Applicative of the current Monad, as defined by the relationship defined by the ParDual instance.

parTraverse :: Traversable t => (a -> m b) -> t a -> m (t b)

Same as traverse, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parTraverse_ :: Traversable t => (a -> m b) -> t a -> m ()

Same as traverse_, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parSequence :: Traversable t => t (m a) -> m (t a)

Same as sequence, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parSequence_ :: Traversable t => t (m a) -> m ()

Same as sequence_, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parProductR :: m a -> m b -> m b

Same as *>, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parProductL :: m a -> m b -> m a

Same as <*, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parBitraverse :: Bitraversable t => (a -> m c) -> (b -> m d) -> t a b -> m (t c d)

Same as bitraverse, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

parBisequence :: Bitraversable t => t (m a) (m b) -> m (t a b)

Same as bisequence, except it uses the dual Applicative of the current Monad, as defined by the ParDual relationship.

Instances

ParDual Concurrently IO

Defined in Control.ParDual.Class

Methods

parallel :: IO a -> Concurrently a

sequential :: Concurrently a -> IO a

parMap2 :: IO a0 -> IO a1 -> (a0 -> a1 -> a) -> IO a

parMap3 :: IO a0 -> IO a1 -> IO a2 -> (a0 -> a1 -> a2 -> a) -> IO a

parMap4 :: IO a0 -> IO a1 -> IO a2 -> IO a3 -> (a0 -> a1 -> a2 -> a3 -> a) -> IO a

parMap5 :: IO a0 -> IO a1 -> IO a2 -> IO a3 -> IO a4 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a) -> IO a

parMap6 :: IO a0 -> IO a1 -> IO a2 -> IO a3 -> IO a4 -> IO a5 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a5 -> a) -> IO a

parTraverse :: Traversable t => (a -> IO b) -> t a -> IO (t b)

parTraverse_ :: Traversable t => (a -> IO b) -> t a -> IO ()

parSequence :: Traversable t => t (IO a) -> IO (t a)

parSequence_ :: Traversable t => t (IO a) -> IO ()

parProductR :: IO a -> IO b -> IO b

parProductL :: IO a -> IO b -> IO a

parBitraverse :: Bitraversable t => (a -> IO c) -> (b -> IO d) -> t a b -> IO (t c d)

parBisequence :: Bitraversable t => t (IO a) (IO b) -> IO (t a b)

ParDual ZipList []

Defined in Control.ParDual.Class

Methods

parallel :: [a] -> ZipList a

sequential :: ZipList a -> [a]

parMap2 :: [a0] -> [a1] -> (a0 -> a1 -> a) -> [a]

parMap3 :: [a0] -> [a1] -> [a2] -> (a0 -> a1 -> a2 -> a) -> [a]

parMap4 :: [a0] -> [a1] -> [a2] -> [a3] -> (a0 -> a1 -> a2 -> a3 -> a) -> [a]

parMap5 :: [a0] -> [a1] -> [a2] -> [a3] -> [a4] -> (a0 -> a1 -> a2 -> a3 -> a4 -> a) -> [a]

parMap6 :: [a0] -> [a1] -> [a2] -> [a3] -> [a4] -> [a5] -> (a0 -> a1 -> a2 -> a3 -> a4 -> a5 -> a) -> [a]

parTraverse :: Traversable t => (a -> [b]) -> t a -> [t b]

parTraverse_ :: Traversable t => (a -> [b]) -> t a -> [()]

parSequence :: Traversable t => t [a] -> [t a]

parSequence_ :: Traversable t => t [a] -> [()]

parProductR :: [a] -> [b] -> [b]

parProductL :: [a] -> [b] -> [a]

parBitraverse :: Bitraversable t => (a -> [c]) -> (b -> [d]) -> t a b -> [t c d]

parBisequence :: Bitraversable t => t [a] [b] -> [t a b]

Semigroup e => ParDual (Validation e) (Either e)

Defined in Control.ParDual.Class

Methods

parallel :: Either e a -> Validation e a

sequential :: Validation e a -> Either e a

parMap2 :: Either e a0 -> Either e a1 -> (a0 -> a1 -> a) -> Either e a

parMap3 :: Either e a0 -> Either e a1 -> Either e a2 -> (a0 -> a1 -> a2 -> a) -> Either e a

parMap4 :: Either e a0 -> Either e a1 -> Either e a2 -> Either e a3 -> (a0 -> a1 -> a2 -> a3 -> a) -> Either e a

parMap5 :: Either e a0 -> Either e a1 -> Either e a2 -> Either e a3 -> Either e a4 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a) -> Either e a

parMap6 :: Either e a0 -> Either e a1 -> Either e a2 -> Either e a3 -> Either e a4 -> Either e a5 -> (a0 -> a1 -> a2 -> a3 -> a4 -> a5 -> a) -> Either e a

parTraverse :: Traversable t => (a -> Either e b) -> t a -> Either e (t b)

parTraverse_ :: Traversable t => (a -> Either e b) -> t a -> Either e ()

parSequence :: Traversable t => t (Either e a) -> Either e (t a)

parSequence_ :: Traversable t => t (Either e a) -> Either e ()

parProductR :: Either e a -> Either e b -> Either e b

parProductL :: Either e a -> Either e b -> Either e a

parBitraverse :: Bitraversable t => (a -> Either e c) -> (b -> Either e d) -> t a b -> Either e (t c d)

parBisequence :: Bitraversable t => t (Either e a) (Either e b) -> Either e (t a b)