Data.Functor.Product

Методы

from1 :: forall (a :: k0). Product f g a -> Rep1 (Product f g) a Source

to1 :: forall (a :: k0). Rep1 (Product f g) a -> Product f g a Source

Методы

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

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

return :: a -> Product f g a Source

Методы

fmap :: (a -> b) -> Product f g a -> Product f g b Source

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

Методы

mfix :: (a -> Product f g a) -> Product f g a Source

Методы

pure :: a -> Product f g a Source

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

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

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

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

Методы

fold :: Monoid m => Product f g m -> m Исходный код

foldMap :: Monoid m => (a -> m) -> Product f g a -> m Исходный код

foldMap' :: Monoid m => (a -> m) -> Product f g a -> m Исходный код

foldr :: (a -> b -> b) -> b -> Product f g a -> b Исходный код

foldr' :: (a -> b -> b) -> b -> Product f g a -> b Исходный код

foldl :: (b -> a -> b) -> b -> Product f g a -> b Исходный код

foldl' :: (b -> a -> b) -> b -> Product f g a -> b Исходный код

foldr1 :: (a -> a -> a) -> Product f g a -> a Исходный код

foldl1 :: (a -> a -> a) -> Product f g a -> a Исходный код

toList :: Product f g a -> [a] Исходный код

null :: Product f g a -> Bool Исходный код

length :: Product f g a -> Int Исходный код

elem :: Eq a => a -> Product f g a -> Bool Исходный код

maximum :: Ord a => Product f g a -> a Исходный код

minimum :: Ord a => Product f g a -> a Исходный код

sum :: Num a => Product f g a -> a Исходный код

product :: Num a => Product f g a -> a Исходный код

Методы

traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) Исходный код

sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) Исходный код

mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) Исходный код

sequence :: Monad m => Product f g (m a) -> m (Product f g a) Исходный код

Методы

mzero :: Product f g a Исходный код

mplus :: Product f g a -> Product f g a -> Product f g a Исходный код

Методы

empty :: Product f g a Source

(<|>) :: Product f g a -> Product f g a -> Product f g a Source

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

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

Методы

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 c Source

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

Методы

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

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

Методы

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

Методы

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

Методы

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

Методы

contramap :: (a -> b) -> Product f g b -> Product f g a Source

(>$) :: b -> Product f g b -> Product f g a Source

Методы

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

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

Методы

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 -> Constr Source

dataTypeOf :: Product f g a -> DataType Source

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 a Source

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

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

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 -> u Source

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

Методы

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 Исходный код

Методы

readsPrec :: Int -> ReadS (Product f g a) Исходный код

readList :: ReadS [Product f g a] Исходный код

readPrec :: ReadPrec (Product f g a) Исходный код

readListPrec :: ReadPrec [Product f g a] Исходный код

Методы

showsPrec :: Int -> Product f g a -> ShowS Исходный код

show :: Product f g a -> String Исходный код

showList :: [Product f g a] -> ShowS Исходный код

Методы

from :: Product f g a -> Rep (Product f g a) x Исходный код

to :: Rep (Product f g a) x -> Product f g a Исходный код