-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathelement.hpp
416 lines (406 loc) · 8.56 KB
/
element.hpp
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
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
/**************************************************************************
* 运算元素
* 本页代码定义一种代理式元素
* 通过类型控制以及资源ID来索引实际元素,从而达到优化效率的目的
**************************************************************************/
#ifdef ELEMENT
#undef ELEMENT
#endif
#define ELEMENT GROUP::var_t
#define OBJ ELEMENT
#define ENT ELEMENT
#ifdef STRING2VAR
#undef STRING2VAR
#endif
#define STRING2VAR(str) GROUP::var_t(str)
// ------------------------------------------
// 元素定义
// ------------------------------------------
typedef struct var_t
{
using fun_set_t = std::function<void(const var_t& v)>;
string sval;
union {
int ival = 0;
real fval;
};
short resid = -1;
enum { TYPE_DEFAULT = 1, TYPE_INT = 1,TYPE_REAL = 2, TYPE_S = 3, TYPE_UNKOWN = 0};
short type = TYPE_DEFAULT; // 1 -int, 2 -real, 3 -string, 0 -unkown, other -custom
fun_set_t fun_set = 0;
var_t() { }
var_t(int _val) {
type = 1; ival = _val;
}
var_t(real _val) {
type = 2; fval = _val;
}
var_t(bool _val) {
type = 1; ival = (int)_val;
}
var_t(const char* _val) {
type = 3; sval = _val;
//PRINTV(sval);
}
var_t(const var_t& v)
{
//PRINT("var_t copy " << v.type);
(*this) = v;
}
var_t(int _type, const char* _val) {
type = _type; sval = _val;
}
void operator = (int v)
{
type = 1; ival = v; resid = -1;
}
void operator = (real v)
{
type = 2; fval = v; resid = -1;
}
void operator = (const var_t& v)
{
//PRINT("type =" << v.type << " v.sval = " << v.sval);
type = v.type;
if (type == 3)
sval = v.sval;
else if(type == 2)
fval = v.fval;
else if(type == 1)
ival = v.ival;
else if(fun_set)
fun_set(v);
else
sval = v.sval;
resid = v.resid;
}
bool operator == (int v) const
{
return type == 1 && ival == v;
}
bool operator != (int v) const
{
return type != 1 || ival != v;
}
bool operator == (const var_t& v) const
{
return
((type == 0 || v.type == 0 || !sval.empty()) && sval == v.sval) ||
(type == v.type && ((type == 1 && ival == v.ival) ||
(type == 2 && fval == v.fval))) ||
(type != v.type && float(*this) == float(v));
}
bool operator != (const var_t& v) const
{
return !(*this == v);
}
operator bool() const
{
//PRINT("var_t::int " << ival)
if (type == 1)
return ival != 0;
if (type == 2)
return (int)fval != 0;
return !sval.empty() && sval != "";
}
operator int() const
{
//PRINT("var_t::int " << ival)
if (type == 1)
return ival;
if (type == 2)
return (int)fval;
return atoi(sval.c_str());
}
operator float() const
{
//PRINT("var_t::float " << ival)
if (type == 1)
return float(ival);
if (type == 2)
return fval;
return atof(sval.c_str());
//return 0.0f;
}
inline string tostr() const
{
//PRINT(type << ":" << sval);
if (type == 1)
return to_string(ival);
if (type == 2)
return to_string(fval);
return sval;
}
var_t operator + (var_t& v) const
{
var_t ret;
if (type == 1 && v.type == 1)
ret.ival = ival + v.ival;
else if (type == 3 || v.type == 3)
{
ret.type = 3;
ret.sval = tostr() + v.tostr();
//PRINTV(ret.sval)
}
else{
ret.type = 2;
ret.fval = float(*this) + float(v);
}
return ret;
}
void operator += (var_t& v)
{
ASSERT(type != 3 && v.type != 3);
if (type == 1 && v.type == 1)
ival += v.ival;
else if(type == 2){
fval += float(v);
}
}
var_t operator - (var_t& v) const
{
ASSERT(type != 3 && v.type != 3);
var_t ret;
if (type == 1 && v.type == 1)
ret.ival = ival - v.ival;
else{
ret.type = 2;
ret.fval = float(*this) - float(v);
}
return ret;
}
void operator -= (var_t& v)
{
ASSERT(type != 3 && v.type != 3);
if (type == 1 && v.type == 1) {
ival -= v.ival;
}
else if (type == 2) {
fval -= v.fval;
}
}
var_t operator - () const
{
ASSERT(type != 3);
var_t ret;
ret.type = type;
if (type == 1) {
ret.ival = -ival;
}
else if (type == 2) {
ret.fval = -fval;
}
return ret;
}
var_t operator * (var_t& v) const
{
ASSERT(type != 3 && v.type != 3);
var_t ret;
if (type == 1 && v.type == 1){
ret.ival = ival * v.ival;
}
else{
ret.type = 2;
ret.fval = float(*this) * float(v);
}
return ret;
}
var_t operator / (var_t& v) const
{
ASSERT(type != 3 && v.type != 3);
var_t ret;
if (type == 2 || v.type == 2) {
ret.type = 2;
ret.fval = float(*this) / float(v);
}
else
{
ret.ival = ival / v.ival;
}
return ret;
}
bool operator > (const var_t& v) const
{
ASSERT(type != 3 && v.type != 3);
if (type == 2 || v.type == 2) {
return float(*this) > float(v);
}
else
{
return ival > v.ival;
}
}
bool operator < (const var_t& v) const
{
ASSERT(type != 3 && v.type != 3);
if (type == 2 || v.type == 2) {
return float(*this) < float(v);
}
else
{
return ival < v.ival;
}
}
};
// ------------------------------------------
// 打印
// ------------------------------------------
void(*print_fun)(const var&) = 0;
inline void _PHGPRINT(const std::string& pre, const var& v)
{
if (v.type == 1)
PRINT(pre << v.ival)
else if (v.type == 2)
PRINT(pre << v.fval)
else if (v.type == 3)
PRINT(pre << v.sval)
else
{
if (!v.sval.empty())
PRINT(pre << v.sval)
else if (!strlist.empty())
PRINT(pre << strlist.back())
if (print_fun)
print_fun(v);
}
}
// ------------------------------------------
// 运算符号定义
// ------------------------------------------
#define CHECK_CALC (c == '+' || c == '-' || c == '*' || c == '/' || c == '^' || c == '.' || c == '`')
#define CHECK_LOGIC (c == '>' || c == '<' || c == '=' || c == '&' || c == '|' || c == '!')
// CALC RANK
#define RANK_INIT \
rank['|'] = 1; \
rank['&'] = 2; \
rank['>'] = 3; \
rank['<'] = 3; \
rank['='] = 3; \
rank['+'] = 4; \
rank['-'] = 4; \
rank['*'] = 5; \
rank['/'] = 5; \
rank['!'] = 6; \
rank['^'] = 7; \
rank['`'] = 8; \
rank['~'] = 8; \
rank['.'] = 9;
// ------------------------------------------
#define USE_STRING
#include "phg.hpp"
#undef USE_STRING
// ------------------------------------------
// 运算实现
// ------------------------------------------
using fun_calc_t = std::function<var(code& cd, opr o, int args)>;
fun_calc_t fun_calc = 0;
static var _act(code& cd, int args)
{
opr o = cd.oprstack.pop();
//PRINT("calc:" << (char)o << "(" << args << ")");
if (fun_calc)
{
var ret = fun_calc(cd, o, args);
if (ret != 0)
return ret;
}
var ret = 0;
switch (o) {
case '+': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a + b;
}
else {
return cd.valstack.pop();
}
}break;
case '+=': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a + b;
crstr a_name = GET_SPARAM(1);
SET_SVAR(a_name, ret);
}
else {
return cd.valstack.pop();
}
}break;
case '-': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a - b;
}
else {
return -cd.valstack.pop();
}
}break;
case '*': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a * b;
}
else {
return cd.valstack.pop();
}
}break;
case '/': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a / b;
}
else {
return cd.valstack.pop();
}
}break;
case '^': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = pow((real)a, (real)b);
}break;
case '=': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = var(int(a == b));
}break;
case '>': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a > b;
}break;
case '<': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = a < b;
}break;
case '&': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = int(a) && int(b);
}break;
case '|': {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = int(a) || int(b);
}break;
case '!': {
if (args > 1) {
var& b = PHG_VALSTACK(1);
var& a = PHG_VALSTACK(2);
ret = !(a == b);
}
else {
var a = cd.valstack.pop();
return !int(a);
}
}break;
default: {}
}
PHG_VALPOP(args);
return ret;
}