Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
PolyKinds
variant of base's Sum
.
See notes in Data.Functor.Product.PolyKinds for more info
Documentation
A PolyKinds
variant of Sum
.
Note that the original Sum
is poly-kinded
in its type, but not in its instances such as Eq
.
Instances
Generic1 (Sum f g :: k -> Type) Source # | |
(InferOf a ~ InferOf b, Infer m a, Infer m b) => Infer m (Sum a b) Source # | |
(Functor f, Functor g) => Functor (Sum f g) Source # | |
(Foldable f, Foldable g) => Foldable (Sum f g) Source # | |
Defined in Data.Functor.Sum.PolyKinds fold :: Monoid m => Sum f g m -> 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 # | |
(Traversable f, Traversable g) => Traversable (Sum f g) Source # | |
(Eq1 f, Eq1 g) => Eq1 (Sum f g) Source # | |
(Ord1 f, Ord1 g) => Ord1 (Sum f g) Source # | |
Defined in Data.Functor.Sum.PolyKinds | |
(Read1 f, Read1 g) => Read1 (Sum f g) Source # | |
Defined in Data.Functor.Sum.PolyKinds | |
(Show1 f, Show1 g) => Show1 (Sum f g) Source # | |
(KNodes a, KNodes b) => KNodes (Sum a b) Source # | |
Defined in AST.Class.Nodes type KNodesConstraint (Sum a b) c :: Constraint Source # kLiftConstraint :: KNodesConstraint (Sum a b) c => KWitness (Sum a b) n -> Proxy c -> (c n -> r) -> r Source # | |
(KFunctor a, KFunctor b) => KFunctor (Sum a b) Source # | |
(KFoldable a, KFoldable b) => KFoldable (Sum a b) Source # | |
(KTraversable a, KTraversable b) => KTraversable (Sum a b) Source # | |
Defined in AST.Class.Traversable sequenceK :: Applicative f => Tree (Sum a b) (ContainedK f p) -> f (Tree (Sum a b) p) Source # | |
(ZipMatch a, ZipMatch b) => ZipMatch (Sum a b) Source # | |
(Eq (f a), Eq (g a)) => Eq (Sum f g a) Source # | |
(Typeable a, Typeable f, Typeable g, Typeable k, Data (f a), Data (g a)) => Data (Sum f g a) Source # | |
Defined in Data.Functor.Sum.PolyKinds 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 :: (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) # | |
(Ord (f a), Ord (g a)) => Ord (Sum f g a) Source # | |
Defined in Data.Functor.Sum.PolyKinds | |
(Read (f a), Read (g a)) => Read (Sum f g a) Source # | |
(Show (f a), Show (g a)) => Show (Sum f g a) Source # | |
Generic (Sum f g a) Source # | |
type Rep1 (Sum f g :: k -> Type) Source # | |
Defined in Data.Functor.Sum.PolyKinds type Rep1 (Sum f g :: k -> Type) = D1 (MetaData "Sum" "Data.Functor.Sum.PolyKinds" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" 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))) | |
data KWitness (Sum a b) n Source # | |
type InferOf (Sum a b) Source # | |
Defined in AST.Class.Infer | |
type KNodesConstraint (Sum a b) x Source # | |
Defined in AST.Class.Nodes | |
type Rep (Sum f g a) Source # | |
Defined in Data.Functor.Sum.PolyKinds type Rep (Sum f g a) = D1 (MetaData "Sum" "Data.Functor.Sum.PolyKinds" "syntax-tree-0.1.0.1-5Y9WhklreXaDnL6Q9tTtln" 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)))) |