2023-03-31 06:59:08 +02:00
|
|
|
#region data
|
2023-03-23 06:57:31 +01:00
|
|
|
global.EQUATION_PRES = ds_map_create();
|
2023-06-13 21:24:05 +02:00
|
|
|
global.EQUATION_PRES[? "+"] = 1;
|
|
|
|
global.EQUATION_PRES[? "-"] = 1;
|
2023-06-26 18:55:41 +02:00
|
|
|
global.EQUATION_PRES[? "∸"] = 9; //unary negative
|
2023-06-13 21:24:05 +02:00
|
|
|
global.EQUATION_PRES[? "*"] = 2;
|
|
|
|
global.EQUATION_PRES[? "/"] = 2;
|
|
|
|
global.EQUATION_PRES[? "$"] = 3;
|
|
|
|
|
|
|
|
global.EQUATION_PRES[? "&"] = 5;
|
|
|
|
global.EQUATION_PRES[? "|"] = 4;
|
|
|
|
global.EQUATION_PRES[? "^"] = 3;
|
|
|
|
global.EQUATION_PRES[? "<"] = 3;
|
|
|
|
global.EQUATION_PRES[? "»"] = 6;
|
|
|
|
global.EQUATION_PRES[? "«"] = 6;
|
|
|
|
global.EQUATION_PRES[? "~"] = 9;
|
|
|
|
|
|
|
|
global.EQUATION_PRES[? "="] = -1; //==
|
|
|
|
global.EQUATION_PRES[? "≠"] = -1; //!=
|
|
|
|
global.EQUATION_PRES[? "<"] = 0;
|
|
|
|
global.EQUATION_PRES[? ">"] = 0;
|
|
|
|
global.EQUATION_PRES[? "≤"] = 0;
|
|
|
|
global.EQUATION_PRES[? "≥"] = 0;
|
|
|
|
|
|
|
|
global.EQUATION_PRES[? "@"] = 5; //array accerssor symbol
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
global.FUNCTIONS = ds_map_create();
|
2023-07-12 16:28:32 +02:00
|
|
|
global.FUNCTIONS[? "sin"] = [ ["radian"], function(val) { return sin(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "cos"] = [ ["radian"], function(val) { return cos(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "tan"] = [ ["radian"], function(val) { return tan(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "abs"] = [ ["number"], function(val) { return abs(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "round"] = [ ["number"], function(val) { return round(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "ceil"] = [ ["number"], function(val) { return ceil(val[0]); } ];
|
|
|
|
global.FUNCTIONS[? "floor"] = [ ["number"], function(val) { return floor(val[0]); } ];
|
2023-07-11 20:36:44 +02:00
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
global.FUNCTIONS[? "wiggle"] = [ ["time", "frequency", "octave", "seed"], function(val) {
|
|
|
|
return wiggle(0, 1, array_safe_get(val, 1),
|
|
|
|
array_safe_get(val, 0),
|
|
|
|
array_safe_get(val, 3, 0),
|
|
|
|
array_safe_get(val, 2, 1));
|
|
|
|
} ];
|
2023-03-31 06:59:08 +02:00
|
|
|
#endregion
|
2023-03-23 06:57:31 +01:00
|
|
|
|
2023-06-13 21:24:05 +02:00
|
|
|
function functionStringClean(fx) {
|
2023-07-12 16:28:32 +02:00
|
|
|
var ch = "", ind = 0, len = string_length(fx);
|
|
|
|
var _fx = "", str = false;
|
|
|
|
while(ind++ <= len) {
|
|
|
|
ch = string_char_at(fx, ind);
|
|
|
|
|
|
|
|
if(ch == " ") {
|
|
|
|
if(str)
|
|
|
|
_fx += ch;
|
|
|
|
} else
|
|
|
|
_fx += ch;
|
|
|
|
|
|
|
|
if(ch == "\"")
|
|
|
|
str = !str;
|
|
|
|
}
|
|
|
|
|
|
|
|
fx = _fx;
|
|
|
|
|
|
|
|
|
2023-06-13 21:24:05 +02:00
|
|
|
fx = string_replace_all(fx, "\n", "");
|
|
|
|
fx = string_replace_all(fx, "**", "$");
|
|
|
|
fx = string_replace_all(fx, "<<", "«");
|
|
|
|
fx = string_replace_all(fx, ">>", "»");
|
|
|
|
|
|
|
|
fx = string_replace_all(fx, "==", "=");
|
|
|
|
fx = string_replace_all(fx, "!=", "≠");
|
|
|
|
fx = string_replace_all(fx, "<>", "≠");
|
|
|
|
fx = string_replace_all(fx, ">=", "≥");
|
|
|
|
fx = string_replace_all(fx, "<=", "≤");
|
|
|
|
|
|
|
|
fx = string_replace_all(fx, "[", "@["); //add array accessor symbol arr[i] = arr@[i] = arr @ (i)
|
|
|
|
|
|
|
|
return fx;
|
|
|
|
}
|
|
|
|
|
2023-03-31 06:59:08 +02:00
|
|
|
#region evaluator
|
2023-06-20 19:43:19 +02:00
|
|
|
enum EXPRESS_TREE_ANIM {
|
|
|
|
none,
|
|
|
|
base_value,
|
|
|
|
animated
|
|
|
|
}
|
|
|
|
|
|
|
|
function __funcTree(symbol, l = noone, r = noone) constructor {
|
|
|
|
self.symbol = symbol;
|
|
|
|
self.l = l;
|
|
|
|
self.r = r;
|
2023-07-12 16:28:32 +02:00
|
|
|
dependency = [];
|
2023-06-20 19:43:19 +02:00
|
|
|
|
|
|
|
static _string = function(str) {
|
|
|
|
return string_char_at(str, 1) == "\"" &&
|
|
|
|
string_char_at(str, string_length(str)) == "\"";
|
|
|
|
}
|
|
|
|
|
|
|
|
static _string_trim = function(str) {
|
|
|
|
return _string(str)? string_copy(str, 2, string_length(str) - 2) : string(str);
|
|
|
|
}
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
static getVal = function(val, params = {}, getRaw = false) {
|
|
|
|
if(is_struct(val)) return val.eval(params);
|
2023-06-20 19:43:19 +02:00
|
|
|
if(is_real(val)) return val;
|
2023-07-11 20:36:44 +02:00
|
|
|
if(is_string(val)) val = string_trim(val);
|
2023-06-20 19:43:19 +02:00
|
|
|
|
|
|
|
if(struct_has(params, val))
|
|
|
|
return struct_try_get(params, val);
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
if(getRaw) return val;
|
2023-06-20 19:43:19 +02:00
|
|
|
|
|
|
|
if(_string(string_trim(val)))
|
|
|
|
return string_trim(val);
|
|
|
|
|
|
|
|
return nodeGetData(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
static _validate = function(val) {
|
|
|
|
if(is_real(val)) return true;
|
|
|
|
if(is_string(val)) return true;
|
|
|
|
if(is_struct(val)) return val.validate();
|
|
|
|
|
|
|
|
if(val == "value") return true;
|
2023-07-06 19:49:16 +02:00
|
|
|
if(PROJECT.globalNode.inputExist(val)) return true;
|
2023-06-20 19:43:19 +02:00
|
|
|
|
|
|
|
var strs = string_splice(val, ".");
|
|
|
|
if(array_length(strs) < 2) return false;
|
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
if(strs[0] == "Project")
|
|
|
|
return ds_map_exists(PROJECT_VARIABLES, strs[1]);
|
|
|
|
|
|
|
|
if(!ds_map_exists(PROJECT.nodeNameMap, strs[0]))
|
2023-06-20 19:43:19 +02:00
|
|
|
return false;
|
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
array_push_unique(dependency, strs[0])
|
|
|
|
return true;
|
2023-06-20 19:43:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static validate = function() {
|
2023-07-12 16:28:32 +02:00
|
|
|
dependency = [];
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
if(ds_map_exists(global.FUNCTIONS, symbol)) {
|
|
|
|
if(!is_array(l)) return false;
|
|
|
|
for( var i = 0; i < array_length(l); i++ )
|
|
|
|
if(!_validate(l[i])) return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
switch(symbol) {
|
|
|
|
case "@": return _validate(l);
|
2023-07-11 20:36:44 +02:00
|
|
|
case "【": return true;
|
|
|
|
case "": return true;
|
2023-06-20 19:43:19 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return _validate(l) && _validate(r);
|
|
|
|
}
|
|
|
|
|
|
|
|
static _isAnimated = function(val) {
|
|
|
|
if(is_real(val)) return EXPRESS_TREE_ANIM.none;
|
|
|
|
if(is_struct(val)) return val._isAnimated();
|
|
|
|
|
|
|
|
if(val == "value") return EXPRESS_TREE_ANIM.base_value;
|
2023-07-06 19:49:16 +02:00
|
|
|
if(PROJECT.globalNode.inputExist(val)) {
|
|
|
|
var _inp = PROJECT.globalNode.getInput(val);
|
2023-06-20 19:43:19 +02:00
|
|
|
if(_inp.is_anim) return EXPRESS_TREE_ANIM.animated;
|
|
|
|
}
|
|
|
|
|
|
|
|
return EXPRESS_TREE_ANIM.none;
|
|
|
|
}
|
|
|
|
|
|
|
|
static isAnimated = function() {
|
|
|
|
var anim = EXPRESS_TREE_ANIM.none;
|
|
|
|
anim = max(anim, _isAnimated(l));
|
|
|
|
if(symbol != "@")
|
|
|
|
anim = max(anim, _isAnimated(r));
|
|
|
|
|
|
|
|
return anim;
|
|
|
|
}
|
|
|
|
|
|
|
|
static eval = function(params = {}) {
|
2023-07-11 20:36:44 +02:00
|
|
|
if(ds_map_exists(global.FUNCTIONS, symbol)) {
|
|
|
|
if(!is_array(l)) return 0;
|
|
|
|
|
|
|
|
var _fn = global.FUNCTIONS[? symbol];
|
|
|
|
var _ev = _fn[1];
|
|
|
|
var _l = array_create(array_length(l));
|
|
|
|
|
|
|
|
for( var i = 0; i < array_length(l); i++ )
|
|
|
|
_l[i] = getVal(l[i], params);
|
|
|
|
|
|
|
|
var res = _ev(_l);
|
|
|
|
//print($"Function {symbol}{_l} = {res}");
|
|
|
|
//print("====================");
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
var v1 = getVal(l, params, symbol == "【");
|
|
|
|
var v2 = getVal(r, params);
|
|
|
|
|
|
|
|
var res = 0;
|
2023-06-20 19:43:19 +02:00
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
if(symbol == "") {
|
|
|
|
res = v1;
|
|
|
|
} else if(symbol == "【") { //array builder
|
|
|
|
res = array_create(array_length(v1));
|
|
|
|
for( var i = 0; i < array_length(res); i++ )
|
|
|
|
res[i] = getVal(v1[i], params);
|
|
|
|
} else if(symbol == "@") {
|
|
|
|
res = is_real(v2)? array_safe_get(v1, v2) : 0;
|
|
|
|
} else if(is_array(v1) && !is_array(v2)) {
|
|
|
|
res = array_create(array_length(v1));
|
|
|
|
for( var i = 0; i < array_length(res); i++ )
|
|
|
|
res[i] = eval_real(array_safe_get(v1, i), v2);
|
|
|
|
} else if(!is_array(v1) && is_array(v2)) {
|
|
|
|
res = array_create(array_length(v2));
|
|
|
|
for( var i = 0; i < array_length(res); i++ )
|
|
|
|
res[i] = eval_real(v1, array_safe_get(v2, i));
|
|
|
|
} else if(is_array(v1) && is_array(v2)) {
|
|
|
|
res = array_create(max(array_length(v1), array_length(v2)));
|
|
|
|
for( var i = 0; i < array_length(res); i++ )
|
|
|
|
res[i] = eval_real(array_safe_get(v1, i), array_safe_get(v2, i));
|
|
|
|
} else
|
|
|
|
res = eval_real(v1, v2);
|
|
|
|
|
|
|
|
//print($"|{v1}|{symbol}|{v2}| = {res}");
|
2023-06-20 19:43:19 +02:00
|
|
|
//print($"symbol : {symbol}");
|
2023-07-11 20:36:44 +02:00
|
|
|
//print($"l : | {typeof(l)} |{l}|");
|
|
|
|
//print($"r : | {typeof(r)} |{r}|");
|
2023-06-20 19:43:19 +02:00
|
|
|
//print("====================");
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static eval_real = function(v1, v2) {
|
2023-06-20 19:43:19 +02:00
|
|
|
switch(symbol) {
|
|
|
|
case "+":
|
|
|
|
if(_string(v1) || _string(v2))
|
|
|
|
return _string_trim(v1) + _string_trim(v2);
|
|
|
|
if(is_real(v1) && is_real(v2))
|
|
|
|
return v1 + v2;
|
|
|
|
return 0;
|
|
|
|
case "-": return (is_real(v1) && is_real(v2))? v1 - v2 : 0;
|
2023-06-26 18:55:41 +02:00
|
|
|
case "∸": return is_real(v1)? -v1 : 0;
|
2023-06-20 19:43:19 +02:00
|
|
|
case "*": return (is_real(v1) && is_real(v2))? v1 * v2 : 0;
|
|
|
|
case "$": return (is_real(v1) && is_real(v2))? power(v1, v2) : 0;
|
2023-07-11 20:36:44 +02:00
|
|
|
case "/": return (is_real(v1) && is_real(v2) && v2 != 0)? v1 / v2 : 0;
|
2023-06-20 19:43:19 +02:00
|
|
|
|
|
|
|
case "&": return (is_real(v1) && is_real(v2))? v1 & v2 : 0;
|
|
|
|
case "|": return (is_real(v1) && is_real(v2))? v1 | v2 : 0;
|
|
|
|
case "^": return (is_real(v1) && is_real(v2))? v1 ^ v2 : 0;
|
|
|
|
case "«": return (is_real(v1) && is_real(v2))? v1 << v2 : 0;
|
|
|
|
case "»": return (is_real(v1) && is_real(v2))? v1 >> v2 : 0;
|
|
|
|
case "~": return is_real(v1)? ~v1 : 0;
|
|
|
|
|
|
|
|
case "=": return (is_real(v1) && is_real(v2))? v1 == v2 : 0;
|
|
|
|
case "≠": return (is_real(v1) && is_real(v2))? v1 != v2 : 0;
|
|
|
|
case "≤": return (is_real(v1) && is_real(v2))? v1 <= v2 : 0;
|
|
|
|
case "≥": return (is_real(v1) && is_real(v2))? v1 >= v2 : 0;
|
|
|
|
case ">": return (is_real(v1) && is_real(v2))? v1 > v2 : 0;
|
|
|
|
case "<": return (is_real(v1) && is_real(v2))? v1 < v2 : 0;
|
|
|
|
|
|
|
|
case "sin" : return is_real(v1)? sin(v1) : 0;
|
|
|
|
case "cos" : return is_real(v1)? cos(v1) : 0;
|
|
|
|
case "tan" : return is_real(v1)? tan(v1) : 0;
|
|
|
|
case "abs" : return is_real(v1)? abs(v1) : 0;
|
|
|
|
case "round" : return is_real(v1)? round(v1) : 0;
|
|
|
|
case "ceil" : return is_real(v1)? ceil(v1) : 0;
|
|
|
|
case "floor" : return is_real(v1)? floor(v1) : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return v1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
function evaluateFunctionTree(fx) {
|
|
|
|
static __BRACKETS = [ "(", ")", "[", "]" ];
|
|
|
|
|
2023-03-23 06:57:31 +01:00
|
|
|
var pres = global.EQUATION_PRES;
|
|
|
|
var vl = ds_stack_create();
|
|
|
|
var op = ds_stack_create();
|
2023-07-11 20:36:44 +02:00
|
|
|
var last_push = "";
|
2022-01-13 05:24:03 +01:00
|
|
|
|
2023-06-13 21:24:05 +02:00
|
|
|
fx = functionStringClean(fx);
|
2022-01-13 05:24:03 +01:00
|
|
|
|
|
|
|
var len = string_length(fx);
|
2023-03-23 06:57:31 +01:00
|
|
|
var l = 1;
|
2023-06-20 19:43:19 +02:00
|
|
|
var ch = "";
|
|
|
|
var cch = "";
|
|
|
|
var _ch = "";
|
|
|
|
var in_str = false;
|
2022-01-13 05:24:03 +01:00
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
//print($"===== Function: {fx} =====");
|
|
|
|
|
2022-01-13 05:24:03 +01:00
|
|
|
while(l <= len) {
|
|
|
|
ch = string_char_at(fx, l);
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
if(ds_map_exists(pres, ch)) { //symbol is operator
|
2022-01-13 05:24:03 +01:00
|
|
|
if(ds_stack_empty(op)) ds_stack_push(op, ch);
|
|
|
|
else {
|
2023-07-11 20:36:44 +02:00
|
|
|
var _top = ds_stack_top(op);
|
|
|
|
if(_top == "(" || ds_map_exists(global.FUNCTIONS, _top) || pres[? ch] > pres[? _top]) {
|
|
|
|
ds_stack_push(op, ch);
|
|
|
|
last_push = "op";
|
|
|
|
} else {
|
2023-06-26 18:55:41 +02:00
|
|
|
if(ch == "-" && ds_map_exists(pres, _ch)) ch = "∸"; //unary negative
|
2023-05-22 20:31:55 +02:00
|
|
|
|
|
|
|
while(pres[? ch] <= pres[? ds_stack_top(op)] && !ds_stack_empty(op))
|
2023-06-20 19:43:19 +02:00
|
|
|
ds_stack_push(vl, buildFuncTree(ds_stack_pop(op), vl));
|
2022-01-13 05:24:03 +01:00
|
|
|
ds_stack_push(op, ch);
|
2023-07-11 20:36:44 +02:00
|
|
|
last_push = "op";
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
l++;
|
|
|
|
} else if (ch == "(") {
|
2023-07-11 20:36:44 +02:00
|
|
|
if(last_push == "fn") ds_stack_push(op, [ "〚", ds_stack_size(vl) ]);
|
|
|
|
else ds_stack_push(op, ch);
|
|
|
|
last_push = "op";
|
2022-01-13 05:24:03 +01:00
|
|
|
l++;
|
|
|
|
} else if (ch == ")") {
|
2023-07-11 20:36:44 +02:00
|
|
|
while(!ds_stack_empty(op)) {
|
|
|
|
var _top = ds_stack_pop(op);
|
|
|
|
if(_top == "(") break;
|
|
|
|
if(is_array(_top) && _top[0] == "〚") {
|
|
|
|
var arr = [];
|
|
|
|
while(ds_stack_size(vl) > _top[1])
|
|
|
|
array_insert(arr, 0, ds_stack_pop(vl));
|
|
|
|
|
|
|
|
ds_stack_push(vl, new __funcTree(ds_stack_pop(op), arr));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
ds_stack_push(vl, buildFuncTree(_top, vl));
|
2023-06-20 19:43:19 +02:00
|
|
|
}
|
2023-07-11 20:36:44 +02:00
|
|
|
|
|
|
|
last_push = "vl";
|
2023-06-20 19:43:19 +02:00
|
|
|
l++;
|
|
|
|
} else if (ch == "[") {
|
2023-07-11 20:36:44 +02:00
|
|
|
if(last_push == "vl") ds_stack_push(op, ch);
|
|
|
|
else ds_stack_push(op, [ "{", ds_stack_size(vl) ]);
|
|
|
|
last_push = "op";
|
2023-06-20 19:43:19 +02:00
|
|
|
l++;
|
|
|
|
} else if (ch == "]") {
|
2023-07-11 20:36:44 +02:00
|
|
|
while(!ds_stack_empty(op)) {
|
|
|
|
var _top = ds_stack_pop(op);
|
|
|
|
if(_top == "[") break;
|
|
|
|
if(is_array(_top) && _top[0] == "{") {
|
|
|
|
var arr = [];
|
|
|
|
while(ds_stack_size(vl) > _top[1])
|
|
|
|
array_insert(arr, 0, ds_stack_pop(vl));
|
|
|
|
ds_stack_push(vl, arr);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
ds_stack_push(vl, buildFuncTree(_top, vl));
|
|
|
|
}
|
|
|
|
|
|
|
|
last_push = "vl";
|
|
|
|
l++;
|
|
|
|
} else if (ch == ",") {
|
|
|
|
while(!ds_stack_empty(op)) {
|
|
|
|
var _top = ds_stack_top(op);
|
|
|
|
if(_top == "[" || _top == "(" || (is_array(_top) && _top[0] == "{")) break;
|
|
|
|
|
|
|
|
ds_stack_push(vl, buildFuncTree(_top, vl));
|
|
|
|
}
|
2023-06-20 19:43:19 +02:00
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
last_push = "vl";
|
2022-01-13 05:24:03 +01:00
|
|
|
l++;
|
|
|
|
} else {
|
|
|
|
var vsl = "";
|
|
|
|
|
|
|
|
while(l <= len) {
|
|
|
|
cch = string_char_at(fx, l);
|
2023-07-12 16:28:32 +02:00
|
|
|
if(ds_map_exists(pres, cch) || array_exists(__BRACKETS, cch)) break;
|
|
|
|
if(cch == ",") {
|
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
}
|
2022-01-13 05:24:03 +01:00
|
|
|
|
|
|
|
vsl += cch;
|
|
|
|
l++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(vsl == "") continue;
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
if(ds_map_exists(global.FUNCTIONS, vsl)) { //function
|
2022-01-13 05:24:03 +01:00
|
|
|
ds_stack_push(op, vsl);
|
2023-07-11 20:36:44 +02:00
|
|
|
last_push = "fn";
|
2022-01-13 05:24:03 +01:00
|
|
|
} else {
|
2023-07-11 20:36:44 +02:00
|
|
|
vsl = string_trim(vsl);
|
2022-01-13 05:24:03 +01:00
|
|
|
switch(vsl) {
|
2023-06-20 19:43:19 +02:00
|
|
|
case "e" : ds_stack_push(vl, 2.71828); break;
|
|
|
|
case "pi": ds_stack_push(vl, pi); break;
|
|
|
|
default : ds_stack_push(vl, isNumber(vsl)? toNumber(vsl) : vsl); break;
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
2023-07-11 20:36:44 +02:00
|
|
|
|
|
|
|
last_push = "vl";
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
}
|
2023-05-22 20:31:55 +02:00
|
|
|
|
|
|
|
_ch = ch;
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
while(!ds_stack_empty(op))
|
|
|
|
ds_stack_push(vl, buildFuncTree(ds_stack_pop(op), vl));
|
2022-01-13 05:24:03 +01:00
|
|
|
ds_stack_destroy(op);
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
var tree = ds_stack_empty(vl)? noone : ds_stack_pop(vl)
|
|
|
|
ds_stack_destroy(vl);
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
if(!is_struct(tree))
|
2023-06-20 19:43:19 +02:00
|
|
|
tree = new __funcTree("", tree);
|
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
//print(tree);
|
|
|
|
//print("");
|
2023-07-11 20:36:44 +02:00
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
return tree;
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
function buildFuncTree(operator, vl) {
|
|
|
|
if(ds_stack_empty(vl)) return noone;
|
2023-06-13 21:24:05 +02:00
|
|
|
|
2023-07-12 16:28:32 +02:00
|
|
|
if(ds_map_exists(global.FUNCTIONS, operator)) {
|
|
|
|
if(ds_stack_empty(vl))
|
|
|
|
return noone;
|
|
|
|
|
|
|
|
var _v1 = ds_stack_pop(vl);
|
|
|
|
return new __funcTree(operator, _v1);
|
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
switch(operator) {
|
2023-06-26 18:55:41 +02:00
|
|
|
case "-": //deal with preceeding negative number -5
|
2023-06-20 19:43:19 +02:00
|
|
|
if(ds_stack_size(vl) >= 2) {
|
|
|
|
var _v1 = ds_stack_pop(vl);
|
|
|
|
var _v2 = ds_stack_pop(vl);
|
|
|
|
return new __funcTree("-", _v2, _v1);
|
|
|
|
} else
|
|
|
|
return new __funcTree("-", ds_stack_pop(vl), 0);
|
|
|
|
|
2023-07-11 20:36:44 +02:00
|
|
|
case "@":
|
|
|
|
var _v1 = ds_stack_pop(vl);
|
|
|
|
if(is_array(_v1))
|
|
|
|
return new __funcTree("【", _v1);
|
|
|
|
else {
|
|
|
|
var _v2 = ds_stack_pop(vl);
|
|
|
|
return new __funcTree(operator, _v2, _v1);
|
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
case "+": //binary operators
|
2023-03-11 01:40:17 +01:00
|
|
|
case "*":
|
2023-06-13 21:24:05 +02:00
|
|
|
case "$":
|
2022-01-13 05:24:03 +01:00
|
|
|
case "/":
|
2023-06-20 19:43:19 +02:00
|
|
|
|
2023-06-13 21:24:05 +02:00
|
|
|
case "|":
|
2023-06-20 19:43:19 +02:00
|
|
|
case "&":
|
2023-06-13 21:24:05 +02:00
|
|
|
case "^":
|
|
|
|
case "»":
|
|
|
|
case "«":
|
2023-06-20 19:43:19 +02:00
|
|
|
|
2023-06-13 21:24:05 +02:00
|
|
|
case "=":
|
|
|
|
case "≠":
|
|
|
|
case "≤":
|
|
|
|
case "≥":
|
2023-06-20 19:43:19 +02:00
|
|
|
case "<":
|
|
|
|
case ">":
|
|
|
|
|
|
|
|
if(ds_stack_size(vl) >= 2) {
|
|
|
|
var _v1 = ds_stack_pop(vl);
|
|
|
|
var _v2 = ds_stack_pop(vl);
|
|
|
|
return new __funcTree(operator, _v2, _v1);
|
|
|
|
}
|
|
|
|
|
|
|
|
default: return new __funcTree(operator, ds_stack_pop(vl));
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
|
2023-06-20 19:43:19 +02:00
|
|
|
return noone;
|
|
|
|
}
|
|
|
|
|
|
|
|
function evaluateFunction(fx, params = {}) {
|
2023-06-23 15:39:24 +02:00
|
|
|
if(isNumber(fx)) return toNumber(fx);
|
2023-06-20 19:43:19 +02:00
|
|
|
return evaluateFunctionTree(fx).eval(params);
|
2022-01-13 05:24:03 +01:00
|
|
|
}
|
|
|
|
#endregion
|