Data.Semigroup.Bitraversable

Documentation

class (Bifoldable1 t, Bitraversable t) => Bitraversable1 t where

Minimal complete definition

bitraverse1 | bisequence1

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> t a c -> f (t b d)

bisequence1 :: Apply f => t (f a) (f b) -> f (t a b)

Instances

Bitraversable1 Either

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Either a c -> f (Either b d)

bisequence1 :: Apply f => Either (f a) (f b) -> f (Either a b)

Bitraversable1 Arg

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Arg a c -> f (Arg b d)

bisequence1 :: Apply f => Arg (f a) (f b) -> f (Arg a b)

Bitraversable1 (,)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (a, c) -> f (b, d)

bisequence1 :: Apply f => (f a, f b) -> f (a, b)

Bitraversable1 (Const :: Type -> TYPE LiftedRep -> Type)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Const a c -> f (Const b d)

bisequence1 :: Apply f => Const (f a) (f b) -> f (Const a b)

Bitraversable1 (Tagged :: TYPE LiftedRep -> Type -> Type)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Tagged a c -> f (Tagged b d)

bisequence1 :: Apply f => Tagged (f a) (f b) -> f (Tagged a b)

Bitraversable1 ((,,) x)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (x, a, c) -> f (x, b, d)

bisequence1 :: Apply f => (x, f a, f b) -> f (x, a, b)

Bitraversable1 ((,,,) x y)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (x, y, a, c) -> f (x, y, b, d)

bisequence1 :: Apply f => (x, y, f a, f b) -> f (x, y, a, b)

Traversable1 f => Bitraversable1 (Clown f :: TYPE LiftedRep -> TYPE LiftedRep -> Type)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f0 => (a -> f0 b) -> (c -> f0 d) -> Clown f a c -> f0 (Clown f b d)

bisequence1 :: Apply f0 => Clown f (f0 a) (f0 b) -> f0 (Clown f a b)

Bitraversable1 p => Bitraversable1 (Flip p)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Flip p a c -> f (Flip p b d)

bisequence1 :: Apply f => Flip p (f a) (f b) -> f (Flip p a b)

Traversable1 g => Bitraversable1 (Joker g :: TYPE LiftedRep -> TYPE LiftedRep -> Type)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Joker g a c -> f (Joker g b d)

bisequence1 :: Apply f => Joker g (f a) (f b) -> f (Joker g a b)

Bitraversable1 p => Bitraversable1 (WrappedBifunctor p)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> WrappedBifunctor p a c -> f (WrappedBifunctor p b d)

bisequence1 :: Apply f => WrappedBifunctor p (f a) (f b) -> f (WrappedBifunctor p a b)

Bitraversable1 ((,,,,) x y z)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (x, y, z, a, c) -> f (x, y, z, b, d)

bisequence1 :: Apply f => (x, y, z, f a, f b) -> f (x, y, z, a, b)

(Bitraversable1 f, Bitraversable1 g) => Bitraversable1 (Product f g)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f0 => (a -> f0 b) -> (c -> f0 d) -> Product f g a c -> f0 (Product f g b d)

bisequence1 :: Apply f0 => Product f g (f0 a) (f0 b) -> f0 (Product f g a b)

(Traversable1 f, Bitraversable1 p) => Bitraversable1 (Tannen f p)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f0 => (a -> f0 b) -> (c -> f0 d) -> Tannen f p a c -> f0 (Tannen f p b d)

bisequence1 :: Apply f0 => Tannen f p (f0 a) (f0 b) -> f0 (Tannen f p a b)

(Bitraversable1 p, Traversable1 f, Traversable1 g) => Bitraversable1 (Biff p f g)

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f0 => (a -> f0 b) -> (c -> f0 d) -> Biff p f g a c -> f0 (Biff p f g b d)

bisequence1 :: Apply f0 => Biff p f g (f0 a) (f0 b) -> f0 (Biff p f g a b)

bifoldMap1Default :: (Bitraversable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m