Data.Functor.Product

Методы

from1 :: forall (a :: k). Product f g a -> Rep1 (Product f g) a Исходный код

to1 :: forall (a :: k). Rep1 (Product f g) a -> Product f g a Исходный код

Методы

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

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

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

toNonEmpty :: Product f g a -> Непустой список a Исходный код

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

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

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

Методы

liftCompare :: (a -> b -> Порядок) -> Product f g a -> Product f g b -> Порядок Исходный код

Методы

liftReadsPrec :: (Целое -> ReadS a) -> ReadS [a] -> Целое -> ReadS (Product f g a) Исходный код

liftReadList :: (Целое -> ReadS a) -> ReadS [a] -> ReadS [Product f g a] Исходный код

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Product f g a) Исходный код

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

Методы

liftShowsPrec :: (Целое -> a -> ShowS) -> ([a] -> ShowS) -> Целое -> Product f g a -> ShowS Исходный код

liftShowList :: (Целое -> a -> ShowS) -> ([a] -> ShowS) -> [Product f g a] -> ShowS Исходный код

Методы

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

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

Методы

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

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

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

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

Методы

pure :: a -> Product f g a Источник

(<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b Источник

liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c Источник

(*>) :: Product f g a -> Product f g b -> Product f g b Источник

(<*) :: Product f g a -> Product f g b -> Product f g a Источник

Методы

fmap :: (a -> b) -> Product f g a -> Product f g b Источник

(<$) :: a -> Product f g b -> Product f g a Источник

Методы

(>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b Источник

(>>) :: Product f g a -> Product f g b -> Product f g b Источник

return :: a -> Product f g a Источник

Методы

mzero :: Product f g a Источник

mplus :: Product f g a -> Product f g a -> Product f g a Источник

Методы

mfix :: (a -> Product f g a) -> Product f g a Источник

Методы

mzip :: Product f g a -> Product f g b -> Product f g (a, b) Источник

mzipWith :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c Источник

munzip :: Product f g (a, b) -> (Product f g a, Product f g b) Источник

Методы

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

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

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

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

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

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

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

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

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

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

null :: Product f g a -> Bool Source

length :: Product f g a -> Int Source

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

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

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

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

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

Методы

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

Краткое описание методов

mempty :: Product f g a Source

mappend :: Product f g a -> Product f g a -> Product f g a Source

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

Краткое описание методов

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

sconcat :: NonEmpty (Product f g a) -> Product f g a Source

stimes :: Integral b => b -> Product f g a -> Product f g a 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

Методы

from :: Product f g a -> Rep (Product f g a) x Source

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

Методы

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

Методы

showsPrec :: Int -> Product f g a -> ShowS Source

show :: Product f g a -> String Source

showList :: [Product f g a] -> ShowS Source

Методы

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

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

Методы

compare :: Product f g a -> Product f g a -> Порядок Исходный код

(<) :: Product f g a -> Product f g a -> Булево Исходный код

(<=) :: Product f g a -> Product f g a -> Булево Исходный код

(>) :: Product f g a -> Product f g a -> Булево Исходный код

(>=) :: Product f g a -> Product f g a -> Булево Исходный код

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