Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.Functor.Sum.Compat
Documentation
data Sum (f :: k -> Type) (g :: k -> Type) (a :: k) #
Instances
Generic1 (Sum f g :: k -> Type) | |||||
Defined in Data.Functor.Sum Associated Types
| |||||
(Foldable f, Foldable g) => Foldable (Sum f g) | |||||
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |||||
(Foldable1 f, Foldable1 g) => Foldable1 (Sum f g) | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Sum f g m -> m # foldMap1 :: Semigroup m => (a -> m) -> Sum f g a -> m # foldMap1' :: Semigroup m => (a -> m) -> Sum f g a -> m # toNonEmpty :: Sum f g a -> NonEmpty a # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Sum f g a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Sum f g a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Sum f g a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Sum f g a -> b # | |||||
(Eq1 f, Eq1 g) => Eq1 (Sum f g) | |||||
(Ord1 f, Ord1 g) => Ord1 (Sum f g) | |||||
Defined in Data.Functor.Sum Methods liftCompare :: (a -> b -> Ordering) -> Sum f g a -> Sum f g b -> Ordering | |||||
(Read1 f, Read1 g) => Read1 (Sum f g) | |||||
Defined in Data.Functor.Sum | |||||
(Show1 f, Show1 g) => Show1 (Sum f g) | |||||
Defined in Data.Functor.Sum | |||||
(Contravariant f, Contravariant g) => Contravariant (Sum f g) | |||||
(Traversable f, Traversable g) => Traversable (Sum f g) | |||||
(Functor f, Functor g) => Functor (Sum f g) | |||||
(Typeable a, Typeable f, Typeable g, Typeable k, Data (f a), Data (g a)) => Data (Sum f g a) | |||||
Defined in Data.Functor.Sum Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> Sum f g a -> c (Sum f g a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Sum f g a) toConstr :: Sum f g a -> Constr dataTypeOf :: Sum f g a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Sum f g a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Sum f g a)) gmapT :: (forall b. Data b => b -> b) -> Sum f g a -> Sum f g a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sum f g a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sum f g a -> r gmapQ :: (forall d. Data d => d -> u) -> Sum f g a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Sum f g a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sum f g a -> m (Sum f g a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum f g a -> m (Sum f g a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum f g a -> m (Sum f g a) | |||||
Generic (Sum f g a) | |||||
Defined in Data.Functor.Sum Associated Types
| |||||
(Read (f a), Read (g a)) => Read (Sum f g a) | |||||
(Show (f a), Show (g a)) => Show (Sum f g a) | |||||
(Eq (f a), Eq (g a)) => Eq (Sum f g a) | |||||
(Ord (f a), Ord (g a)) => Ord (Sum f g a) | |||||
type Rep1 (Sum f g :: k -> Type) | |||||
Defined in Data.Functor.Sum type Rep1 (Sum f g :: k -> Type) = D1 ('MetaData "Sum" "Data.Functor.Sum" "base" 'False) (C1 ('MetaCons "InL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)) :+: C1 ('MetaCons "InR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 g))) | |||||
type Rep (Sum f g a) | |||||
Defined in Data.Functor.Sum type Rep (Sum f g a) = D1 ('MetaData "Sum" "Data.Functor.Sum" "base" 'False) (C1 ('MetaCons "InL" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))) :+: C1 ('MetaCons "InR" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (g a)))) |