bifunctors-5.5.4: 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 | Haskell98

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

BifunctorFunctor (Product p :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Methods bifmap :: (p0 :-> q) -> Product p p0 :-> Product p q Source #
BifunctorComonad (Product p :: (k1 -> k2 -> Type) -> k1 -> k2 -> Type) Source # |
Instance details Defined in Data.Bifunctor.Product Methods biextract :: Product p p0 :-> p0 Source # biextend :: (Product p p0 :-> q) -> Product p p0 :-> Product p q Source # biduplicate :: Product p p0 :-> Product p (Product p p0) 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 :: Product f g a a0 -> Rep1 (Product f g a) a0 Source # to1 :: Rep1 (Product f g a) a0 -> Product f g a a0 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 #
(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 #
(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 #
(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 #

(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 #

(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 #
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 #
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.5.4-1UxEjHcnv9b1H1UnEF7RRc" 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.5.4-1UxEjHcnv9b1H1UnEF7RRc" 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))))