pandoc-symreg-0.2.1.3: A tool to convert symbolic regression expressions into different formats.
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.SRTree.EqSat

Documentation

Orphan instances

Foldable SRTree Source # 
Instance details

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 #

Eq1 SRTree Source # 
Instance details

Methods

liftEq :: (a -> b -> Bool) -> SRTree a -> SRTree b -> Bool #

Ord1 SRTree Source # 
Instance details

Methods

liftCompare :: (a -> b -> Ordering) -> SRTree a -> SRTree b -> Ordering #

Show1 SRTree Source # 
Instance details

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> SRTree a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [SRTree a] -> ShowS #

Traversable SRTree Source # 
Instance details

Methods

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) #

Language SRTree Source # 
Instance details

Floating (Pattern SRTree) Source # 
Instance details

Num (Pattern SRTree) Source # 
Instance details

Fractional (Pattern SRTree) Source # 
Instance details

Analysis (Maybe Double) SRTree Source # 
Instance details