forked from toolgood/ToolGood.Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAlgorithmEngine.cs
More file actions
862 lines (790 loc) · 34.7 KB
/
Copy pathAlgorithmEngine.cs
File metadata and controls
862 lines (790 loc) · 34.7 KB
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
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ToolGood.Algorithm
{
public partial class AlgorithmEngine
{
List<string> m_Operators = new List<string>() { "(", ")", "!", "*", "/", "%", "+", "-", "<", ">", "=", "&", "|", ",", "==", "!=", ">=", "<=", "<>", "@" };
Stack<object> m_tokens = new Stack<object>(); //最终逆波兰式堆栈
Dictionary<String, Func<List<Operand>, Operand>> funcDict = new Dictionary<string, Func<List<Operand>, Operand>>();
public AlgorithmEngine()
{
AddDateTimeFunction();
AddFlowFunction();
AddMathFunction();
AddStringFunction();
AddSumFunction();
}
private void addFunc(string name, Func<List<Operand>, Operand> func)
{
name = name.ToLower().Trim();
m_Operators.Add(name);
funcDict[name] = func;
}
#region 可重写的方法
protected virtual Operand GetParameter(Operand curOpd)
{
return null;
}
#endregion
#region Parse
public bool Parse(string exp)
{
m_tokens.Clear();//清空语法单元堆栈
if (string.IsNullOrEmpty(exp) || exp.Trim() == "" || !this.isMatching(exp)) {
return false;
}
Stack<object> operands = new Stack<object>(); //操作数堆栈
Stack<Operator> operators = new Stack<Operator>(); //运算符堆栈
OperatorType optType = OperatorType.ERR; //运算符类型
string curOpd = ""; //当前操作数
string curOpt = ""; //当前运算符
int curPos = 0; //当前位置
int funcCount = 0; //函数数量
var texts = splitText(exp);
texts.Add("@");
corrections(texts);
while (curPos < texts.Count) {
//获取 当前操作数
curOpd = getOperand(texts, curPos);
if (curOpd != "") {
operands.Push(new Operand(curOpd));
curPos++;
}
// 获取 当前运算符
curOpt = texts[curPos++];
if (curOpt == "@") break;
#region 解释括号
//若当前运算符为左括号,则直接存入堆栈。
if (curOpt == "(") {
operators.Push(new Operator(OperatorType.LB, "("));
continue;
}
//若当前运算符为右括号,则依次弹出运算符堆栈中的运算符并存入到操作数堆栈,直到遇到左括号为止,此时抛弃该左括号.
if (curOpt == ")") {
while (operators.Count > 0) {
if (operators.Peek().Type != OperatorType.LB) {
operands.Push(operators.Pop());
} else {
operators.Pop();
break;
}
}
continue;
}
#endregion
optType = Operator.ConvertOperator(curOpt, texts[curPos]);
if (optType== OperatorType.PARAMETER) {
operands.Push(new Operand(curOpt));
continue;
}
funcCount = optType != OperatorType.FUNC ? 0 : getFunctionCount(texts, curPos);
//若运算符堆栈为空,或者若运算符堆栈栈顶为左括号,则将当前运算符直接存入运算符堆栈.
if (operators.Count == 0 || operators.Peek().Type == OperatorType.LB) {
operators.Push(new Operator(optType, curOpt, funcCount));
continue;
}
//若当前运算符优先级大于运算符栈顶的运算符,则将当前运算符直接存入运算符堆栈.
if (Operator.ComparePriority(optType, operators.Peek().Type) > 0) {
operators.Push(new Operator(optType, curOpt, funcCount));
} else {
//若当前运算符若比运算符堆栈栈顶的运算符优先级低或相等,则输出栈顶运算符到操作数堆栈,直至运算符栈栈顶运算符低于(不包括等于)该运算符优先级,
//或运算符栈栈顶运算符为左括号
//并将当前运算符压入运算符堆栈。
while (operators.Count > 0) {
if (Operator.ComparePriority(optType, operators.Peek().Type) <= 0 && operators.Peek().Type != OperatorType.LB) {
operands.Push(operators.Pop());
if (operators.Count == 0) {
operators.Push(new Operator(optType, curOpt, funcCount));
break;
}
} else {
operators.Push(new Operator(optType, curOpt, funcCount));
break;
}
}
}
}
//转换完成,若运算符堆栈中尚有运算符时,
//则依序取出运算符到操作数堆栈,直到运算符堆栈为空
while (operators.Count > 0) {
operands.Push(operators.Pop());
}
//调整操作数栈中对象的顺序并输出到最终栈
while (operands.Count > 0) {
m_tokens.Push(operands.Pop());
}
return true;
}
private int getFunctionCount(List<string> texts, int curPos)
{
var hasCount = 0;
var count = 0;
Stack<string> list = new Stack<string>();
for (int i = curPos + 1; i < texts.Count; i++) {
var t = texts[i];
if (t == ")") {
if (list.Count == 0) break;
list.Pop();
} else if (t == "(") {
list.Push(t);
} else if (t == "," && list.Count == 0) {
count++;
}
hasCount = 1;
}
return count + hasCount;
}
private string getOperand(List<string> texts, int curPos)
{
var t = texts[curPos];
if (curPos + 1 < texts.Count) {
var t2 = texts[curPos + 1];
if (t2 == "(") {
return "";
}
}
if (m_Operators.Contains(t.ToLower())) {
return "";
}
return t;
}
/// <summary>
/// 更正信息
/// </summary>
/// <param name="texts"></param>
private void corrections(List<string> texts)
{
for (int i = texts.Count - 1; i >= 1; i--) {
var t = texts[i];
if (i > 0) {
var t2 = texts[i - 1];
if (t == "-" && (t2 == "(" || t2 == "{" || t2 == ",")) {
texts.RemoveAt(i);
texts[i] = "-" + texts[i];
} else if (t == "+" && (t2 == "(" || t2 == "{" || t2 == ",")) {
texts.RemoveAt(i);
}
} else if (i == 0) {
if (t == "-") {
texts.RemoveAt(i);
texts[i] = "-" + texts[i];
} else if (t == "+") {
texts.RemoveAt(i);
}
}
if (t == "}") {
texts[i] = ")";
} else if (t == "{") {
texts[i] = "(";
texts.Insert(i, "array");
}
}
}
/// <summary>
/// 验证字符串
/// </summary>
/// <param name="exp"></param>
/// <returns></returns>
private bool isMatching(string exp)
{
List<char> opts = new List<char>();
bool inString = false;
var index = 0;
while (index < exp.Length) {
var chr = exp[index++];
if (inString) {
if (chr == '\\') {
index++;
} else if (opts.Last() == chr) {
opts.RemoveAt(opts.Count - 1);
inString = false;
}
} else {
if ("\"'".Contains(chr)) {
opts.Add(chr);
inString = true;
} else if (chr == '(') {
opts.Add('(');
} else if (chr == '【') {
opts.Add('[');
} else if (chr == '(' || chr == '[' || chr == '{') {
opts.Add(chr);
} else if ((chr == ')' || chr == ')') && opts.Count > 0 && opts.Last() == '(') {
opts.RemoveAt(opts.Count - 1);
} else if ((chr == ']' || chr == '】') && opts.Count > 0 && opts.Last() == '[') {
opts.RemoveAt(opts.Count - 1);
} else if (chr == '}' && opts.Count > 0 && opts.Last() == '{') {
opts.RemoveAt(opts.Count - 1);
} else {
//return false;
}
}
}
return opts.Count == 0;
}
/// <summary>
/// 分割字符串
/// </summary>
/// <param name="exp"></param>
/// <returns></returns>
private List<string> splitText(string exp)
{
List<string> list = new List<string>();
char opts = 'a';
bool inString = false;
bool inParameter = false;
var end = 0;
var start = 0;
while (end < exp.Length) {
var chr = exp[end++];
if (inString) {
if (chr == '\\') {
end++;
} else if (opts == chr) {
inString = false;
list.Add(exp.Substring(start, end - start));
start = end;
}
} else if (inParameter) {
if (chr == ']' || chr == '】') {
inParameter = false;
if (start < end - 1) {
list.Add(exp.Substring(start, end - start).Trim());
}
start = end;
}
} else {
if ("\"'".Contains(chr)) {
opts = chr;
inString = true;
if (start < end - 1) {
list.Add(exp.Substring(start, end - start - 1).Trim());
}
start = end - 1;
} else if (chr == '[' || chr == '【') {
inParameter = true;
if (start < end - 1) {
list.Add(exp.Substring(start, end - start - 1).Trim());
}
start = end - 1;
} else if ("(){}*&%+-=/<>!|, ,()".Contains(chr)) {
if (start < end - 1) {
list.Add(exp.Substring(start, end - start - 1).Trim());
start = end - 1;
}
if (start + 2 < exp.Length) {
var str = exp.Substring(start, 2);
if (str == "!=" || str == "==" || str == "<>" || str == ">=" || str == "<=" /*|| str == "&&" || str == "||"*/) {
end++;
}
}
var str2 = exp.Substring(start, end - start).Trim()
.Replace(",", ",")
.Replace("【", "[")
.Replace("】", "]")
.Replace("(", "(")
.Replace(")", ")");
if (str2 != "") list.Add(str2);
start = end;
}
}
}
if (end > start) {
list.Add(exp.Substring(start, end - start).Trim());
}
return list;
}
#endregion
#region GetParameterNames
public List<string> GetParameterNames()
{
List<string> list = new List<string>();
foreach (var item in m_tokens) {
var curOpd = item as Operand;
if (curOpd != null) {
if (curOpd.Type == OperandType.PARAMETER) {
var name = curOpd.Value.ToString();
list.Add(name);
}
}
}
return list;
}
#endregion
public object Evaluate()
{
/*
逆波兰表达式求值算法:
、循环扫描语法单元的项目。
、如果扫描的项目是操作数,则将其压入操作数堆栈,并扫描下一个项目。
、如果扫描的项目是一个二元运算符,则对栈的顶上两个操作数执行该运算。
、如果扫描的项目是一个一元运算符,则对栈的最顶上操作数执行该运算。
、将运算结果重新压入堆栈。
、重复步骤2-5,堆栈中即为结果值。
*/
if (m_tokens.Count == 0) return null;
object value = null;
Stack<Operand> opds = new Stack<Operand>();
Stack<object> pars = new Stack<object>();
foreach (object item in m_tokens) {
var curOpd = item as Operand;
if (curOpd != null) {
if (curOpd.Type == OperandType.PARAMETER) {
var opd = GetParameter(curOpd);
if (opd != null) {
opds.Push(opd);
continue;
}
}
opds.Push((Operand)item);
} else {
var curOpt = (Operator)item;
List<Operand> list = new List<Operand>();
switch (curOpt.Type) {
#region 乘,*,multiplication
case OperatorType.MUL:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(mul(list));
break;
#endregion
#region 除,/,division
case OperatorType.DIV:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(div(list));
break;
#endregion
#region 余,%,modulus
case OperatorType.MOD:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(mod(list));
break;
#endregion
#region 加,+,Addition
case OperatorType.ADD:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(add(list));
break;
#endregion
#region 加,&,Addition
case OperatorType.StringADD:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(stringAdd(list));
break;
#endregion
#region 减,-,subtraction
case OperatorType.SUB:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(sub(list));
break;
#endregion
#region 小于 小于或等于 大于 大于或等于 等于 不等于
case OperatorType.LT:
case OperatorType.LE:
case OperatorType.GT:
case OperatorType.GE:
case OperatorType.ET:
case OperatorType.UT:
list.Insert(0, opds.Pop());
list.Insert(0, opds.Pop());
opds.Push(compare(list, curOpt.Type));
break;
#endregion
#region FUNC
case OperatorType.FUNC:
for (int i = 0; i < curOpt.ArgsCount; i++) {
list.Insert(0, opds.Pop());
}
var fun = funcDict[curOpt.Value.ToLower()];
if (curOpt.Value.ToLower() != "iferror") {
var o = hasError(list);
if (o != null) {
opds.Push(o);
break;
}
}
opds.Push(fun(list));
break;
#endregion
}
}
}
if (opds.Count == 1) {
var outopd = opds.Pop();
if (outopd.Type == OperandType.ERROR) {
throw new Exception(outopd.StringValue);
}
value = outopd.Value;
}
//if (value is Date) {
// var v = (Date)value;
// if (v.Year>0) {
// return (DateTime)v;
// }
// return (TimeSpan)v;
//}
return value;
}
#region TryEvaluate
public short TryEvaluate(string exp, short def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (short)(double)(Date)obj;
return (short)(double)obj;
}
return def;
}
public int TryEvaluate(string exp, int def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (int)(double)(Date)Evaluate();
return (int)(double)obj;
}
return def;
}
public long TryEvaluate(string exp, long def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (long)(double)(Date)obj;
return (long)(double)obj;
}
return def;
}
public ushort TryEvaluate(string exp, ushort def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (ushort)(double)(Date)obj;
return (ushort)(double)obj;
}
return def;
}
public uint TryEvaluate(string exp, uint def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (uint)(double)(Date)obj;
return (uint)(double)obj;
}
return def;
}
public ulong TryEvaluate(string exp, ulong def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (ulong)(double)(Date)obj;
return (ulong)(double)obj;
}
return def;
}
public float TryEvaluate(string exp, float def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (float)(double)(Date)obj;
return (float)(double)obj;
}
return def;
}
public double TryEvaluate(string exp, double def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is Date) return (double)(Date)obj;
return (double)obj;
}
return def;
}
public string TryEvaluate(string exp, string def)
{
if (Parse(exp)) {
return Evaluate().ToString();
}
return def;
}
public bool TryEvaluate(string exp, bool def)
{
if (Parse(exp)) {
return (bool)Evaluate();
}
return def;
}
public DateTime TryEvaluate(string exp, DateTime def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is string) {
DateTime dt;
if (DateTime.TryParse(obj.ToString(),out dt)) {
return dt;
}
return def;
}
return (DateTime)(Date)Evaluate();
}
return def;
}
public TimeSpan TryEvaluate(string exp, TimeSpan def)
{
if (Parse(exp)) {
var obj = Evaluate();
if (obj is string) {
TimeSpan dt;
if (TimeSpan.TryParse(obj.ToString(), out dt)) {
return dt;
}
return def;
}
return (TimeSpan)(Date)Evaluate();
}
return def;
}
#endregion
private Operand doFunc(Operator curOpt, List<Operand> ops)
{
try {
var fun = funcDict[curOpt.Value.ToLower()];
if (curOpt.Value.ToLower() != "iferror") {
var o = hasError(ops);
if (o != null) {
return o;
}
}
return fun(ops);
} catch (Exception ex) {
return new Operand(OperandType.ERROR, curOpt.ToString() + "Error:" + ex.Message);
}
}
private Operand hasError(List<Operand> ops)
{
foreach (var item in ops) {
if (item.Type == OperandType.ERROR) {
return item;
}
}
return null;
}
private Operand throwError(string errMsg, List<Operand> ops)
{
foreach (var item in ops) {
if (item.Type == OperandType.ERROR) {
return item;
}
}
return new Operand(OperandType.ERROR, errMsg);
}
#region 加减乘除 连接 取余
private Operand stringAdd(List<Operand> ops)
{
return new Operand(OperandType.STRING, ops[0].StringValue + ops[1].StringValue);
}
private Operand add(List<Operand> ops)
{
if (ops[1].Type == OperandType.NUMBER) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue + ops[1].NumberValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue + ops[1].NumberValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) + ops[1].NumberValue);
}
}
if (ops[1].Type == OperandType.BOOLEAN) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue + (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue + (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) + (ops[1].BooleanValue ? 1.0 : 0.0));
}
}
if (ops[1].Type == OperandType.DATE) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue + ops[1].DateValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue + ops[1].DateValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) + ops[1].DateValue);
}
}
//if (ops[1].Type == OperandType.STRING || ops[0].Type == OperandType.STRING) {
// return new Operand(OperandType.STRING, ops[0].StringValue + ops[1].StringValue);
//}
return throwError("两个参数不能相加", ops);
}
private Operand sub(List<Operand> ops)
{
if (ops[1].Type == OperandType.NUMBER) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue - ops[1].NumberValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue - ops[1].NumberValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) - ops[1].NumberValue);
}
}
if (ops[1].Type == OperandType.BOOLEAN) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue - (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue - (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) - (ops[1].BooleanValue ? 1.0 : 0.0));
}
}
if (ops[1].Type == OperandType.DATE) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue - ops[1].DateValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue - ops[1].DateValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) - ops[1].DateValue);
}
}
return throwError("两个参数不能相减", ops);
}
private Operand mul(List<Operand> ops)
{
if (ops[1].Type == OperandType.NUMBER) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue * ops[1].NumberValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue * ops[1].NumberValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) * ops[1].NumberValue);
}
}
if (ops[1].Type == OperandType.BOOLEAN) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue * (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue * (ops[1].BooleanValue ? 1.0 : 0.0));
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) * (ops[1].BooleanValue ? 1.0 : 0.0));
}
}
if (ops[1].Type == OperandType.DATE) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue * ops[1].DateValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) * ops[1].DateValue);
}
}
return throwError("两个参数不能相乘", ops);
}
private Operand div(List<Operand> ops)
{
if (ops[1].Type == OperandType.NUMBER) {
if (ops[1].NumberValue == 0) {
return throwError("无法除0", ops);
}
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue / ops[1].NumberValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue / ops[1].NumberValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) / ops[1].NumberValue);
}
}
if (ops[1].Type == OperandType.DATE) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue / ops[1].DateValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) / ops[1].DateValue);
}
}
return throwError("两个参数不能相除", ops);
}
private Operand mod(List<Operand> ops)
{
if (ops[1].Type == OperandType.NUMBER) {
if (ops[1].NumberValue == 0) {
return throwError("无法除0", ops);
}
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue % ops[1].NumberValue);
} else if (ops[0].Type == OperandType.DATE) {
return new Operand(OperandType.DATE, ops[0].DateValue % ops[1].NumberValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) % ops[1].NumberValue);
}
}
if (ops[1].Type == OperandType.DATE) {
if (ops[0].Type == OperandType.NUMBER) {
return new Operand(OperandType.NUMBER, ops[0].NumberValue % ops[1].DateValue);
} else if (ops[0].Type == OperandType.BOOLEAN) {
return new Operand(OperandType.NUMBER, (ops[0].BooleanValue ? 1.0 : 0.0) % ops[1].DateValue);
}
}
return throwError("两个参数不能相除取余", ops);
}
#endregion
#region 小于 小于或等于 大于 大于或等于 等于 不等于
private Operand compare(List<Operand> ops, OperatorType type)
{
var a = ops[0];
var b = ops[1];
int r = 0;
if (a.Type == b.Type) {
if (a.Type == OperandType.STRING) {
r = compare(a.StringValue, b.StringValue);
} else {
r = compare(a.NumberValue, b.NumberValue);
}
} else if ((a.Type == OperandType.DATE && b.Type == OperandType.STRING) || (b.Type == OperandType.DATE && a.Type == OperandType.STRING)) {
r = compare(a.StringValue, b.StringValue);
} else if (a.Type == OperandType.STRING || b.Type == OperandType.STRING) {
return new Operand(OperandType.ERROR, "两个类型无法比较");
} else {
r = compare(a.NumberValue, b.NumberValue);
}
if (type == OperatorType.LT) {
return new Operand(OperandType.BOOLEAN, r == -1);
} else if (type == OperatorType.LE) {
return new Operand(OperandType.BOOLEAN, r <= 0);
} else if (type == OperatorType.GT) {
return new Operand(OperandType.BOOLEAN, r == 1);
} else if (type == OperatorType.GE) {
return new Operand(OperandType.BOOLEAN, r >= 0);
} else if (type == OperatorType.ET) {
return new Operand(OperandType.BOOLEAN, r == 0);
}
return new Operand(OperandType.BOOLEAN, r != 0);
}
private int compare(double t1, double t2)
{
t1 = Math.Round(t1, 12);
t2 = Math.Round(t2, 12);
if (t1 == t2) {
return 0;
} else if (t1 > t2) {
return 1;
}
return -1;
}
private int compare(string t1, string t2)
{
if (t1 == t2) {
return 0;
}
List<string> ts = new List<string>() { t1, t2 };
ts = ts.OrderBy(q => q).ToList();
if (t1 == ts[1]) {
return 1;
}
return -1;
}
#endregion
}
}