forked from eddyparkinson/cellmaster
-
Notifications
You must be signed in to change notification settings - Fork 0
/
formula1.js
executable file
·5700 lines (4735 loc) · 182 KB
/
formula1.js
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
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//
//
/*
// SocialCalc Spreadsheet Formula Library
//
// Part of the SocialCalc package
//
// (c) Copyright 2008 Socialtext, Inc.
// All Rights Reserved.
//
// The contents of this file are subject to the Artistic License 2.0; you may not
// use this file except in compliance with the License. You may obtain a copy of
// the License at http://socialcalc.org/licenses/al-20/.
//
// Some of the other files in the SocialCalc package are licensed under
// different licenses. Please note the licenses of the modules you use.
//
// Code History:
//
// Initially coded by Dan Bricklin of Software Garden, Inc., for Socialtext, Inc.
// Based in part on the SocialCalc 1.1.0 code written in Perl.
// The SocialCalc 1.1.0 code was:
// Portions (c) Copyright 2005, 2006, 2007 Software Garden, Inc.
// All Rights Reserved.
// Portions (c) Copyright 2007 Socialtext, Inc.
// All Rights Reserved.
// The Perl SocialCalc started as modifications to the wikiCalc(R) program, version 1.0.
// wikiCalc 1.0 was written by Software Garden, Inc.
// Unless otherwise specified, referring to "SocialCalc" in comments refers to this
// JavaScript version of the code, not the SocialCalc Perl code.
//
*/
var SocialCalc;
if (!SocialCalc) SocialCalc = {}; // May be used with other SocialCalc libraries or standalone
// In any case, requires SocialCalc.Constants.
SocialCalc.Formula = {};
SocialCalc.TriggerIoAction = {}; // eddy
//
// Formula constants for parsing:
//
SocialCalc.Formula.ParseState = {num: 1, alpha: 2, coord: 3, string: 4, stringquote: 5, numexp1: 6, numexp2: 7, alphanumeric: 8, specialvalue:9};
SocialCalc.Formula.TokenType = {num: 1, coord: 2, op: 3, name: 4, error: 5, string: 6, space: 7};
SocialCalc.Formula.CharClass = {num: 1, numstart: 2, op: 3, eof: 4, alpha: 5, incoord: 6, error: 7, quote: 8, space: 9, specialstart: 10};
SocialCalc.Formula.CharClassTable = {
" ": 9, "!": 3, '"': 8, "'": 8, "#": 10, "$":6, "%":3, "&":3, "(": 3, ")": 3, "*": 3, "+": 3, ",": 3, "-": 3, ".": 2, "/": 3,
"0": 1, "1": 1, "2": 1, "3": 1, "4": 1, "5": 1, "6": 1, "7": 1, "8": 1, "9": 1,
":": 3, "<": 3, "=": 3, ">": 3,
"A": 5, "B": 5, "C": 5, "D": 5, "E": 5, "F": 5, "G": 5, "H": 5, "I": 5, "J": 5, "K": 5, "L": 5, "M": 5, "N": 5,
"O": 5, "P": 5, "Q": 5, "R": 5, "S": 5, "T": 5, "U": 5, "V": 5, "W": 5, "X": 5, "Y": 5, "Z": 5,
"^": 3, "_": 5,
"a": 5, "b": 5, "c": 5, "d": 5, "e": 5, "f": 5, "g": 5, "h": 5, "i": 5, "j": 5, "k": 5, "l": 5, "m": 5, "n": 5,
"o": 5, "p": 5, "q": 5, "r": 5, "s": 5, "t": 5, "u": 5, "v": 5, "w": 5, "x": 5, "y": 5, "z": 5
};
SocialCalc.Formula.UpperCaseTable = {
"a": "A", "b": "B", "c": "C", "d": "D", "e": "E", "f": "F", "g": "G", "h": "H", "i": "I", "j": "J", "k": "K", "l": "L", "m": "M",
"n": "N", "o": "O", "p": "P", "q": "Q", "r": "R", "s": "S", "t": "T", "u": "U", "v": "V", "w": "W", "x": "X", "y": "Y", "z": "Z",
"A": "A", "B": "B", "C": "C", "D": "D", "E": "E", "F": "F", "G": "G", "H": "H", "I": "I", "J": "J", "K": "K", "L": "L", "M": "M",
"N": "N", "O": "O", "P": "P", "Q": "Q", "R": "R", "S": "S", "T": "T", "U": "U", "V": "V", "W": "W", "X": "X", "Y": "Y", "Z": "Z"
}
SocialCalc.Formula.SpecialConstants = { // names that turn into constants for name lookup
"#NULL!": "0,e#NULL!", "#NUM!": "0,e#NUM!", "#DIV/0!": "0,e#DIV/0!", "#VALUE!": "0,e#VALUE!",
"#REF!": "0,e#REF!", "#NAME?": "0,e#NAME?"};
// Operator Precedence table
//
// 1- !, 2- : ,, 3- M P, 4- %, 5- ^, 6- * /, 7- + -, 8- &, 9- < > = G(>=) L(<=) N(<>),
// Negative value means Right Associative
SocialCalc.Formula.TokenPrecedence = {
"!": 1,
":": 2, ",": 2,
"M": -3, "P": -3,
"%": 4,
"^": 5,
"*": 6, "/": 6,
"+": 7, "-": 7,
"&": 8,
"<": 9, ">": 9, "G": 9, "L": 9, "N": 9
};
// Convert one-char token text to input text:
SocialCalc.Formula.TokenOpExpansion = {'G': '>=', 'L': '<=', 'M': '-', 'N': '<>', 'P': '+'};
//
// Information about the resulting value types when doing operations on values (used by LookupResultType)
//
// Each object entry is an object with specific types with result type info as follows:
//
// 'type1a': '|type2a:resulta|type2b:resultb|...
// Type of t* or n* matches any of those types not listed
// Results may be a type or the numbers 1 or 2 specifying to return type1 or type2
SocialCalc.Formula.TypeLookupTable = {
unaryminus: { 'n*': '|n*:1|', 'e*': '|e*:1|', 't*': '|t*:e#VALUE!|', 'b': '|b:n|'},
unaryplus: { 'n*': '|n*:1|', 'e*': '|e*:1|', 't*': '|t*:e#VALUE!|', 'b': '|b:n|'},
unarypercent: { 'n*': '|n:n%|n*:n|', 'e*': '|e*:1|', 't*': '|t*:e#VALUE!|', 'b': '|b:n|'},
plus: {
'n%': '|n%:n%|nd:n|nt:n|ndt:n|n$:n|n:n|n*:n|b:n|e*:2|t*:e#VALUE!|',
'nd': '|n%:n|nd:nd|nt:ndt|ndt:ndt|n$:n|n:nd|n*:n|b:n|e*:2|t*:e#VALUE!|',
'nt': '|n%:n|nd:ndt|nt:nt|ndt:ndt|n$:n|n:nt|n*:n|b:n|e*:2|t*:e#VALUE!|',
'ndt': '|n%:n|nd:ndt|nt:ndt|ndt:ndt|n$:n|n:ndt|n*:n|b:n|e*:2|t*:e#VALUE!|',
'n$': '|n%:n|nd:n|nt:n|ndt:n|n$:n$|n:n$|n*:n|b:n|e*:2|t*:e#VALUE!|',
'nl': '|n%:n|nd:n|nt:n|ndt:n|n$:n|n:n|n*:n|b:n|e*:2|t*:e#VALUE!|',
'n': '|n%:n|nd:nd|nt:nt|ndt:ndt|n$:n$|n:n|n*:n|b:n|e*:2|t*:e#VALUE!|',
'b': '|n%:n%|nd:nd|nt:nt|ndt:ndt|n$:n$|n:n|n*:n|b:n|e*:2|t*:e#VALUE!|',
't*': '|n*:e#VALUE!|t*:e#VALUE!|b:e#VALUE!|e*:2|',
'e*': '|e*:1|n*:1|t*:1|b:1|'
},
concat: {
't': '|t:t|th:th|tw:tw|tl:t|tr:tr|t*:2|e*:2|',
'th': '|t:th|th:th|tw:t|tl:th|tr:t|t*:t|e*:2|',
'tw': '|t:tw|th:t|tw:tw|tl:tw|tr:tw|t*:t|e*:2|',
'tl': '|t:tl|th:th|tw:tw|tl:tl|tr:tr|t*:t|e*:2|',
't*': '|t*:t|e*:2|',
'e*': '|e*:1|n*:1|t*:1|'
},
oneargnumeric: { 'n*': '|n*:n|', 'e*': '|e*:1|', 't*': '|t*:e#VALUE!|', 'b': '|b:n|'},
twoargnumeric: { 'n*': '|n*:n|t*:e#VALUE!|e*:2|', 'e*': '|e*:1|n*:1|t*:1|', 't*': '|t*:e#VALUE!|n*:e#VALUE!|e*:2|'},
propagateerror: { 'n*': '|n*:2|e*:2|', 'e*': '|e*:2|', 't*': '|t*:2|e*:2|', 'b': '|b:2|e*:2|'}
};
/* *******************
parseinfo = SocialCalc.Formula.ParseFormulaIntoTokens(line)
Parses a text string as if it was a spreadsheet formula
This uses a simple state machine run on each character in turn.
States remember whether a number is being gathered, etc.
The result is parseinfo which is an array with one entry for each token:
parseinfo[i] = {
text: "the characters making up the parsed token",
type: the type of the token (a number),
opcode: a single character version of an operator suitable for use in the
precedence table and distinguishing between unary and binary + and -.
************************* */
SocialCalc.Formula.ParseFormulaIntoTokens = function(line) {
var i, ch, cclass, haddecimal, last_token, last_token_type, last_token_text, t;
var scf = SocialCalc.Formula;
var scc = SocialCalc.Constants;
var parsestate = scf.ParseState;
var tokentype = scf.TokenType;
var charclass = scf.CharClass;
var charclasstable = scf.CharClassTable;
var uppercasetable = scf.UpperCaseTable; // much faster than toUpperCase function
var pushtoken = scf.ParsePushToken;
var coordregex = /^\$?[A-Z]{1,2}\$?[1-9]\d*$/i;
var parseinfo = [];
var str = "";
var state = 0;
var haddecimal = false;
for (i=0; i<=line.length; i++) {
if (i<line.length) {
ch = line.charAt(i);
cclass = charclasstable[ch];
}
else {
ch = "";
cclass = charclass.eof;
}
if (state == parsestate.num) {
if (cclass == charclass.num) {
str += ch;
}
else if (cclass == charclass.numstart && !haddecimal) {
haddecimal = true;
str += ch;
}
else if (ch == "E" || ch == "e") {
str += ch;
haddecimal = false;
state = parsestate.numexp1;
}
else { // end of number - save it
pushtoken(parseinfo, str, tokentype.num, 0);
haddecimal = false;
state = 0;
}
}
if (state == parsestate.numexp1) {
if (cclass == parsestate.num) {
state = parsestate.numexp2;
}
else if ((ch == '+' || ch == '-') && (uppercasetable[str.charAt(str.length-1)] == 'E')) {
str += ch;
}
else if (ch == 'E' || ch == 'e') {
;
}
else {
pushtoken(parseinfo, scc.s_parseerrexponent, tokentype.error, 0);
state = 0;
}
}
if (state == parsestate.numexp2) {
if (cclass == charclass.num) {
str += ch;
}
else { // end of number - save it
pushtoken(parseinfo, str, tokentype.num, 0);
state = 0;
}
}
if (state == parsestate.alpha) {
if (cclass == charclass.num) {
state = parsestate.coord;
}
else if (cclass == charclass.alpha || ch == ".") { // alpha may be letters, numbers, "_", or "."
str += ch;
}
else if (cclass == charclass.incoord) {
state = parsestate.coord;
}
else if (cclass == charclass.op || cclass == charclass.numstart
|| cclass == charclass.space || cclass == charclass.eof) {
pushtoken(parseinfo, str.toUpperCase(), tokentype.name, 0);
state = 0;
}
else {
pushtoken(parseinfo, scc.s_parseerrchar, tokentype.error, 0);
state = 0;
}
}
if (state == parsestate.coord) {
if (cclass == charclass.num) {
str += ch;
}
else if (cclass == charclass.incoord) {
str += ch;
}
else if (cclass == charclass.alpha) {
state = parsestate.alphanumeric;
}
else if (cclass == charclass.op || cclass == charclass.numstart ||
cclass == charclass.eof || cclass == charclass.space) {
if (coordregex.test(str)) {
t = tokentype.coord;
}
else {
t = tokentype.name;
}
pushtoken(parseinfo, str.toUpperCase(), t, 0);
state = 0;
}
else {
pushtoken(parseinfo, scc.s_parseerrchar, tokentype.error, 0);
state = 0;
}
}
if (state == parsestate.alphanumeric) {
if (cclass == charclass.num || cclass == charclass.alpha) {
str += ch;
}
else if (cclass == charclass.op || cclass == charclass.numstart
|| cclass == charclass.space || cclass == charclass.eof) {
pushtoken(parseinfo, str.toUpperCase(), tokentype.name, 0);
state = 0;
}
else {
pushtoken(parseinfo, scc.s_parseerrchar, tokentype.error, 0);
state = 0;
}
}
if (state == parsestate.string) {
if (cclass == charclass.quote) {
state = parsestate.stringquote; // got quote in string: is it doubled (quote in string) or by itself (end of string)?
}
else if (cclass == charclass.eof) {
pushtoken(parseinfo, scc.s_parseerrstring, tokentype.error, 0);
state = 0;
}
else {
str += ch;
}
}
else if (state == parsestate.stringquote) { // note else if here
if (cclass == charclass.quote) {
str += ch;
state = parsestate.string; // double quote: add one then continue getting string
}
else { // something else -- end of string
pushtoken(parseinfo, str, tokentype.string, 0);
state = 0; // drop through to process
}
}
else if (state == parsestate.specialvalue) { // special values like #REF!
if (str.charAt(str.length-1) == "!") { // done - save value as a name
pushtoken(parseinfo, str, tokentype.name, 0);
state = 0; // drop through to process
}
else if (cclass == charclass.eof) {
pushtoken(parseinfo, scc.s_parseerrspecialvalue, tokentype.error, 0);
state = 0;
}
else {
str += ch;
}
}
if (state == 0) {
if (cclass == charclass.num) {
str = ch;
state = parsestate.num;
}
else if (cclass == charclass.numstart) {
str = ch;
haddecimal = true;
state = parsestate.num;
}
else if (cclass == charclass.alpha || cclass == charclass.incoord) {
str = ch;
state = parsestate.alpha;
}
else if (cclass == charclass.specialstart) {
str = ch;
state = parsestate.specialvalue;
}
else if (cclass == charclass.op) {
str = ch;
if (parseinfo.length>0) {
last_token = parseinfo[parseinfo.length-1];
last_token_type = last_token.type;
last_token_text = last_token.text;
if (last_token_type == charclass.op) {
if (last_token_text == '<' || last_token_text == ">") {
str = last_token_text + str;
parseinfo.pop();
if (parseinfo.length>0) {
last_token = parseinfo[parseinfo.length-1];
last_token_type = last_token.type;
last_token_text = last_token.text;
}
else {
last_token_type = charclass.eof;
last_token_text = "EOF";
}
}
}
}
else {
last_token_type = charclass.eof;
last_token_text = "EOF";
}
t = tokentype.op;
if ((parseinfo.length == 0)
|| (last_token_type == charclass.op && last_token_text != ')' && last_token_text != '%')) { // Unary operator
if (str == '-') { // M is unary minus
str = "M";
ch = "M";
}
else if (str == '+') { // P is unary plus
str = "P";
ch = "P";
}
else if (str == ')' && last_token_text == '(') { // null arg list OK
;
}
else if (str != '(') { // binary-op open-paren OK, others no
t = tokentype.error;
str = scc.s_parseerrtwoops;
}
}
else if (str.length > 1) {
if (str == '>=') { // G is >=
str = "G";
ch = "G";
}
else if (str == '<=') { // L is <=
str = "L";
ch = "L";
}
else if (str == '<>') { // N is <>
str = "N";
ch = "N";
}
else {
t = tokentype.error;
str = scc.s_parseerrtwoops;
}
}
pushtoken(parseinfo, str, t, ch);
state = 0;
}
else if (cclass == charclass.quote) { // starting a string
str = "";
state = parsestate.string;
}
else if (cclass == charclass.space) { // store so can reconstruct spacing
//pushtoken(parseinfo, " ", tokentype.space, 0);
}
else if (cclass == charclass.eof) { // ignore -- needed to have extra loop to close out other things
}
else { // unknown class - such as unknown char
pushtoken(parseinfo, scc.s_parseerrchar, tokentype.error, 0);
}
}
}
return parseinfo;
}
SocialCalc.Formula.ParsePushToken = function(parseinfo, ttext, ttype, topcode) {
parseinfo.push({text: ttext, type: ttype, opcode: topcode});
}
/* *******************
result = SocialCalc.Formula.evaluate_parsed_formula(parseinfo, sheet, allowrangereturn)
Does the calculation expressed in a parsed formula, returning a value, its type, and error info
returns: {value: value, type: valuetype, error: errortext}.
If allowrangereturn is present and true, can return a range (e.g., "A1:A10" - translated from "A1|A10|")
************************* */
SocialCalc.Formula.evaluate_parsed_formula = function(parseinfo, sheet, allowrangereturn) {
var result;
var scf = SocialCalc.Formula;
var tokentype = scf.TokenType;
var revpolish;
var parsestack = [];
var errortext = "";
revpolish = scf.ConvertInfixToPolish(parseinfo); // result is either an array or a string with error text
result = scf.EvaluatePolish(parseinfo, revpolish, sheet, allowrangereturn);
return result;
}
//
// revpolish = SocialCalc.Formula.ConvertInfixToPolish(parseinfo)
//
// Convert infix to reverse polish notation
//
// Returns revpolish array with a sequence of references to tokens by number if successful.
// Errors return a string with the error.
//
// Based upon the algorithm shown in Wikipedia "Reverse Polish notation" article
// and then enhanced for additional spreadsheet things
//
SocialCalc.Formula.ConvertInfixToPolish = function(parseinfo) {
var scf = SocialCalc.Formula;
var scc = SocialCalc.Constants;
var tokentype = scf.TokenType;
var token_precedence = scf.TokenPrecedence;
var revpolish = [];
var parsestack = [];
var errortext = "";
var function_start = -1;
var i, pii, ttype, ttext, tprecedence, tstackprecedence;
for (i=0; i<parseinfo.length; i++) {
pii = parseinfo[i];
ttype = pii.type;
ttext = pii.text;
if (ttype == tokentype.num || ttype == tokentype.coord || ttype == tokentype.string) {
revpolish.push(i);
}
else if (ttype == tokentype.name) {
parsestack.push(i);
revpolish.push(function_start);
}
else if (ttype == tokentype.space) { // ignore
continue;
}
else if (ttext == ',') {
while (parsestack.length && parseinfo[parsestack[parsestack.length-1]].text != "(") {
revpolish.push(parsestack.pop());
}
if (parsestack.length == 0) { // no ( -- error
errortext = scc.s_parseerrmissingopenparen;
break;
}
}
else if (ttext == '(') {
parsestack.push(i);
}
else if (ttext == ')') {
while (parsestack.length && parseinfo[parsestack[parsestack.length-1]].text != "(") {
revpolish.push(parsestack.pop());
}
if (parsestack.length == 0) { // no ( -- error
errortext = scc.s_parseerrcloseparennoopen;
break;
}
parsestack.pop();
if (parsestack.length && parseinfo[parsestack[parsestack.length-1]].type == tokentype.name) {
revpolish.push(parsestack.pop());
}
}
else if (ttype == tokentype.op) {
if (parsestack.length && parseinfo[parsestack[parsestack.length-1]].type == tokentype.name) {
revpolish.push(parsestack.pop());
}
while (parsestack.length && parseinfo[parsestack[parsestack.length-1]].type == tokentype.op
&& parseinfo[parsestack[parsestack.length-1]].text != '(') {
tprecedence = token_precedence[pii.opcode];
tstackprecedence = token_precedence[parseinfo[parsestack[parsestack.length-1]].opcode];
if (tprecedence >= 0 && tprecedence < tstackprecedence) {
break;
}
else if (tprecedence < 0) {
tprecedence = -tprecedence;
if (tstackprecedence < 0) tstackprecedence = -tstackprecedence;
if (tprecedence <= tstackprecedence) {
break;
}
}
revpolish.push(parsestack.pop());
}
parsestack.push(i);
}
else if (ttype == tokentype.error) {
errortext = ttext;
break;
}
else {
errortext = "Internal error while processing parsed formula. ";
break;
}
}
while (parsestack.length>0) {
if (parseinfo[parsestack[parsestack.length-1]].text == '(') {
errortext = scc.s_parseerrmissingcloseparen;
break;
}
revpolish.push(parsestack.pop());
}
if (errortext) {
return errortext;
}
return revpolish;
}
// DebugLog
// display logged objects in the audit tab of the spreadsheet control
if(typeof SocialCalc.debug_log === 'undefined') SocialCalc.debug_log = [];
SocialCalc.DebugLog = function(logObject) {
SocialCalc.debug_log.push(logObject);
}
//
// result = SocialCalc.Formula.EvaluatePolish(parseinfo, revpolish, sheet, allowrangereturn)
//
// Execute reverse polish representation of formula
//
// Operand values are objects in the operand array with a "type" and an optional "value".
// Type can have these values (many are type and sub-type as two or more letters):
// "tw", "th", "t", "n", "nt", "coord", "range", "start", "eErrorType", "b" (blank)
// The value of a coord is in the form A57 or A57!sheetname
// The value of a range is coord|coord|number where number starts at 0 and is
// the offset of the next item to fetch if you are going through the range one by one
// The number starts as a null string ("A1|B3|")
//
SocialCalc.Formula.EvaluatePolish = function(parseinfo, revpolish, sheet, allowrangereturn) {
var scf = SocialCalc.Formula;
var scc = SocialCalc.Constants;
var tokentype = scf.TokenType;
var lookup_result_type = scf.LookupResultType;
var typelookup = scf.TypeLookupTable;
var operand_as_number = scf.OperandAsNumber;
var operand_as_text = scf.OperandAsText;
var operand_value_and_type = scf.OperandValueAndType;
var operands_as_coord_on_sheet = scf.OperandsAsCoordOnSheet;
var format_number_for_display = SocialCalc.format_number_for_display || function(v, t, f) {return v+"";};
var errortext = "";
var function_start = -1;
var missingOperandError = {value: "", type: "e#VALUE!", error: scc.s_parseerrmissingoperand};
var operand = [];
var PushOperand = function(t, v) {operand.push({type: t, value: v});};
var i, rii, prii, ttype, ttext, value1, value2, tostype, tostype2, resulttype, valuetype, cond, vmatch, smatch;
if (!parseinfo.length || (! (revpolish instanceof Array))) {
return ({value: "", type: "e#VALUE!", error: (typeof revpolish == "string" ? revpolish : "")});
}
// eddy EvaluatePolish {
SocialCalc.DebugLog({ revpolish: revpolish});
SocialCalc.DebugLog({ revpolish: revpolish});
// }
// eddy EvaluatePolish {
// e.g parameterInfo: [ {'text':'E1','type':2,'opcode':0}, ... ]
var parameterInfo = [];
// }
for (i=0; i<revpolish.length; i++) {
rii = revpolish[i];
if (rii == function_start) { // Remember the start of a function argument list
PushOperand("start", 0);
continue;
}
prii = parseinfo[rii];
ttype = prii.type;
ttext = prii.text;
// eddy EvaluatePolish {
parameterInfo.push(prii);
// }
if (ttype == tokentype.num) {
PushOperand("n", ttext-0);
}
else if (ttype == tokentype.coord) {
PushOperand("coord", ttext);
}
else if (ttype == tokentype.string) {
PushOperand("t", ttext);
}
else if (ttype == tokentype.op) {
if (operand.length <= 0) { // Nothing on the stack...
return missingOperandError;
break; // done
}
// Unary minus
if (ttext == 'M') {
value1 = operand_as_number(sheet, operand);
resulttype = lookup_result_type(value1.type, value1.type, typelookup.unaryminus);
PushOperand(resulttype, -value1.value);
}
// Unary plus
else if (ttext == 'P') {
value1 = operand_as_number(sheet, operand);
resulttype = lookup_result_type(value1.type, value1.type, typelookup.unaryplus);
PushOperand(resulttype, value1.value);
}
// Unary % - percent, left associative
else if (ttext == '%') {
value1 = operand_as_number(sheet, operand);
resulttype = lookup_result_type(value1.type, value1.type, typelookup.unarypercent);
PushOperand(resulttype, 0.01*value1.value);
}
// & - string concatenate
else if (ttext == '&') {
if (operand.length <= 1) { // Need at least two things on the stack...
return missingOperandError;
}
value2 = operand_as_text(sheet, operand);
value1 = operand_as_text(sheet, operand);
resulttype = lookup_result_type(value1.type, value1.type, typelookup.concat);
PushOperand(resulttype, value1.value + value2.value);
}
// : - Range constructor
else if (ttext == ':') {
if (operand.length <= 1) { // Need at least two things on the stack...
return missingOperandError;
}
value1 = scf.OperandsAsRangeOnSheet(sheet, operand); // get coords even if use name on other sheet
if (value1.error) { // not available
errortext = errortext || value1.error;
}
PushOperand(value1.type, value1.value); // push sheetname with range on that sheet
}
// ! - sheetname!coord
else if (ttext == '!') {
if (operand.length <= 1) { // Need at least two things on the stack...
return missingOperandError;
}
value1 = operands_as_coord_on_sheet(sheet, operand); // get coord even if name on other sheet
if (value1.error) { // not available
errortext = errortext || value1.error;
}
PushOperand(value1.type, value1.value); // push sheetname with coord or range on that sheet
}
// Comparison operators: < L = G > N (< <= = >= > <>)
else if (ttext == "<" || ttext == "L" || ttext == "=" || ttext == "G" || ttext == ">" || ttext == "N") {
if (operand.length <= 1) { // Need at least two things on the stack...
errortext = scc.s_parseerrmissingoperand; // remember error
break;
}
value2 = operand_value_and_type(sheet, operand);
value1 = operand_value_and_type(sheet, operand);
if (value1.type.charAt(0) == "n" && value2.type.charAt(0) == "n") { // compare two numbers
cond = 0;
if (ttext == "<") { cond = value1.value < value2.value ? 1 : 0; }
else if (ttext == "L") { cond = value1.value <= value2.value ? 1 : 0; }
else if (ttext == "=") { cond = value1.value == value2.value ? 1 : 0; }
else if (ttext == "G") { cond = value1.value >= value2.value ? 1 : 0; }
else if (ttext == ">") { cond = value1.value > value2.value ? 1 : 0; }
else if (ttext == "N") { cond = value1.value != value2.value ? 1 : 0; }
PushOperand("nl", cond);
}
else if (value1.type.charAt(0) == "e") { // error on left
PushOperand(value1.type, 0);
}
else if (value2.type.charAt(0) == "e") { // error on right
PushOperand(value2.type, 0);
}
else { // text maybe mixed with numbers or blank
tostype = value1.type.charAt(0);
tostype2 = value2.type.charAt(0);
if (tostype == "n") {
value1.value = format_number_for_display(value1.value, "n", "");
}
else if (tostype == "b") {
value1.value = "";
}
if (tostype2 == "n") {
value2.value = format_number_for_display(value2.value, "n", "");
}
else if (tostype2 == "b") {
value2.value = "";
}
cond = 0;
value1.value = value1.value.toLowerCase(); // ignore case
value2.value = value2.value.toLowerCase();
if (ttext == "<") { cond = value1.value < value2.value ? 1 : 0; }
else if (ttext == "L") { cond = value1.value <= value2.value ? 1 : 0; }
else if (ttext == "=") { cond = value1.value == value2.value ? 1 : 0; }
else if (ttext == "G") { cond = value1.value >= value2.value ? 1 : 0; }
else if (ttext == ">") { cond = value1.value > value2.value ? 1 : 0; }
else if (ttext == "N") { cond = value1.value != value2.value ? 1 : 0; }
PushOperand("nl", cond);
}
}
// Normal infix arithmethic operators: +, -. *, /, ^
else { // what's left are the normal infix arithmetic operators
if (operand.length <= 1) { // Need at least two things on the stack...
errortext = scc.s_parseerrmissingoperand; // remember error
break;
}
value2 = operand_as_number(sheet, operand);
value1 = operand_as_number(sheet, operand);
if (ttext == '+') {
resulttype = lookup_result_type(value1.type, value2.type, typelookup.plus);
PushOperand(resulttype, value1.value + value2.value);
}
else if (ttext == '-') {
resulttype = lookup_result_type(value1.type, value2.type, typelookup.plus);
PushOperand(resulttype, value1.value - value2.value);
}
else if (ttext == '*') {
resulttype = lookup_result_type(value1.type, value2.type, typelookup.plus);
PushOperand(resulttype, value1.value * value2.value);
}
else if (ttext == '/') {
if (value2.value != 0) {
PushOperand("n", value1.value / value2.value); // gives plain numeric result type
}
else {
PushOperand("e#DIV/0!", 0);
}
}
else if (ttext == '^') {
value1.value = Math.pow(value1.value, value2.value);
value1.type = "n"; // gives plain numeric result type
if (isNaN(value1.value)) {
value1.value = 0;
value1.type = "e#NUM!";
}
PushOperand(value1.type, value1.value);
}
}
}
// function or name
else if (ttype == tokentype.name) {
// errortext = scf.CalculateFunction(ttext, operand, sheet);
errortext = scf.CalculateFunction(ttext, operand, sheet, parseinfo.coord); // eddy also pass the cell id
if (errortext) break;
}
else {
errortext = scc.s_InternalError+"Unknown token "+ttype+" ("+ttext+"). ";
break;
}
}
// look at final value and handle special cases
value = operand[0] ? operand[0].value : "";
tostype = operand[0] ? operand[0].type : "";
if (tostype == "name") { // name - expand it
value1 = SocialCalc.Formula.LookupName(sheet, value);
value = value1.value;
tostype = value1.type;
errortext = errortext || value1.error;
}
if (tostype == "coord") { // the value is a coord reference, get its value and type
value1 = operand_value_and_type(sheet, operand);
value = value1.value;
tostype = value1.type;
if (tostype == "b") {
tostype = "n";
value = 0;
}
}
if (operand.length > 1 && !errortext) { // something left - error
errortext += scc.s_parseerrerrorinformula;
}
// set return type
valuetype = tostype;
if (tostype.charAt(0) == "e") { // error value
errortext = errortext || tostype.substring(1) || scc.s_calcerrerrorvalueinformula;
}
else if (tostype == "range") {
vmatch = value.match(/^(.*)\|(.*)\|/);
smatch = vmatch[1].indexOf("!");
if (smatch>=0) { // swap sheetname
vmatch[1] = vmatch[1].substring(smatch+1) + "!" + vmatch[1].substring(0, smatch).toUpperCase();
}
else {
vmatch[1] = vmatch[1].toUpperCase();
}
value = vmatch[1] + ":" + vmatch[2].toUpperCase();
if (!allowrangereturn) {
errortext = scc.s_formularangeresult+" "+value;
}
}
if (errortext && valuetype.charAt(0) != "e") {
value = errortext;
valuetype = "e";
}
// look for overflow
if (valuetype.charAt(0) == "n" && (isNaN(value) || !isFinite(value))) {
value = 0;
valuetype = "e#NUM!";
errortext = isNaN(value) ? scc.s_calcerrnumericnan: scc.s_calcerrnumericoverflow;
}
return ({value: value, type: valuetype, error: errortext});
}
/*
#
# resulttype = SocialCalc.Formula.LookupResultType(type1, type2, typelookup);
#
# typelookup has values of the following form:
#
# typelookup{"typespec1"} = "|typespec2A:resultA|typespec2B:resultB|..."
#
# First type1 is looked up. If no match, then the first letter (major type) of type1 plus "*" is looked up
# resulttype is type1 if result is "1", type2 if result is "2", otherwise the value of result.
#
*/
SocialCalc.Formula.LookupResultType = function(type1, type2, typelookup) {
var pos1, pos2, result;
var table1 = typelookup[type1];
if (!table1) {
table1 = typelookup[type1.charAt(0)+'*'];
if (!table1) {
return "e#VALUE! (internal error, missing LookupResultType "+type1.charAt(0)+"*)"; // missing from table -- please add it
}
}
pos1 = table1.indexOf("|"+type2+":");
if (pos1 >= 0) {
pos2 = table1.indexOf("|", pos1+1);
if (pos2<0) return "e#VALUE! (internal error, incorrect LookupResultType "+table1+")";
result = table1.substring(pos1+type2.length+2, pos2);
if (result == "1") return type1;
if (result == "2") return type2;
return result;
}
pos1 = table1.indexOf("|"+type2.charAt(0)+"*:");
if (pos1 >= 0) {
pos2 = table1.indexOf("|", pos1+1);
if (pos2<0) return "e#VALUE! (internal error, incorrect LookupResultType "+table1+")";
result = table1.substring(pos1+4, pos2);
if (result == "1") return type1;
if (result == "2") return type2;
return result;
}
return "e#VALUE!";
}
/*
#
# operandinfo = SocialCalc.Formula.TopOfStackValueAndType(sheet, operand)
#
# Returns top of stack value and type and then pops the stack.
# The result is {value: value, type: type, error: "only if bad error"}
#
*/
SocialCalc.Formula.TopOfStackValueAndType = function(sheet, operand) {
var cellvtype, cell, pos, coordsheet;
var scf = SocialCalc.Formula;
var result = {type: "", value: ""};
var stacklen = operand.length;
if (!stacklen) { // make sure something is there
result.error = SocialCalc.Constants.s_InternalError+"no operand on stack";
return result;
}
result.value = operand[stacklen-1].value; // get top of stack
result.type = operand[stacklen-1].type;
operand.pop(); // we have data - pop stack
if (result.type == "name") {
result = scf.LookupName(sheet, result.value);
}
return result;
}