Copyright | (C) 2011-2015 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell98 |
Data.Semigroup.Bitraversable
Description
Documentation
class (Bifoldable1 t, Bitraversable t) => Bitraversable1 t where Source #
Minimal complete definition
Methods
bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> t a c -> f (t b d) Source #
bisequence1 :: Apply f => t (f a) (f b) -> f (t a b) Source #
Instances
Bitraversable1 Either Source # | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Either a c -> f (Either b d) Source # bisequence1 :: Apply f => Either (f a) (f b) -> f (Either a b) Source # | |
Bitraversable1 (,) Source # | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (a, c) -> f (b, d) Source # bisequence1 :: Apply f => (f a, f b) -> f (a, b) Source # | |
Bitraversable1 Arg Source # | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Arg a c -> f (Arg b d) Source # bisequence1 :: Apply f => Arg (f a) (f b) -> f (Arg a b) Source # | |
Bitraversable1 ((,,) x) Source # | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> (x, a, c) -> f (x, b, d) Source # bisequence1 :: Apply f => (x, f a, f b) -> f (x, a, b) Source # | |
Bitraversable1 (Const :: Type -> Type -> Type) Source # | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Const a c -> f (Const b d) Source # bisequence1 :: Apply f => Const (f a) (f b) -> f (Const a b) Source # | |
Bitraversable1 (Tagged :: Type -> Type -> Type) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
Bitraversable1 ((,,,) x y) Source # | |
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) Source # bisequence1 :: Apply f => (x, y, f a, f b) -> f (x, y, a, b) Source # | |
Bitraversable1 ((,,,,) x y z) Source # | |
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) Source # bisequence1 :: Apply f => (x, y, z, f a, f b) -> f (x, y, z, a, b) Source # | |
Bitraversable1 p => Bitraversable1 (WrappedBifunctor p) Source # | |
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) Source # bisequence1 :: Apply f => WrappedBifunctor p (f a) (f b) -> f (WrappedBifunctor p a b) Source # | |
Traversable1 g => Bitraversable1 (Joker g :: Type -> Type -> Type) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
Bitraversable1 p => Bitraversable1 (Flip p) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
Traversable1 f => Bitraversable1 (Clown f :: Type -> Type -> Type) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
(Bitraversable1 f, Bitraversable1 g) => Bitraversable1 (Product f g) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
(Traversable1 f, Bitraversable1 p) => Bitraversable1 (Tannen f p) Source # | |
Defined in Data.Semigroup.Traversable.Class | |
(Bitraversable1 p, Traversable1 f, Traversable1 g) => Bitraversable1 (Biff p f g) Source # | |
Defined in Data.Semigroup.Traversable.Class |
bifoldMap1Default :: (Bitraversable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m Source #