typelevel-rewrite-rules-1.0: Solve type equalities using custom type-level rewrite rules
Safe HaskellNone
LanguageHaskell2010

TypeLevel.Rewrite.Internal.DecomposedConstraint

Documentation

data DecomposedConstraint a Source #

Instances

Instances details
Functor DecomposedConstraint Source # 
Instance details

Defined in TypeLevel.Rewrite.Internal.DecomposedConstraint

Foldable DecomposedConstraint Source # 
Instance details

Defined in TypeLevel.Rewrite.Internal.DecomposedConstraint

Methods

fold :: Monoid m => DecomposedConstraint m -> m #

foldMap :: Monoid m => (a -> m) -> DecomposedConstraint a -> m #

foldMap' :: Monoid m => (a -> m) -> DecomposedConstraint a -> m #

foldr :: (a -> b -> b) -> b -> DecomposedConstraint a -> b #

foldr' :: (a -> b -> b) -> b -> DecomposedConstraint a -> b #

foldl :: (b -> a -> b) -> b -> DecomposedConstraint a -> b #

foldl' :: (b -> a -> b) -> b -> DecomposedConstraint a -> b #

foldr1 :: (a -> a -> a) -> DecomposedConstraint a -> a #

foldl1 :: (a -> a -> a) -> DecomposedConstraint a -> a #

toList :: DecomposedConstraint a -> [a] #

null :: DecomposedConstraint a -> Bool #

length :: DecomposedConstraint a -> Int #

elem :: Eq a => a -> DecomposedConstraint a -> Bool #

maximum :: Ord a => DecomposedConstraint a -> a #

minimum :: Ord a => DecomposedConstraint a -> a #

sum :: Num a => DecomposedConstraint a -> a #

product :: Num a => DecomposedConstraint a -> a #

Traversable DecomposedConstraint Source # 
Instance details

Defined in TypeLevel.Rewrite.Internal.DecomposedConstraint