Data.SRTree.EqSat
Contents
simplifyEqSat :: Fix SRTree -> Fix SRTree Source #
Methods
fold :: Monoid m => SRTree m -> m #
foldMap :: Monoid m => (a -> m) -> SRTree a -> m #
foldMap' :: Monoid m => (a -> m) -> SRTree a -> m #
foldr :: (a -> b -> b) -> b -> SRTree a -> b #
foldr' :: (a -> b -> b) -> b -> SRTree a -> b #
foldl :: (b -> a -> b) -> b -> SRTree a -> b #
foldl' :: (b -> a -> b) -> b -> SRTree a -> b #
foldr1 :: (a -> a -> a) -> SRTree a -> a #
foldl1 :: (a -> a -> a) -> SRTree a -> a #
toList :: SRTree a -> [a] #
null :: SRTree a -> Bool #
length :: SRTree a -> Int #
elem :: Eq a => a -> SRTree a -> Bool #
maximum :: Ord a => SRTree a -> a #
minimum :: Ord a => SRTree a -> a #
sum :: Num a => SRTree a -> a #
product :: Num a => SRTree a -> a #
liftEq :: (a -> b -> Bool) -> SRTree a -> SRTree b -> Bool #
liftCompare :: (a -> b -> Ordering) -> SRTree a -> SRTree b -> Ordering #
liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> SRTree a -> ShowS #
liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [SRTree a] -> ShowS #
traverse :: Applicative f => (a -> f b) -> SRTree a -> f (SRTree b) #
sequenceA :: Applicative f => SRTree (f a) -> f (SRTree a) #
mapM :: Monad m => (a -> m b) -> SRTree a -> m (SRTree b) #
sequence :: Monad m => SRTree (m a) -> m (SRTree a) #
pi :: Pattern SRTree #
exp :: Pattern SRTree -> Pattern SRTree #
log :: Pattern SRTree -> Pattern SRTree #
sqrt :: Pattern SRTree -> Pattern SRTree #
(**) :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
logBase :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
sin :: Pattern SRTree -> Pattern SRTree #
cos :: Pattern SRTree -> Pattern SRTree #
tan :: Pattern SRTree -> Pattern SRTree #
asin :: Pattern SRTree -> Pattern SRTree #
acos :: Pattern SRTree -> Pattern SRTree #
atan :: Pattern SRTree -> Pattern SRTree #
sinh :: Pattern SRTree -> Pattern SRTree #
cosh :: Pattern SRTree -> Pattern SRTree #
tanh :: Pattern SRTree -> Pattern SRTree #
asinh :: Pattern SRTree -> Pattern SRTree #
acosh :: Pattern SRTree -> Pattern SRTree #
atanh :: Pattern SRTree -> Pattern SRTree #
log1p :: Pattern SRTree -> Pattern SRTree #
expm1 :: Pattern SRTree -> Pattern SRTree #
log1pexp :: Pattern SRTree -> Pattern SRTree #
log1mexp :: Pattern SRTree -> Pattern SRTree #
(+) :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
(-) :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
(*) :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
negate :: Pattern SRTree -> Pattern SRTree #
abs :: Pattern SRTree -> Pattern SRTree #
signum :: Pattern SRTree -> Pattern SRTree #
fromInteger :: Integer -> Pattern SRTree #
(/) :: Pattern SRTree -> Pattern SRTree -> Pattern SRTree #
recip :: Pattern SRTree -> Pattern SRTree #
fromRational :: Rational -> Pattern SRTree #
makeA :: SRTree (Maybe Double) -> Maybe Double #
joinA :: Maybe Double -> Maybe Double -> Maybe Double #
modifyA :: EClass (Maybe Double) SRTree -> (EClass (Maybe Double) SRTree, [Fix SRTree]) #