Data.Bitraversable

Documentation

class (Bifunctor t, Bifoldable t) => Bitraversable t where

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)

bisequenceA :: Applicative f => t (f a) (f b) -> f (t a b)

bimapM :: Monad m => (a -> m c) -> (b -> m d) -> t a b -> m (t c d)

bisequence :: Monad m => t (m a) (m b) -> m (t a b)

Instances

Bitraversable Either

Bitraversable (,)

Bitraversable Const

Bitraversable ((,,) x)

Bitraversable (Tagged *)

Traversable f => Bitraversable (Clown f)

Bitraversable p => Bitraversable (Flip p)

Traversable g => Bitraversable (Joker g)

Bitraversable p => Bitraversable (WrappedBifunctor p)

Bitraversable ((,,,) x y)

Bitraversable ((,,,,) x y z)

bifor :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)

biforM :: (Bitraversable t, Monad m) => t a b -> (a -> m c) -> (b -> m d) -> m (t c d)

bimapAccumL :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)

bimapAccumR :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)

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

bifoldMapDefault :: (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m