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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
|
/*
* Smithsonian Astrophysical Observatory, Cambridge, MA, USA
* This code has been modified under the terms listed below and is made
* available under the same terms.
*/
/*
* bltVecMath.c --
*
* This module implements mathematical expressions with vector data
* objects.
*
* Copyright 1995-2004 George A Howlett.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
* KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
* WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
* PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS
* OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <float.h>
#include <math.h>
#include "bltInt.h"
#include "bltVecInt.h"
#include "bltNsUtil.h"
#include "bltParse.h"
/*
* Three types of math functions:
*
* ComponentProc Function is applied in multiple calls to
* each component of the vector.
* VectorProc Entire vector is passed, each component is
* modified.
* ScalarProc Entire vector is passed, single scalar value
* is returned.
*/
typedef double (ComponentProc)(double value);
typedef int (VectorProc)(Vector *vPtr);
typedef double (ScalarProc)(Vector *vPtr);
/*
* Built-in math functions:
*/
typedef int (GenericMathProc) ();
/*
* MathFunction --
*
* Contains information about math functions that can be called
* for vectors. The table of math functions is global within the
* application. So you can't define two different "sqrt"
* functions.
*/
typedef struct {
const char *name; /* Name of built-in math function. If
* NULL, indicates that the function
* was user-defined and dynamically
* allocated. Function names are
* global across all interpreters. */
void *proc; /* Procedure that implements this math
* function. */
ClientData clientData; /* Argument to pass when invoking the
* function. */
} MathFunction;
/* The data structure below is used to describe an expression value,
* which can be either a double-precision floating-point value, or a
* string. A given number has only one value at a time. */
#define STATIC_STRING_SPACE 150
/*
* Tokens --
*
* The token types are defined below. In addition, there is a
* table associating a precedence with each operator. The order
* of types is important. Consult the code before changing it.
*/
enum Tokens {
VALUE, OPEN_PAREN, CLOSE_PAREN, COMMA, END, UNKNOWN,
MULT = 8, DIVIDE, MOD, PLUS, MINUS,
LEFT_SHIFT, RIGHT_SHIFT,
LESS, GREATER, LEQ, GEQ, EQUAL, NEQ,
OLD_BIT_AND, EXPONENT, OLD_BIT_OR, OLD_QUESTY, OLD_COLON,
AND, OR, UNARY_MINUS, OLD_UNARY_PLUS, NOT, OLD_BIT_NOT
};
typedef struct {
Vector *vPtr;
char staticSpace[STATIC_STRING_SPACE];
ParseValue pv; /* Used to hold a string value, if any. */
} Value;
/*
* ParseInfo --
*
* The data structure below describes the state of parsing an
* expression. It's passed among the routines in this module.
*/
typedef struct {
const char *expr; /* The entire right-hand side of the
* expression, as originally passed to
* Blt_ExprVector. */
const char *nextPtr; /* Position of the next character to
* be scanned from the expression
* string. */
enum Tokens token; /* Type of the last token to be parsed
* from nextPtr. See below for
* definitions. Corresponds to the
* characters just before nextPtr. */
} ParseInfo;
/*
* Precedence table. The values for non-operator token types are ignored.
*/
static int precTable[] =
{
0, 0, 0, 0, 0, 0, 0, 0,
12, 12, 12, /* MULT, DIVIDE, MOD */
11, 11, /* PLUS, MINUS */
10, 10, /* LEFT_SHIFT, RIGHT_SHIFT */
9, 9, 9, 9, /* LESS, GREATER, LEQ, GEQ */
8, 8, /* EQUAL, NEQ */
7, /* OLD_BIT_AND */
13, /* EXPONENTIATION */
5, /* OLD_BIT_OR */
4, /* AND */
3, /* OR */
2, /* OLD_QUESTY */
1, /* OLD_COLON */
14, 14, 14, 14 /* UNARY_MINUS, OLD_UNARY_PLUS, NOT,
* OLD_BIT_NOT */
};
/*
* Forward declarations.
*/
static int NextValue(Tcl_Interp* interp, ParseInfo *piPtr, int prec,
Value *valuePtr);
/*
*---------------------------------------------------------------------------
*
* Sort --
*
* A vector math function. Sorts the values of the given
* vector.
*
* Results:
* Always TCL_OK.
*
* Side Effects:
* The vector is sorted.
*
*---------------------------------------------------------------------------
*/
static int
Sort(Vector *vPtr)
{
size_t *map;
double *values;
int i;
map = Blt_Vec_SortMap(&vPtr, 1);
values = malloc(sizeof(double) * vPtr->length);
for(i = vPtr->first; i <= vPtr->last; i++) {
values[i] = vPtr->valueArr[map[i]];
}
free(map);
for (i = vPtr->first; i <= vPtr->last; i++) {
vPtr->valueArr[i] = values[i];
}
free(values);
return TCL_OK;
}
static double
Length(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
return (double)(vPtr->last - vPtr->first + 1);
}
double
Blt_VecMax(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
return Blt_Vec_Max(vPtr);
}
double
Blt_VecMin(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
return Blt_Vec_Min(vPtr);
}
static double
Product(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double prod;
double *vp, *vend;
prod = 1.0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
prod *= *vp;
}
return prod;
}
static double
Sum(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double sum, c;
double *vp, *vend;
/* Kahan summation algorithm */
vp = vPtr->valueArr + vPtr->first;
sum = *vp++;
c = 0.0; /* A running compensation for lost
* low-order bits.*/
for (vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
double y, t;
y = *vp - c; /* So far, so good: c is zero.*/
t = sum + y; /* Alas, sum is big, y small, so
* low-order digits of y are lost.*/
c = (t - sum) - y; /* (t - sum) recovers the high-order
* part of y; subtracting y recovers
* -(low part of y) */
sum = t;
}
return sum;
}
static double
Mean(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double sum;
int n;
sum = Sum(vectorPtr);
n = vPtr->last - vPtr->first + 1;
return sum / (double)n;
}
/*
* var = 1/N Sum( (x[i] - mean)^2 )
*/
static double
Variance(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double var, mean;
double *vp, *vend;
int count;
mean = Mean(vectorPtr);
var = 0.0;
count = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
double dx;
dx = *vp - mean;
var += dx * dx;
count++;
}
if (count < 2) {
return 0.0;
}
var /= (double)(count - 1);
return var;
}
/*
* skew = Sum( (x[i] - mean)^3 ) / (var^3/2)
*/
static double
Skew(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double diff, var, skew, mean, diffsq;
double *vp, *vend;
int count;
mean = Mean(vectorPtr);
var = skew = 0.0;
count = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
diff = *vp - mean;
diff = fabs(diff);
diffsq = diff * diff;
var += diffsq;
skew += diffsq * diff;
count++;
}
if (count < 2) {
return 0.0;
}
var /= (double)(count - 1);
skew /= count * var * sqrt(var);
return skew;
}
static double
StdDeviation(Blt_Vector *vectorPtr)
{
double var;
var = Variance(vectorPtr);
if (var > 0.0) {
return sqrt(var);
}
return 0.0;
}
static double
AvgDeviation(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double diff, avg, mean;
double *vp, *vend;
int count;
mean = Mean(vectorPtr);
avg = 0.0;
count = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
diff = *vp - mean;
avg += fabs(diff);
count++;
}
if (count < 2) {
return 0.0;
}
avg /= (double)count;
return avg;
}
static double
Kurtosis(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double diff, diffsq, kurt, var, mean;
double *vp, *vend;
int count;
mean = Mean(vectorPtr);
var = kurt = 0.0;
count = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
diff = *vp - mean;
diffsq = diff * diff;
var += diffsq;
kurt += diffsq * diffsq;
count++;
}
if (count < 2) {
return 0.0;
}
var /= (double)(count - 1);
if (var == 0.0) {
return 0.0;
}
kurt /= (count * var * var);
return kurt - 3.0; /* Fisher Kurtosis */
}
static double
Median(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
size_t *map;
double q2;
int mid;
if (vPtr->length == 0) {
return -DBL_MAX;
}
map = Blt_Vec_SortMap(&vPtr, 1);
mid = (vPtr->length - 1) / 2;
/*
* Determine Q2 by checking if the number of elements [0..n-1] is
* odd or even. If even, we must take the average of the two
* middle values.
*/
if (vPtr->length & 1) { /* Odd */
q2 = vPtr->valueArr[map[mid]];
} else { /* Even */
q2 = (vPtr->valueArr[map[mid]] +
vPtr->valueArr[map[mid + 1]]) * 0.5;
}
free(map);
return q2;
}
static double
Q1(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double q1;
size_t *map;
if (vPtr->length == 0) {
return -DBL_MAX;
}
map = Blt_Vec_SortMap(&vPtr, 1);
if (vPtr->length < 4) {
q1 = vPtr->valueArr[map[0]];
} else {
int mid, q;
mid = (vPtr->length - 1) / 2;
q = mid / 2;
/*
* Determine Q1 by checking if the number of elements in the
* bottom half [0..mid) is odd or even. If even, we must
* take the average of the two middle values.
*/
if (mid & 1) { /* Odd */
q1 = vPtr->valueArr[map[q]];
} else { /* Even */
q1 = (vPtr->valueArr[map[q]] +
vPtr->valueArr[map[q + 1]]) * 0.5;
}
}
free(map);
return q1;
}
static double
Q3(Blt_Vector *vectorPtr)
{
Vector *vPtr = (Vector *)vectorPtr;
double q3;
size_t *map;
if (vPtr->length == 0) {
return -DBL_MAX;
}
map = Blt_Vec_SortMap(&vPtr, 1);
if (vPtr->length < 4) {
q3 = vPtr->valueArr[map[vPtr->length - 1]];
} else {
int mid, q;
mid = (vPtr->length - 1) / 2;
q = (vPtr->length + mid) / 2;
/*
* Determine Q3 by checking if the number of elements in the
* upper half (mid..n-1] is odd or even. If even, we must
* take the average of the two middle values.
*/
if (mid & 1) { /* Odd */
q3 = vPtr->valueArr[map[q]];
} else { /* Even */
q3 = (vPtr->valueArr[map[q]] +
vPtr->valueArr[map[q + 1]]) * 0.5;
}
}
free(map);
return q3;
}
static int
Norm(Blt_Vector *vector)
{
Vector *vPtr = (Vector *)vector;
double norm, range, min, max;
int i;
min = Blt_Vec_Min(vPtr);
max = Blt_Vec_Max(vPtr);
range = max - min;
for (i = 0; i < vPtr->length; i++) {
norm = (vPtr->valueArr[i] - min) / range;
vPtr->valueArr[i] = norm;
}
return TCL_OK;
}
static double
Nonzeros(Blt_Vector *vector)
{
Vector *vPtr = (Vector *)vector;
int count;
double *vp, *vend;
count = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
if (*vp == 0.0) {
count++;
}
}
return (double) count;
}
static double
Fabs(double value)
{
if (value < 0.0) {
return -value;
}
return value;
}
static double
Round(double value)
{
if (value < 0.0) {
return ceil(value - 0.5);
} else {
return floor(value + 0.5);
}
}
static double
Fmod(double x, double y)
{
if (y == 0.0) {
return 0.0;
}
return x - (floor(x / y) * y);
}
/*
*---------------------------------------------------------------------------
*
* MathError --
*
* This procedure is called when an error occurs during a
* floating-point operation. It reads errno and sets
* interp->result accordingly.
*
* Results:
* Interp->result is set to hold an error message.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static void
MathError(
Tcl_Interp* interp, /* Where to store error message. */
double value) /* Value returned after error; used to
* distinguish underflows from
* overflows. */
{
if ((errno == EDOM) || (value != value)) {
Tcl_AppendResult(interp, "domain error: argument not in valid range",
(char *)NULL);
Tcl_SetErrorCode(interp, "ARITH", "DOMAIN",
Tcl_GetStringResult(interp), (char *)NULL);
} else if ((errno == ERANGE) || isinf(value)) {
if (value == 0.0) {
Tcl_AppendResult(interp,
"floating-point value too small to represent",
(char *)NULL);
Tcl_SetErrorCode(interp, "ARITH", "UNDERFLOW",
Tcl_GetStringResult(interp), (char *)NULL);
} else {
Tcl_AppendResult(interp,
"floating-point value too large to represent",
(char *)NULL);
Tcl_SetErrorCode(interp, "ARITH", "OVERFLOW",
Tcl_GetStringResult(interp), (char *)NULL);
}
} else {
Tcl_AppendResult(interp, "unknown floating-point error, ",
"errno = ", Blt_Itoa(errno), (char *)NULL);
Tcl_SetErrorCode(interp, "ARITH", "UNKNOWN",
Tcl_GetStringResult(interp), (char *)NULL);
}
}
/*
*---------------------------------------------------------------------------
*
* ParseString --
*
* Given a string (such as one coming from command or variable
* substitution), make a Value based on the string. The value
* will be a floating-point or integer, if possible, or else it
* will just be a copy of the string.
*
* Results:
* TCL_OK is returned under normal circumstances, and TCL_ERROR
* is returned if a floating-point overflow or underflow occurred
* while reading in a number. The value at *valuePtr is modified
* to hold a number, if possible.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static int
ParseString(
Tcl_Interp* interp, /* Where to store error message. */
const char *string, /* String to turn into value. */
Value *valuePtr) /* Where to store value information.
* Caller must have initialized pv field. */
{
const char *endPtr;
double value;
errno = 0;
/*
* The string can be either a number or a vector. First try to
* convert the string to a number. If that fails then see if
* we can find a vector by that name.
*/
value = strtod(string, (char **)&endPtr);
if ((endPtr != string) && (*endPtr == '\0')) {
if (errno != 0) {
Tcl_ResetResult(interp);
MathError(interp, value);
return TCL_ERROR;
}
/* Numbers are stored as single element vectors. */
if (Blt_Vec_ChangeLength(interp, valuePtr->vPtr, 1) != TCL_OK) {
return TCL_ERROR;
}
valuePtr->vPtr->valueArr[0] = value;
return TCL_OK;
} else {
Vector *vPtr;
while (isspace((unsigned char)(*string))) {
string++; /* Skip spaces leading the vector name. */
}
vPtr = Blt_Vec_ParseElement(interp, valuePtr->vPtr->dataPtr,
string, &endPtr, NS_SEARCH_BOTH);
if (vPtr == NULL) {
return TCL_ERROR;
}
if (*endPtr != '\0') {
Tcl_AppendResult(interp, "extra characters after vector",
(char *)NULL);
return TCL_ERROR;
}
/* Copy the designated vector to our temporary. */
Blt_Vec_Duplicate(valuePtr->vPtr, vPtr);
}
return TCL_OK;
}
/*
*---------------------------------------------------------------------------
*
* ParseMathFunction --
*
* This procedure is invoked to parse a math function from an
* expression string, carry out the function, and return the
* value computed.
*
* Results:
* TCL_OK is returned if all went well and the function's value
* was computed successfully. If the name doesn't match any
* known math function, returns TCL_RETURN. And if a format error
* was found, TCL_ERROR is returned and an error message is left
* in interp->result.
*
* After a successful return piPtr will be updated to point to
* the character just after the function call, the token is set
* to VALUE, and the value is stored in valuePtr.
*
* Side effects:
* Embedded commands could have arbitrary side-effects.
*
*---------------------------------------------------------------------------
*/
static int
ParseMathFunction(
Tcl_Interp* interp, /* Interpreter to use for error reporting. */
const char *start, /* Start of string to parse */
ParseInfo *piPtr, /* Describes the state of the parse.
* piPtr->nextPtr must point to the
* first character of the function's
* name. */
Value *valuePtr) /* Where to store value, if that is
* what's parsed from string. Caller
* must have initialized pv field
* correctly. */
{
Tcl_HashEntry *hPtr;
MathFunction *mathPtr; /* Info about math function. */
char *p;
VectorInterpData *dataPtr; /* Interpreter-specific data. */
GenericMathProc *proc;
/*
* Find the end of the math function's name and lookup the
* record for the function.
*/
p = (char *)start;
while (isspace((unsigned char)(*p))) {
p++;
}
piPtr->nextPtr = p;
while (isalnum((unsigned char)(*p)) || (*p == '_')) {
p++;
}
if (*p != '(') {
return TCL_RETURN; /* Must start with open parenthesis */
}
dataPtr = valuePtr->vPtr->dataPtr;
*p = '\0';
hPtr = Tcl_FindHashEntry(&dataPtr->mathProcTable, piPtr->nextPtr);
*p = '(';
if (hPtr == NULL) {
return TCL_RETURN; /* Name doesn't match any known function */
}
/* Pick up the single value as the argument to the function */
piPtr->token = OPEN_PAREN;
piPtr->nextPtr = p + 1;
valuePtr->pv.next = valuePtr->pv.buffer;
if (NextValue(interp, piPtr, -1, valuePtr) != TCL_OK) {
return TCL_ERROR; /* Parse error */
}
if (piPtr->token != CLOSE_PAREN) {
Tcl_AppendResult(interp, "unmatched parentheses in expression \"",
piPtr->expr, "\"", (char *)NULL);
return TCL_ERROR; /* Missing right parenthesis */
}
mathPtr = Tcl_GetHashValue(hPtr);
proc = mathPtr->proc;
if ((*proc) (mathPtr->clientData, interp, valuePtr->vPtr) != TCL_OK) {
return TCL_ERROR; /* Function invocation error */
}
piPtr->token = VALUE;
return TCL_OK;
}
/*
*---------------------------------------------------------------------------
*
* NextToken --
*
* Lexical analyzer for expression parser: parses a single value,
* operator, or other syntactic element from an expression string.
*
* Results:
* TCL_OK is returned unless an error occurred while doing lexical
* analysis or executing an embedded command. In that case a
* standard TCL error is returned, using interp->result to hold
* an error message. In the event of a successful return, the token
* and field in piPtr is updated to refer to the next symbol in
* the expression string, and the expr field is advanced past that
* token; if the token is a value, then the value is stored at
* valuePtr.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static int
NextToken(
Tcl_Interp* interp, /* Interpreter to use for error reporting. */
ParseInfo *piPtr, /* Describes the state of the parse. */
Value *valuePtr) /* Where to store value, if that is
* what's parsed from string. Caller
* must have initialized pv field
* correctly. */
{
const char *p;
const char *endPtr;
const char *var;
int result;
p = piPtr->nextPtr;
while (isspace((unsigned char)(*p))) {
p++;
}
if (*p == '\0') {
piPtr->token = END;
piPtr->nextPtr = p;
return TCL_OK;
}
/*
* Try to parse the token as a floating-point number. But check
* that the first character isn't a "-" or "+", which "strtod"
* will happily accept as an unary operator. Otherwise, we might
* accidently treat a binary operator as unary by mistake, which
* will eventually cause a syntax error.
*/
if ((*p != '-') && (*p != '+')) {
double value;
errno = 0;
value = strtod(p, (char **)&endPtr);
if (endPtr != p) {
if (errno != 0) {
MathError(interp, value);
return TCL_ERROR;
}
piPtr->token = VALUE;
piPtr->nextPtr = endPtr;
/*
* Save the single floating-point value as an 1-component vector.
*/
if (Blt_Vec_ChangeLength(interp, valuePtr->vPtr, 1) != TCL_OK) {
return TCL_ERROR;
}
valuePtr->vPtr->valueArr[0] = value;
return TCL_OK;
}
}
piPtr->nextPtr = p + 1;
switch (*p) {
case '$':
piPtr->token = VALUE;
var = Tcl_ParseVar(interp, p, &endPtr);
if (var == NULL) {
return TCL_ERROR;
}
piPtr->nextPtr = endPtr;
Tcl_ResetResult(interp);
result = ParseString(interp, var, valuePtr);
return result;
case '[':
piPtr->token = VALUE;
result = Blt_ParseNestedCmd(interp, p + 1, 0, &endPtr, &valuePtr->pv);
if (result != TCL_OK) {
return result;
}
piPtr->nextPtr = endPtr;
Tcl_ResetResult(interp);
result = ParseString(interp, valuePtr->pv.buffer, valuePtr);
return result;
case '"':
piPtr->token = VALUE;
result = Blt_ParseQuotes(interp, p + 1, '"', 0, &endPtr, &valuePtr->pv);
if (result != TCL_OK) {
return result;
}
piPtr->nextPtr = endPtr;
Tcl_ResetResult(interp);
result = ParseString(interp, valuePtr->pv.buffer, valuePtr);
return result;
case '{':
piPtr->token = VALUE;
result = Blt_ParseBraces(interp, p + 1, &endPtr, &valuePtr->pv);
if (result != TCL_OK) {
return result;
}
piPtr->nextPtr = endPtr;
Tcl_ResetResult(interp);
result = ParseString(interp, valuePtr->pv.buffer, valuePtr);
return result;
case '(':
piPtr->token = OPEN_PAREN;
break;
case ')':
piPtr->token = CLOSE_PAREN;
break;
case ',':
piPtr->token = COMMA;
break;
case '*':
piPtr->token = MULT;
break;
case '/':
piPtr->token = DIVIDE;
break;
case '%':
piPtr->token = MOD;
break;
case '+':
piPtr->token = PLUS;
break;
case '-':
piPtr->token = MINUS;
break;
case '^':
piPtr->token = EXPONENT;
break;
case '<':
switch (*(p + 1)) {
case '<':
piPtr->nextPtr = p + 2;
piPtr->token = LEFT_SHIFT;
break;
case '=':
piPtr->nextPtr = p + 2;
piPtr->token = LEQ;
break;
default:
piPtr->token = LESS;
break;
}
break;
case '>':
switch (*(p + 1)) {
case '>':
piPtr->nextPtr = p + 2;
piPtr->token = RIGHT_SHIFT;
break;
case '=':
piPtr->nextPtr = p + 2;
piPtr->token = GEQ;
break;
default:
piPtr->token = GREATER;
break;
}
break;
case '=':
if (*(p + 1) == '=') {
piPtr->nextPtr = p + 2;
piPtr->token = EQUAL;
} else {
piPtr->token = UNKNOWN;
}
break;
case '&':
if (*(p + 1) == '&') {
piPtr->nextPtr = p + 2;
piPtr->token = AND;
} else {
piPtr->token = UNKNOWN;
}
break;
case '|':
if (*(p + 1) == '|') {
piPtr->nextPtr = p + 2;
piPtr->token = OR;
} else {
piPtr->token = UNKNOWN;
}
break;
case '!':
if (*(p + 1) == '=') {
piPtr->nextPtr = p + 2;
piPtr->token = NEQ;
} else {
piPtr->token = NOT;
}
break;
default:
piPtr->token = VALUE;
result = ParseMathFunction(interp, p, piPtr, valuePtr);
if ((result == TCL_OK) || (result == TCL_ERROR)) {
return result;
} else {
Vector *vPtr;
while (isspace((unsigned char)(*p))) {
p++; /* Skip spaces leading the vector name. */
}
vPtr = Blt_Vec_ParseElement(interp, valuePtr->vPtr->dataPtr,
p, &endPtr, NS_SEARCH_BOTH);
if (vPtr == NULL) {
return TCL_ERROR;
}
Blt_Vec_Duplicate(valuePtr->vPtr, vPtr);
piPtr->nextPtr = endPtr;
}
}
return TCL_OK;
}
/*
*---------------------------------------------------------------------------
*
* NextValue --
*
* Parse a "value" from the remainder of the expression in piPtr.
*
* Results:
* Normally TCL_OK is returned. The value of the expression is
* returned in *valuePtr. If an error occurred, then interp->result
* contains an error message and TCL_ERROR is returned.
* InfoPtr->token will be left pointing to the token AFTER the
* expression, and piPtr->nextPtr will point to the character just
* after the terminating token.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static int
NextValue(
Tcl_Interp* interp, /* Interpreter to use for error reporting. */
ParseInfo *piPtr, /* Describes the state of the parse
* just before the value (i.e. NextToken will
* be called to get first token of value). */
int prec, /* Treat any un-parenthesized operator
* with precedence <= this as the end
* of the expression. */
Value *valuePtr) /* Where to store the value of the expression.
* Caller must have initialized pv field. */
{
Value value2; /* Second operand for current operator. */
int operator; /* Current operator (either unary or binary). */
int gotOp; /* Non-zero means already lexed the operator
* (while picking up value for unary operator).
* Don't lex again. */
int result;
Vector *vPtr, *v2Ptr;
int i;
/*
* There are two phases to this procedure. First, pick off an initial
* value. Then, parse (binary operator, value) pairs until done.
*/
vPtr = valuePtr->vPtr;
v2Ptr = Blt_Vec_New(vPtr->dataPtr);
gotOp = FALSE;
value2.vPtr = v2Ptr;
value2.pv.buffer = value2.pv.next = value2.staticSpace;
value2.pv.end = value2.pv.buffer + STATIC_STRING_SPACE - 1;
value2.pv.expandProc = Blt_ExpandParseValue;
value2.pv.clientData = NULL;
result = NextToken(interp, piPtr, valuePtr);
if (result != TCL_OK) {
goto done;
}
if (piPtr->token == OPEN_PAREN) {
/* Parenthesized sub-expression. */
result = NextValue(interp, piPtr, -1, valuePtr);
if (result != TCL_OK) {
goto done;
}
if (piPtr->token != CLOSE_PAREN) {
Tcl_AppendResult(interp, "unmatched parentheses in expression \"",
piPtr->expr, "\"", (char *)NULL);
result = TCL_ERROR;
goto done;
}
} else {
if (piPtr->token == MINUS) {
piPtr->token = UNARY_MINUS;
}
if (piPtr->token >= UNARY_MINUS) {
operator = piPtr->token;
result = NextValue(interp, piPtr, precTable[operator], valuePtr);
if (result != TCL_OK) {
goto done;
}
gotOp = TRUE;
/* Process unary operators. */
switch (operator) {
case UNARY_MINUS:
for(i = 0; i < vPtr->length; i++) {
vPtr->valueArr[i] = -(vPtr->valueArr[i]);
}
break;
case NOT:
for(i = 0; i < vPtr->length; i++) {
vPtr->valueArr[i] = (double)(!vPtr->valueArr[i]);
}
break;
default:
Tcl_AppendResult(interp, "unknown operator", (char *)NULL);
goto error;
}
} else if (piPtr->token != VALUE) {
Tcl_AppendResult(interp, "missing operand", (char *)NULL);
goto error;
}
}
if (!gotOp) {
result = NextToken(interp, piPtr, &value2);
if (result != TCL_OK) {
goto done;
}
}
/*
* Got the first operand. Now fetch (operator, operand) pairs.
*/
for (;;) {
operator = piPtr->token;
value2.pv.next = value2.pv.buffer;
if ((operator < MULT) || (operator >= UNARY_MINUS)) {
if ((operator == END) || (operator == CLOSE_PAREN) ||
(operator == COMMA)) {
result = TCL_OK;
goto done;
} else {
Tcl_AppendResult(interp, "bad operator", (char *)NULL);
goto error;
}
}
if (precTable[operator] <= prec) {
result = TCL_OK;
goto done;
}
result = NextValue(interp, piPtr, precTable[operator], &value2);
if (result != TCL_OK) {
goto done;
}
if ((piPtr->token < MULT) && (piPtr->token != VALUE) &&
(piPtr->token != END) && (piPtr->token != CLOSE_PAREN) &&
(piPtr->token != COMMA)) {
Tcl_AppendResult(interp, "unexpected token in expression",
(char *)NULL);
goto error;
}
/*
* At this point we have two vectors and an operator.
*/
if (v2Ptr->length == 1) {
double *opnd;
double scalar;
/*
* 2nd operand is a scalar.
*/
scalar = v2Ptr->valueArr[0];
opnd = vPtr->valueArr;
switch (operator) {
case MULT:
for(i = 0; i < vPtr->length; i++) {
opnd[i] *= scalar;
}
break;
case DIVIDE:
if (scalar == 0.0) {
Tcl_AppendResult(interp, "divide by zero", (char *)NULL);
goto error;
}
for(i = 0; i < vPtr->length; i++) {
opnd[i] /= scalar;
}
break;
case PLUS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] += scalar;
}
break;
case MINUS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] -= scalar;
}
break;
case EXPONENT:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = pow(opnd[i], scalar);
}
break;
case MOD:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = Fmod(opnd[i], scalar);
}
break;
case LESS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] < scalar);
}
break;
case GREATER:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] > scalar);
}
break;
case LEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] <= scalar);
}
break;
case GEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] >= scalar);
}
break;
case EQUAL:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] == scalar);
}
break;
case NEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] != scalar);
}
break;
case AND:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] && scalar);
}
break;
case OR:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] || scalar);
}
break;
case LEFT_SHIFT:
{
int offset;
offset = (int)scalar % vPtr->length;
if (offset > 0) {
double *hold;
int j;
hold = malloc(sizeof(double) * offset);
for (i = 0; i < offset; i++) {
hold[i] = opnd[i];
}
for (i = offset, j = 0; i < vPtr->length; i++, j++) {
opnd[j] = opnd[i];
}
for (i = 0, j = vPtr->length - offset;
j < vPtr->length; i++, j++) {
opnd[j] = hold[i];
}
free(hold);
}
}
break;
case RIGHT_SHIFT:
{
int offset;
offset = (int)scalar % vPtr->length;
if (offset > 0) {
double *hold;
int j;
hold = malloc(sizeof(double) * offset);
for (i = vPtr->length - offset, j = 0;
i < vPtr->length; i++, j++) {
hold[j] = opnd[i];
}
for (i = vPtr->length - offset - 1,
j = vPtr->length - 1; i >= 0; i--, j--) {
opnd[j] = opnd[i];
}
for (i = 0; i < offset; i++) {
opnd[i] = hold[i];
}
free(hold);
}
}
break;
default:
Tcl_AppendResult(interp, "unknown operator in expression",
(char *)NULL);
goto error;
}
} else if (vPtr->length == 1) {
double *opnd;
double scalar;
/*
* 1st operand is a scalar.
*/
scalar = vPtr->valueArr[0];
Blt_Vec_Duplicate(vPtr, v2Ptr);
opnd = vPtr->valueArr;
switch (operator) {
case MULT:
for(i = 0; i < vPtr->length; i++) {
opnd[i] *= scalar;
}
break;
case PLUS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] += scalar;
}
break;
case DIVIDE:
for(i = 0; i < vPtr->length; i++) {
if (opnd[i] == 0.0) {
Tcl_AppendResult(interp, "divide by zero",
(char *)NULL);
goto error;
}
opnd[i] = (scalar / opnd[i]);
}
break;
case MINUS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = scalar - opnd[i];
}
break;
case EXPONENT:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = pow(scalar, opnd[i]);
}
break;
case MOD:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = Fmod(scalar, opnd[i]);
}
break;
case LESS:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(scalar < opnd[i]);
}
break;
case GREATER:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(scalar > opnd[i]);
}
break;
case LEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(scalar >= opnd[i]);
}
break;
case GEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(scalar <= opnd[i]);
}
break;
case EQUAL:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] == scalar);
}
break;
case NEQ:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] != scalar);
}
break;
case AND:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] && scalar);
}
break;
case OR:
for(i = 0; i < vPtr->length; i++) {
opnd[i] = (double)(opnd[i] || scalar);
}
break;
case LEFT_SHIFT:
case RIGHT_SHIFT:
Tcl_AppendResult(interp, "second shift operand must be scalar",
(char *)NULL);
goto error;
default:
Tcl_AppendResult(interp, "unknown operator in expression",
(char *)NULL);
goto error;
}
} else {
double *opnd1, *opnd2;
/*
* Carry out the function of the specified operator.
*/
if (vPtr->length != v2Ptr->length) {
Tcl_AppendResult(interp, "vectors are different lengths",
(char *)NULL);
goto error;
}
opnd1 = vPtr->valueArr, opnd2 = v2Ptr->valueArr;
switch (operator) {
case MULT:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] *= opnd2[i];
}
break;
case DIVIDE:
for (i = 0; i < vPtr->length; i++) {
if (opnd2[i] == 0.0) {
Tcl_AppendResult(interp,
"can't divide by 0.0 vector component",
(char *)NULL);
goto error;
}
opnd1[i] /= opnd2[i];
}
break;
case PLUS:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] += opnd2[i];
}
break;
case MINUS:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] -= opnd2[i];
}
break;
case MOD:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = Fmod(opnd1[i], opnd2[i]);
}
break;
case EXPONENT:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = pow(opnd1[i], opnd2[i]);
}
break;
case LESS:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] < opnd2[i]);
}
break;
case GREATER:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] > opnd2[i]);
}
break;
case LEQ:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] <= opnd2[i]);
}
break;
case GEQ:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] >= opnd2[i]);
}
break;
case EQUAL:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] == opnd2[i]);
}
break;
case NEQ:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] != opnd2[i]);
}
break;
case AND:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] && opnd2[i]);
}
break;
case OR:
for (i = 0; i < vPtr->length; i++) {
opnd1[i] = (double)(opnd1[i] || opnd2[i]);
}
break;
case LEFT_SHIFT:
case RIGHT_SHIFT:
Tcl_AppendResult(interp, "second shift operand must be scalar",
(char *)NULL);
goto error;
default:
Tcl_AppendResult(interp, "unknown operator in expression",
(char *)NULL);
goto error;
}
}
}
done:
if (value2.pv.buffer != value2.staticSpace) {
free(value2.pv.buffer);
}
Blt_Vec_Free(v2Ptr);
return result;
error:
if (value2.pv.buffer != value2.staticSpace) {
free(value2.pv.buffer);
}
Blt_Vec_Free(v2Ptr);
return TCL_ERROR;
}
/*
*---------------------------------------------------------------------------
*
* EvaluateExpression --
*
* This procedure provides top-level functionality shared by
* procedures like Tcl_ExprInt, Tcl_ExprDouble, etc.
*
* Results:
* The result is a standard TCL return value. If an error
* occurs then an error message is left in interp->result.
* The value of the expression is returned in *valuePtr, in
* whatever form it ends up in (could be string or integer
* or double). Caller may need to convert result. Caller
* is also responsible for freeing string memory in *valuePtr,
* if any was allocated.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static int
EvaluateExpression(
Tcl_Interp* interp, /* Context in which to evaluate the
* expression. */
char *string, /* Expression to evaluate. */
Value *valuePtr) /* Where to store result. Should
* not be initialized by caller. */
{
ParseInfo info;
int result;
Vector *vPtr;
double *vp, *vend;
info.expr = info.nextPtr = string;
valuePtr->pv.buffer = valuePtr->pv.next = valuePtr->staticSpace;
valuePtr->pv.end = valuePtr->pv.buffer + STATIC_STRING_SPACE - 1;
valuePtr->pv.expandProc = Blt_ExpandParseValue;
valuePtr->pv.clientData = NULL;
result = NextValue(interp, &info, -1, valuePtr);
if (result != TCL_OK) {
return result;
}
if (info.token != END) {
Tcl_AppendResult(interp, ": syntax error in expression \"",
string, "\"", (char *)NULL);
return TCL_ERROR;
}
vPtr = valuePtr->vPtr;
/* Check for NaN's and overflows. */
for (vp = vPtr->valueArr, vend = vp + vPtr->length; vp < vend; vp++) {
if (!isfinite(*vp)) {
/*
* IEEE floating-point error.
*/
MathError(interp, *vp);
return TCL_ERROR;
}
}
return TCL_OK;
}
/*
*---------------------------------------------------------------------------
*
* Math Functions --
*
* This page contains the procedures that implement all of the
* built-in math functions for expressions.
*
* Results:
* Each procedure returns TCL_OK if it succeeds and places result
* information at *resultPtr. If it fails it returns TCL_ERROR
* and leaves an error message in interp->result.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
static int
ComponentFunc(
ClientData clientData, /* Contains address of procedure that
* takes one double argument and
* returns a double result. */
Tcl_Interp* interp,
Vector *vPtr)
{
ComponentProc *procPtr = (ComponentProc *) clientData;
double *vp, *vend;
errno = 0;
for(vp = vPtr->valueArr + vPtr->first,
vend = vPtr->valueArr + vPtr->last; vp <= vend; vp++) {
*vp = (*procPtr) (*vp);
if (errno != 0) {
MathError(interp, *vp);
return TCL_ERROR;
}
if (!isfinite(*vp)) {
/*
* IEEE floating-point error.
*/
MathError(interp, *vp);
return TCL_ERROR;
}
}
return TCL_OK;
}
static int
ScalarFunc(ClientData clientData, Tcl_Interp* interp, Vector *vPtr)
{
double value;
ScalarProc *procPtr = (ScalarProc *) clientData;
errno = 0;
value = (*procPtr) (vPtr);
if (errno != 0) {
MathError(interp, value);
return TCL_ERROR;
}
if (Blt_Vec_ChangeLength(interp, vPtr, 1) != TCL_OK) {
return TCL_ERROR;
}
vPtr->valueArr[0] = value;
return TCL_OK;
}
/*ARGSUSED*/
static int
VectorFunc(ClientData clientData, Tcl_Interp* interp, Vector *vPtr)
{
VectorProc *procPtr = (VectorProc *) clientData;
return (*procPtr) (vPtr);
}
static MathFunction mathFunctions[] =
{
{"abs", ComponentFunc, Fabs},
{"acos", ComponentFunc, acos},
{"asin", ComponentFunc, asin},
{"atan", ComponentFunc, atan},
{"adev", ScalarFunc, AvgDeviation},
{"ceil", ComponentFunc, ceil},
{"cos", ComponentFunc, cos},
{"cosh", ComponentFunc, cosh},
{"exp", ComponentFunc, exp},
{"floor", ComponentFunc, floor},
{"kurtosis",ScalarFunc, Kurtosis},
{"length", ScalarFunc, Length},
{"log", ComponentFunc, log},
{"log10", ComponentFunc, log10},
{"max", ScalarFunc, Blt_VecMax},
{"mean", ScalarFunc, Mean},
{"median", ScalarFunc, Median},
{"min", ScalarFunc, Blt_VecMin},
{"norm", VectorFunc, Norm},
{"nz", ScalarFunc, Nonzeros},
{"q1", ScalarFunc, Q1},
{"q3", ScalarFunc, Q3},
{"prod", ScalarFunc, Product},
{"random", ComponentFunc, drand48},
{"round", ComponentFunc, Round},
{"sdev", ScalarFunc, StdDeviation},
{"sin", ComponentFunc, sin},
{"sinh", ComponentFunc, sinh},
{"skew", ScalarFunc, Skew},
{"sort", VectorFunc, Sort},
{"sqrt", ComponentFunc, sqrt},
{"sum", ScalarFunc, Sum},
{"tan", ComponentFunc, tan},
{"tanh", ComponentFunc, tanh},
{"var", ScalarFunc, Variance},
{(char *)NULL,},
};
void
Blt_Vec_InstallMathFunctions(Tcl_HashTable *tablePtr)
{
MathFunction *mathPtr;
for (mathPtr = mathFunctions; mathPtr->name != NULL; mathPtr++) {
Tcl_HashEntry *hPtr;
int isNew;
hPtr = Tcl_CreateHashEntry(tablePtr, mathPtr->name, &isNew);
Tcl_SetHashValue(hPtr, (ClientData)mathPtr);
}
}
void
Blt_Vec_UninstallMathFunctions(Tcl_HashTable *tablePtr)
{
Tcl_HashEntry *hPtr;
Tcl_HashSearch cursor;
for (hPtr = Tcl_FirstHashEntry(tablePtr, &cursor); hPtr != NULL;
hPtr = Tcl_NextHashEntry(&cursor)) {
MathFunction *mathPtr;
mathPtr = Tcl_GetHashValue(hPtr);
if (mathPtr->name == NULL) {
free(mathPtr);
}
}
}
static void
InstallIndexProc(
Tcl_HashTable *tablePtr,
const char *string,
Blt_VectorIndexProc *procPtr) /* Pointer to function to be called
* when the vector finds the named index.
* If NULL, this indicates to remove
* the index from the table.
*/
{
Tcl_HashEntry *hPtr;
int dummy;
hPtr = Tcl_CreateHashEntry(tablePtr, string, &dummy);
if (procPtr == NULL) {
Tcl_DeleteHashEntry(hPtr);
} else {
Tcl_SetHashValue(hPtr, (ClientData)procPtr);
}
}
void
Blt_Vec_InstallSpecialIndices(Tcl_HashTable *tablePtr)
{
InstallIndexProc(tablePtr, "min", Blt_VecMin);
InstallIndexProc(tablePtr, "max", Blt_VecMax);
InstallIndexProc(tablePtr, "mean", Mean);
InstallIndexProc(tablePtr, "sum", Sum);
InstallIndexProc(tablePtr, "prod", Product);
}
/*
*---------------------------------------------------------------------------
*
* Blt_ExprVector --
*
* Evaluates an vector expression and returns its value(s).
*
* Results:
* Each of the procedures below returns a standard TCL result.
* If an error occurs then an error message is left in
* interp->result. Otherwise the value of the expression,
* in the appropriate form, is stored at *resultPtr. If
* the expression had a result that was incompatible with the
* desired form then an error is returned.
*
* Side effects:
* None.
*
*---------------------------------------------------------------------------
*/
int
Blt_ExprVector(
Tcl_Interp* interp, /* Context in which to evaluate the
* expression. */
char *string, /* Expression to evaluate. */
Blt_Vector *vector) /* Where to store result. */
{
VectorInterpData *dataPtr; /* Interpreter-specific data. */
Vector *vPtr = (Vector *)vector;
Value value;
dataPtr = (vector != NULL)
? vPtr->dataPtr : Blt_Vec_GetInterpData(interp);
value.vPtr = Blt_Vec_New(dataPtr);
if (EvaluateExpression(interp, string, &value) != TCL_OK) {
Blt_Vec_Free(value.vPtr);
return TCL_ERROR;
}
if (vPtr != NULL) {
Blt_Vec_Duplicate(vPtr, value.vPtr);
} else {
Tcl_Obj *listObjPtr;
double *vp, *vend;
/* No result vector. Put values in interp->result. */
listObjPtr = Tcl_NewListObj(0, (Tcl_Obj **) NULL);
for (vp = value.vPtr->valueArr, vend = vp + value.vPtr->length;
vp < vend; vp++) {
Tcl_ListObjAppendElement(interp, listObjPtr, Tcl_NewDoubleObj(*vp));
}
Tcl_SetObjResult(interp, listObjPtr);
}
Blt_Vec_Free(value.vPtr);
return TCL_OK;
}
|