Documentation

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 #

Methods

traverse :: Applicative f => (a -> f b) -> DecomposedConstraint a -> f (DecomposedConstraint b) #

sequenceA :: Applicative f => DecomposedConstraint (f a) -> f (DecomposedConstraint a) #

mapM :: Monad m => (a -> m b) -> DecomposedConstraint a -> m (DecomposedConstraint b) #

sequence :: Monad m => DecomposedConstraint (m a) -> m (DecomposedConstraint a) #

Methods

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

(<$) :: a -> DecomposedConstraint b -> DecomposedConstraint a #