Associated Types

typeRep1 (Product f g) :: k ->TypeSource#

Methods

from1 ::Product f g a ->Rep1 (Product f g) aSource#

to1 ::Rep1 (Product f g) a ->Product f g aSource#

Methods

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

(>>) ::Product f g a ->Product f g b ->Product f g bSource#

return :: a ->Product f g aSource#

fail ::String ->Product f g aSource#

Methods

fmap :: (a -> b) ->Product f g a ->Product f g bSource#

(<$) :: a ->Product f g b ->Product f g aSource#

Methods

mfix :: (a ->Product f g a) ->Product f g aSource#

Methods

pure :: a ->Product f g aSource#

(<*>) ::Product f g (a -> b) ->Product f g a ->Product f g bSource#

liftA2 :: (a -> b -> c) ->Product f g a ->Product f g b ->Product f g cSource#

(*>) ::Product f g a ->Product f g b ->Product f g bSource#

(<*) ::Product f g a ->Product f g b ->Product f g aSource#

Methods

fold ::Monoid m =>Product f g m -> mSource#

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

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

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

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

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

foldr1 :: (a -> a -> a) ->Product f g a -> aSource#

foldl1 :: (a -> a -> a) ->Product f g a -> aSource#

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

null ::Product f g a ->BoolSource#

length ::Product f g a ->IntSource#

elem ::Eq a => a ->Product f g a ->BoolSource#

maximum ::Ord a =>Product f g a -> aSource#

minimum ::Ord a =>Product f g a -> aSource#

sum ::Num a =>Product f g a -> aSource#

product ::Num a =>Product f g a -> aSource#

Methods

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

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

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

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

Methods

mzero ::Product f g aSource#

mplus ::Product f g a ->Product f g a ->Product f g aSource#

Methods

empty ::Product f g aSource#

(<|>) ::Product f g a ->Product f g a ->Product f g aSource#

some ::Product f g a ->Product f g [a]Source#

many ::Product f g a ->Product f g [a]Source#

Methods

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

mzipWith :: (a -> b -> c) ->Product f g a ->Product f g b ->Product f g cSource#

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

Methods

liftShowsPrec :: (Int -> a ->ShowS) -> ([a] ->ShowS) ->Int ->Product f g a ->ShowSSource#

liftShowList :: (Int -> a ->ShowS) -> ([a] ->ShowS) -> [Product f g a] ->ShowSSource#

Methods

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

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

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

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

Methods

liftCompare :: (a -> b ->Ordering) ->Product f g a ->Product f g b ->OrderingSource#

Methods

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

Methods

contramap :: (a -> b) ->Product f g b ->Product f g aSource#

(>$) :: b ->Product f g b ->Product f g aSource#

Methods

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

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

Methods

gfoldl :: (forall d b.Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) ->Product f g a -> c (Product f g a)Source#

gunfold :: (forall b r.Data b => c (b -> r) -> c r) -> (forall r. r -> c r) ->Constr -> c (Product f g a)Source#

toConstr ::Product f g a ->ConstrSource#

dataTypeOf ::Product f g a ->DataTypeSource#

dataCast1 ::Typeable t => (forall d.Data d => c (t d)) ->Maybe (c (Product f g a))Source#

dataCast2 ::Typeable t => (forall d e. (Data d,Data e) => c (t d e)) ->Maybe (c (Product f g a))Source#

gmapT :: (forall b.Data b => b -> b) ->Product f g a ->Product f g aSource#

gmapQl :: (r -> r' -> r) -> r -> (forall d.Data d => d -> r') ->Product f g a -> rSource#

gmapQr :: (r' -> r -> r) -> r -> (forall d.Data d => d -> r') ->Product f g a -> rSource#

gmapQ :: (forall d.Data d => d -> u) ->Product f g a -> [u]Source#

gmapQi ::Int -> (forall d.Data d => d -> u) ->Product f g a -> uSource#

gmapM ::Monad m => (forall d.Data d => d -> m d) ->Product f g a -> m (Product f g a)Source#

gmapMp ::MonadPlus m => (forall d.Data d => d -> m d) ->Product f g a -> m (Product f g a)Source#

gmapMo ::MonadPlus m => (forall d.Data d => d -> m d) ->Product f g a -> m (Product f g a)Source#

Methods

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

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

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

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

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

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

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

Methods

readsPrec ::Int ->ReadS (Product f g a)Source#

readList ::ReadS [Product f g a]Source#

readPrec ::ReadPrec (Product f g a)Source#

readListPrec ::ReadPrec [Product f g a]Source#

Methods

showsPrec ::Int ->Product f g a ->ShowSSource#

show ::Product f g a ->StringSource#

showList :: [Product f g a] ->ShowSSource#

Associated Types

typeRep (Product f g a) ::Type ->TypeSource#

Methods

from ::Product f g a ->Rep (Product f g a) xSource#

to ::Rep (Product f g a) x ->Product f g aSource#