1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/****************************************************************************
** Copyright (c) 2016, Adel Kara Slimane <adel.ks@zegrapher.com>
**
** This file is part of ZeGrapher's source code.
**
** ZeGrapher is free software: you may copy, redistribute and/or modify it
** under the terms of the GNU General Public License as published by the
** Free Software Foundation, either version 3 of the License, or (at your
** option) any later version.
**
** This file is distributed in the hope that it will be useful, but
** WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
** General Public License for more details.
**
** You should have received a copy of the GNU General Public License
** along with this program. If not, see <http://www.gnu.org/licenses/>.
**
****************************************************************************/
#include "Calculus/exprcalculator.h"
static double tenPower(double x)
{
return pow(10, x);
}
ExprCalculator::ExprCalculator(bool allowK, QList<FuncCalculator *> otherFuncs) : treeCreator(NORMAL_EXPR)
{
treeCreator.allow_k(allowK);
k = 0;
currentTree = NULL;
funcCalculatorsList = otherFuncs;
addRefFuncsPointers();
}
double ExprCalculator::calculateExpression(QString expr, bool &ok, double k_val)
{
ok = true;
k = k_val;
ok = checkCalledFuncsValidity(expr);
if(!ok)
return NAN;
currentTree = treeCreator.getTreeFromExpr(expr, ok);
if(!ok)
return NAN;
double result = calculateFromTree(currentTree);
treeCreator.deleteFastTree(currentTree);
currentTree = NULL;
return result;
}
void ExprCalculator::setAdditionnalVarsValues(QList<double> values)
{
additionnalVarsValues = values;
}
void ExprCalculator::setK(double val)
{
k = val;
}
bool ExprCalculator::checkCalledFuncsValidity(QString expr)
{
QList<int> calledFuncs = treeCreator.getCalledFuncs(expr);
if(funcCalculatorsList.isEmpty())
{
return calledFuncs.isEmpty();
}
else
{
bool validity = true;
for(int i = 0; i < calledFuncs.size() && validity ; i++)
validity = funcCalculatorsList[calledFuncs[i]]->isFuncValid();
return validity;
}
return false;
}
void ExprCalculator::addRefFuncsPointers()
{
refFuncs << acos << asin << atan << cos << sin << tan << sqrt
<< log10 << log << fabs << exp << floor << ceil << cosh
<< sinh << tanh << tenPower << tenPower << acosh << asinh
<< atanh << erf << erfc << tgamma << tgamma << cosh
<< sinh << tanh << acosh << asinh << atanh;
}
double ExprCalculator::calculateFromTree(FastTree *tree, double x)
{
if(tree->type == NUMBER )
{
return *tree->value;
}
else if(tree->type == PAR_K)
{
return k;
}
else if(tree->type == VAR_X || tree->type == VAR_T)
{
return x;
}
else if(tree->type == PLUS)
{
return calculateFromTree(tree->left, x) + calculateFromTree(tree->right, x);
}
else if(tree->type == MINUS)
{
return calculateFromTree(tree->left, x) - calculateFromTree(tree->right, x);
}
else if(tree->type == MULTIPLY)
{
return calculateFromTree(tree->left, x) * calculateFromTree(tree->right, x);
}
else if(tree->type == DIVIDE)
{
return calculateFromTree(tree->left, x) / calculateFromTree(tree->right, x);
}
else if(tree->type == POW)
{
return pow(calculateFromTree(tree->left, x), calculateFromTree(tree->right, x));
}
else if(REF_FUNC_START < tree->type && tree->type < REF_FUNC_END)
{
return (*refFuncs[tree->type - REF_FUNC_START - 1])(calculateFromTree(tree->right, x));
}
else if(FUNC_START < tree->type && tree->type < FUNC_END)
{
int id = tree->type - FUNC_START - 1;
return funcCalculatorsList[id]->getFuncValue(calculateFromTree(tree->right, x), k);
}
else if(DERIV_START < tree->type && tree->type < DERIV_END)
{
int id = tree->type - DERIV_START - 1;
return funcCalculatorsList[id]->getDerivativeValue(calculateFromTree(tree->right, x), k);
}
else if(tree->type >= ADDITIONNAL_VARS_START)
{
return additionnalVarsValues.at(tree->type - ADDITIONNAL_VARS_START);
}
else return NAN;
}
|
