-
Notifications
You must be signed in to change notification settings - Fork 0
/
Classes.cpp
315 lines (312 loc) · 8.8 KB
/
Classes.cpp
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
#include "Classes.h" //ýòî íàø ïðîøëûé çàãîëîâîê
#include <cstring> //çàãîëîâîê äëÿ strcmp()
namespace forSolverEq
{
//
double mysqrt(double num, double n)
{
double exp = pow(forSolverEq::exactSqrt, n);
if(n == 0) return 1;//x^0 == 1
else if(n<0) return 1 / mysqrt(num, -n); // x^(1/-2) == 1 / x^(1/2)
else if(n<1) return pow(num, 1 / n);// x^(1/2) == pow(x, 1/2)
else if(num < 0 && fmod(n,2) == 0)
return -nan("");//sqrt from negative is impossible
double onedivn = 1 / n, nm1 = n - 1,
rt = (num + 1) / 2;
if(exp == 0) exp = 0.00000000001;
long double powed = pow(rt,n);
if(std::isinf(powed)){
rt =2;
powed = pow(rt, n);
}
//way searching roots by Newton
int i = 1;
while(fabs(powed - num) > exp)
{
rt =onedivn* (nm1 * rt + num / (powed / rt));
if(std::isinf(powed) || rt == 0) rt = i;
powed = pow(rt,n);
if(i>500) break;
i++;
}
return rt;
}
double(*operations[sizeOperationsNames])(double) {fabs,sin, cos, tan, asin, acos, atan,sqrt };
double constants[sizeConstants]
{
3.141592653589,6.283180779586, 2.718281828459,
4.669201609102, 1.618033988749, 57.295779513082
};
const char* operationsNames[sizeOperationsNames]
{
"abs","sin", "cos", "tan", "asin", "acos", "atan", "sqrt"
};
const char* constantsNames[sizeConstants]{
"pi", "tau", "e", "delta", "phi", "rad"
};
const char* binOpNames[sizeBinOpNames]{"rt", "pow"};
double (*binops[sizeBinOpNames])(double, double){mysqrt, pow};
data*d; //We need it while calcul(). It's temperary data
double exactSqrt = 0.1;
}
ABC_Variable::ABC_Variable() :id(0) { }
ABC_Variable::ABC_Variable(char id) : id(id) { }
ABC_Variable::~ABC_Variable(){}
//Unknown
void Unknown::inilisated(char sign, ABC_Variable& pow)
{
this->sign = sign;
if (pow.id == NUMSIGN)
power = new Num(static_cast<Num&>(pow));
}//
void Unknown::inilisated(char sign, ABC_Variable& pow, double qty2)
{
this->sign = sign;
qty = qty2;
if (pow.id == NUMSIGN)
power = new Num(static_cast<Num&>(pow));
}
Unknown::~Unknown()
{
delete power;
}
//operation
operation::operation(char ch) :op(ch), ABC_Variable('o') { }
//Layout
Layout::~Layout()
{
for (auto it = begin(); it != end(); it++)
delete *(it);
}
void SolverEq::read(char*str)
{
std::vector<Layout*>stack; //stack of Layout*.
int size{};
{
int maxBrackets = 0,rightBr = -1, leftBr = -1;
for (char ch = str[0];; ch = str[size])
{
if (ch == '(')
leftBr++;
else if (ch == ')')
rightBr++;
else if (ch == '\0')
break;
if (leftBr > maxBrackets)
maxBrackets = leftBr;
size++;
}
if(rightBr != leftBr)
throw "lack of brackets";
stack.reserve(maxBrackets + 1);//and reserve. +1 for main equation
}
stack.push_back(&lay);
Layout* thisLay = &lay;
for (int i = 0; i < size; i++)
{
char ch = str[i];
if(ch >= 'a' && ch <= 'z')
{
char* str2 = &str[i];
for (;; i++)
{
if(str[i] < 'a' || str[i] > 'z')
break;
}
ch = str[i];
str[i] = '\0';
if(strcmp(str2, "x") == 0)
thisLay->push_back(new Unknown('x', Num(1)));
else if(strcmp(str2, "y") == 0)
thisLay->push_back(new Unknown('y', Num(1)));
else{
for(int indJ = 0;indJ < sizeConstants;indJ++)
if (strcmp(forSolverEq::constantsNames[indJ], str2) == 0)
{
thisLay->push_back(new Num(forSolverEq::constants[indJ]));
goto noErr;
}
for (int indJ = 0; indJ < sizeOperationsNames; indJ++)
if (strcmp(forSolverEq::operationsNames[indJ], str2) == 0)
{
thisLay->push_back(new operation(static_cast<char>(indJ)));
goto noErr;
}
for(int indJ = 0; indJ < sizeBinOpNames; indJ++)
if(strcmp(forSolverEq::binOpNames[indJ], str2) == 0)
{
thisLay->push_back(new operation(static_cast<char>(indJ), 'b'));
goto noErr;
}
throw
"Unknown variable/function";
}
noErr:
str[i] = ch;
i--;
}
else if (ch >= '0' && ch <= '9')
{
char* str2 = &str[i];
for (;; i++)
{
if ((str[i] < '0' || str[i] > '9') && (str[i] != '.'))
break;
}
ch = str[i];
str[i] = '\0';
thisLay->push_back(new Num(atof(str2)));
str[i] = ch;
i--;
}
else {
switch (ch)
{
case ' ':
break;
case '-':
case '+':
case '/':
case '*':
thisLay->push_back(new operation(ch));
break;
case ',':
case ')':
stack.pop_back();
thisLay = stack.back();
if(ch == ')')break;
case '(':
{
Layout*newL = new Layout;
stack.push_back(newL);
thisLay->push_back(newL);
thisLay = newL;
break;
}
case '^':
thisLay->push_back(new operation('^', OPERATSIGN));
std::swap(thisLay->back(), *(&(thisLay->back()) - 1));
break;
default:
throw "Unknown variable2/function";
};
}
}
}
void SolverEq::clear()
{
if(lay.size() != 0)
lay.clear();
}
floatN SolverEq::expression(Layout&l)
{
using forSolverEq::d;
uint i = 0, siz = l.size();
floatN result = mult(l, i);
for (; i < siz;)
{
switch (d->op)
{
case '+':
result += mult(l, ++i);
break;
case '-':
result -= mult(l, ++i);
break;
default:
return result;
}
}
return result;
}
floatN SolverEq::mult(Layout&l, uint&ind)
{
using forSolverEq::d;
floatN result;
result = getValue(l, ind);
uint siz = l.size();
for (; ind < siz;)
{
forSolverEq::d->op = static_cast<operation*>(l[ind])->op;
switch (forSolverEq::d->op)
{
case '*':
result *= getValue(l, ++ind);
break;
case '/': {
floatN d = getValue(l, ++ind);
if(d == 0)
throw "Zero dividing";
result /= d;
}
break;
default:
return result;
}
}
d->op = 0;
return result;
}
floatN SolverEq::getValue(Layout&l, uint&ind)
{
ABC_Variable&abc = *(l[ind]);
char ch = abc.getId();
ind++;
switch (ch)
{
case 'l':
return expression(static_cast<Layout&>(abc));
case 'u': {
auto&t = static_cast<Unknown&>(abc);
return t.get_value(forSolverEq::d->search->at(t.getSign()));
}
case 'd':
return static_cast<Num&>(abc).numD;
case 'o':
{
operation&o = static_cast<operation&>(abc);
if (o.op == '-')
return -getValue(l, ind);
else if (o.op < sizeOperationsNames)
return forSolverEq::operations[o.op](getValue(l, ind));
else if(o.op == '^'){
floatN one = getValue(l, ind);
floatN two = getValue(l, ind);
return pow(one, two);
}
break;
}
case 'b':
{
int n= static_cast<operation&>(abc).op;
floatN one = getValue(l, ind);
floatN two = getValue(l, ind);
return forSolverEq::binops[n](one, two);
}
default:
break;
}
}
floatN SolverEq::calcul(mapCD&c)
{
using forSolverEq::data;
using forSolverEq::d;
d = new data;
fast_ptr<data> delD(d);// for delete d;
d->search = &c;
floatN r = expression(lay);
return r;
}
/* for(int i = thisLay->size() - 3;;--i)
{
if(i < 0)break;
ABC_Variable*a = (*thisLay)[i];
if(a->getId() == 'o' || a->getId() == 'b')
{
char ch = static_cast<operation*>(a)->op;
if((ch < sizeOperationsNames || ch == '^'))
std::swap(a,(*thisLay)[i+1] );
}
else break;
}
break;*/