Data.SRTree.Random

Functions to generate random trees and nodes.

Documentation

class HasVars p

Minimal complete definition

_vars

Instances

HasVars FullParams

Defined in Data.SRTree.Random

Methods

_vars :: FullParams -> [Int]

class HasVals p

Minimal complete definition

_range

Instances

HasVals FullParams

Defined in Data.SRTree.Random

Methods

_range :: FullParams -> (Double, Double)

class HasFuns p

Minimal complete definition

_funs

Instances

HasFuns FullParams

Defined in Data.SRTree.Random

Methods

_funs :: FullParams -> [Function]

type HasEverything p = (HasVars p, HasVals p, HasExps p, HasFuns p)

Constraint synonym for all properties.

data FullParams

A structure with every property

Constructors

P [Int] (Double, Double) (Int, Int) [Function]

Instances

HasFuns FullParams

Defined in Data.SRTree.Random

Methods

_funs :: FullParams -> [Function]

HasVals FullParams

Defined in Data.SRTree.Random

Methods

_range :: FullParams -> (Double, Double)

HasVars FullParams

Defined in Data.SRTree.Random

Methods

_vars :: FullParams -> [Int]

type RndTree p = ReaderT p (StateT StdGen IO) (Fix SRTree)

RndTree is a Monad Transformer to generate random trees of type `SRTree ix val` given the parameters `p ix val` using the random number generator StdGen.

randomVar :: HasVars p => RndTree p

Returns a random variable, the parameter p must have the HasVars property

randomConst :: HasVals p => RndTree p

Returns a random constant, the parameter p must have the HasConst property

randomPow :: HasExps p => RndTree p

Returns a random integer power node, the parameter p must have the HasExps property

randomFunction :: HasFuns p => RndTree p

Returns a random function, the parameter p must have the HasFuns property

randomNode :: HasEverything p => RndTree p

Returns a random node, the parameter p must have every property.

randomNonTerminal :: HasEverything p => RndTree p

Returns a random non-terminal node, the parameter p must have every property.

randomTree :: HasEverything p => Int -> RndTree p

Returns a random tree with a limited budget, the parameter p must have every property.

>>> let treeGen = runReaderT (randomTree 12) (P [0,1] (-10, 10) (2, 3) [Log, Exp])
>>> tree <- evalStateT treeGen (mkStdGen 52)
>>> showExpr tree
"(-2.7631152121655838 / Exp((x0 / ((x0 * -7.681722660704317) - Log(3.378309080134594)))))"

randomTreeBalanced :: HasEverything p => Int -> RndTree p

Returns a random tree with a approximately a number n of nodes, the parameter p must have every property.

>>> let treeGen = runReaderT (randomTreeBalanced 10) (P [0,1] (-10, 10) (2, 3) [Log, Exp])
>>> tree <- evalStateT treeGen (mkStdGen 42)
>>> showExpr tree
"Exp(Log((((7.784360517385774 * x0) - (3.6412224491658223 ^ x1)) ^ ((x0 ^ -4.09764995657091) + Log(-7.710216839988497)))))"