Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
data Product (f :: k -> *) (g :: k -> *) (a :: k) :: forall k. (k -> *) -> (k -> *) -> k -> * #
Lifted product of functors.
Pair (f a) (g a) |
Instances
Generic1 (Product f g :: k -> *) | |
MFunctor (Product f :: (* -> *) -> * -> *) | |
(Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
(Functor f, Functor g) => Functor (Product f g) | Since: base-4.9.0.0 |
(MonadFix f, MonadFix g) => MonadFix (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product fold :: Monoid m => Product f g m -> 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 # | |
(Traversable f, Traversable g) => Traversable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Alternative f, Alternative g) => Alternative (Product f g) | Since: base-4.9.0.0 |
(Distributive f, Distributive g) => Distributive (Product f g) | |
Defined in Data.Distributive | |
(Contravariant f, Contravariant g) => Contravariant (Product f g) | |
(Representable f, Representable g) => Representable (Product f g) | |
(ToJSON1 f, ToJSON1 g) => ToJSON1 (Product f g) | |
Defined in Data.Aeson.Types.ToJSON liftToJSON :: (a -> Value) -> ([a] -> Value) -> Product f g a -> Value # liftToJSONList :: (a -> Value) -> ([a] -> Value) -> [Product f g a] -> Value # liftToEncoding :: (a -> Encoding) -> ([a] -> Encoding) -> Product f g a -> Encoding # liftToEncodingList :: (a -> Encoding) -> ([a] -> Encoding) -> [Product f g a] -> Encoding # | |
(FromJSON1 f, FromJSON1 g) => FromJSON1 (Product f g) | |
(MonadPlus f, MonadPlus g) => MonadPlus (Product f g) | Since: base-4.9.0.0 |
(Eq1 f, Eq1 g) => Eq1 (Product f g) | Since: base-4.9.0.0 |
(Ord1 f, Ord1 g) => Ord1 (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Read1 f, Read1 g) => Read1 (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Product f g a) # liftReadList :: (Int -> 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] # | |
(Show1 f, Show1 g) => Show1 (Product f g) | Since: base-4.9.0.0 |
(MonadZip f, MonadZip g) => MonadZip (Product f g) | Since: base-4.9.0.0 |
(Functor f, Functor g, Compactable f, Compactable g) => Compactable (Product f g) | |
Defined in Control.Compactable compact :: Product f g (Maybe a) -> Product f g a # separate :: Product f g (Either l r) -> (Product f g l, Product f g r) # filter :: (a -> Bool) -> Product f g a -> Product f g a # partition :: (a -> Bool) -> Product f g a -> (Product f g a, Product f g a) # fmapMaybe :: Functor (Product f g) => (a -> Maybe b) -> Product f g a -> Product f g b # fmapEither :: Functor (Product f g) => (a -> Either l r) -> Product f g a -> (Product f g l, Product f g r) # applyMaybe :: Applicative (Product f g) => Product f g (a -> Maybe b) -> Product f g a -> Product f g b # applyEither :: Applicative (Product f g) => Product f g (a -> Either l r) -> Product f g a -> (Product f g l, Product f g r) # bindMaybe :: Monad (Product f g) => Product f g a -> (a -> Product f g (Maybe b)) -> Product f g b # bindEither :: Monad (Product f g) => Product f g a -> (a -> Product f g (Either l r)) -> (Product f g l, Product f g r) # traverseMaybe :: (Applicative g0, Traversable (Product f g)) => (a -> g0 (Maybe b)) -> Product f g a -> g0 (Product f g b) # traverseEither :: (Applicative g0, Traversable (Product f g)) => (a -> g0 (Either l r)) -> Product f g a -> g0 (Product f g l, Product f g r) # | |
(Compactable f, Alternative f, Monad f, Compactable g, Alternative g, Monad g) => CompactFold (Product f g) | |
Defined in Control.Compactable compactFold :: Foldable g0 => Product f g (g0 a) -> Product f g a # separateFold :: Bifoldable g0 => Product f g (g0 a b) -> (Product f g a, Product f g b) # fmapFold :: (Functor (Product f g), Foldable g0) => (a -> g0 b) -> Product f g a -> Product f g b # fmapBifold :: (Functor (Product f g), Bifoldable g0) => (a -> g0 l r) -> Product f g a -> (Product f g l, Product f g r) # applyFold :: (Applicative (Product f g), Foldable g0) => Product f g (a -> g0 b) -> Product f g a -> Product f g b # applyBifold :: (Applicative (Product f g), Bifoldable g0) => Product f g (a -> g0 l r) -> Product f g a -> (Product f g l, Product f g r) # bindFold :: (Monad (Product f g), Foldable g0) => Product f g a -> (a -> Product f g (g0 b)) -> Product f g b # bindBifold :: (Monad (Product f g), Bifoldable g0) => Product f g a -> (a -> Product f g (g0 l r)) -> (Product f g l, Product f g r) # traverseFold :: (Applicative h, Foldable g0, Traversable (Product f g)) => (a -> h (g0 b)) -> Product f g a -> h (Product f g b) # traverseBifold :: (Applicative h, Bifoldable g0, Traversable (Product f g)) => (a -> h (g0 l r)) -> Product f g a -> h (Product f g l, Product f g r) # | |
(Divisible f, Divisible g) => Divisible (Product f g) | |
(Decidable f, Decidable g) => Decidable (Product f g) | |
(NFData1 f, NFData1 g) => NFData1 (Product f g) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
(Hashable1 f, Hashable1 g) => Hashable1 (Product f g) | |
Defined in Data.Hashable.Class | |
(Apply f, Apply g) => Apply (Product f g) | |
(Traversable1 f, Traversable1 g) => Traversable1 (Product f g) | |
(Pointed p, Pointed q) => Pointed (Product p q) | |
Defined in Data.Pointed | |
(Foldable1 f, Foldable1 g) => Foldable1 (Product f g) | |
(Plus f, Plus g) => Plus (Product f g) | |
Defined in Data.Functor.Plus | |
(Alt f, Alt g) => Alt (Product f g) | |
(Bind f, Bind g) => Bind (Product f g) | |
(Eq1 f, Eq1 g, Eq a) => Eq (Product f g a) | Since: base-4.9.0.0 |
(Typeable a, Typeable f, Typeable g, Typeable k, Data (f a), Data (g a)) => Data (Product f g a) | |
Defined in Data.Functor.Product 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) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Product f g a) # toConstr :: Product f g a -> Constr # dataTypeOf :: Product f g a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Product f g a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Product f g a)) # gmapT :: (forall b. Data b => b -> b) -> Product f g a -> Product f g a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Product f g a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Product f g a -> r # gmapQ :: (forall d. Data d => d -> u) -> Product f g a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Product f g a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Product f g a -> m (Product f g a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Product f g a -> m (Product f g a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Product f g a -> m (Product f g a) # | |
(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product 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 # | |
(Read1 f, Read1 g, Read a) => Read (Product f g a) | Since: base-4.9.0.0 |
(Show1 f, Show1 g, Show a) => Show (Product f g a) | Since: base-4.9.0.0 |
Generic (Product f g a) | |
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Product f g a) | |
Defined in Data.Hashable.Class | |
(ToJSON1 f, ToJSON1 g, ToJSON a) => ToJSON (Product f g a) | |
Defined in Data.Aeson.Types.ToJSON | |
(FromJSON1 f, FromJSON1 g, FromJSON a) => FromJSON (Product f g a) | |
(NFData1 f, NFData1 g, NFData a) => NFData (Product f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
Field1 (Product f g a) (Product f' g a) (f a) (f' a) | |
Field2 (Product f g a) (Product f g' a) (g a) (g' a) | |
type Rep1 (Product f g :: k -> *) | |
Defined in Data.Functor.Product type Rep1 (Product f g :: k -> *) = D1 (MetaData "Product" "Data.Functor.Product" "base" False) (C1 (MetaCons "Pair" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 f) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 g))) | |
type Rep (Product f g) | |
type Rep (Product f g a) | |
Defined in Data.Functor.Product type Rep (Product f g a) = D1 (MetaData "Product" "Data.Functor.Product" "base" False) (C1 (MetaCons "Pair" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f a)) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (g a)))) |