Data.SRTree.Internal

Expression tree for Symbolic Regression

Documentation

data SRTree val

Tree structure to be used with Symbolic Regression algorithms. This structure is a fixed point of a n-ary tree.

Constructors

Var Int

index of the variables

Param Int

index of the parameter

Const Double

constant value, can be converted to a parameter | IConst Int -- TODO: integer constant | RConst Ratio -- TODO: rational constant

Uni Function val

univariate function

Bin Op val val

binary operator

Instances

Functor SRTree

Defined in Data.SRTree.Internal

Methods

fmap :: (a -> b) -> SRTree a -> SRTree b

(<$) :: a -> SRTree b -> SRTree a

Foldable SRTree

Defined in Data.SRTree.Internal

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

Traversable SRTree

Defined in Data.SRTree.Internal

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)

Hashable ENode

Defined in Algorithm.EqSat.Egraph

Methods

hashWithSalt :: Int -> ENode -> Int

hash :: ENode -> Int

IsString (Fix SRTree)

the instance of IsString allows us to create a tree using a more practical notation:

>>> :t  "x0" + "t0" * sin("x1" * "t1")
Fix SRTree

Defined in Data.SRTree.Internal

Methods

fromString :: String -> Fix SRTree

Floating (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

pi :: Fix SRTree

exp :: Fix SRTree -> Fix SRTree

log :: Fix SRTree -> Fix SRTree

sqrt :: Fix SRTree -> Fix SRTree

(**) :: Fix SRTree -> Fix SRTree -> Fix SRTree

logBase :: Fix SRTree -> Fix SRTree -> Fix SRTree

sin :: Fix SRTree -> Fix SRTree

cos :: Fix SRTree -> Fix SRTree

tan :: Fix SRTree -> Fix SRTree

asin :: Fix SRTree -> Fix SRTree

acos :: Fix SRTree -> Fix SRTree

atan :: Fix SRTree -> Fix SRTree

sinh :: Fix SRTree -> Fix SRTree

cosh :: Fix SRTree -> Fix SRTree

tanh :: Fix SRTree -> Fix SRTree

asinh :: Fix SRTree -> Fix SRTree

acosh :: Fix SRTree -> Fix SRTree

atanh :: Fix SRTree -> Fix SRTree

log1p :: Fix SRTree -> Fix SRTree

expm1 :: Fix SRTree -> Fix SRTree

log1pexp :: Fix SRTree -> Fix SRTree

log1mexp :: Fix SRTree -> Fix SRTree

Num (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

(+) :: Fix SRTree -> Fix SRTree -> Fix SRTree

(-) :: Fix SRTree -> Fix SRTree -> Fix SRTree

(*) :: Fix SRTree -> Fix SRTree -> Fix SRTree

negate :: Fix SRTree -> Fix SRTree

abs :: Fix SRTree -> Fix SRTree

signum :: Fix SRTree -> Fix SRTree

fromInteger :: Integer -> Fix SRTree

Fractional (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

(/) :: Fix SRTree -> Fix SRTree -> Fix SRTree

recip :: Fix SRTree -> Fix SRTree

fromRational :: Rational -> Fix SRTree

Show val => Show (SRTree val)

Defined in Data.SRTree.Internal

Methods

showsPrec :: Int -> SRTree val -> ShowS

show :: SRTree val -> String

showList :: [SRTree val] -> ShowS

Eq val => Eq (SRTree val)

Defined in Data.SRTree.Internal

Methods

(==) :: SRTree val -> SRTree val -> Bool

(/=) :: SRTree val -> SRTree val -> Bool

Ord val => Ord (SRTree val)

Defined in Data.SRTree.Internal

Methods

compare :: SRTree val -> SRTree val -> Ordering

(<) :: SRTree val -> SRTree val -> Bool

(<=) :: SRTree val -> SRTree val -> Bool

(>) :: SRTree val -> SRTree val -> Bool

(>=) :: SRTree val -> SRTree val -> Bool

max :: SRTree val -> SRTree val -> SRTree val

min :: SRTree val -> SRTree val -> SRTree val

data Function

Supported functions

Constructors

Id

Abs

Sin

Cos

Tan

Sinh

Cosh

Tanh

ASin

ACos

ATan

ASinh

ACosh

ATanh

Sqrt

SqrtAbs

Cbrt

Square

Log

LogAbs

Exp

Recip

Cube

Instances

Enum Function

Defined in Data.SRTree.Internal

Methods

succ :: Function -> Function

pred :: Function -> Function

toEnum :: Int -> Function

fromEnum :: Function -> Int

enumFrom :: Function -> [Function]

enumFromThen :: Function -> Function -> [Function]

enumFromTo :: Function -> Function -> [Function]

enumFromThenTo :: Function -> Function -> Function -> [Function]

Read Function

Defined in Data.SRTree.Internal

Methods

readsPrec :: Int -> ReadS Function

readList :: ReadS [Function]

readPrec :: ReadPrec Function

readListPrec :: ReadPrec [Function]

Show Function

Defined in Data.SRTree.Internal

Methods

showsPrec :: Int -> Function -> ShowS

show :: Function -> String

showList :: [Function] -> ShowS

Eq Function

Defined in Data.SRTree.Internal

Methods

(==) :: Function -> Function -> Bool

(/=) :: Function -> Function -> Bool

Ord Function

Defined in Data.SRTree.Internal

Methods

compare :: Function -> Function -> Ordering

(<) :: Function -> Function -> Bool

(<=) :: Function -> Function -> Bool

(>) :: Function -> Function -> Bool

(>=) :: Function -> Function -> Bool

max :: Function -> Function -> Function

min :: Function -> Function -> Function

data Op

Supported operators

Constructors

Add

Sub

Mul

Div

Power

PowerAbs

AQ

Instances

Enum Op

Defined in Data.SRTree.Internal

Methods

succ :: Op -> Op

pred :: Op -> Op

toEnum :: Int -> Op

fromEnum :: Op -> Int

enumFrom :: Op -> [Op]

enumFromThen :: Op -> Op -> [Op]

enumFromTo :: Op -> Op -> [Op]

enumFromThenTo :: Op -> Op -> Op -> [Op]

Read Op

Defined in Data.SRTree.Internal

Methods

readsPrec :: Int -> ReadS Op

readList :: ReadS [Op]

readPrec :: ReadPrec Op

readListPrec :: ReadPrec [Op]

Show Op

Defined in Data.SRTree.Internal

Methods

showsPrec :: Int -> Op -> ShowS

show :: Op -> String

showList :: [Op] -> ShowS

Eq Op

Defined in Data.SRTree.Internal

Methods

(==) :: Op -> Op -> Bool

(/=) :: Op -> Op -> Bool

Ord Op

Defined in Data.SRTree.Internal

Methods

compare :: Op -> Op -> Ordering

(<) :: Op -> Op -> Bool

(<=) :: Op -> Op -> Bool

(>) :: Op -> Op -> Bool

(>=) :: Op -> Op -> Bool

max :: Op -> Op -> Op

min :: Op -> Op -> Op

param :: Int -> Fix SRTree

create a tree with a single node representing a parameter

var :: Int -> Fix SRTree

create a tree with a single node representing a variable

constv :: Double -> Fix SRTree

create a tree with a single node representing a constant value

arity :: Fix SRTree -> Int

Arity of the current node

getChildren :: Fix SRTree -> [Fix SRTree]

Get the children of a node. Returns an empty list in case of a leaf node.

>>> map showExpr . getChildren $ "x0" + 2
["x0", 2]

childrenOf :: SRTree a -> [a]

Get the children of an unfixed node

replaceChildren :: [a] -> SRTree b -> SRTree a

replaces the children with elements from a list

getOperator :: SRTree a -> SRTree ()

returns a node containing the operator and () as children

countNodes :: Num a => Fix SRTree -> a

Count the number of nodes in a tree.

>>> countNodes $ "x0" + 2
3

countVarNodes :: Num a => Fix SRTree -> a

Count the number of Var nodes

>>> countVarNodes $ "x0" + 2 * ("x0" - sin "x1")
3

countConsts :: Num a => Fix SRTree -> a

Count the number of const nodes

>>> countConsts $ "x0"* 2 + 3 * sin "x0"
2

countParams :: Num a => Fix SRTree -> a

Count the number of Param nodes

>>> countParams $ "x0" + "t0" * sin ("t1" + "x1") - "t0"
3

countOccurrences :: Num a => Int -> Fix SRTree -> a

Count the occurrences of variable indexed as ix

>>> countOccurrences 0 $ "x0"* 2 + 3 * sin "x0" + "x1"
2

countUniqueTokens :: Num a => Fix SRTree -> a

counts the number of unique tokens

>>> countUniqueTokens $ "x0" + ("x1" * "x0" - sin ("x0" ** 2))
8

numberOfVars :: Num a => Fix SRTree -> a

return the number of unique variables

>>> numberOfVars $ "x0" + 2 * ("x0" - sin "x1")
2

getIntConsts :: Fix SRTree -> [Double]

returns the integer constants. We assume an integer constant as those values in which `floor x == ceiling x`.

>>> getIntConsts $ "x0" + 2 * "x1" ** 3 - 3.14
[2.0,3.0]

relabelParams :: Fix SRTree -> Fix SRTree

Relabel the parameters indices incrementaly starting from 0

>>> showExpr . relabelParams $ "x0" + "t0" * sin ("t1" + "x1") - "t0"
"x0" + "t0" * sin ("t1" + "x1") - "t2" 

relabelVars :: Fix SRTree -> Fix SRTree

Relabel the parameters indices incrementaly starting from 0

>>> showExpr . relabelParams $ "x0" + "t0" * sin ("t1" + "x1") - "t0"
"x0" + "t0" * sin ("t1" + "x1") - "t2"

constsToParam :: Fix SRTree -> (Fix SRTree, [Double])

Change constant values to a parameter, returning the changed tree and a list of parameter values

>>> snd . constsToParam $ "x0" * 2 + 3.14 * sin (5 * "x1")
[2.0,3.14,5.0]

floatConstsToParam :: Fix SRTree -> (Fix SRTree, [Double])

Same as constsToParam but does not change constant values that can be converted to integer without loss of precision

>>> snd . floatConstsToParam $ "x0" * 2 + 3.14 * sin (5 * "x1")
[3.14]

paramsToConst :: [Double] -> Fix SRTree -> Fix SRTree

Convert the parameters into constants in the tree

>>> showExpr . paramsToConst [1.1, 2.2, 3.3] $ "x0" + "t0" * sin ("t1" * "x0" - "t2")
x0 + 1.1 * sin(2.2 * x0 - 3.3)

newtype Fix (f :: Type -> Type)

Constructors

Fix

Fields

• unfix :: f (Fix f)

Instances

IsString (Fix SRTree)

the instance of IsString allows us to create a tree using a more practical notation:

>>> :t  "x0" + "t0" * sin("x1" * "t1")
Fix SRTree

Defined in Data.SRTree.Internal

Methods

fromString :: String -> Fix SRTree

Floating (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

pi :: Fix SRTree

exp :: Fix SRTree -> Fix SRTree

log :: Fix SRTree -> Fix SRTree

sqrt :: Fix SRTree -> Fix SRTree

(**) :: Fix SRTree -> Fix SRTree -> Fix SRTree

logBase :: Fix SRTree -> Fix SRTree -> Fix SRTree

sin :: Fix SRTree -> Fix SRTree

cos :: Fix SRTree -> Fix SRTree

tan :: Fix SRTree -> Fix SRTree

asin :: Fix SRTree -> Fix SRTree

acos :: Fix SRTree -> Fix SRTree

atan :: Fix SRTree -> Fix SRTree

sinh :: Fix SRTree -> Fix SRTree

cosh :: Fix SRTree -> Fix SRTree

tanh :: Fix SRTree -> Fix SRTree

asinh :: Fix SRTree -> Fix SRTree

acosh :: Fix SRTree -> Fix SRTree

atanh :: Fix SRTree -> Fix SRTree

log1p :: Fix SRTree -> Fix SRTree

expm1 :: Fix SRTree -> Fix SRTree

log1pexp :: Fix SRTree -> Fix SRTree

log1mexp :: Fix SRTree -> Fix SRTree

Num (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

(+) :: Fix SRTree -> Fix SRTree -> Fix SRTree

(-) :: Fix SRTree -> Fix SRTree -> Fix SRTree

(*) :: Fix SRTree -> Fix SRTree -> Fix SRTree

negate :: Fix SRTree -> Fix SRTree

abs :: Fix SRTree -> Fix SRTree

signum :: Fix SRTree -> Fix SRTree

fromInteger :: Integer -> Fix SRTree

Fractional (Fix SRTree)

Defined in Data.SRTree.Internal

Methods

(/) :: Fix SRTree -> Fix SRTree -> Fix SRTree

recip :: Fix SRTree -> Fix SRTree

fromRational :: Rational -> Fix SRTree