bifunctors-5.6.2: Bifunctors

Copyright | (C) 2008-2016 Jesse Selover Edward Kmett
License | BSD-style (see the file LICENSE)
Maintainer | Edward Kmett <ekmett@gmail.com>
Stability | provisional
Portability | portable
Safe Haskell | Safe
Language | Haskell2010

Data.Bifunctor.Product

Description

The product of two bifunctors.

Synopsis

- data Product f g a b = Pair (f a b) (g a b)

# Documentation

data Product f g a b Source #

Form the product of two bifunctors

Constructors

Pair (f a b) (g a b) |

#### Instances

Instances details

BifunctorFunctor (Product p :: (k2 -> k3 -> Type) -> k2 -> k3 -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bifmap :: forall (p0 :: k -> k1 -> Type) (q :: k -> k1 -> Type). (p0 :-> q) -> Product p p0 :-> Product p q Source #
BifunctorComonad (Product p :: (k -> k1 -> Type) -> k -> k1 -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Methods biextract :: forall (p0 :: k0 -> k10 -> Type). Product p p0 :-> p0 Source # biextend :: forall (p0 :: k0 -> k10 -> Type) (q :: k0 -> k10 -> Type). (Product p p0 :-> q) -> Product p p0 :-> Product p q Source # biduplicate :: forall (p0 :: k0 -> k10 -> Type). Product p p0 :-> Product p (Product p p0) Source #
(Category p, Category q) => Category (Product p q :: k -> k -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Methods id :: forall (a :: k0). Product p q a a Source # (.) :: forall (b :: k0) (c :: k0) (a :: k0). Product p q b c -> Product p q a b -> Product p q a c Source #
Generic1 (Product f g a :: k1 -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Associated Types type Rep1 (Product f g a) :: k -> Type Source # Methods from1 :: forall (a0 :: k). Product f g a a0 -> Rep1 (Product f g a) a0 Source # to1 :: forall (a0 :: k). Rep1 (Product f g a) a0 -> Product f g a a0 Source #
(Swap p, Swap q) => Swap (Product p q) Source # | Since: 5.6.1
Instance details Defined in Data.Bifunctor.Product Methods swap :: Product p q a b -> Product p q b a Source #
(Arrow p, Arrow q) => Arrow (Product p q) Source # |
Instance details Defined in Data.Bifunctor.Product Methods arr :: (b -> c) -> Product p q b c Source # first :: Product p q b c -> Product p q (b, d) (c, d) Source # second :: Product p q b c -> Product p q (d, b) (d, c) Source # (***) :: Product p q b c -> Product p q b' c' -> Product p q (b, b') (c, c') Source # (&&&) :: Product p q b c -> Product p q b c' -> Product p q b (c, c') Source #
(ArrowChoice p, ArrowChoice q) => ArrowChoice (Product p q) Source # |
Instance details Defined in Data.Bifunctor.Product Methods left :: Product p q b c -> Product p q (Either b d) (Either c d) Source # right :: Product p q b c -> Product p q (Either d b) (Either d c) Source # (+++) :: Product p q b c -> Product p q b' c' -> Product p q (Either b b') (Either c c') Source # (|||) :: Product p q b d -> Product p q c d -> Product p q (Either b c) d Source #
(ArrowLoop p, ArrowLoop q) => ArrowLoop (Product p q) Source # |
Instance details Defined in Data.Bifunctor.Product Methods loop :: Product p q (b, d) (c, d) -> Product p q b c Source #
(ArrowPlus p, ArrowPlus q) => ArrowPlus (Product p q) Source # |
Instance details Defined in Data.Bifunctor.Product Methods (<+>) :: Product p q b c -> Product p q b c -> Product p q b c Source #
(ArrowZero p, ArrowZero q) => ArrowZero (Product p q) Source # |
Instance details Defined in Data.Bifunctor.Product Methods zeroArrow :: Product p q b c Source #
(Bifoldable f, Bifoldable g) => Bifoldable (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bifold :: Monoid m => Product f g m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Product f g a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Product f g a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Product f g a b -> c Source #
(Bifoldable1 f, Bifoldable1 g) => Bifoldable1 (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bifold1 :: Semigroup m => Product f g m m -> m Source # bifoldMap1 :: Semigroup m => (a -> m) -> (b -> m) -> Product f g a b -> m Source #
(Bifunctor f, Bifunctor g) => Bifunctor (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bimap :: (a -> b) -> (c -> d) -> Product f g a c -> Product f g b d Source # first :: (a -> b) -> Product f g a c -> Product f g b c Source # second :: (b -> c) -> Product f g a b -> Product f g a c Source #
(Bitraversable f, Bitraversable g) => Bitraversable (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bitraverse :: Applicative f0 => (a -> f0 c) -> (b -> f0 d) -> Product f g a b -> f0 (Product f g c d) Source #
(Eq2 f, Eq2 g) => Eq2 (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Product f g a c -> Product f g b d -> Bool Source #
(Ord2 f, Ord2 g) => Ord2 (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Product f g a c -> Product f g b d -> Ordering Source #
(Read2 f, Read2 g) => Read2 (Product f g) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Product f g a b) Source #

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Product f g a b] Source #

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Product f g a b) Source #

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Product f g a b] Source #

(Show2 f, Show2 g) => Show2 (Product f g) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Product f g a b -> ShowS Source # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Product f g a b] -> ShowS Source #
(Biapplicative f, Biapplicative g) => Biapplicative (Product f g) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

bipure :: a -> b -> Product f g a b Source #

(<<*>>) :: Product f g (a -> b) (c -> d) -> Product f g a c -> Product f g b d Source #

biliftA2 :: (a -> b -> c) -> (d -> e -> f0) -> Product f g a d -> Product f g b e -> Product f g c f0 Source #

(*>>) :: Product f g a b -> Product f g c d -> Product f g c d Source #

(<<*) :: Product f g a b -> Product f g c d -> Product f g a b Source #

(Foldable (f a), Foldable (g a)) => Foldable (Product f g a) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

fold :: Monoid m => Product f g a m -> m Source #

foldMap :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source #

foldMap' :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source #

foldr :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source #

foldr' :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source #

foldl :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source #

foldl' :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source #

foldr1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source #

foldl1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source #

toList :: Product f g a a0 -> [a0] Source #

null :: Product f g a a0 -> Bool Source #

length :: Product f g a a0 -> Int Source #

elem :: Eq a0 => a0 -> Product f g a a0 -> Bool Source #

maximum :: Ord a0 => Product f g a a0 -> a0 Source #

minimum :: Ord a0 => Product f g a a0 -> a0 Source #

sum :: Num a0 => Product f g a a0 -> a0 Source #

product :: Num a0 => Product f g a a0 -> a0 Source #

(Eq2 f, Eq2 g, Eq a) => Eq1 (Product f g a) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftEq :: (a0 -> b -> Bool) -> Product f g a a0 -> Product f g a b -> Bool Source #
(Ord2 f, Ord2 g, Ord a) => Ord1 (Product f g a) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftCompare :: (a0 -> b -> Ordering) -> Product f g a a0 -> Product f g a b -> Ordering Source #
(Read2 f, Read2 g, Read a) => Read1 (Product f g a) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Product f g a a0) Source #

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Product f g a a0] Source #

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Product f g a a0) Source #

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Product f g a a0] Source #

(Show2 f, Show2 g, Show a) => Show1 (Product f g a) Source # |
Instance details Defined in Data.Bifunctor.Product Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Product f g a a0 -> ShowS Source # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Product f g a a0] -> ShowS Source #
(Traversable (f a), Traversable (g a)) => Traversable (Product f g a) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Product f g a a0 -> f0 (Product f g a b) Source #

sequenceA :: Applicative f0 => Product f g a (f0 a0) -> f0 (Product f g a a0) Source #

mapM :: Monad m => (a0 -> m b) -> Product f g a a0 -> m (Product f g a b) Source #

sequence :: Monad m => Product f g a (m a0) -> m (Product f g a a0) Source #

(Functor (f a), Functor (g a)) => Functor (Product f g a) Source # |
Instance details Defined in Data.Bifunctor.Product Methods fmap :: (a0 -> b) -> Product f g a a0 -> Product f g a b Source # (<$) :: a0 -> Product f g a b -> Product f g a a0 Source #
Generic (Product f g a b) Source # |
Instance details Defined in Data.Bifunctor.Product Associated Types type Rep (Product f g a b) :: Type -> Type Source # Methods from :: Product f g a b -> Rep (Product f g a b) x Source # to :: Rep (Product f g a b) x -> Product f g a b Source #
(Read (f a b), Read (g a b)) => Read (Product f g a b) Source # |
Instance details Defined in Data.Bifunctor.Product Methods readsPrec :: Int -> ReadS (Product f g a b) Source # readList :: ReadS [Product f g a b] Source # readPrec :: ReadPrec (Product f g a b) Source # readListPrec :: ReadPrec [Product f g a b] Source #
(Show (f a b), Show (g a b)) => Show (Product f g a b) Source # |
Instance details Defined in Data.Bifunctor.Product Methods showsPrec :: Int -> Product f g a b -> ShowS Source # show :: Product f g a b -> String Source # showList :: [Product f g a b] -> ShowS Source #
(Eq (f a b), Eq (g a b)) => Eq (Product f g a b) Source # |
Instance details Defined in Data.Bifunctor.Product Methods (==) :: Product f g a b -> Product f g a b -> Bool Source # (/=) :: Product f g a b -> Product f g a b -> Bool Source #
(Ord (f a b), Ord (g a b)) => Ord (Product f g a b) Source # |

Instance details

Defined in Data.Bifunctor.Product

Methods

compare :: Product f g a b -> Product f g a b -> Ordering Source #

(<) :: Product f g a b -> Product f g a b -> Bool Source #

(<=) :: Product f g a b -> Product f g a b -> Bool Source #

(>) :: Product f g a b -> Product f g a b -> Bool Source #

(>=) :: Product f g a b -> Product f g a b -> Bool Source #

max :: Product f g a b -> Product f g a b -> Product f g a b Source #

min :: Product f g a b -> Product f g a b -> Product f g a b Source #

type Rep1 (Product f g a :: k1 -> Type) Source # |

Instance details

Defined in Data.Bifunctor.Product

type Rep1 (Product f g a :: k1 -> Type) = D1 ('MetaData "Product" "Data.Bifunctor.Product" "bifunctors-5.6.2-KsAAHBmzKwpDPdrUe1LfsZ" 'False) (C1 ('MetaCons "Pair" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (f a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 (g a))))

type Rep (Product f g a b) Source # |

Instance details

Defined in Data.Bifunctor.Product

type Rep (Product f g a b) = D1 ('MetaData "Product" "Data.Bifunctor.Product" "bifunctors-5.6.2-KsAAHBmzKwpDPdrUe1LfsZ" 'False) (C1 ('MetaCons "Pair" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a b)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a b))))