-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathConvertFunc.cpp
293 lines (266 loc) · 7.53 KB
/
ConvertFunc.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
#include "ConvertFunc.h"
double calc(const double& num1, const double& num2, const char& op){
double res;
switch(op){
case '+':
res = num1 + num2;
break;
case '-':
res = num1 - num2;
break;
case '*':
res = num1 * num2;
break;
case '/':
res = num1 / num2;
break;
case '%':
//may occur error answer!
if((int)num2 == 0)
res = std::nanf("1");
else
res = (int)num1 % (int)num2;
break;
case '^':
res = pow(num1, num2);
break;
case '.': {
QString integer(QString::asprintf("%d", (int)num1));
QString fracture(QString::asprintf("%d", (int)num2));
fracture.remove(0, 1); //remove the first 0
QString num;
num.append(integer);
num.append('.');
num.append(fracture);
res = num.toDouble();
break;
}
default:
res = 0;
break;
}
return res;
}
void Expression::rebuildStacks(){
QString tempString = expString;
opStack.Empty();
numStack.Empty();
errorInput.Empty();
expString.clear();
inputCons = 0b101011;
for(int i = 0; i < tempString.length(); i++){
insert(tempString[i].toLatin1());
}
}
void Expression::update(int index = -1){
while(numStack.Size() > 1 && !opStack.IsEmpty() && opMap[opStack.TopElement()] >= index && opStack.TopElement() != '('){
double num2 = numStack.PopBack();
double num1 = numStack.PopBack();
char op = opStack.PopBack();
double res = calc(num1, num2, op);
numStack.PushBack(res);
//count the differences in stacks
numChange.append('o');
numChange.append('o');
opChange.append('o');
numChange.append(QString::asprintf("i%lf", res));
}
//enable fracture
inputCons |= 0b000010;
}
void Expression::insert(char c){
//clear last step differences in stacks
opChange.clear();
numChange.clear();
if(c == '#'){
update();
return;
}
if(!errorInput.IsEmpty())
//Error stack is not empty, regard as error input.
errorInput.PushBack(c);
else if(c == '('){
if(inputCons & 0b100000){
opStack.PushBack(c);
opChange.append(QString::asprintf("i%c", c));
//allow minus numbers
inputCons |= 0b000001;
}
else
errorInput.PushBack(c);
}
else if(c == ')'){
if(inputCons & 0b010000){
update();
if(opStack.TopElement() == '('){
opStack.PopBack();
opChange.append('o');
//set constraints
inputCons &= 0b010110;
}
else
errorInput.PushBack(c);
}
else
errorInput.PushBack(c);
}
else if(c == '.'){
if((inputCons & 0b000110) == 0b000110){
//accept dot
opStack.PushBack(c);
numStack.PushBack(1);
opChange.append(QString::asprintf("i%c", c));
numChange.append("i1");
//stop accept dots and operators
inputCons &= 0b001010;
}
else
errorInput.PushBack(c);
}
else if(c >= '0' && c <= '9'){
if(inputCons & 0b001000){
if(inputCons & 0b010000 || opStack.TopElement() == '.'){
//not the first number
double i = numStack.PopBack();
i *= 10;
i += (c - '0');
numStack.PushBack(i);
numChange.append(QString::asprintf("oi%lf", i));
}
else{
double i = c - '0';
numStack.PushBack(i);
//qDebug() << c - '0' << "\n";
numChange.append(QString::asprintf("i%lf", i));
}
inputCons &= 0b011110;
inputCons |= 0b010000;
if(opStack.TopElement() != '.')
inputCons |= 0b000100;
}
else
errorInput.PushBack(c);
}
else if(opMap[c] >= 0){
if(inputCons & 0b010000){
//if(opStack.TopElement() == '.'){
// double fracture = numStack.PopBack();
// double integer = numStack.PopBack();
// double res = calc(integer, fracture, opStack.PopBack());
// numStack.PushBack(res);
//}
update(opMap[c]);
if(c == '%' && numStack.TopElement() != (int)numStack.TopElement())
errorInput.PushBack(c);
else{
opStack.PushBack(c);
opChange.append(QString::asprintf("i%c", c));
//set constraints
inputCons &= 0b101010;
inputCons |= 0b101000;
if(c == '%')
inputCons &= 0b111101;
}
}
else{
if(c == '-' && inputCons & 0b000001){
//adjust exp string
if(opStack.TopElement() != '(')
expString.append('0');
//accept minus number
numStack.PushBack(0);
opStack.PushBack('-');
numChange.append("i0");
opChange.append("i-");
//stop accepting minus numbers and operators
inputCons &= 0b101110;
//allow integers and dots
inputCons |= 0b101000;
}
else
errorInput.PushBack(c);
}
}
expString.append(c);
}
void Expression::backSpace(){
opChange.clear();
numChange.clear();
expString.chop(1);
if(!errorInput.IsEmpty())
errorInput.PopBack();
else{
rebuildStacks();
}
}
QString Expression::expStr(){
return expString;
}
QString Expression::expToHtml(){
QString output = expString;
if(!errorInput.IsEmpty()){
output.insert(expString.length() - errorInput.Size(), "<span style=\"color:#E56600;\">");
output.append("</span>");
}
return output;
}
QString Expression::resToHtml(){
QString res;
if(opStack.IsEmpty() && numStack.Size() == 1 && errorInput.IsEmpty())
res.append(QString::asprintf("%g", numStack.TopElement()));
else
res.append("Syntax Error!");
return res;
}
void Expression::clr(){
opStack.Empty();
numStack.Empty();
errorInput.Empty();
expString.clear();
inputCons = 0b101011;
numChange.clear();
opChange.clear();
}
bool Expression::prepare(){
expString.clear();
if(opStack.IsEmpty() && numStack.Size() == 1 && errorInput.IsEmpty()){
expString.append(QString::asprintf("%g", numStack.TopElement()));
return false;
}
else{
clr();
return true;
}
}
QString Expression::numDifStr(){
return numChange;
}
QString Expression::opDifStr(){
return opChange;
}
QString Expression::numStackToStr(){
QString numStr;
Stack<double> cpy(numStack);
QVector<double> reverse;
int n = cpy.Size();
for(int i = 0; i < n; i++){
reverse.push_back(cpy.PopBack());
}
for(int i = 0; i < n; i++){
numStr.append(QString::asprintf("i%lf", reverse[n - i - 1]));
}
return numStr;
}
QString Expression::opStackToStr(){
QString opStr;
Stack<char> cpy(opStack);
QVector<char> reverse;
int n = cpy.Size();
for(int i = 0; i < n; i++){
reverse.push_back(cpy.PopBack());
}
for(int i = 0; i < n; i++){
opStr.append(QString::asprintf("i%c", reverse[n - i - 1]));
}
return opStr;
}