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
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
12673
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
13001
13002
13003
13004
13005
13006
13007
13008
13009
13010
13011
13012
13013
13014
13015
13016
13017
13018
13019
13020
13021
13022
13023
13024
13025
13026
13027
13028
13029
13030
13031
13032
13033
13034
13035
13036
13037
13038
13039
13040
13041
13042
13043
13044
13045
13046
13047
13048
13049
13050
13051
13052
13053
13054
13055
13056
13057
13058
13059
13060
13061
13062
13063
13064
13065
13066
13067
13068
13069
13070
13071
13072
13073
13074
13075
13076
13077
13078
13079
13080
13081
13082
13083
13084
13085
13086
13087
13088
13089
13090
13091
13092
13093
13094
13095
13096
13097
13098
13099
13100
13101
13102
13103
13104
13105
13106
13107
13108
13109
13110
13111
13112
13113
13114
13115
13116
13117
13118
13119
13120
13121
13122
13123
13124
13125
13126
13127
13128
13129
13130
13131
13132
13133
13134
13135
13136
13137
13138
13139
13140
13141
13142
13143
13144
13145
13146
13147
13148
13149
13150
13151
13152
13153
13154
13155
13156
13157
13158
13159
13160
13161
13162
13163
13164
13165
13166
13167
13168
13169
13170
13171
13172
13173
13174
13175
13176
13177
13178
13179
13180
13181
13182
13183
13184
13185
13186
13187
13188
13189
13190
13191
13192
13193
13194
13195
13196
13197
13198
13199
13200
13201
13202
13203
13204
13205
13206
13207
13208
13209
13210
13211
13212
13213
13214
13215
13216
13217
13218
13219
13220
13221
13222
13223
13224
13225
13226
13227
13228
13229
13230
13231
13232
13233
13234
13235
13236
13237
13238
13239
13240
13241
13242
13243
13244
13245
13246
13247
13248
13249
13250
13251
13252
13253
13254
13255
13256
13257
13258
13259
13260
13261
13262
13263
13264
13265
13266
13267
13268
13269
13270
13271
13272
13273
13274
13275
13276
13277
13278
13279
13280
13281
13282
13283
13284
13285
13286
13287
13288
13289
13290
13291
13292
13293
13294
13295
13296
13297
13298
13299
13300
13301
13302
13303
13304
13305
13306
13307
13308
13309
13310
13311
13312
13313
13314
13315
13316
13317
13318
13319
13320
13321
13322
13323
13324
13325
13326
13327
13328
13329
13330
13331
13332
13333
13334
13335
13336
13337
13338
13339
13340
13341
13342
13343
13344
13345
13346
13347
13348
13349
13350
13351
13352
13353
13354
13355
13356
13357
13358
13359
13360
13361
13362
13363
13364
13365
13366
13367
13368
13369
13370
13371
13372
13373
13374
13375
13376
13377
13378
13379
13380
13381
13382
13383
13384
13385
13386
13387
13388
13389
13390
13391
13392
13393
13394
13395
13396
13397
13398
13399
13400
13401
13402
13403
13404
13405
13406
13407
13408
13409
13410
13411
13412
13413
13414
13415
13416
13417
13418
13419
13420
13421
13422
13423
13424
13425
13426
13427
13428
13429
13430
13431
13432
13433
13434
13435
13436
13437
13438
13439
13440
13441
13442
13443
13444
13445
13446
13447
13448
13449
13450
13451
13452
13453
13454
13455
13456
13457
13458
13459
13460
13461
13462
13463
13464
13465
13466
13467
13468
13469
13470
13471
13472
13473
13474
13475
13476
13477
13478
13479
13480
13481
13482
13483
13484
13485
13486
13487
13488
13489
13490
13491
13492
13493
13494
13495
13496
13497
13498
13499
13500
13501
13502
13503
13504
13505
13506
13507
13508
13509
13510
13511
13512
13513
13514
13515
13516
13517
13518
13519
13520
13521
13522
13523
13524
13525
13526
13527
13528
13529
13530
13531
13532
13533
13534
13535
13536
13537
13538
13539
13540
13541
13542
13543
13544
13545
13546
13547
13548
13549
13550
13551
13552
13553
13554
13555
13556
13557
13558
13559
13560
13561
13562
13563
13564
13565
13566
13567
13568
13569
13570
13571
13572
13573
13574
13575
13576
13577
13578
13579
13580
13581
13582
13583
13584
13585
13586
13587
13588
13589
13590
13591
13592
13593
13594
13595
13596
13597
13598
13599
13600
13601
13602
13603
13604
13605
13606
13607
13608
13609
13610
13611
13612
13613
13614
13615
13616
13617
13618
13619
13620
13621
13622
13623
13624
13625
13626
13627
13628
13629
13630
13631
13632
13633
13634
13635
13636
13637
13638
13639
13640
13641
13642
13643
13644
13645
13646
13647
13648
13649
13650
13651
13652
13653
13654
13655
13656
13657
13658
13659
13660
13661
13662
13663
13664
13665
13666
13667
13668
13669
13670
13671
13672
13673
13674
13675
13676
13677
13678
13679
13680
13681
13682
13683
13684
13685
13686
13687
13688
13689
13690
13691
13692
13693
13694
13695
13696
13697
13698
13699
13700
13701
13702
13703
13704
13705
13706
13707
13708
13709
13710
13711
13712
13713
13714
13715
13716
13717
13718
13719
13720
13721
13722
13723
13724
13725
13726
13727
13728
13729
13730
13731
13732
13733
13734
13735
13736
13737
13738
13739
13740
13741
13742
13743
13744
13745
13746
13747
13748
13749
13750
13751
13752
13753
13754
13755
13756
13757
13758
13759
13760
13761
13762
13763
13764
13765
13766
13767
13768
13769
13770
13771
13772
13773
13774
13775
13776
13777
13778
13779
13780
13781
13782
13783
13784
13785
13786
13787
13788
13789
13790
13791
13792
13793
13794
13795
13796
13797
13798
13799
13800
13801
13802
13803
13804
13805
13806
13807
13808
13809
13810
13811
13812
13813
13814
13815
13816
13817
13818
13819
13820
13821
13822
13823
13824
13825
13826
13827
13828
13829
13830
13831
13832
13833
13834
13835
13836
13837
13838
13839
13840
13841
13842
13843
13844
13845
13846
13847
13848
13849
13850
13851
13852
13853
13854
13855
13856
13857
13858
13859
13860
13861
13862
13863
13864
13865
13866
13867
13868
13869
13870
13871
13872
13873
13874
13875
13876
13877
13878
13879
13880
13881
13882
13883
13884
13885
13886
13887
13888
13889
13890
13891
13892
13893
13894
13895
13896
13897
13898
13899
13900
13901
13902
13903
13904
13905
13906
13907
13908
13909
13910
13911
13912
13913
13914
13915
13916
13917
13918
13919
13920
13921
13922
13923
13924
13925
13926
13927
13928
13929
13930
13931
13932
13933
13934
13935
13936
13937
13938
13939
13940
13941
13942
13943
13944
13945
13946
13947
13948
13949
13950
13951
13952
13953
13954
13955
13956
13957
13958
13959
13960
13961
13962
13963
13964
13965
13966
13967
13968
13969
13970
13971
13972
13973
13974
13975
13976
13977
13978
13979
13980
13981
13982
13983
13984
13985
13986
13987
13988
13989
13990
13991
13992
13993
13994
13995
13996
13997
13998
13999
14000
14001
14002
14003
14004
14005
14006
14007
14008
14009
14010
14011
14012
14013
14014
14015
14016
14017
14018
14019
14020
14021
14022
14023
14024
14025
14026
14027
14028
14029
14030
14031
14032
14033
14034
14035
14036
14037
14038
14039
14040
14041
14042
14043
14044
14045
14046
14047
14048
14049
14050
14051
14052
14053
14054
14055
14056
14057
14058
14059
14060
14061
14062
14063
14064
14065
14066
14067
14068
14069
14070
14071
14072
14073
14074
14075
14076
14077
14078
14079
14080
14081
14082
14083
14084
14085
14086
14087
14088
14089
14090
14091
14092
14093
14094
14095
14096
14097
14098
14099
14100
14101
14102
14103
14104
14105
14106
14107
14108
14109
14110
14111
14112
14113
14114
14115
14116
14117
14118
14119
14120
14121
14122
14123
14124
14125
14126
14127
14128
14129
14130
14131
14132
14133
14134
14135
14136
14137
14138
14139
14140
14141
14142
14143
14144
14145
14146
14147
14148
14149
14150
14151
14152
14153
14154
14155
14156
14157
14158
14159
14160
14161
14162
14163
14164
14165
14166
14167
14168
14169
14170
14171
14172
14173
14174
14175
14176
14177
14178
14179
14180
14181
14182
14183
14184
14185
14186
14187
14188
14189
14190
14191
14192
14193
14194
14195
14196
14197
14198
14199
14200
14201
14202
14203
14204
14205
14206
14207
14208
14209
14210
14211
14212
14213
14214
14215
14216
14217
14218
14219
14220
14221
14222
14223
14224
14225
14226
14227
14228
14229
14230
14231
14232
14233
14234
14235
14236
14237
14238
14239
14240
14241
14242
14243
14244
14245
14246
14247
14248
14249
14250
14251
14252
14253
14254
14255
14256
14257
14258
14259
14260
14261
14262
14263
14264
14265
14266
14267
14268
14269
14270
14271
14272
14273
14274
14275
14276
14277
14278
14279
14280
14281
14282
14283
14284
14285
14286
14287
14288
14289
14290
14291
14292
14293
14294
14295
14296
14297
14298
14299
14300
14301
14302
14303
14304
14305
14306
14307
14308
14309
14310
14311
14312
14313
14314
14315
14316
14317
14318
14319
14320
14321
14322
14323
14324
14325
14326
14327
14328
14329
14330
14331
14332
14333
14334
14335
14336
14337
14338
14339
14340
14341
14342
14343
14344
14345
14346
14347
14348
14349
14350
14351
14352
14353
14354
14355
14356
14357
14358
14359
14360
14361
14362
14363
14364
14365
14366
14367
14368
14369
14370
14371
14372
14373
14374
14375
14376
14377
14378
14379
14380
14381
14382
14383
14384
14385
14386
14387
14388
14389
14390
14391
14392
14393
14394
14395
14396
14397
14398
14399
14400
14401
14402
14403
14404
14405
14406
14407
14408
14409
14410
14411
14412
14413
14414
14415
14416
14417
14418
14419
14420
14421
14422
14423
14424
14425
14426
14427
14428
14429
14430
14431
14432
14433
14434
14435
14436
14437
14438
14439
14440
14441
14442
14443
14444
14445
14446
14447
14448
14449
14450
14451
14452
14453
14454
14455
14456
14457
14458
14459
14460
14461
14462
14463
14464
14465
14466
14467
14468
14469
14470
14471
14472
14473
14474
14475
14476
14477
14478
14479
14480
14481
14482
14483
14484
14485
14486
14487
14488
14489
14490
14491
14492
14493
14494
14495
14496
14497
14498
14499
14500
14501
14502
14503
14504
14505
14506
14507
14508
14509
14510
14511
14512
14513
14514
14515
14516
14517
14518
14519
14520
14521
14522
14523
14524
14525
14526
14527
14528
14529
14530
14531
14532
14533
14534
14535
14536
14537
14538
14539
14540
14541
14542
14543
14544
14545
14546
14547
14548
14549
14550
14551
14552
14553
14554
14555
14556
14557
14558
14559
14560
14561
14562
14563
14564
14565
14566
14567
14568
14569
14570
14571
14572
14573
14574
14575
14576
14577
14578
14579
14580
14581
14582
14583
14584
14585
14586
14587
14588
14589
14590
14591
14592
14593
14594
14595
14596
14597
14598
14599
14600
14601
14602
14603
14604
14605
14606
14607
14608
14609
14610
14611
14612
14613
14614
14615
14616
14617
14618
14619
14620
14621
14622
14623
14624
14625
14626
14627
14628
14629
14630
14631
14632
14633
14634
14635
14636
14637
14638
14639
14640
14641
14642
14643
14644
14645
14646
14647
14648
14649
14650
14651
14652
14653
14654
14655
14656
14657
14658
14659
14660
14661
14662
14663
14664
14665
14666
14667
14668
14669
14670
14671
14672
14673
14674
14675
14676
14677
14678
14679
14680
14681
14682
14683
14684
14685
14686
14687
14688
14689
14690
14691
14692
14693
14694
14695
14696
14697
14698
14699
14700
14701
14702
14703
14704
14705
14706
14707
14708
14709
14710
14711
14712
14713
14714
14715
14716
14717
14718
14719
14720
14721
14722
14723
14724
14725
14726
14727
14728
14729
14730
14731
14732
14733
14734
14735
14736
14737
14738
14739
14740
14741
14742
14743
14744
14745
14746
14747
14748
14749
14750
14751
14752
14753
14754
14755
14756
14757
14758
14759
14760
14761
14762
14763
14764
14765
14766
14767
14768
14769
14770
14771
14772
14773
14774
14775
14776
14777
14778
14779
14780
14781
14782
14783
14784
14785
14786
14787
14788
14789
14790
14791
14792
14793
14794
14795
14796
14797
14798
14799
14800
14801
14802
14803
14804
14805
14806
14807
14808
14809
14810
14811
14812
14813
14814
14815
14816
14817
14818
14819
14820
14821
14822
14823
14824
14825
14826
14827
14828
14829
14830
14831
14832
14833
14834
14835
14836
14837
14838
14839
14840
14841
14842
14843
14844
14845
14846
14847
14848
14849
14850
14851
14852
14853
14854
14855
14856
14857
14858
14859
14860
14861
14862
14863
14864
14865
14866
14867
14868
14869
14870
14871
14872
14873
14874
14875
14876
14877
14878
14879
14880
14881
14882
14883
14884
14885
14886
14887
14888
14889
14890
14891
14892
14893
14894
14895
14896
14897
14898
14899
14900
14901
14902
14903
14904
14905
14906
14907
14908
14909
14910
14911
14912
14913
14914
14915
14916
14917
14918
14919
14920
14921
14922
14923
14924
14925
14926
14927
14928
14929
14930
14931
14932
14933
14934
14935
14936
14937
14938
14939
14940
14941
14942
14943
14944
14945
14946
14947
14948
14949
14950
14951
14952
14953
14954
14955
14956
14957
14958
14959
14960
14961
14962
14963
14964
14965
14966
14967
14968
14969
14970
14971
14972
14973
14974
14975
14976
14977
14978
14979
14980
14981
14982
14983
14984
14985
14986
14987
14988
14989
14990
14991
14992
14993
14994
14995
14996
14997
14998
14999
15000
15001
15002
15003
15004
15005
15006
15007
15008
15009
15010
15011
15012
15013
15014
15015
15016
15017
15018
15019
15020
15021
15022
15023
15024
15025
15026
15027
15028
15029
15030
15031
15032
15033
15034
15035
15036
15037
15038
15039
15040
15041
15042
15043
15044
15045
15046
15047
15048
15049
15050
15051
15052
15053
15054
15055
15056
15057
15058
15059
15060
15061
15062
15063
15064
15065
15066
15067
15068
15069
15070
15071
15072
15073
15074
15075
15076
15077
15078
15079
15080
15081
15082
15083
15084
15085
15086
15087
15088
15089
15090
15091
15092
15093
15094
15095
15096
15097
15098
15099
15100
15101
15102
15103
15104
15105
15106
15107
15108
15109
15110
15111
15112
15113
15114
15115
15116
15117
15118
15119
15120
15121
15122
15123
15124
15125
15126
15127
15128
15129
15130
15131
15132
15133
15134
15135
15136
15137
15138
15139
15140
15141
15142
15143
15144
15145
15146
15147
15148
15149
15150
15151
15152
15153
15154
15155
15156
15157
15158
15159
15160
15161
15162
15163
15164
15165
15166
15167
15168
15169
15170
15171
15172
15173
15174
15175
15176
15177
15178
15179
15180
15181
15182
15183
15184
15185
15186
15187
15188
15189
15190
15191
15192
15193
15194
15195
15196
15197
15198
15199
15200
15201
15202
15203
15204
15205
15206
15207
15208
15209
15210
15211
15212
15213
15214
15215
15216
15217
15218
15219
15220
15221
15222
15223
15224
15225
15226
15227
15228
15229
15230
15231
15232
15233
15234
15235
15236
15237
15238
15239
15240
15241
15242
15243
15244
15245
15246
15247
15248
15249
15250
15251
15252
15253
15254
15255
15256
15257
15258
15259
15260
15261
15262
15263
15264
15265
15266
15267
15268
15269
15270
15271
15272
15273
15274
15275
15276
15277
15278
15279
15280
15281
15282
15283
15284
15285
15286
15287
15288
15289
15290
15291
15292
15293
15294
15295
15296
15297
15298
15299
15300
15301
15302
15303
15304
15305
15306
15307
15308
15309
15310
15311
15312
15313
15314
15315
15316
15317
15318
15319
15320
15321
15322
15323
15324
15325
15326
15327
15328
15329
15330
15331
15332
15333
15334
15335
15336
15337
15338
15339
15340
15341
15342
15343
15344
15345
15346
15347
15348
15349
15350
15351
15352
15353
15354
15355
15356
15357
15358
15359
15360
15361
15362
15363
15364
15365
15366
15367
15368
15369
15370
15371
15372
15373
15374
15375
15376
15377
15378
15379
15380
15381
15382
15383
15384
15385
15386
15387
15388
15389
15390
15391
15392
15393
15394
15395
15396
15397
15398
15399
15400
15401
15402
15403
15404
15405
15406
15407
15408
15409
15410
15411
15412
15413
15414
15415
15416
15417
15418
15419
15420
15421
15422
15423
15424
15425
15426
15427
15428
15429
15430
15431
15432
15433
15434
15435
15436
15437
15438
15439
15440
15441
15442
15443
15444
15445
15446
15447
15448
15449
15450
15451
15452
15453
15454
15455
15456
15457
15458
15459
15460
15461
15462
15463
15464
15465
15466
15467
15468
15469
15470
15471
15472
15473
15474
15475
15476
15477
15478
15479
15480
15481
15482
15483
15484
15485
15486
15487
15488
15489
15490
15491
15492
15493
15494
15495
15496
15497
15498
15499
15500
15501
15502
15503
15504
15505
15506
15507
15508
15509
15510
15511
15512
15513
15514
15515
15516
15517
15518
15519
15520
15521
15522
15523
15524
15525
15526
15527
15528
15529
15530
15531
15532
15533
15534
15535
15536
15537
15538
15539
15540
15541
15542
15543
15544
15545
15546
15547
15548
15549
15550
15551
15552
15553
15554
15555
15556
15557
15558
15559
15560
15561
15562
15563
15564
15565
15566
15567
15568
15569
15570
15571
15572
15573
15574
15575
15576
15577
15578
15579
15580
15581
15582
15583
15584
15585
15586
15587
15588
15589
15590
15591
15592
15593
15594
15595
15596
15597
15598
15599
15600
15601
15602
15603
15604
15605
15606
15607
15608
15609
15610
15611
15612
15613
15614
15615
15616
15617
15618
15619
15620
15621
15622
15623
15624
15625
15626
15627
15628
15629
15630
15631
15632
15633
15634
15635
15636
15637
15638
15639
15640
15641
15642
15643
15644
15645
15646
15647
15648
15649
15650
15651
15652
15653
15654
15655
15656
15657
15658
15659
15660
15661
15662
15663
15664
15665
15666
15667
15668
15669
15670
15671
15672
15673
15674
15675
15676
15677
15678
15679
15680
15681
15682
15683
15684
15685
15686
15687
15688
15689
15690
15691
15692
15693
15694
15695
15696
15697
15698
15699
15700
15701
15702
15703
15704
15705
15706
15707
15708
15709
15710
15711
15712
15713
15714
15715
15716
15717
15718
15719
15720
15721
15722
15723
15724
15725
15726
15727
15728
15729
15730
15731
15732
15733
15734
15735
15736
15737
15738
15739
15740
15741
15742
15743
15744
15745
15746
15747
15748
15749
15750
15751
15752
15753
15754
15755
15756
15757
15758
15759
15760
15761
15762
15763
15764
15765
15766
15767
15768
15769
15770
15771
15772
15773
15774
15775
15776
15777
15778
15779
15780
15781
15782
15783
15784
15785
15786
15787
15788
15789
15790
15791
15792
15793
15794
15795
15796
15797
15798
15799
15800
15801
15802
15803
15804
15805
15806
15807
15808
15809
15810
15811
15812
15813
15814
15815
15816
15817
15818
15819
15820
15821
15822
15823
15824
15825
15826
15827
15828
15829
15830
15831
15832
15833
15834
15835
15836
15837
15838
15839
15840
15841
15842
15843
15844
15845
15846
15847
15848
15849
15850
15851
15852
15853
15854
15855
15856
15857
15858
15859
15860
15861
15862
15863
15864
15865
15866
15867
15868
15869
15870
15871
15872
15873
15874
15875
15876
15877
15878
15879
15880
15881
15882
15883
15884
15885
15886
15887
15888
15889
15890
15891
15892
15893
15894
15895
15896
15897
15898
15899
15900
15901
15902
15903
15904
15905
15906
15907
15908
15909
15910
15911
15912
15913
15914
15915
15916
15917
15918
15919
15920
15921
15922
15923
15924
15925
15926
15927
15928
15929
15930
15931
15932
15933
15934
15935
15936
15937
15938
15939
15940
15941
15942
15943
15944
15945
15946
15947
15948
15949
15950
15951
15952
15953
15954
15955
15956
15957
15958
15959
15960
15961
15962
15963
15964
15965
15966
15967
15968
15969
15970
15971
15972
15973
15974
15975
15976
15977
15978
15979
15980
15981
15982
15983
15984
15985
15986
15987
15988
15989
15990
15991
15992
15993
15994
15995
15996
15997
15998
15999
16000
16001
16002
16003
16004
16005
16006
16007
16008
16009
16010
16011
16012
16013
16014
16015
16016
16017
16018
16019
16020
16021
16022
16023
16024
16025
16026
16027
16028
16029
16030
16031
16032
16033
16034
16035
16036
16037
16038
16039
16040
16041
16042
16043
16044
16045
16046
16047
16048
16049
16050
16051
16052
16053
16054
16055
16056
16057
16058
16059
16060
16061
16062
16063
16064
16065
16066
16067
16068
16069
16070
16071
16072
16073
16074
16075
16076
16077
16078
16079
16080
16081
16082
16083
16084
16085
16086
16087
16088
16089
16090
16091
16092
16093
16094
16095
16096
16097
16098
16099
16100
16101
16102
16103
16104
16105
16106
16107
16108
16109
16110
16111
16112
16113
16114
16115
16116
16117
16118
16119
16120
16121
16122
16123
16124
16125
16126
16127
16128
16129
16130
16131
16132
16133
16134
16135
16136
16137
16138
16139
16140
16141
16142
16143
16144
16145
16146
16147
16148
16149
16150
16151
16152
16153
16154
16155
16156
16157
16158
16159
16160
16161
16162
16163
16164
16165
16166
16167
16168
16169
16170
16171
16172
16173
16174
16175
16176
16177
16178
16179
16180
16181
16182
16183
16184
16185
16186
16187
16188
16189
16190
16191
16192
16193
16194
16195
16196
16197
16198
16199
16200
16201
16202
16203
16204
16205
16206
16207
16208
16209
16210
16211
16212
16213
16214
16215
16216
16217
16218
16219
16220
16221
16222
16223
16224
16225
16226
16227
16228
16229
16230
16231
16232
16233
16234
16235
16236
16237
16238
16239
16240
16241
16242
16243
16244
16245
16246
16247
|
#!/usr/bin/env texlua
if not modules then modules = { } end modules ['mtxrun'] = {
version = 1.001,
comment = "runner, lua replacement for texmfstart.rb",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- one can make a stub:
--
-- #!/bin/sh
-- env LUATEXDIR=/....../texmf/scripts/context/lua luatex --luaonly mtxrun.lua "$@"
-- filename : mtxrun.lua
-- comment : companion to context.tex
-- author : Hans Hagen, PRAGMA-ADE, Hasselt NL
-- copyright: PRAGMA ADE / ConTeXt Development Team
-- license : see context related readme files
-- This script is based on texmfstart.rb but does not use kpsewhich to
-- locate files. Although kpse is a library it never came to opening up
-- its interface to other programs (esp scripting languages) and so we
-- do it ourselves. The lua variant evolved out of an experimental ruby
-- one. Interesting is that using a scripting language instead of c does
-- not have a speed penalty. Actually the lua variant is more efficient,
-- especially when multiple calls to kpsewhich are involved. The lua
-- library also gives way more control.
-- to be done / considered
--
-- support for --exec or make it default
-- support for jar files (or maybe not, never used, too messy)
-- support for $RUBYINPUTS cum suis (if still needed)
-- remember for subruns: _CTX_K_V_#{original}_
-- remember for subruns: _CTX_K_S_#{original}_
-- remember for subruns: TEXMFSTART.#{original} [tex.rb texmfstart.rb]
-- begin library merge
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-string'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local string = string
local sub, gsub, find, match, gmatch, format, char, byte, rep, lower = string.sub, string.gsub, string.find, string.match, string.gmatch, string.format, string.char, string.byte, string.rep, string.lower
local lpegmatch, S, C, Ct = lpeg.match, lpeg.S, lpeg.C, lpeg.Ct
-- some functions may disappear as they are not used anywhere
if not string.split then
-- this will be overloaded by a faster lpeg variant
function string.split(str,pattern)
local t = { }
if #str > 0 then
local n = 1
for s in gmatch(str..pattern,"(.-)"..pattern) do
t[n] = s
n = n + 1
end
end
return t
end
end
function string.unquoted(str)
return (gsub(str,"^([\"\'])(.*)%1$","%2"))
end
function string.quoted(str)
return format("%q",str) -- always "
end
function string.count(str,pattern) -- variant 3
local n = 0
for _ in gmatch(str,pattern) do -- not for utf
n = n + 1
end
return n
end
function string.limit(str,n,sentinel) -- not utf proof
if #str > n then
sentinel = sentinel or "..."
return sub(str,1,(n-#sentinel)) .. sentinel
else
return str
end
end
local space = S(" \t\v\n")
local nospace = 1 - space
local stripper = space^0 * C((space^0 * nospace^1)^0) -- roberto's code
function string.strip(str)
return lpegmatch(stripper,str) or ""
end
function string.is_empty(str)
return not find(str,"%S")
end
local patterns_escapes = {
["%"] = "%%",
["."] = "%.",
["+"] = "%+", ["-"] = "%-", ["*"] = "%*",
["["] = "%[", ["]"] = "%]",
["("] = "%(", [")"] = "%)",
-- ["{"] = "%{", ["}"] = "%}"
-- ["^"] = "%^", ["$"] = "%$",
}
local simple_escapes = {
["-"] = "%-",
["."] = "%.",
["?"] = ".",
["*"] = ".*",
}
function string.escapedpattern(str,simple)
return (gsub(str,".",simple and simple_escapes or patterns_escapes))
end
function string.topattern(str,lowercase,strict)
if str == "" then
return ".*"
else
str = gsub(str,".",simple_escapes)
if lowercase then
str = lower(str)
end
if strict then
return "^" .. str .. "$"
else
return str
end
end
end
-- obsolete names:
string.quote = string.quoted
string.unquote = string.unquoted
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-table'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local type, next, tostring, tonumber, ipairs, table, string = type, next, tostring, tonumber, ipairs, table, string
local concat, sort, insert, remove = table.concat, table.sort, table.insert, table.remove
local format, find, gsub, lower, dump, match = string.format, string.find, string.gsub, string.lower, string.dump, string.match
local getmetatable, setmetatable = getmetatable, setmetatable
local getinfo = debug.getinfo
-- Starting with version 5.2 Lua no longer provide ipairs, which makes
-- sense. As we already used the for loop and # in most places the
-- impact on ConTeXt was not that large; the remaining ipairs already
-- have been replaced. In a similar fashion we also hardly used pairs.
--
-- Just in case, we provide the fallbacks as discussed in Programming
-- in Lua (http://www.lua.org/pil/7.3.html):
if not ipairs then
-- for k, v in ipairs(t) do ... end
-- for k=1,#t do local v = t[k] ... end
local function iterate(a,i)
i = i + 1
local v = a[i]
if v ~= nil then
return i, v --, nil
end
end
function ipairs(a)
return iterate, a, 0
end
end
if not pairs then
-- for k, v in pairs(t) do ... end
-- for k, v in next, t do ... end
function pairs(t)
return next, t -- , nil
end
end
-- Also, unpack has been moved to the table table, and for compatiility
-- reasons we provide both now.
if not table.unpack then
table.unpack = _G.unpack
elseif not unpack then
_G.unpack = table.unpack
end
-- extra functions, some might go (when not used)
function table.strip(tab)
local lst, l = { }, 0
for i=1,#tab do
local s = gsub(tab[i],"^%s*(.-)%s*$","%1")
if s == "" then
-- skip this one
else
l = l + 1
lst[l] = s
end
end
return lst
end
function table.keys(t)
local keys, k = { }, 0
for key, _ in next, t do
k = k + 1
keys[k] = key
end
return keys
end
local function compare(a,b)
local ta, tb = type(a), type(b) -- needed, else 11 < 2
if ta == tb then
return a < b
else
return tostring(a) < tostring(b)
end
end
local function sortedkeys(tab)
local srt, category, s = { }, 0, 0 -- 0=unknown 1=string, 2=number 3=mixed
for key,_ in next, tab do
s = s + 1
srt[s] = key
if category == 3 then
-- no further check
else
local tkey = type(key)
if tkey == "string" then
category = (category == 2 and 3) or 1
elseif tkey == "number" then
category = (category == 1 and 3) or 2
else
category = 3
end
end
end
if category == 0 or category == 3 then
sort(srt,compare)
else
sort(srt)
end
return srt
end
local function sortedhashkeys(tab) -- fast one
local srt, s = { }, 0
for key,_ in next, tab do
if key then
s= s + 1
srt[s] = key
end
end
sort(srt)
return srt
end
table.sortedkeys = sortedkeys
table.sortedhashkeys = sortedhashkeys
local function nothing() end
local function sortedhash(t)
if t then
local n, s = 0, sortedkeys(t) -- the robust one
local function kv(s)
n = n + 1
local k = s[n]
return k, t[k]
end
return kv, s
else
return nothing
end
end
table.sortedhash = sortedhash
table.sortedpairs = sortedhash
function table.append(t, list)
local n = #t
for i=1,#list do
n = n + 1
t[n] = list[i]
end
return t
end
function table.prepend(t, list)
local nl = #list
local nt = nl + #t
for i=#t,1,-1 do
t[nt] = t[i]
nt = nt - 1
end
for i=1,#list do
t[i] = list[i]
end
return t
end
function table.merge(t, ...) -- first one is target
t = t or { }
local lst = { ... }
for i=1,#lst do
for k, v in next, lst[i] do
t[k] = v
end
end
return t
end
function table.merged(...)
local tmp, lst = { }, { ... }
for i=1,#lst do
for k, v in next, lst[i] do
tmp[k] = v
end
end
return tmp
end
function table.imerge(t, ...)
local lst, nt = { ... }, #t
for i=1,#lst do
local nst = lst[i]
for j=1,#nst do
nt = nt + 1
t[nt] = nst[j]
end
end
return t
end
function table.imerged(...)
local tmp, ntmp, lst = { }, 0, {...}
for i=1,#lst do
local nst = lst[i]
for j=1,#nst do
ntmp = ntmp + 1
tmp[ntmp] = nst[j]
end
end
return tmp
end
local function fastcopy(old,metatabletoo) -- fast one
if old then
local new = { }
for k,v in next, old do
if type(v) == "table" then
new[k] = fastcopy(v,metatabletoo) -- was just table.copy
else
new[k] = v
end
end
if metatabletoo then
-- optional second arg
local mt = getmetatable(old)
if mt then
setmetatable(new,mt)
end
end
return new
else
return { }
end
end
-- todo : copy without metatable
local function copy(t, tables) -- taken from lua wiki, slightly adapted
tables = tables or { }
local tcopy = {}
if not tables[t] then
tables[t] = tcopy
end
for i,v in next, t do -- brrr, what happens with sparse indexed
if type(i) == "table" then
if tables[i] then
i = tables[i]
else
i = copy(i, tables)
end
end
if type(v) ~= "table" then
tcopy[i] = v
elseif tables[v] then
tcopy[i] = tables[v]
else
tcopy[i] = copy(v, tables)
end
end
local mt = getmetatable(t)
if mt then
setmetatable(tcopy,mt)
end
return tcopy
end
table.fastcopy = fastcopy
table.copy = copy
function table.derive(parent)
local child = { }
if parent then
setmetatable(child,{ __index = parent })
end
return child
end
function table.tohash(t,value)
local h = { }
if t then
if value == nil then value = true end
for _, v in next, t do -- no ipairs here
h[v] = value
end
end
return h
end
function table.fromhash(t)
local hsh, h = { }, 0
for k, v in next, t do -- no ipairs here
if v then
h = h + 1
hsh[h] = k
end
end
return hsh
end
local noquotes, hexify, handle, reduce, compact, inline, functions
local reserved = table.tohash { -- intercept a language inconvenience: no reserved words as key
'and', 'break', 'do', 'else', 'elseif', 'end', 'false', 'for', 'function', 'if',
'in', 'local', 'nil', 'not', 'or', 'repeat', 'return', 'then', 'true', 'until', 'while',
}
local function simple_table(t)
if #t > 0 then
local n = 0
for _,v in next, t do
n = n + 1
end
if n == #t then
local tt, nt = { }, 0
for i=1,#t do
local v = t[i]
local tv = type(v)
if tv == "number" then
nt = nt + 1
if hexify then
tt[nt] = format("0x%04X",v)
else
tt[nt] = tostring(v) -- tostring not needed
end
elseif tv == "boolean" then
nt = nt + 1
tt[nt] = tostring(v)
elseif tv == "string" then
nt = nt + 1
tt[nt] = format("%q",v)
else
tt = nil
break
end
end
return tt
end
end
return nil
end
-- Because this is a core function of mkiv I moved some function calls
-- inline.
--
-- twice as fast in a test:
--
-- local propername = lpeg.P(lpeg.R("AZ","az","__") * lpeg.R("09","AZ","az", "__")^0 * lpeg.P(-1) )
-- problem: there no good number_to_string converter with the best resolution
local function dummy() end
local function do_serialize(root,name,depth,level,indexed)
if level > 0 then
depth = depth .. " "
if indexed then
handle(format("%s{",depth))
else
local tn = type(name)
if tn == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s[0x%04X]={",depth,name))
else
handle(format("%s[%s]={",depth,name))
end
elseif tn == "string" then
if noquotes and not reserved[name] and find(name,"^%a[%w%_]*$") then
handle(format("%s%s={",depth,name))
else
handle(format("%s[%q]={",depth,name))
end
elseif tn == "boolean" then
handle(format("%s[%s]={",depth,tostring(name)))
else
handle(format("%s{",depth))
end
end
end
-- we could check for k (index) being number (cardinal)
if root and next(root) then
local first, last = nil, 0 -- #root cannot be trusted here (will be ok in 5.2 when ipairs is gone)
if compact then
-- NOT: for k=1,#root do (we need to quit at nil)
for k,v in ipairs(root) do -- can we use next?
if not first then first = k end
last = last + 1
end
end
local sk = sortedkeys(root)
for i=1,#sk do
local k = sk[i]
local v = root[k]
-- circular
local t, tk = type(v), type(k)
if compact and first and tk == "number" and k >= first and k <= last then
if t == "number" then
if hexify then
handle(format("%s 0x%04X,",depth,v))
else
handle(format("%s %s,",depth,v)) -- %.99g
end
elseif t == "string" then
if reduce and tonumber(v) then
handle(format("%s %s,",depth,v))
else
handle(format("%s %q,",depth,v))
end
elseif t == "table" then
if not next(v) then
handle(format("%s {},",depth))
elseif inline then -- and #t > 0
local st = simple_table(v)
if st then
handle(format("%s { %s },",depth,concat(st,", ")))
else
do_serialize(v,k,depth,level+1,true)
end
else
do_serialize(v,k,depth,level+1,true)
end
elseif t == "boolean" then
handle(format("%s %s,",depth,tostring(v)))
elseif t == "function" then
if functions then
handle(format('%s loadstring(%q),',depth,dump(v)))
else
handle(format('%s "function",',depth))
end
else
handle(format("%s %q,",depth,tostring(v)))
end
elseif k == "__p__" then -- parent
if false then
handle(format("%s __p__=nil,",depth))
end
elseif t == "number" then
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=0x%04X,",depth,k,v))
else
handle(format("%s [%s]=%s,",depth,k,v)) -- %.99g
end
elseif tk == "boolean" then
if hexify then
handle(format("%s [%s]=0x%04X,",depth,tostring(k),v))
else
handle(format("%s [%s]=%s,",depth,tostring(k),v)) -- %.99g
end
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
if hexify then
handle(format("%s %s=0x%04X,",depth,k,v))
else
handle(format("%s %s=%s,",depth,k,v)) -- %.99g
end
else
if hexify then
handle(format("%s [%q]=0x%04X,",depth,k,v))
else
handle(format("%s [%q]=%s,",depth,k,v)) -- %.99g
end
end
elseif t == "string" then
if reduce and tonumber(v) then
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=%s,",depth,k,v))
else
handle(format("%s [%s]=%s,",depth,k,v))
end
elseif tk == "boolean" then
handle(format("%s [%s]=%s,",depth,tostring(k),v))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s=%s,",depth,k,v))
else
handle(format("%s [%q]=%s,",depth,k,v))
end
else
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=%q,",depth,k,v))
else
handle(format("%s [%s]=%q,",depth,k,v))
end
elseif tk == "boolean" then
handle(format("%s [%s]=%q,",depth,tostring(k),v))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s=%q,",depth,k,v))
else
handle(format("%s [%q]=%q,",depth,k,v))
end
end
elseif t == "table" then
if not next(v) then
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]={},",depth,k))
else
handle(format("%s [%s]={},",depth,k))
end
elseif tk == "boolean" then
handle(format("%s [%s]={},",depth,tostring(k)))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s={},",depth,k))
else
handle(format("%s [%q]={},",depth,k))
end
elseif inline then
local st = simple_table(v)
if st then
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]={ %s },",depth,k,concat(st,", ")))
else
handle(format("%s [%s]={ %s },",depth,k,concat(st,", ")))
end
elseif tk == "boolean" then -- or find(k,"^%d+$") then
handle(format("%s [%s]={ %s },",depth,tostring(k),concat(st,", ")))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s={ %s },",depth,k,concat(st,", ")))
else
handle(format("%s [%q]={ %s },",depth,k,concat(st,", ")))
end
else
do_serialize(v,k,depth,level+1)
end
else
do_serialize(v,k,depth,level+1)
end
elseif t == "boolean" then
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=%s,",depth,k,tostring(v)))
else
handle(format("%s [%s]=%s,",depth,k,tostring(v)))
end
elseif tk == "boolean" then -- or find(k,"^%d+$") then
handle(format("%s [%s]=%s,",depth,tostring(k),tostring(v)))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s=%s,",depth,k,tostring(v)))
else
handle(format("%s [%q]=%s,",depth,k,tostring(v)))
end
elseif t == "function" then
if functions then
local f = getinfo(v).what == "C" and dump(dummy) or dump(v)
-- local f = getinfo(v).what == "C" and dump(function(...) return v(...) end) or dump(v)
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=loadstring(%q),",depth,k,f))
else
handle(format("%s [%s]=loadstring(%q),",depth,k,f))
end
elseif tk == "boolean" then
handle(format("%s [%s]=loadstring(%q),",depth,tostring(k),f))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s=loadstring(%q),",depth,k,f))
else
handle(format("%s [%q]=loadstring(%q),",depth,k,f))
end
end
else
if tk == "number" then -- or find(k,"^%d+$") then
if hexify then
handle(format("%s [0x%04X]=%q,",depth,k,tostring(v)))
else
handle(format("%s [%s]=%q,",depth,k,tostring(v)))
end
elseif tk == "boolean" then -- or find(k,"^%d+$") then
handle(format("%s [%s]=%q,",depth,tostring(k),tostring(v)))
elseif noquotes and not reserved[k] and find(k,"^%a[%w%_]*$") then
handle(format("%s %s=%q,",depth,k,tostring(v)))
else
handle(format("%s [%q]=%q,",depth,k,tostring(v)))
end
end
end
end
if level > 0 then
handle(format("%s},",depth))
end
end
-- replacing handle by a direct t[#t+1] = ... (plus test) is not much
-- faster (0.03 on 1.00 for zapfino.tma)
local function serialize(_handle,root,name,specification) -- handle wins
local tname = type(name)
if type(specification) == "table" then
noquotes = specification.noquotes
hexify = specification.hexify
handle = _handle or specification.handle or print
reduce = specification.reduce or false
functions = specification.functions
compact = specification.compact
inline = specification.inline and compact
if functions == nil then
functions = true
end
if compact == nil then
compact = true
end
if inline == nil then
inline = compact
end
else
noquotes = false
hexify = false
handle = _handle or print
reduce = false
compact = true
inline = true
functions = true
end
if tname == "string" then
if name == "return" then
handle("return {")
else
handle(name .. "={")
end
elseif tname == "number" then
if hexify then
handle(format("[0x%04X]={",name))
else
handle("[" .. name .. "]={")
end
elseif tname == "boolean" then
if name then
handle("return {")
else
handle("{")
end
else
handle("t={")
end
if root then
-- The dummy access will initialize a table that has a delayed initialization
-- using a metatable. (maybe explicitly test for metatable)
if getmetatable(root) then -- todo: make this an option, maybe even per subtable
local dummy = root._w_h_a_t_e_v_e_r_
root._w_h_a_t_e_v_e_r_ = nil
end
-- Let's forget about empty tables.
if next(root) then
do_serialize(root,name,"",0)
end
end
handle("}")
end
function table.serialize(root,name,specification)
local t, n = { }, 0
local function flush(s)
n = n + 1
t[n] = s
end
serialize(flush,root,name,specification)
return concat(t,"\n")
end
table.tohandle = serialize
-- sometimes tables are real use (zapfino extra pro is some 85M) in which
-- case a stepwise serialization is nice; actually, we could consider:
--
-- for line in table.serializer(root,name,reduce,noquotes) do
-- ...(line)
-- end
--
-- so this is on the todo list
local maxtab = 2*1024
function table.tofile(filename,root,name,specification)
local f = io.open(filename,'w')
if f then
if maxtab > 1 then
local t, n = { }, 0
local function flush(s)
n = n + 1
t[n] = s
if n > maxtab then
f:write(concat(t,"\n"),"\n") -- hm, write(sometable) should be nice
t, n = { }, 0 -- we could recycle t if needed
end
end
serialize(flush,root,name,specification)
f:write(concat(t,"\n"),"\n")
else
local function flush(s)
f:write(s,"\n")
end
serialize(flush,root,name,specification)
end
f:close()
io.flush()
end
end
local function flattened(t,f,depth)
if f == nil then
f = { }
depth = 0xFFFF
elseif tonumber(f) then
-- assume then only two arguments are given
depth = f
f = { }
elseif not depth then
depth = 0xFFFF
end
for k, v in next, t do
if type(k) ~= "number" then
if depth > 0 and type(v) == "table" then
flattened(v,f,depth-1)
else
f[k] = v
end
end
end
local n = #f
for k=1,#t do
local v = t[k]
if depth > 0 and type(v) == "table" then
flattened(v,f,depth-1)
n = #f
else
n = n + 1
f[n] = v
end
end
return f
end
table.flattened = flattened
local function unnest(t,f) -- only used in mk, for old times sake
if not f then -- and only relevant for token lists
f = { }
end
for i=1,#t do
local v = t[i]
if type(v) == "table" then
if type(v[1]) == "table" then
unnest(v,f)
else
f[#f+1] = v
end
else
f[#f+1] = v
end
end
return f
end
function table.unnest(t) -- bad name
return unnest(t)
end
local function are_equal(a,b,n,m) -- indexed
if a and b and #a == #b then
n = n or 1
m = m or #a
for i=n,m do
local ai, bi = a[i], b[i]
if ai==bi then
-- same
elseif type(ai)=="table" and type(bi)=="table" then
if not are_equal(ai,bi) then
return false
end
else
return false
end
end
return true
else
return false
end
end
local function identical(a,b) -- assumes same structure
for ka, va in next, a do
local vb = b[ka]
if va == vb then
-- same
elseif type(va) == "table" and type(vb) == "table" then
if not identical(va,vb) then
return false
end
else
return false
end
end
return true
end
table.identical = identical
table.are_equal = are_equal
-- maybe also make a combined one
function table.compact(t)
if t then
for k,v in next, t do
if not next(v) then
t[k] = nil
end
end
end
end
function table.contains(t, v)
if t then
for i=1, #t do
if t[i] == v then
return i
end
end
end
return false
end
function table.count(t)
local n = 0
for k, v in next, t do
n = n + 1
end
return n
end
function table.swapped(t,s) -- hash
local n = { }
if s then
for k, v in next, s do
n[k] = v
end
end
for k, v in next, t do
n[v] = k
end
return n
end
function table.reversed(t)
if t then
local tt, tn = { }, #t
if tn > 0 then
local ttn = 0
for i=tn,1,-1 do
ttn = ttn + 1
tt[ttn] = t[i]
end
end
return tt
end
end
function table.sequenced(t,sep,simple) -- hash only
local s, n = { }, 0
for k, v in sortedhash(t) do
if simple then
if v == true then
n = n + 1
s[n] = k
elseif v and v~= "" then
n = n + 1
s[n] = k .. "=" .. tostring(v)
end
else
n = n + 1
s[n] = k .. "=" .. tostring(v)
end
end
return concat(s, sep or " | ")
end
function table.print(t,...)
if type(t) ~= "table" then
print(tostring(t))
else
table.tohandle(print,t,...)
end
end
-- -- -- obsolete but we keep them for a while and might comment them later -- -- --
-- roughly: copy-loop : unpack : sub == 0.9 : 0.4 : 0.45 (so in critical apps, use unpack)
function table.sub(t,i,j)
return { unpack(t,i,j) }
end
-- slower than #t on indexed tables (#t only returns the size of the numerically indexed slice)
function table.is_empty(t)
return not t or not next(t)
end
function table.has_one_entry(t)
return t and not next(t,next(t))
end
-- new
function table.loweredkeys(t) -- maybe utf
local l = { }
for k, v in next, t do
l[lower(k)] = v
end
return l
end
-- new, might move (maybe duplicate)
function table.unique(old)
local hash = { }
local new = { }
local n = 0
for i=1,#old do
local oi = old[i]
if not hash[oi] then
n = n + 1
new[n] = oi
hash[oi] = true
end
end
return new
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-lpeg'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- a new lpeg fails on a #(1-P(":")) test and really needs a + P(-1)
local lpeg = require("lpeg")
-- tracing (only used when we encounter a problem in integration of lpeg in luatex)
local report = texio and texio.write_nl or print
local type = type
local byte, char = string.byte, string.char
-- Beware, we predefine a bunch of patterns here and one reason for doing so
-- is that we get consistent behaviour in some of the visualizers.
lpeg.patterns = lpeg.patterns or { } -- so that we can share
local patterns = lpeg.patterns
local P, R, S, V, match = lpeg.P, lpeg.R, lpeg.S, lpeg.V, lpeg.match
local Ct, C, Cs, Cc = lpeg.Ct, lpeg.C, lpeg.Cs, lpeg.Cc
local lpegtype = lpeg.type
local utfcharacters = string.utfcharacters
local utfgmatch = unicode and unicode.utf8.gmatch
local anything = P(1)
local endofstring = P(-1)
local alwaysmatched = P(true)
patterns.anything = anything
patterns.endofstring = endofstring
patterns.beginofstring = alwaysmatched
patterns.alwaysmatched = alwaysmatched
local digit, sign = R('09'), S('+-')
local cr, lf, crlf = P("\r"), P("\n"), P("\r\n")
local newline = crlf + S("\r\n") -- cr + lf
local escaped = P("\\") * anything
local squote = P("'")
local dquote = P('"')
local space = P(" ")
local utfbom_32_be = P('\000\000\254\255')
local utfbom_32_le = P('\255\254\000\000')
local utfbom_16_be = P('\255\254')
local utfbom_16_le = P('\254\255')
local utfbom_8 = P('\239\187\191')
local utfbom = utfbom_32_be + utfbom_32_le
+ utfbom_16_be + utfbom_16_le
+ utfbom_8
local utftype = utfbom_32_be / "utf-32-be" + utfbom_32_le / "utf-32-le"
+ utfbom_16_be / "utf-16-be" + utfbom_16_le / "utf-16-le"
+ utfbom_8 / "utf-8" + alwaysmatched / "unknown"
local utf8next = R("\128\191")
patterns.utf8one = R("\000\127")
patterns.utf8two = R("\194\223") * utf8next
patterns.utf8three = R("\224\239") * utf8next * utf8next
patterns.utf8four = R("\240\244") * utf8next * utf8next * utf8next
patterns.utfbom = utfbom
patterns.utftype = utftype
local utf8char = patterns.utf8one + patterns.utf8two + patterns.utf8three + patterns.utf8four
local validutf8char = utf8char^0 * endofstring * Cc(true) + Cc(false)
patterns.utf8 = utf8char
patterns.utf8char = utf8char
patterns.validutf8 = validutf8char
patterns.validutf8char = validutf8char
patterns.digit = digit
patterns.sign = sign
patterns.cardinal = sign^0 * digit^1
patterns.integer = sign^0 * digit^1
patterns.float = sign^0 * digit^0 * P('.') * digit^1
patterns.cfloat = sign^0 * digit^0 * P(',') * digit^1
patterns.number = patterns.float + patterns.integer
patterns.cnumber = patterns.cfloat + patterns.integer
patterns.oct = P("0") * R("07")^1
patterns.octal = patterns.oct
patterns.HEX = P("0x") * R("09","AF")^1
patterns.hex = P("0x") * R("09","af")^1
patterns.hexadecimal = P("0x") * R("09","AF","af")^1
patterns.lowercase = R("az")
patterns.uppercase = R("AZ")
patterns.letter = patterns.lowercase + patterns.uppercase
patterns.space = space
patterns.tab = P("\t")
patterns.spaceortab = patterns.space + patterns.tab
patterns.eol = S("\n\r")
patterns.spacer = S(" \t\f\v") -- + char(0xc2, 0xa0) if we want utf (cf mail roberto)
patterns.newline = newline
patterns.emptyline = newline^1
patterns.nonspacer = 1 - patterns.spacer
patterns.whitespace = patterns.eol + patterns.spacer
patterns.nonwhitespace = 1 - patterns.whitespace
patterns.equal = P("=")
patterns.comma = P(",")
patterns.commaspacer = P(",") * patterns.spacer^0
patterns.period = P(".")
patterns.colon = P(":")
patterns.semicolon = P(";")
patterns.underscore = P("_")
patterns.escaped = escaped
patterns.squote = squote
patterns.dquote = dquote
patterns.nosquote = (escaped + (1-squote))^0
patterns.nodquote = (escaped + (1-dquote))^0
patterns.unsingle = (squote/"") * patterns.nosquote * (squote/"")
patterns.undouble = (dquote/"") * patterns.nodquote * (dquote/"")
patterns.unquoted = patterns.undouble + patterns.unsingle -- more often undouble
patterns.unspacer = ((patterns.spacer^1)/"")^0
patterns.somecontent = (anything - newline - space)^1 -- (utf8char - newline - space)^1
patterns.beginline = #(1-newline)
-- print(string.unquoted("test"))
-- print(string.unquoted([["t\"est"]]))
-- print(string.unquoted([["t\"est"x]]))
-- print(string.unquoted("\'test\'"))
-- print(string.unquoted('"test"'))
-- print(string.unquoted('"test"'))
function lpeg.anywhere(pattern) --slightly adapted from website
return P { P(pattern) + 1 * V(1) } -- why so complex?
end
function lpeg.splitter(pattern, action)
return (((1-P(pattern))^1)/action+1)^0
end
function lpeg.tsplitter(pattern, action)
return Ct((((1-P(pattern))^1)/action+1)^0)
end
-- probleem: separator can be lpeg and that does not hash too well, but
-- it's quite okay as the key is then not garbage collected
local splitters_s, splitters_m, splitters_t = { }, { }, { }
local function splitat(separator,single)
local splitter = (single and splitters_s[separator]) or splitters_m[separator]
if not splitter then
separator = P(separator)
local other = C((1 - separator)^0)
if single then
local any = anything
splitter = other * (separator * C(any^0) + "") -- ?
splitters_s[separator] = splitter
else
splitter = other * (separator * other)^0
splitters_m[separator] = splitter
end
end
return splitter
end
local function tsplitat(separator)
local splitter = splitters_t[separator]
if not splitter then
splitter = Ct(splitat(separator))
splitters_t[separator] = splitter
end
return splitter
end
lpeg.splitat = splitat
lpeg.tsplitat = tsplitat
function string.splitup(str,separator)
if not separator then
separator = ","
end
return match(splitters_m[separator] or splitat(separator),str)
end
local cache = { }
function lpeg.split(separator,str)
local c = cache[separator]
if not c then
c = tsplitat(separator)
cache[separator] = c
end
return match(c,str)
end
function string.split(str,separator)
local c = cache[separator]
if not c then
c = tsplitat(separator)
cache[separator] = c
end
return match(c,str)
end
local spacing = patterns.spacer^0 * newline -- sort of strip
local empty = spacing * Cc("")
local nonempty = Cs((1-spacing)^1) * spacing^-1
local content = (empty + nonempty)^1
patterns.textline = content
local linesplitter = tsplitat(newline)
patterns.linesplitter = linesplitter
function string.splitlines(str)
return match(linesplitter,str)
end
local utflinesplitter = utfbom^-1 * tsplitat(newline)
patterns.utflinesplitter = utflinesplitter
function string.utfsplitlines(str)
return match(utflinesplitter,str or "")
end
local cache = { }
function lpeg.checkedsplit(separator,str)
local c = cache[separator]
if not c then
separator = P(separator)
local other = C((1 - separator)^1)
c = Ct(separator^0 * other * (separator^1 * other)^0)
cache[separator] = c
end
return match(c,str)
end
function string.checkedsplit(str,separator)
local c = cache[separator]
if not c then
separator = P(separator)
local other = C((1 - separator)^1)
c = Ct(separator^0 * other * (separator^1 * other)^0)
cache[separator] = c
end
return match(c,str)
end
local function f2(s) local c1, c2 = byte(s,1,2) return c1 * 64 + c2 - 12416 end
local function f3(s) local c1, c2, c3 = byte(s,1,3) return (c1 * 64 + c2) * 64 + c3 - 925824 end
local function f4(s) local c1, c2, c3, c4 = byte(s,1,4) return ((c1 * 64 + c2) * 64 + c3) * 64 + c4 - 63447168 end
local utf8byte = patterns.utf8one/byte + patterns.utf8two/f2 + patterns.utf8three/f3 + patterns.utf8four/f4
patterns.utf8byte = utf8byte
local cache = { }
function lpeg.stripper(str)
if type(str) == "string" then
local s = cache[str]
if not s then
s = Cs(((S(str)^1)/"" + 1)^0)
cache[str] = s
end
return s
else
return Cs(((str^1)/"" + 1)^0)
end
end
local cache = { }
function lpeg.keeper(str)
if type(str) == "string" then
local s = cache[str]
if not s then
s = Cs((((1-S(str))^1)/"" + 1)^0)
cache[str] = s
end
return s
else
return Cs((((1-str)^1)/"" + 1)^0)
end
end
function lpeg.frontstripper(str) -- or pattern (yet undocumented)
return (P(str) + P(true)) * Cs(P(1)^0)
end
function lpeg.endstripper(str) -- or pattern (yet undocumented)
return Cs((1 - P(str) * P(-1))^0)
end
-- Just for fun I looked at the used bytecode and
-- p = (p and p + pp) or pp gets one more (testset).
function lpeg.replacer(one,two)
if type(one) == "table" then
local no = #one
if no > 0 then
local p
for i=1,no do
local o = one[i]
local pp = P(o[1]) / o[2]
if p then
p = p + pp
else
p = pp
end
end
return Cs((p + 1)^0)
end
else
two = two or ""
return Cs((P(one)/two + 1)^0)
end
end
local splitters_f, splitters_s = { }, { }
function lpeg.firstofsplit(separator) -- always return value
local splitter = splitters_f[separator]
if not splitter then
separator = P(separator)
splitter = C((1 - separator)^0)
splitters_f[separator] = splitter
end
return splitter
end
function lpeg.secondofsplit(separator) -- nil if not split
local splitter = splitters_s[separator]
if not splitter then
separator = P(separator)
splitter = (1 - separator)^0 * separator * C(anything^0)
splitters_s[separator] = splitter
end
return splitter
end
function lpeg.balancer(left,right)
left, right = P(left), P(right)
return P { left * ((1 - left - right) + V(1))^0 * right }
end
local nany = utf8char/""
function lpeg.counter(pattern)
pattern = Cs((P(pattern)/" " + nany)^0)
return function(str)
return #match(pattern,str)
end
end
if utfgmatch then
function lpeg.count(str,what) -- replaces string.count
if type(what) == "string" then
local n = 0
for _ in utfgmatch(str,what) do
n = n + 1
end
return n
else -- 4 times slower but still faster than / function
return #match(Cs((P(what)/" " + nany)^0),str)
end
end
else
local cache = { }
function lpeg.count(str,what) -- replaces string.count
if type(what) == "string" then
local p = cache[what]
if not p then
p = Cs((P(what)/" " + nany)^0)
cache[p] = p
end
return #match(p,str)
else -- 4 times slower but still faster than / function
return #match(Cs((P(what)/" " + nany)^0),str)
end
end
end
local patterns_escapes = { -- also defines in l-string
["%"] = "%%",
["."] = "%.",
["+"] = "%+", ["-"] = "%-", ["*"] = "%*",
["["] = "%[", ["]"] = "%]",
["("] = "%)", [")"] = "%)",
-- ["{"] = "%{", ["}"] = "%}"
-- ["^"] = "%^", ["$"] = "%$",
}
local simple_escapes = { -- also defines in l-string
["-"] = "%-",
["."] = "%.",
["?"] = ".",
["*"] = ".*",
}
local p = Cs((S("-.+*%()[]") / patterns_escapes + anything)^0)
local s = Cs((S("-.+*%()[]") / simple_escapes + anything)^0)
function string.escapedpattern(str,simple)
return match(simple and s or p,str)
end
-- utf extensies
lpeg.UP = lpeg.P
if utfcharacters then
function lpeg.US(str)
local p
for uc in utfcharacters(str) do
if p then
p = p + P(uc)
else
p = P(uc)
end
end
return p
end
elseif utfgmatch then
function lpeg.US(str)
local p
for uc in utfgmatch(str,".") do
if p then
p = p + P(uc)
else
p = P(uc)
end
end
return p
end
else
function lpeg.US(str)
local p
local f = function(uc)
if p then
p = p + P(uc)
else
p = P(uc)
end
end
match((utf8char/f)^0,str)
return p
end
end
local range = Cs(utf8byte) * (Cs(utf8byte) + Cc(false))
local utfchar = unicode and unicode.utf8 and unicode.utf8.char
function lpeg.UR(str,more)
local first, last
if type(str) == "number" then
first = str
last = more or first
else
first, last = match(range,str)
if not last then
return P(str)
end
end
if first == last then
return P(str)
elseif utfchar and last - first < 8 then -- a somewhat arbitrary criterium
local p
for i=first,last do
if p then
p = p + P(utfchar(i))
else
p = P(utfchar(i))
end
end
return p -- nil when invalid range
else
local f = function(b)
return b >= first and b <= last
end
return utf8byte / f -- nil when invalid range
end
end
function lpeg.oneof(list,...) -- lpeg.oneof("elseif","else","if","then")
if type(list) ~= "table" then
list = { list, ... }
end
-- sort(list) -- longest match first
local p = P(list[1])
for l=2,#list do
p = p + P(list[l])
end
return p
end
function lpeg.is_lpeg(p)
return p and lpegtype(p) == "pattern"
end
-- For the moment here, but it might move to utilities:
local sort, fastcopy, sortedpairs = table.sort, table.fastcopy, table.sortedpairs -- dependency!
function lpeg.append(list,pp,delayed)
local p = pp
if #list > 0 then
list = fastcopy(list)
sort(list)
for l=1,#list do
if p then
p = P(list[l]) + p
else
p = P(list[l])
end
end
elseif delayed then
for k, v in sortedpairs(list) do
if p then
p = P(k)/list + p
else
p = P(k)/list
end
end
else
for k, v in sortedpairs(list) do
if p then
p = P(k)/v + p
else
p = P(k)/v
end
end
end
return p
end
-- function lpeg.exact_match(words,case_insensitive)
-- local pattern = concat(words)
-- if case_insensitive then
-- local pattern = S(upper(characters)) + S(lower(characters))
-- local list = { }
-- for i=1,#words do
-- list[lower(words[i])] = true
-- end
-- return Cmt(pattern^1, function(_,i,s)
-- return list[lower(s)] and i
-- end)
-- else
-- local pattern = S(concat(words))
-- local list = { }
-- for i=1,#words do
-- list[words[i]] = true
-- end
-- return Cmt(pattern^1, function(_,i,s)
-- return list[s] and i
-- end)
-- end
-- end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-io'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local io = io
local byte, find, gsub, format = string.byte, string.find, string.gsub, string.format
local concat = table.concat
local type = type
if string.find(os.getenv("PATH"),";") then
io.fileseparator, io.pathseparator = "\\", ";"
else
io.fileseparator, io.pathseparator = "/" , ":"
end
function io.loaddata(filename,textmode)
local f = io.open(filename,(textmode and 'r') or 'rb')
if f then
local data = f:read('*all')
f:close()
return data
else
return nil
end
end
function io.savedata(filename,data,joiner)
local f = io.open(filename,"wb")
if f then
if type(data) == "table" then
f:write(concat(data,joiner or ""))
elseif type(data) == "function" then
data(f)
else
f:write(data or "")
end
f:close()
io.flush()
return true
else
return false
end
end
function io.exists(filename)
local f = io.open(filename)
if f == nil then
return false
else
assert(f:close())
return true
end
end
function io.size(filename)
local f = io.open(filename)
if f == nil then
return 0
else
local s = f:seek("end")
assert(f:close())
return s
end
end
function io.noflines(f)
if type(f) == "string" then
local f = io.open(filename)
local n = f and io.noflines(f) or 0
assert(f:close())
return n
else
local n = 0
for _ in f:lines() do
n = n + 1
end
f:seek('set',0)
return n
end
end
local nextchar = {
[ 4] = function(f)
return f:read(1,1,1,1)
end,
[ 2] = function(f)
return f:read(1,1)
end,
[ 1] = function(f)
return f:read(1)
end,
[-2] = function(f)
local a, b = f:read(1,1)
return b, a
end,
[-4] = function(f)
local a, b, c, d = f:read(1,1,1,1)
return d, c, b, a
end
}
function io.characters(f,n)
if f then
return nextchar[n or 1], f
end
end
local nextbyte = {
[4] = function(f)
local a, b, c, d = f:read(1,1,1,1)
if d then
return byte(a), byte(b), byte(c), byte(d)
end
end,
[3] = function(f)
local a, b, c = f:read(1,1,1)
if b then
return byte(a), byte(b), byte(c)
end
end,
[2] = function(f)
local a, b = f:read(1,1)
if b then
return byte(a), byte(b)
end
end,
[1] = function (f)
local a = f:read(1)
if a then
return byte(a)
end
end,
[-2] = function (f)
local a, b = f:read(1,1)
if b then
return byte(b), byte(a)
end
end,
[-3] = function(f)
local a, b, c = f:read(1,1,1)
if b then
return byte(c), byte(b), byte(a)
end
end,
[-4] = function(f)
local a, b, c, d = f:read(1,1,1,1)
if d then
return byte(d), byte(c), byte(b), byte(a)
end
end
}
function io.bytes(f,n)
if f then
return nextbyte[n or 1], f
else
return nil, nil
end
end
function io.ask(question,default,options)
while true do
io.write(question)
if options then
io.write(format(" [%s]",concat(options,"|")))
end
if default then
io.write(format(" [%s]",default))
end
io.write(format(" "))
io.flush()
local answer = io.read()
answer = gsub(answer,"^%s*(.*)%s*$","%1")
if answer == "" and default then
return default
elseif not options then
return answer
else
for k=1,#options do
if options[k] == answer then
return answer
end
end
local pattern = "^" .. answer
for k=1,#options do
local v = options[k]
if find(v,pattern) then
return v
end
end
end
end
end
local function readnumber(f,n,m)
if m then
f:seek("set",n)
n = m
end
if n == 1 then
return byte(f:read(1))
elseif n == 2 then
local a, b = byte(f:read(2),1,2)
return 256 * a + b
elseif n == 3 then
local a, b, c = byte(f:read(3),1,3)
return 256*256 * a + 256 * b + c
elseif n == 4 then
local a, b, c, d = byte(f:read(4),1,4)
return 256*256*256 * a + 256*256 * b + 256 * c + d
elseif n == 8 then
local a, b = readnumber(f,4), readnumber(f,4)
return 256 * a + b
elseif n == 12 then
local a, b, c = readnumber(f,4), readnumber(f,4), readnumber(f,4)
return 256*256 * a + 256 * b + c
elseif n == -2 then
local b, a = byte(f:read(2),1,2)
return 256*a + b
elseif n == -3 then
local c, b, a = byte(f:read(3),1,3)
return 256*256 * a + 256 * b + c
elseif n == -4 then
local d, c, b, a = byte(f:read(4),1,4)
return 256*256*256 * a + 256*256 * b + 256*c + d
elseif n == -8 then
local h, g, f, e, d, c, b, a = byte(f:read(8),1,8)
return 256*256*256*256*256*256*256 * a +
256*256*256*256*256*256 * b +
256*256*256*256*256 * c +
256*256*256*256 * d +
256*256*256 * e +
256*256 * f +
256 * g +
h
else
return 0
end
end
io.readnumber = readnumber
function io.readstring(f,n,m)
if m then
f:seek("set",n)
n = m
end
local str = gsub(f:read(n),"%z","")
return str
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-number'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- this module will be replaced when we have the bit library
local tostring = tostring
local format, floor, match, rep = string.format, math.floor, string.match, string.rep
local concat, insert = table.concat, table.insert
local lpegmatch = lpeg.match
number = number or { }
local number = number
-- a,b,c,d,e,f = number.toset(100101)
function number.toset(n)
return match(tostring(n),"(.?)(.?)(.?)(.?)(.?)(.?)(.?)(.?)")
end
function number.toevenhex(n)
local s = format("%X",n)
if #s % 2 == 0 then
return s
else
return "0" .. s
end
end
-- the lpeg way is slower on 8 digits, but faster on 4 digits, some 7.5%
-- on
--
-- for i=1,1000000 do
-- local a,b,c,d,e,f,g,h = number.toset(12345678)
-- local a,b,c,d = number.toset(1234)
-- local a,b,c = number.toset(123)
-- end
--
-- of course dedicated "(.)(.)(.)(.)" matches are even faster
local one = lpeg.C(1-lpeg.S(''))^1
function number.toset(n)
return lpegmatch(one,tostring(n))
end
function number.bits(n,zero)
local t, i = { }, (zero and 0) or 1
while n > 0 do
local m = n % 2
if m > 0 then
insert(t,1,i)
end
n = floor(n/2)
i = i + 1
end
return t
end
function number.bit(p)
return 2 ^ (p - 1) -- 1-based indexing
end
function number.hasbit(x, p) -- typical call: if hasbit(x, bit(3)) then ...
return x % (p + p) >= p
end
function number.setbit(x, p)
return hasbit(x, p) and x or x + p
end
function number.clearbit(x, p)
return hasbit(x, p) and x - p or x
end
function number.tobitstring(n,m)
if n == 0 then
if m then
rep("00000000",m)
else
return "00000000"
end
else
local t = { }
while n > 0 do
insert(t,1,n % 2 > 0 and 1 or 0)
n = floor(n/2)
end
local nn = 8 - #t % 8
if nn > 0 and nn < 8 then
for i=1,nn do
insert(t,1,0)
end
end
if m then
m = m * 8 - #t
if m > 0 then
insert(t,1,rep("0",m))
end
end
return concat(t)
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-set'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- This will become obsolete when we have the bitset library embedded.
set = set or { }
local nums = { }
local tabs = { }
local concat = table.concat
local next, type = next, type
set.create = table.tohash
function set.tonumber(t)
if next(t) then
local s = ""
-- we could save mem by sorting, but it slows down
for k, v in next, t do
if v then
-- why bother about the leading space
s = s .. " " .. k
end
end
local n = nums[s]
if not n then
n = #tabs + 1
tabs[n] = t
nums[s] = n
end
return n
else
return 0
end
end
function set.totable(n)
if n == 0 then
return { }
else
return tabs[n] or { }
end
end
function set.tolist(n)
if n == 0 or not tabs[n] then
return ""
else
local t, n = { }, 0
for k, v in next, tabs[n] do
if v then
n = n + 1
t[n] = k
end
end
return concat(t," ")
end
end
function set.contains(n,s)
if type(n) == "table" then
return n[s]
elseif n == 0 then
return false
else
local t = tabs[n]
return t and t[s]
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-os'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- This file deals with some operating system issues. Please don't bother me
-- with the pros and cons of operating systems as they all have their flaws
-- and benefits. Bashing one of them won't help solving problems and fixing
-- bugs faster and is a waste of time and energy.
--
-- path separators: / or \ ... we can use / everywhere
-- suffixes : dll so exe <none> ... no big deal
-- quotes : we can use "" in most cases
-- expansion : unless "" are used * might give side effects
-- piping/threads : somewhat different for each os
-- locations : specific user file locations and settings can change over time
--
-- os.type : windows | unix (new, we already guessed os.platform)
-- os.name : windows | msdos | linux | macosx | solaris | .. | generic (new)
-- os.platform : extended os.name with architecture
-- maybe build io.flush in os.execute
local os = os
local find, format, gsub, upper = string.find, string.format, string.gsub, string.upper
local concat = table.concat
local random, ceil = math.random, math.ceil
local rawget, rawset, type, getmetatable, setmetatable, tonumber = rawget, rawset, type, getmetatable, setmetatable, tonumber
-- The following code permits traversing the environment table, at least
-- in luatex. Internally all environment names are uppercase.
if not os.__getenv__ then
os.__getenv__ = os.getenv
os.__setenv__ = os.setenv
if os.env then
local osgetenv = os.getenv
local ossetenv = os.setenv
local osenv = os.env local _ = osenv.PATH -- initialize the table
function os.setenv(k,v)
if v == nil then
v = ""
end
local K = upper(k)
osenv[K] = v
if type(v) == "table" then
v = concat(v,";") -- path
end
ossetenv(K,v)
end
function os.getenv(k)
local K = upper(k)
local v = osenv[K] or osenv[k] or osgetenv(K) or osgetenv(k)
if v == "" then
return nil
else
return v
end
end
else
local ossetenv = os.setenv
local osgetenv = os.getenv
local osenv = { }
function os.setenv(k,v)
if v == nil then
v = ""
end
local K = upper(k)
osenv[K] = v
end
function os.getenv(k)
local K = upper(k)
local v = osenv[K] or osgetenv(K) or osgetenv(k)
if v == "" then
return nil
else
return v
end
end
local function __index(t,k)
return os.getenv(k)
end
local function __newindex(t,k,v)
os.setenv(k,v)
end
os.env = { }
setmetatable(os.env, { __index = __index, __newindex = __newindex } )
end
end
-- end of environment hack
local execute, spawn, exec, iopopen, ioflush = os.execute, os.spawn or os.execute, os.exec or os.execute, io.popen, io.flush
function os.execute(...) ioflush() return execute(...) end
function os.spawn (...) ioflush() return spawn (...) end
function os.exec (...) ioflush() return exec (...) end
function io.popen (...) ioflush() return iopopen(...) end
function os.resultof(command)
local handle = io.popen(command,"r")
return handle and handle:read("*all") or ""
end
if not io.fileseparator then
if find(os.getenv("PATH"),";") then
io.fileseparator, io.pathseparator, os.type = "\\", ";", os.type or "mswin"
else
io.fileseparator, io.pathseparator, os.type = "/" , ":", os.type or "unix"
end
end
os.type = os.type or (io.pathseparator == ";" and "windows") or "unix"
os.name = os.name or (os.type == "windows" and "mswin" ) or "linux"
if os.type == "windows" then
os.libsuffix, os.binsuffix = 'dll', 'exe'
else
os.libsuffix, os.binsuffix = 'so', ''
end
function os.launch(str)
if os.type == "windows" then
os.execute("start " .. str) -- os.spawn ?
else
os.execute(str .. " &") -- os.spawn ?
end
end
if not os.times then
-- utime = user time
-- stime = system time
-- cutime = children user time
-- cstime = children system time
function os.times()
return {
utime = os.gettimeofday(), -- user
stime = 0, -- system
cutime = 0, -- children user
cstime = 0, -- children system
}
end
end
os.gettimeofday = os.gettimeofday or os.clock
local startuptime = os.gettimeofday()
function os.runtime()
return os.gettimeofday() - startuptime
end
-- no need for function anymore as we have more clever code and helpers now
-- this metatable trickery might as well disappear
os.resolvers = os.resolvers or { } -- will become private
local resolvers = os.resolvers
local osmt = getmetatable(os) or { __index = function(t,k) t[k] = "unset" return "unset" end } -- maybe nil
local osix = osmt.__index
osmt.__index = function(t,k)
return (resolvers[k] or osix)(t,k)
end
setmetatable(os,osmt)
-- we can use HOSTTYPE on some platforms
local name, platform = os.name or "linux", os.getenv("MTX_PLATFORM") or ""
local function guess()
local architecture = os.resultof("uname -m") or ""
if architecture ~= "" then
return architecture
end
architecture = os.getenv("HOSTTYPE") or ""
if architecture ~= "" then
return architecture
end
return os.resultof("echo $HOSTTYPE") or ""
end
if platform ~= "" then
os.platform = platform
elseif os.type == "windows" then
-- we could set the variable directly, no function needed here
function os.resolvers.platform(t,k)
local platform, architecture = "", os.getenv("PROCESSOR_ARCHITECTURE") or ""
if find(architecture,"AMD64") then
platform = "mswin-64"
else
platform = "mswin"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
elseif name == "linux" then
function os.resolvers.platform(t,k)
-- we sometimes have HOSTTYPE set so let's check that first
local platform, architecture = "", os.getenv("HOSTTYPE") or os.resultof("uname -m") or ""
if find(architecture,"x86_64") then
platform = "linux-64"
elseif find(architecture,"ppc") then
platform = "linux-ppc"
else
platform = "linux"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
elseif name == "macosx" then
--[[
Identifying the architecture of OSX is quite a mess and this
is the best we can come up with. For some reason $HOSTTYPE is
a kind of pseudo environment variable, not known to the current
environment. And yes, uname cannot be trusted either, so there
is a change that you end up with a 32 bit run on a 64 bit system.
Also, some proper 64 bit intel macs are too cheap (low-end) and
therefore not permitted to run the 64 bit kernel.
]]--
function os.resolvers.platform(t,k)
-- local platform, architecture = "", os.getenv("HOSTTYPE") or ""
-- if architecture == "" then
-- architecture = os.resultof("echo $HOSTTYPE") or ""
-- end
local platform, architecture = "", os.resultof("echo $HOSTTYPE") or ""
if architecture == "" then
-- print("\nI have no clue what kind of OSX you're running so let's assume an 32 bit intel.\n")
platform = "osx-intel"
elseif find(architecture,"i386") then
platform = "osx-intel"
elseif find(architecture,"x86_64") then
platform = "osx-64"
else
platform = "osx-ppc"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
elseif name == "sunos" then
function os.resolvers.platform(t,k)
local platform, architecture = "", os.resultof("uname -m") or ""
if find(architecture,"sparc") then
platform = "solaris-sparc"
else -- if architecture == 'i86pc'
platform = "solaris-intel"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
elseif name == "freebsd" then
function os.resolvers.platform(t,k)
local platform, architecture = "", os.resultof("uname -m") or ""
if find(architecture,"amd64") then
platform = "freebsd-amd64"
else
platform = "freebsd"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
elseif name == "kfreebsd" then
function os.resolvers.platform(t,k)
-- we sometimes have HOSTTYPE set so let's check that first
local platform, architecture = "", os.getenv("HOSTTYPE") or os.resultof("uname -m") or ""
if find(architecture,"x86_64") then
platform = "kfreebsd-amd64"
else
platform = "kfreebsd-i386"
end
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
else
-- platform = "linux"
-- os.setenv("MTX_PLATFORM",platform)
-- os.platform = platform
function os.resolvers.platform(t,k)
local platform = "linux"
os.setenv("MTX_PLATFORM",platform)
os.platform = platform
return platform
end
end
-- beware, we set the randomseed
-- from wikipedia: Version 4 UUIDs use a scheme relying only on random numbers. This algorithm sets the
-- version number as well as two reserved bits. All other bits are set using a random or pseudorandom
-- data source. Version 4 UUIDs have the form xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx with hexadecimal
-- digits x and hexadecimal digits 8, 9, A, or B for y. e.g. f47ac10b-58cc-4372-a567-0e02b2c3d479.
--
-- as we don't call this function too often there is not so much risk on repetition
local t = { 8, 9, "a", "b" }
function os.uuid()
return format("%04x%04x-4%03x-%s%03x-%04x-%04x%04x%04x",
random(0xFFFF),random(0xFFFF),
random(0x0FFF),
t[ceil(random(4))] or 8,random(0x0FFF),
random(0xFFFF),
random(0xFFFF),random(0xFFFF),random(0xFFFF)
)
end
local d
function os.timezone(delta)
d = d or tonumber(tonumber(os.date("%H")-os.date("!%H")))
if delta then
if d > 0 then
return format("+%02i:00",d)
else
return format("-%02i:00",-d)
end
else
return 1
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-file'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- needs a cleanup
file = file or { }
local file = file
local insert, concat = table.insert, table.concat
local find, gmatch, match, gsub, sub, char, lower = string.find, string.gmatch, string.match, string.gsub, string.sub, string.char, string.lower
local lpegmatch = lpeg.match
local getcurrentdir, attributes = lfs.currentdir, lfs.attributes
local P, R, S, C, Cs, Cp, Cc = lpeg.P, lpeg.R, lpeg.S, lpeg.C, lpeg.Cs, lpeg.Cp, lpeg.Cc
local function dirname(name,default)
return match(name,"^(.+)[/\\].-$") or (default or "")
end
local function basename(name)
return match(name,"^.+[/\\](.-)$") or name
end
local function nameonly(name)
return (gsub(match(name,"^.+[/\\](.-)$") or name,"%..*$",""))
end
local function extname(name,default)
return match(name,"^.+%.([^/\\]-)$") or default or ""
end
local function splitname(name)
local n, s = match(name,"^(.+)%.([^/\\]-)$")
return n or name, s or ""
end
file.basename = basename
file.dirname = dirname
file.nameonly = nameonly
file.extname = extname
file.suffix = extname
function file.removesuffix(filename)
return (gsub(filename,"%.[%a%d]+$",""))
end
function file.addsuffix(filename, suffix, criterium)
if not suffix or suffix == "" then
return filename
elseif criterium == true then
return filename .. "." .. suffix
elseif not criterium then
local n, s = splitname(filename)
if not s or s == "" then
return filename .. "." .. suffix
else
return filename
end
else
local n, s = splitname(filename)
if s and s ~= "" then
local t = type(criterium)
if t == "table" then
-- keep if in criterium
for i=1,#criterium do
if s == criterium[i] then
return filename
end
end
elseif t == "string" then
-- keep if criterium
if s == criterium then
return filename
end
end
end
return n .. "." .. suffix
end
end
function file.replacesuffix(filename, suffix)
return (gsub(filename,"%.[%a%d]+$","")) .. "." .. suffix
end
local trick_1 = char(1)
local trick_2 = "^" .. trick_1 .. "/+"
function file.join(...) -- rather dirty
local lst = { ... }
local a, b = lst[1], lst[2]
if not a or a == "" then -- not a added
lst[1] = trick_1
elseif b and find(a,"^/+$") and find(b,"^/") then
lst[1] = ""
lst[2] = gsub(b,"^/+","")
end
local pth = concat(lst,"/")
pth = gsub(pth,"\\","/")
local a, b = match(pth,"^(.*://)(.*)$")
if a and b then
return a .. gsub(b,"//+","/")
end
a, b = match(pth,"^(//)(.*)$")
if a and b then
return a .. gsub(b,"//+","/")
end
pth = gsub(pth,trick_2,"")
return (gsub(pth,"//+","/"))
end
-- We should be able to use:
--
-- function file.is_writable(name)
-- local a = attributes(name) or attributes(dirname(name,"."))
-- return a and sub(a.permissions,2,2) == "w"
-- end
--
-- But after some testing Taco and I came up with:
function file.is_writable(name)
if lfs.isdir(name) then
name = name .. "/m_t_x_t_e_s_t.tmp"
local f = io.open(name,"wb")
if f then
f:close()
os.remove(name)
return true
end
elseif lfs.isfile(name) then
local f = io.open(name,"ab")
if f then
f:close()
return true
end
else
local f = io.open(name,"ab")
if f then
f:close()
os.remove(name)
return true
end
end
return false
end
function file.is_readable(name)
local a = attributes(name)
return a and sub(a.permissions,1,1) == "r"
end
file.isreadable = file.is_readable -- depricated
file.iswritable = file.is_writable -- depricated
-- todo: lpeg \\ / .. does not save much
local checkedsplit = string.checkedsplit
function file.splitpath(str,separator) -- string
str = gsub(str,"\\","/")
return checkedsplit(str,separator or io.pathseparator)
end
function file.joinpath(tab,separator) -- table
return concat(tab,separator or io.pathseparator) -- can have trailing //
end
-- we can hash them weakly
function file.collapsepath(str,anchor)
if anchor and not find(str,"^/") and not find(str,"^%a:") then
str = getcurrentdir() .. "/" .. str
end
if str == "" or str =="." then
return "."
elseif find(str,"^%.%.") then
str = gsub(str,"\\","/")
return str
elseif not find(str,"%.") then
str = gsub(str,"\\","/")
return str
end
str = gsub(str,"\\","/")
local starter, rest = match(str,"^(%a+:/*)(.-)$")
if starter then
str = rest
end
local oldelements = checkedsplit(str,"/")
local newelements = { }
local i = #oldelements
while i > 0 do
local element = oldelements[i]
if element == '.' then
-- do nothing
elseif element == '..' then
local n = i -1
while n > 0 do
local element = oldelements[n]
if element ~= '..' and element ~= '.' then
oldelements[n] = '.'
break
else
n = n - 1
end
end
if n < 1 then
insert(newelements,1,'..')
end
elseif element ~= "" then
insert(newelements,1,element)
end
i = i - 1
end
if #newelements == 0 then
return starter or "."
elseif starter then
return starter .. concat(newelements, '/')
elseif find(str,"^/") then
return "/" .. concat(newelements,'/')
else
return concat(newelements, '/')
end
end
function file.robustname(str,strict)
str = gsub(str,"[^%a%d%/%-%.\\]+","-")
if strict then
return lower(gsub(str,"^%-*(.-)%-*$","%1"))
else
return str
end
end
file.readdata = io.loaddata
file.savedata = io.savedata
function file.copy(oldname,newname)
file.savedata(newname,io.loaddata(oldname))
end
-- lpeg variants, slightly faster, not always
-- also rewrite previous
local letter = R("az","AZ") + S("_-+")
local separator = P("://")
local qualified = P(".")^0 * P("/") + letter*P(":") + letter^1*separator + letter^1 * P("/")
local rootbased = P("/") + letter*P(":")
lpeg.patterns.qualified = qualified
lpeg.patterns.rootbased = rootbased
-- ./name ../name /name c: :// name/name
function file.is_qualified_path(filename)
return lpegmatch(qualified,filename) ~= nil
end
function file.is_rootbased_path(filename)
return lpegmatch(rootbased,filename) ~= nil
end
-- actually these are schemes
local slash = S("\\/")
local period = P(".")
local drive = C(R("az","AZ")) * P(":")
local path = C(((1-slash)^0 * slash)^0)
local suffix = period * C(P(1-period)^0 * P(-1))
local base = C((1-suffix)^0)
drive = drive + Cc("")
path = path + Cc("")
base = base + Cc("")
suffix = suffix + Cc("")
local pattern_a = drive * path * base * suffix
local pattern_b = path * base * suffix
local pattern_c = C(drive * path) * C(base * suffix)
function file.splitname(str,splitdrive)
if splitdrive then
return lpegmatch(pattern_a,str) -- returns drive, path, base, suffix
else
return lpegmatch(pattern_b,str) -- returns path, base, suffix
end
end
function file.nametotable(str,splitdrive) -- returns table
local path, drive, subpath, name, base, suffix = lpegmatch(pattern_c,str)
if splitdrive then
return {
path = path,
drive = drive,
subpath = subpath,
name = name,
base = base,
suffix = suffix,
}
else
return {
path = path,
name = name,
base = base,
suffix = suffix,
}
end
end
-- function test(t) for k, v in next, t do print(v, "=>", file.splitname(v)) end end
--
-- test { "c:", "c:/aa", "c:/aa/bb", "c:/aa/bb/cc", "c:/aa/bb/cc.dd", "c:/aa/bb/cc.dd.ee" }
-- test { "c:", "c:aa", "c:aa/bb", "c:aa/bb/cc", "c:aa/bb/cc.dd", "c:aa/bb/cc.dd.ee" }
-- test { "/aa", "/aa/bb", "/aa/bb/cc", "/aa/bb/cc.dd", "/aa/bb/cc.dd.ee" }
-- test { "aa", "aa/bb", "aa/bb/cc", "aa/bb/cc.dd", "aa/bb/cc.dd.ee" }
-- for myself:
function file.strip(name,dir)
local b, a = match(name,"^(.-)" .. dir .. "(.*)$")
return a ~= "" and a or name
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-md5'] = {
version = 1.001,
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- This also provides file checksums and checkers.
local md5, file = md5, file
local gsub, format, byte = string.gsub, string.format, string.byte
local function convert(str,fmt)
return (gsub(md5.sum(str),".",function(chr) return format(fmt,byte(chr)) end))
end
if not md5.HEX then function md5.HEX(str) return convert(str,"%02X") end end
if not md5.hex then function md5.hex(str) return convert(str,"%02x") end end
if not md5.dec then function md5.dec(str) return convert(str,"%03i") end end
function file.needs_updating(oldname,newname,threshold) -- size modification access change
local oldtime = lfs.attributes(oldname, modification)
local newtime = lfs.attributes(newname, modification)
if newtime >= oldtime then
return false
elseif oldtime - newtime < (threshold or 1) then
return false
else
return true
end
end
function file.checksum(name)
if md5 then
local data = io.loaddata(name)
if data then
return md5.HEX(data)
end
end
return nil
end
function file.loadchecksum(name)
if md5 then
local data = io.loaddata(name .. ".md5")
return data and (gsub(data,"%s",""))
end
return nil
end
function file.savechecksum(name, checksum)
if not checksum then checksum = file.checksum(name) end
if checksum then
io.savedata(name .. ".md5",checksum)
return checksum
end
return nil
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-url'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local char, gmatch, gsub, format, byte, find = string.char, string.gmatch, string.gsub, string.format, string.byte, string.find
local concat = table.concat
local tonumber, type = tonumber, type
local P, C, R, S, Cs, Cc, Ct = lpeg.P, lpeg.C, lpeg.R, lpeg.S, lpeg.Cs, lpeg.Cc, lpeg.Ct
local lpegmatch, lpegpatterns, replacer = lpeg.match, lpeg.patterns, lpeg.replacer
-- from wikipedia:
--
-- foo://username:password@example.com:8042/over/there/index.dtb?type=animal;name=narwhal#nose
-- \_/ \_______________/ \_________/ \__/ \___/ \_/ \______________________/ \__/
-- | | | | | | | |
-- | userinfo hostname port | | query fragment
-- | \________________________________/\_____________|____|/
-- scheme | | | |
-- | authority path | |
-- | | |
-- | path interpretable as filename
-- | ___________|____________ |
-- / \ / \ |
-- urn:example:animal:ferret:nose interpretable as extension
url = url or { }
local url = url
local tochar = function(s) return char(tonumber(s,16)) end
local colon = P(":")
local qmark = P("?")
local hash = P("#")
local slash = P("/")
local percent = P("%")
local endofstring = P(-1)
local hexdigit = R("09","AF","af")
local plus = P("+")
local nothing = Cc("")
local escaped = (plus / " ") + (percent * C(hexdigit * hexdigit) / tochar)
-- we assume schemes with more than 1 character (in order to avoid problems with windows disks)
-- we also assume that when we have a scheme, we also have an authority
local schemestr = Cs((escaped+(1-colon-slash-qmark-hash))^2)
local authoritystr = Cs((escaped+(1- slash-qmark-hash))^0)
local pathstr = Cs((escaped+(1- qmark-hash))^0)
local querystr = Cs((escaped+(1- hash))^0)
local fragmentstr = Cs((escaped+(1- endofstring))^0)
local scheme = schemestr * colon + nothing
local authority = slash * slash * authoritystr + nothing
local path = slash * pathstr + nothing
local query = qmark * querystr + nothing
local fragment = hash * fragmentstr + nothing
local validurl = scheme * authority * path * query * fragment
local parser = Ct(validurl)
lpegpatterns.url = validurl
lpegpatterns.urlsplitter = parser
local escapes = { } ; for i=0,255 do escapes[i] = format("%%%02X",i) end
local escaper = Cs((R("09","AZ","az") + S("-./_") + P(1) / escapes)^0)
lpegpatterns.urlescaper = escaper
-- todo: reconsider Ct as we can as well have five return values (saves a table)
-- so we can have two parsers, one with and one without
local function split(str)
return (type(str) == "string" and lpegmatch(parser,str)) or str
end
local isscheme = schemestr * colon * slash * slash -- this test also assumes authority
local function hasscheme(str)
local scheme = lpegmatch(isscheme,str) -- at least one character
return scheme ~= "" and scheme or false
end
-- todo: cache them
local rootletter = R("az","AZ")
+ S("_-+")
local separator = P("://")
local qualified = P(".")^0 * P("/")
+ rootletter * P(":")
+ rootletter^1 * separator
+ rootletter^1 * P("/")
local rootbased = P("/")
+ rootletter * P(":")
local barswapper = replacer("|",":")
local backslashswapper = replacer("\\","/")
local function hashed(str) -- not yet ok (/test?test)
local s = split(str)
local somescheme = s[1] ~= ""
local somequery = s[4] ~= ""
if not somescheme and not somequery then
s = {
scheme = "file",
authority = "",
path = str,
query = "",
fragment = "",
original = str,
noscheme = true,
filename = str,
}
else -- not always a filename but handy anyway
local authority, path, filename = s[2], s[3]
if authority == "" then
filename = path
else
filename = authority .. "/" .. path
end
s = {
scheme = s[1],
authority = authority,
path = path,
query = s[4],
fragment = s[5],
original = str,
noscheme = false,
filename = filename,
}
end
return s
end
-- Here we assume:
--
-- files: /// = relative
-- files: //// = absolute (!)
url.split = split
url.hasscheme = hasscheme
url.hashed = hashed
function url.addscheme(str,scheme) -- no authority
if hasscheme(str) then
return str
elseif not scheme then
return "file:///" .. str
else
return scheme .. ":///" .. str
end
end
function url.construct(hash) -- dodo: we need to escape !
local fullurl, f = { }, 0
local scheme, authority, path, query, fragment = hash.scheme, hash.authority, hash.path, hash.query, hash.fragment
if scheme and scheme ~= "" then
f = f + 1 ; fullurl[f] = scheme .. "://"
end
if authority and authority ~= "" then
f = f + 1 ; fullurl[f] = authority
end
if path and path ~= "" then
f = f + 1 ; fullurl[f] = "/" .. path
end
if query and query ~= "" then
f = f + 1 ; fullurl[f] = "?".. query
end
if fragment and fragment ~= "" then
f = f + 1 ; fullurl[f] = "#".. fragment
end
return lpegmatch(escaper,concat(fullurl))
end
function url.filename(filename)
local t = hashed(filename)
return (t.scheme == "file" and (gsub(t.path,"^/([a-zA-Z])([:|])/)","%1:"))) or filename
end
function url.query(str)
if type(str) == "string" then
local t = { }
for k, v in gmatch(str,"([^&=]*)=([^&=]*)") do
t[k] = v
end
return t
else
return str
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-dir'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- dir.expandname will be merged with cleanpath and collapsepath
local type = type
local find, gmatch, match, gsub = string.find, string.gmatch, string.match, string.gsub
local concat, insert, remove = table.concat, table.insert, table.remove
local lpegmatch = lpeg.match
local P, S, R, C, Cc, Cs, Ct, Cv, V = lpeg.P, lpeg.S, lpeg.R, lpeg.C, lpeg.Cc, lpeg.Cs, lpeg.Ct, lpeg.Cv, lpeg.V
dir = dir or { }
local dir = dir
local lfs = lfs
local attributes = lfs.attributes
local walkdir = lfs.dir
local isdir = lfs.isdir
local isfile = lfs.isfile
local mkdir = lfs.mkdir
local chdir = lfs.chdir
local currentdir = lfs.currentdir
-- handy
function dir.current()
return (gsub(currentdir(),"\\","/"))
end
-- optimizing for no find (*) does not save time
local lfsisdir = isdir
local function isdir(path)
path = gsub(path,"[/\\]+$","")
return lfsisdir(path)
end
lfs.isdir = isdir
local function globpattern(path,patt,recurse,action)
if path == "/" then
path = path .. "."
elseif not find(path,"/$") then
path = path .. '/'
end
if isdir(path) then -- lfs.isdir does not like trailing /
for name in walkdir(path) do -- lfs.dir accepts trailing /
local full = path .. name
local mode = attributes(full,'mode')
if mode == 'file' then
if find(full,patt) then
action(full)
end
elseif recurse and (mode == "directory") and (name ~= '.') and (name ~= "..") then
globpattern(full,patt,recurse,action)
end
end
end
end
dir.globpattern = globpattern
local function collectpattern(path,patt,recurse,result)
local ok, scanner
result = result or { }
if path == "/" then
ok, scanner = xpcall(function() return walkdir(path..".") end, function() end) -- kepler safe
else
ok, scanner = xpcall(function() return walkdir(path) end, function() end) -- kepler safe
end
if ok and type(scanner) == "function" then
if not find(path,"/$") then path = path .. '/' end
for name in scanner do
local full = path .. name
local attr = attributes(full)
local mode = attr.mode
if mode == 'file' then
if find(full,patt) then
result[name] = attr
end
elseif recurse and (mode == "directory") and (name ~= '.') and (name ~= "..") then
attr.list = collectpattern(full,patt,recurse)
result[name] = attr
end
end
end
return result
end
dir.collectpattern = collectpattern
local pattern = Ct {
[1] = (C(P(".") + P("/")^1) + C(R("az","AZ") * P(":") * P("/")^0) + Cc("./")) * V(2) * V(3),
[2] = C(((1-S("*?/"))^0 * P("/"))^0),
[3] = C(P(1)^0)
}
local filter = Cs ( (
P("**") / ".*" +
P("*") / "[^/]*" +
P("?") / "[^/]" +
P(".") / "%%." +
P("+") / "%%+" +
P("-") / "%%-" +
P(1)
)^0 )
local function glob(str,t)
if type(t) == "function" then
if type(str) == "table" then
for s=1,#str do
glob(str[s],t)
end
elseif isfile(str) then
t(str)
else
local split = lpegmatch(pattern,str) -- we could use the file splitter
if split then
local root, path, base = split[1], split[2], split[3]
local recurse = find(base,"%*%*")
local start = root .. path
local result = lpegmatch(filter,start .. base)
globpattern(start,result,recurse,t)
end
end
else
if type(str) == "table" then
local t = t or { }
for s=1,#str do
glob(str[s],t)
end
return t
elseif isfile(str) then
if t then
t[#t+1] = str
return t
else
return { str }
end
else
local split = lpegmatch(pattern,str) -- we could use the file splitter
if split then
local t = t or { }
local action = action or function(name) t[#t+1] = name end
local root, path, base = split[1], split[2], split[3]
local recurse = find(base,"%*%*")
local start = root .. path
local result = lpegmatch(filter,start .. base)
globpattern(start,result,recurse,action)
return t
else
return { }
end
end
end
end
dir.glob = glob
local function globfiles(path,recurse,func,files) -- func == pattern or function
if type(func) == "string" then
local s = func
func = function(name) return find(name,s) end
end
files = files or { }
local noffiles = #files
for name in walkdir(path) do
if find(name,"^%.") then
--- skip
else
local mode = attributes(name,'mode')
if mode == "directory" then
if recurse then
globfiles(path .. "/" .. name,recurse,func,files)
end
elseif mode == "file" then
if not func or func(name) then
noffiles = noffiles + 1
files[noffiles] = path .. "/" .. name
end
end
end
end
return files
end
dir.globfiles = globfiles
-- t = dir.glob("c:/data/develop/context/sources/**/????-*.tex")
-- t = dir.glob("c:/data/develop/tex/texmf/**/*.tex")
-- t = dir.glob("c:/data/develop/context/texmf/**/*.tex")
-- t = dir.glob("f:/minimal/tex/**/*")
-- print(dir.ls("f:/minimal/tex/**/*"))
-- print(dir.ls("*.tex"))
function dir.ls(pattern)
return concat(glob(pattern),"\n")
end
local make_indeed = true -- false
local onwindows = os.type == "windows" or find(os.getenv("PATH"),";")
if onwindows then
function dir.mkdirs(...)
local str, pth, t = "", "", { ... }
for i=1,#t do
local s = t[i]
if s ~= "" then
if str ~= "" then
str = str .. "/" .. s
else
str = s
end
end
end
local first, middle, last
local drive = false
first, middle, last = match(str,"^(//)(//*)(.*)$")
if first then
-- empty network path == local path
else
first, last = match(str,"^(//)/*(.-)$")
if first then
middle, last = match(str,"([^/]+)/+(.-)$")
if middle then
pth = "//" .. middle
else
pth = "//" .. last
last = ""
end
else
first, middle, last = match(str,"^([a-zA-Z]:)(/*)(.-)$")
if first then
pth, drive = first .. middle, true
else
middle, last = match(str,"^(/*)(.-)$")
if not middle then
last = str
end
end
end
end
for s in gmatch(last,"[^/]+") do
if pth == "" then
pth = s
elseif drive then
pth, drive = pth .. s, false
else
pth = pth .. "/" .. s
end
if make_indeed and not isdir(pth) then
mkdir(pth)
end
end
return pth, (isdir(pth) == true)
end
else
function dir.mkdirs(...)
local str, pth, t = "", "", { ... }
for i=1,#t do
local s = t[i]
if s and s ~= "" then -- we catch nil and false
if str ~= "" then
str = str .. "/" .. s
else
str = s
end
end
end
str = gsub(str,"/+","/")
if find(str,"^/") then
pth = "/"
for s in gmatch(str,"[^/]+") do
local first = (pth == "/")
if first then
pth = pth .. s
else
pth = pth .. "/" .. s
end
if make_indeed and not first and not isdir(pth) then
mkdir(pth)
end
end
else
pth = "."
for s in gmatch(str,"[^/]+") do
pth = pth .. "/" .. s
if make_indeed and not isdir(pth) then
mkdir(pth)
end
end
end
return pth, (isdir(pth) == true)
end
end
dir.makedirs = dir.mkdirs
-- we can only define it here as it uses dir.current
if onwindows then
function dir.expandname(str) -- will be merged with cleanpath and collapsepath
local first, nothing, last = match(str,"^(//)(//*)(.*)$")
if first then
first = dir.current() .. "/"
end
if not first then
first, last = match(str,"^(//)/*(.*)$")
end
if not first then
first, last = match(str,"^([a-zA-Z]:)(.*)$")
if first and not find(last,"^/") then
local d = currentdir()
if chdir(first) then
first = dir.current()
end
chdir(d)
end
end
if not first then
first, last = dir.current(), str
end
last = gsub(last,"//","/")
last = gsub(last,"/%./","/")
last = gsub(last,"^/*","")
first = gsub(first,"/*$","")
if last == "" or last == "." then
return first
else
return first .. "/" .. last
end
end
else
function dir.expandname(str) -- will be merged with cleanpath and collapsepath
if not find(str,"^/") then
str = currentdir() .. "/" .. str
end
str = gsub(str,"//","/")
str = gsub(str,"/%./","/")
str = gsub(str,"(.)/%.$","%1")
return str
end
end
file.expandname = dir.expandname -- for convenience
local stack = { }
function dir.push(newdir)
insert(stack,lfs.currentdir())
end
function dir.pop()
local d = remove(stack)
if d then
lfs.chdir(d)
end
return d
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-boolean'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local type, tonumber = type, tonumber
boolean = boolean or { }
local boolean = boolean
function boolean.tonumber(b)
if b then return 1 else return 0 end -- test and return or return
end
function toboolean(str,tolerant)
if tolerant then
local tstr = type(str)
if tstr == "string" then
return str == "true" or str == "yes" or str == "on" or str == "1" or str == "t"
elseif tstr == "number" then
return tonumber(str) ~= 0
elseif tstr == "nil" then
return false
else
return str
end
elseif str == "true" then
return true
elseif str == "false" then
return false
else
return str
end
end
string.toboolean = toboolean
function string.is_boolean(str,default)
if type(str) == "string" then
if str == "true" or str == "yes" or str == "on" or str == "t" then
return true
elseif str == "false" or str == "no" or str == "off" or str == "f" then
return false
end
end
return default
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-unicode'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
if not unicode then
unicode = { utf8 = { } }
local floor, char = math.floor, string.char
function unicode.utf8.utfchar(n)
if n < 0x80 then
return char(n)
elseif n < 0x800 then
return char(
0xC0 + floor(n/0x40),
0x80 + (n % 0x40)
)
elseif n < 0x10000 then
return char(
0xE0 + floor(n/0x1000),
0x80 + (floor(n/0x40) % 0x40),
0x80 + (n % 0x40)
)
elseif n < 0x40000 then
return char(
0xF0 + floor(n/0x40000),
0x80 + floor(n/0x1000),
0x80 + (floor(n/0x40) % 0x40),
0x80 + (n % 0x40)
)
else
-- return char(
-- 0xF1 + floor(n/0x1000000),
-- 0x80 + floor(n/0x40000),
-- 0x80 + floor(n/0x1000),
-- 0x80 + (floor(n/0x40) % 0x40),
-- 0x80 + (n % 0x40)
-- )
return "?"
end
end
end
local unicode = unicode
utf = utf or unicode.utf8
local concat = table.concat
local utfchar, utfbyte, utfgsub = utf.char, utf.byte, utf.gsub
local char, byte, find, bytepairs, utfvalues, format = string.char, string.byte, string.find, string.bytepairs, string.utfvalues, string.format
local type = type
local utfsplitlines = string.utfsplitlines
-- 0 EF BB BF UTF-8
-- 1 FF FE UTF-16-little-endian
-- 2 FE FF UTF-16-big-endian
-- 3 FF FE 00 00 UTF-32-little-endian
-- 4 00 00 FE FF UTF-32-big-endian
unicode.utfname = {
[0] = 'utf-8',
[1] = 'utf-16-le',
[2] = 'utf-16-be',
[3] = 'utf-32-le',
[4] = 'utf-32-be'
}
-- \000 fails in <= 5.0 but is valid in >=5.1 where %z is depricated
function unicode.utftype(f)
local str = f:read(4)
if not str then
f:seek('set')
return 0
-- elseif find(str,"^%z%z\254\255") then -- depricated
-- elseif find(str,"^\000\000\254\255") then -- not permitted and bugged
elseif find(str,"\000\000\254\255",1,true) then -- seems to work okay (TH)
return 4
-- elseif find(str,"^\255\254%z%z") then -- depricated
-- elseif find(str,"^\255\254\000\000") then -- not permitted and bugged
elseif find(str,"\255\254\000\000",1,true) then -- seems to work okay (TH)
return 3
elseif find(str,"^\254\255") then
f:seek('set',2)
return 2
elseif find(str,"^\255\254") then
f:seek('set',2)
return 1
elseif find(str,"^\239\187\191") then
f:seek('set',3)
return 0
else
f:seek('set')
return 0
end
end
local function utf16_to_utf8_be(t)
if type(t) == "string" then
t = utfsplitlines(str)
end
local result = { } -- we reuse result
for i=1,#t do
local r, more = 0, 0
for left, right in bytepairs(t[i]) do
if right then
local now = 256*left + right
if more > 0 then
now = (more-0xD800)*0x400 + (now-0xDC00) + 0x10000 -- the 0x10000 smells wrong
more = 0
r = r + 1
result[r] = utfchar(now)
elseif now >= 0xD800 and now <= 0xDBFF then
more = now
else
r = r + 1
result[r] = utfchar(now)
end
end
end
t[i] = concat(result,"",1,r) -- we reused tmp, hence t
end
return t
end
local function utf16_to_utf8_le(t)
if type(t) == "string" then
t = utfsplitlines(str)
end
local result = { } -- we reuse result
for i=1,#t do
local r, more = 0, 0
for left, right in bytepairs(t[i]) do
if right then
local now = 256*right + left
if more > 0 then
now = (more-0xD800)*0x400 + (now-0xDC00) + 0x10000 -- the 0x10000 smells wrong
more = 0
r = r + 1
result[r] = utfchar(now)
elseif now >= 0xD800 and now <= 0xDBFF then
more = now
else
r = r + 1
result[r] = utfchar(now)
end
end
end
t[i] = concat(result,"",1,r) -- we reused tmp, hence t
end
return t
end
local function utf32_to_utf8_be(t)
if type(t) == "string" then
t = utfsplitlines(t)
end
local result = { } -- we reuse result
for i=1,#t do
local r, more = 0, -1
for a,b in bytepairs(t[i]) do
if a and b then
if more < 0 then
more = 256*256*256*a + 256*256*b
else
r = r + 1
result[t] = utfchar(more + 256*a + b)
more = -1
end
else
break
end
end
t[i] = concat(result,"",1,r)
end
return t
end
local function utf32_to_utf8_le(t)
if type(t) == "string" then
t = utfsplitlines(t)
end
local result = { } -- we reuse result
for i=1,#t do
local r, more = 0, -1
for a,b in bytepairs(t[i]) do
if a and b then
if more < 0 then
more = 256*b + a
else
r = r + 1
result[t] = utfchar(more + 256*256*256*b + 256*256*a)
more = -1
end
else
break
end
end
t[i] = concat(result,"",1,r)
end
return t
end
unicode.utf32_to_utf8_be = utf32_to_utf8_be
unicode.utf32_to_utf8_le = utf32_to_utf8_le
unicode.utf16_to_utf8_be = utf16_to_utf8_be
unicode.utf16_to_utf8_le = utf16_to_utf8_le
function unicode.utf8_to_utf8(t)
return type(t) == "string" and utfsplitlines(t) or t
end
function unicode.utf16_to_utf8(t,endian)
return endian and utf16_to_utf8_be(t) or utf16_to_utf8_le(t) or t
end
function unicode.utf32_to_utf8(t,endian)
return endian and utf32_to_utf8_be(t) or utf32_to_utf8_le(t) or t
end
local function little(c)
local b = byte(c)
if b < 0x10000 then
return char(b%256,b/256)
else
b = b - 0x10000
local b1, b2 = b/1024 + 0xD800, b%1024 + 0xDC00
return char(b1%256,b1/256,b2%256,b2/256)
end
end
local function big(c)
local b = byte(c)
if b < 0x10000 then
return char(b/256,b%256)
else
b = b - 0x10000
local b1, b2 = b/1024 + 0xD800, b%1024 + 0xDC00
return char(b1/256,b1%256,b2/256,b2%256)
end
end
function unicode.utf8_to_utf16(str,littleendian)
if littleendian then
return char(255,254) .. utfgsub(str,".",little)
else
return char(254,255) .. utfgsub(str,".",big)
end
end
function unicode.utfcodes(str)
local t, n = { }, 0
for u in utfvalues(str) do
n = n + 1
t[n] = format("0x%04X",u)
end
return concat(t,separator or " ")
end
function unicode.ustring(s)
return format("U+%05X",type(s) == "number" and s or utfbyte(s))
end
function unicode.xstring(s)
return format("0x%05X",type(s) == "number" and s or utfbyte(s))
end
local lpegmatch = lpeg.match
local patterns = lpeg.patterns
local utftype = patterns.utftype
function unicode.filetype(data)
return data and lpegmatch(utftype,data) or "unknown"
end
local toentities = lpeg.Cs (
(
patterns.utf8one
+ (
patterns.utf8two
+ patterns.utf8three
+ patterns.utf8four
) / function(s) local b = utfbyte(s) if b < 127 then return s else return format("&#%X;",b) end end
)^0
)
patterns.toentities = toentities
function utf.toentities(str)
return lpegmatch(toentities,str)
end
local P, C, R, Cs = lpeg.P, lpeg.C, lpeg.R, lpeg.Cs
local one = P(1)
local two = C(1) * C(1)
local four = C(R(utfchar(0xD8),utfchar(0xFF))) * C(1) * C(1) * C(1)
local pattern = P("\254\255") * Cs( (
four / function(a,b,c,d)
local ab = 0xFF * byte(a) + byte(b)
local cd = 0xFF * byte(c) + byte(d)
return utfchar((ab-0xD800)*0x400 + (cd-0xDC00) + 0x10000)
end
+ two / function(a,b)
return utfchar(byte(a)*256 + byte(b))
end
+ one
)^1 )
+ P("\255\254") * Cs( (
four / function(b,a,d,c)
local ab = 0xFF * byte(a) + byte(b)
local cd = 0xFF * byte(c) + byte(d)
return utfchar((ab-0xD800)*0x400 + (cd-0xDC00) + 0x10000)
end
+ two / function(b,a)
return utfchar(byte(a)*256 + byte(b))
end
+ one
)^1 )
function string.toutf(s)
return lpegmatch(pattern,s) or s -- todo: utf32
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['l-math'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local floor, sin, cos, tan = math.floor, math.sin, math.cos, math.tan
if not math.round then
function math.round(x) return floor(x + 0.5) end
end
if not math.div then
function math.div(n,m) return floor(n/m) end
end
if not math.mod then
function math.mod(n,m) return n % m end
end
local pipi = 2*math.pi/360
if not math.sind then
function math.sind(d) return sin(d*pipi) end
function math.cosd(d) return cos(d*pipi) end
function math.tand(d) return tan(d*pipi) end
end
if not math.odd then
function math.odd (n) return n % 2 == 0 end
function math.even(n) return n % 2 ~= 0 end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-tab'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
utilities = utilities or {}
utilities.tables = utilities.tables or { }
local tables = utilities.tables
local format, gmatch, rep = string.format, string.gmatch, string.rep
local concat, insert, remove = table.concat, table.insert, table.remove
local setmetatable, getmetatable, tonumber, tostring = setmetatable, getmetatable, tonumber, tostring
local type, next, rawset, tonumber = type, next, rawset, tonumber
function tables.definetable(target) -- defines undefined tables
local composed, t, n = nil, { }, 0
for name in gmatch(target,"([^%.]+)") do
n = n + 1
if composed then
composed = composed .. "." .. name
else
composed = name
end
t[n] = format("%s = %s or { }",composed,composed)
end
return concat(t,"\n")
end
function tables.accesstable(target,root)
local t = root or _G
for name in gmatch(target,"([^%.]+)") do
t = t[name]
if not t then
return
end
end
return t
end
function tables.migratetable(target,v,root)
local t = root or _G
local names = string.split(target,".")
for i=1,#names-1 do
local name = names[i]
t[name] = t[name] or { }
t = t[name]
if not t then
return
end
end
t[names[#names]] = v
end
function tables.removevalue(t,value) -- todo: n
if value then
for i=1,#t do
if t[i] == value then
remove(t,i)
-- remove all, so no: return
end
end
end
end
function tables.insertbeforevalue(t,value,extra)
for i=1,#t do
if t[i] == extra then
remove(t,i)
end
end
for i=1,#t do
if t[i] == value then
insert(t,i,extra)
return
end
end
insert(t,1,extra)
end
function tables.insertaftervalue(t,value,extra)
for i=1,#t do
if t[i] == extra then
remove(t,i)
end
end
for i=1,#t do
if t[i] == value then
insert(t,i+1,extra)
return
end
end
insert(t,#t+1,extra)
end
-- experimental
local function toxml(t,d,result,step)
for k, v in table.sortedpairs(t) do
if type(v) == "table" then
if type(k) == "number" then
result[#result+1] = format("%s<entry n='%s'>",d,k)
toxml(v,d..step,result,step)
result[#result+1] = format("%s</entry>",d,k)
else
result[#result+1] = format("%s<%s>",d,k)
toxml(v,d..step,result,step)
result[#result+1] = format("%s</%s>",d,k)
end
elseif type(k) == "number" then
result[#result+1] = format("%s<entry n='%s'>%s</entry>",d,k,v,k)
else
result[#result+1] = format("%s<%s>%s</%s>",d,k,tostring(v),k)
end
end
end
function table.toxml(t,name,nobanner,indent,spaces)
local noroot = name == false
local result = (nobanner or noroot) and { } or { "<?xml version='1.0' standalone='yes' ?>" }
local indent = rep(" ",indent or 0)
local spaces = rep(" ",spaces or 1)
if noroot then
toxml( t, inndent, result, spaces)
else
toxml( { [name or "root"] = t }, indent, result, spaces)
end
return concat(result,"\n")
end
-- also experimental
-- encapsulate(table,utilities.tables)
-- encapsulate(table,utilities.tables,true)
-- encapsulate(table,true)
function tables.encapsulate(core,capsule,protect)
if type(capsule) ~= "table" then
protect = true
capsule = { }
end
for key, value in next, core do
if capsule[key] then
print(format("\ninvalid inheritance '%s' in '%s': %s",key,tostring(core)))
os.exit()
else
capsule[key] = value
end
end
if protect then
for key, value in next, core do
core[key] = nil
end
setmetatable(core, {
__index = capsule,
__newindex = function(t,key,value)
if capsule[key] then
print(format("\ninvalid overload '%s' in '%s'",key,tostring(core)))
os.exit()
else
rawset(t,key,value)
end
end
} )
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-sto'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local setmetatable, getmetatable = setmetatable, getmetatable
utilities = utilities or { }
utilities.storage = utilities.storage or { }
local storage = utilities.storage
function storage.mark(t)
if not t then
texio.write_nl("fatal error: storage cannot be marked")
return -- os.exit()
end
local m = getmetatable(t)
if not m then
m = { }
setmetatable(t,m)
end
m.__storage__ = true
return t
end
function storage.allocate(t)
t = t or { }
local m = getmetatable(t)
if not m then
m = { }
setmetatable(t,m)
end
m.__storage__ = true
return t
end
function storage.marked(t)
local m = getmetatable(t)
return m and m.__storage__
end
function storage.checked(t)
if not t then
texio.write_nl("fatal error: storage has not been allocated")
return -- os.exit()
end
return t
end
function storage.setinitializer(data,initialize)
local m = getmetatable(data) or { }
m.__index = function(data,k)
m.__index = nil -- so that we can access the entries during initializing
initialize()
return data[k]
end
setmetatable(data, m)
end
local keyisvalue = { __index = function(t,k)
t[k] = k
return k
end }
function storage.sparse(t)
t = t or { }
setmetatable(t,keyisvalue)
return t
end
-- table namespace ?
local function f_empty() return "" end -- t,k
local function f_self(t,k) t[k] = k return k end
local function f_ignore() end -- t,k,v
local t_empty = { __index = empty }
local t_self = { __index = self }
local t_ignore = { __newindex = ignore }
function table.setmetatableindex(t,f)
local m = getmetatable(t)
if m then
if f == "empty" then
m.__index = f_empty
elseif f == "key" then
m.__index = f_self
else
m.__index = f
end
else
if f == "empty" then
setmetatable(t, t_empty)
elseif f == "key" then
setmetatable(t, t_self)
else
setmetatable(t,{ __index = f })
end
end
end
function table.setmetatablenewindex(t,f)
local m = getmetatable(t)
if m then
if f == "ignore" then
m.__newindex = f_ignore
else
m.__newindex = f
end
else
if f == "ignore" then
setmetatable(t, t_ignore)
else
setmetatable(t,{ __newindex = f })
end
end
end
function table.setmetatablecall(t,f)
local m = getmetatable(t)
if m then
m.__call = f
else
setmetatable(t,{ __call = f })
end
end
function table.setmetatablekey(t,key,value)
local m = getmetatable(t)
if not m then
m = { }
setmetatable(t,m)
end
m[key] = value
end
function table.getmetatablekey(t,key,value)
local m = getmetatable(t)
return m and m[key]
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-mrg'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- hm, quite unreadable
local gsub, format = string.gsub, string.format
local concat = table.concat
local type, next = type, next
utilities = utilities or {}
utilities.merger = utilities.merger or { } -- maybe mergers
utilities.report = logs and logs.reporter("system") or print
local merger = utilities.merger
merger.strip_comment = true
local m_begin_merge = "begin library merge"
local m_end_merge = "end library merge"
local m_begin_closure = "do -- create closure to overcome 200 locals limit"
local m_end_closure = "end -- of closure"
local m_pattern =
"%c+" ..
"%-%-%s+" .. m_begin_merge ..
"%c+(.-)%c+" ..
"%-%-%s+" .. m_end_merge ..
"%c+"
local m_format =
"\n\n-- " .. m_begin_merge ..
"\n%s\n" ..
"-- " .. m_end_merge .. "\n\n"
local m_faked =
"-- " .. "created merged file" .. "\n\n" ..
"-- " .. m_begin_merge .. "\n\n" ..
"-- " .. m_end_merge .. "\n\n"
local function self_fake()
return m_faked
end
local function self_nothing()
return ""
end
local function self_load(name)
local data = io.loaddata(name) or ""
if data == "" then
utilities.report("merge: unknown file %s",name)
else
utilities.report("merge: inserting %s",name)
end
return data or ""
end
local function self_save(name, data)
if data ~= "" then
if merger.strip_comment then
-- saves some 20K
local n = #data
data = gsub(data,"%-%-~[^\n\r]*[\r\n]","")
utilities.report("merge: %s bytes of comment stripped, %s bytes of code left",n-#data,#data)
end
io.savedata(name,data)
utilities.report("merge: saving %s",name)
end
end
local function self_swap(data,code)
return data ~= "" and (gsub(data,m_pattern, function() return format(m_format,code) end, 1)) or ""
end
local function self_libs(libs,list)
local result, f, frozen, foundpath = { }, nil, false, nil
result[#result+1] = "\n"
if type(libs) == 'string' then libs = { libs } end
if type(list) == 'string' then list = { list } end
for i=1,#libs do
local lib = libs[i]
for j=1,#list do
local pth = gsub(list[j],"\\","/") -- file.clean_path
utilities.report("merge: checking library path %s",pth)
local name = pth .. "/" .. lib
if lfs.isfile(name) then
foundpath = pth
end
end
if foundpath then break end
end
if foundpath then
utilities.report("merge: using library path %s",foundpath)
local right, wrong = { }, { }
for i=1,#libs do
local lib = libs[i]
local fullname = foundpath .. "/" .. lib
if lfs.isfile(fullname) then
utilities.report("merge: using library %s",fullname)
right[#right+1] = lib
result[#result+1] = m_begin_closure
result[#result+1] = io.loaddata(fullname,true)
result[#result+1] = m_end_closure
else
utilities.report("merge: skipping library %s",fullname)
wrong[#wrong+1] = lib
end
end
if #right > 0 then
utilities.report("merge: used libraries: %s",concat(right," "))
end
if #wrong > 0 then
utilities.report("merge: skipped libraries: %s",concat(wrong," "))
end
else
utilities.report("merge: no valid library path found")
end
return concat(result, "\n\n")
end
function merger.selfcreate(libs,list,target)
if target then
self_save(target,self_swap(self_fake(),self_libs(libs,list)))
end
end
function merger.selfmerge(name,libs,list,target)
self_save(target or name,self_swap(self_load(name),self_libs(libs,list)))
end
function merger.selfclean(name)
self_save(name,self_swap(self_load(name),self_nothing()))
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-lua'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
utilities = utilities or {}
utilities.lua = utilities.lua or { }
utilities.report = logs and logs.reporter("system") or print
function utilities.lua.compile(luafile,lucfile,cleanup,strip) -- defaults: cleanup=false strip=true
utilities.report("lua: compiling %s into %s",luafile,lucfile)
os.remove(lucfile)
local command = "-o " .. string.quoted(lucfile) .. " " .. string.quoted(luafile)
if strip ~= false then
command = "-s " .. command
end
local done = os.spawn("texluac " .. command) == 0 or os.spawn("luac " .. command) == 0
if done and cleanup == true and lfs.isfile(lucfile) and lfs.isfile(luafile) then
utilities.report("lua: removing %s",luafile)
os.remove(luafile)
end
return done
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-prs'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local P, R, V, C, Ct, Cs, Carg = lpeg.P, lpeg.R, lpeg.V, lpeg.C, lpeg.Ct, lpeg.Cs, lpeg.Carg
local lpegmatch = lpeg.match
local concat, format, gmatch, find = table.concat, string.format, string.gmatch, string.find
local tostring, type, next = tostring, type, next
utilities = utilities or {}
utilities.parsers = utilities.parsers or { }
local parsers = utilities.parsers
parsers.patterns = parsers.patterns or { }
local setmetatableindex = table.setmetatableindex
local sortedhash = table.sortedhash
-- we could use a Cf Cg construct
local escape, left, right = P("\\"), P('{'), P('}')
lpeg.patterns.balanced = P {
[1] = ((escape * (left+right)) + (1 - (left+right)) + V(2))^0,
[2] = left * V(1) * right
}
local space = P(' ')
local equal = P("=")
local comma = P(",")
local lbrace = P("{")
local rbrace = P("}")
local nobrace = 1 - (lbrace+rbrace)
local nested = P { lbrace * (nobrace + V(1))^0 * rbrace }
local spaces = space^0
local argument = Cs((lbrace/"") * ((nobrace + nested)^0) * (rbrace/""))
local content = (1-P(-1))^0
lpeg.patterns.nested = nested -- no capture
lpeg.patterns.argument = argument -- argument after e.g. =
lpeg.patterns.content = content -- rest after e.g =
local value = P(lbrace * C((nobrace + nested)^0) * rbrace) + C((nested + (1-comma))^0)
local key = C((1-equal-comma)^1)
local pattern_a = (space+comma)^0 * (key * equal * value + key * C(""))
local pattern_c = (space+comma)^0 * (key * equal * value)
local key = C((1-space-equal-comma)^1)
local pattern_b = spaces * comma^0 * spaces * (key * ((spaces * equal * spaces * value) + C("")))
-- "a=1, b=2, c=3, d={a{b,c}d}, e=12345, f=xx{a{b,c}d}xx, g={}" : outer {} removes, leading spaces ignored
local hash = { }
local function set(key,value)
hash[key] = value
end
local function set(key,value)
hash[key] = value
end
local pattern_a_s = (pattern_a/set)^1
local pattern_b_s = (pattern_b/set)^1
local pattern_c_s = (pattern_c/set)^1
parsers.patterns.settings_to_hash_a = pattern_a_s
parsers.patterns.settings_to_hash_b = pattern_b_s
parsers.patterns.settings_to_hash_c = pattern_c_s
function parsers.make_settings_to_hash_pattern(set,how)
if how == "strict" then
return (pattern_c/set)^1
elseif how == "tolerant" then
return (pattern_b/set)^1
else
return (pattern_a/set)^1
end
end
function parsers.settings_to_hash(str,existing)
if str and str ~= "" then
hash = existing or { }
lpegmatch(pattern_a_s,str)
return hash
else
return { }
end
end
function parsers.settings_to_hash_tolerant(str,existing)
if str and str ~= "" then
hash = existing or { }
lpegmatch(pattern_b_s,str)
return hash
else
return { }
end
end
function parsers.settings_to_hash_strict(str,existing)
if str and str ~= "" then
hash = existing or { }
lpegmatch(pattern_c_s,str)
return next(hash) and hash
else
return nil
end
end
local separator = comma * space^0
local value = P(lbrace * C((nobrace + nested)^0) * rbrace) + C((nested + (1-comma))^0)
local pattern = Ct(value*(separator*value)^0)
-- "aap, {noot}, mies" : outer {} removes, leading spaces ignored
parsers.patterns.settings_to_array = pattern
-- we could use a weak table as cache
function parsers.settings_to_array(str,strict)
if not str or str == "" then
return { }
elseif strict then
if find(str,"{") then
return lpegmatch(pattern,str)
else
return { str }
end
else
return lpegmatch(pattern,str)
end
end
local function set(t,v)
t[#t+1] = v
end
local value = P(Carg(1)*value) / set
local pattern = value*(separator*value)^0 * Carg(1)
function parsers.add_settings_to_array(t,str)
return lpegmatch(pattern,str,nil,t)
end
function parsers.hash_to_string(h,separator,yes,no,strict,omit)
if h then
local t, tn, s = { }, 0, table.sortedkeys(h)
omit = omit and table.tohash(omit)
for i=1,#s do
local key = s[i]
if not omit or not omit[key] then
local value = h[key]
if type(value) == "boolean" then
if yes and no then
if value then
tn = tn + 1
t[tn] = key .. '=' .. yes
elseif not strict then
tn = tn + 1
t[tn] = key .. '=' .. no
end
elseif value or not strict then
tn = tn + 1
t[tn] = key .. '=' .. tostring(value)
end
else
tn = tn + 1
t[tn] = key .. '=' .. value
end
end
end
return concat(t,separator or ",")
else
return ""
end
end
function parsers.array_to_string(a,separator)
if a then
return concat(a,separator or ",")
else
return ""
end
end
function parsers.settings_to_set(str,t) -- tohash? -- todo: lpeg -- duplicate anyway
t = t or { }
-- for s in gmatch(str,"%s*([^, ]+)") do -- space added
for s in gmatch(str,"[^, ]+") do -- space added
t[s] = true
end
return t
end
function parsers.simple_hash_to_string(h, separator)
local t, tn = { }, 0
for k, v in sortedhash(h) do
if v then
tn = tn + 1
t[tn] = k
end
end
return concat(t,separator or ",")
end
local value = lbrace * C((nobrace + nested)^0) * rbrace
local pattern = Ct((space + value)^0)
function parsers.arguments_to_table(str)
return lpegmatch(pattern,str)
end
-- temporary here (unoptimized)
function parsers.getparameters(self,class,parentclass,settings)
local sc = self[class]
if not sc then
sc = { }
self[class] = sc
if parentclass then
local sp = self[parentclass]
if not sp then
sp = { }
self[parentclass] = sp
end
setmetatableindex(sc,sp)
end
end
parsers.settings_to_hash(settings,sc)
end
function parsers.listitem(str)
return gmatch(str,"[^, ]+")
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util-fmt'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
utilities = utilities or { }
utilities.formatters = utilities.formatters or { }
local formatters = utilities.formatters
local concat, format = table.concat, string.format
local tostring, type = tostring, type
local strip = string.strip
local P, R, Cs = lpeg.P, lpeg.R, lpeg.Cs
local lpegmatch = lpeg.match
-- temporary here
local digit = R("09")
local period = P(".")
local zero = P("0")
local trailingzeros = zero^0 * -digit -- suggested by Roberto R
local case_1 = period * trailingzeros / ""
local case_2 = period * (digit - trailingzeros)^1 * (trailingzeros / "")
local number = digit^1 * (case_1 + case_2)
local stripper = Cs((number + 1)^0)
lpeg.patterns.stripzeros = stripper
function formatters.stripzeros(str)
return lpegmatch(stripper,str)
end
function formatters.formatcolumns(result,between)
if result and #result > 0 then
between = between or " "
local widths, numbers = { }, { }
local first = result[1]
local n = #first
for i=1,n do
widths[i] = 0
end
for i=1,#result do
local r = result[i]
for j=1,n do
local rj = r[j]
local tj = type(rj)
if tj == "number" then
numbers[j] = true
end
if tj ~= "string" then
rj = tostring(rj)
r[j] = rj
end
local w = #rj
if w > widths[j] then
widths[j] = w
end
end
end
for i=1,n do
local w = widths[i]
if numbers[i] then
if w > 80 then
widths[i] = "%s" .. between
else
widths[i] = "%0" .. w .. "i" .. between
end
else
if w > 80 then
widths[i] = "%s" .. between
elseif w > 0 then
widths[i] = "%-" .. w .. "s" .. between
else
widths[i] = "%s"
end
end
end
local template = strip(concat(widths))
for i=1,#result do
local str = format(template,unpack(result[i]))
result[i] = strip(str)
end
end
return result
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['util.deb'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- the <anonymous> tag is kind of generic and used for functions that are not
-- bound to a variable, like node.new, node.copy etc (contrary to for instance
-- node.has_attribute which is bound to a has_attribute local variable in mkiv)
local debug = require "debug"
local getinfo = debug.getinfo
local type, next, tostring = type, next, tostring
local format, find = string.format, string.find
local is_boolean = string.is_boolean
utilities = utilities or { }
utilities.debugger = utilities.debugger or { }
local debugger = utilities.debugger
local counters = { }
local names = { }
-- one
local function hook()
local f = getinfo(2) -- "nS"
if f then
local n = "unknown"
if f.what == "C" then
n = f.name or '<anonymous>'
if not names[n] then
names[n] = format("%42s",n)
end
else
-- source short_src linedefined what name namewhat nups func
n = f.name or f.namewhat or f.what
if not n or n == "" then
n = "?"
end
if not names[n] then
names[n] = format("%42s : % 5i : %s",n,f.linedefined or 0,f.short_src or "unknown source")
end
end
counters[n] = (counters[n] or 0) + 1
end
end
function debugger.showstats(printer,threshold) -- hm, something has changed, rubish now
printer = printer or texio.write or print
threshold = threshold or 0
local total, grandtotal, functions = 0, 0, 0
local dataset = { }
for name, count in next, counters do
dataset[#dataset+1] = { name, count }
end
table.sort(dataset,function(a,b) return a[2] == b[2] and b[1] > a[1] or a[2] > b[2] end)
for i=1,#dataset do
local d = dataset[i]
local name = d[1]
local count = d[2]
if count > threshold and not find(name,"for generator") then -- move up
printer(format("%8i %s\n", count, names[name]))
total = total + count
end
grandtotal = grandtotal + count
functions = functions + 1
end
printer("\n")
printer(format("functions : % 10i\n", functions))
printer(format("total : % 10i\n", total))
printer(format("grand total: % 10i\n", grandtotal))
printer(format("threshold : % 10i\n", threshold))
end
function debugger.savestats(filename,threshold)
local f = io.open(filename,'w')
if f then
debugger.showstats(function(str) f:write(str) end,threshold)
f:close()
end
end
function debugger.enable()
debug.sethook(hook,"c")
end
function debugger.disable()
debug.sethook()
end
local is_node = node and node.is_node
local is_lpeg = lpeg and lpeg.type
function inspect(i) -- global function
local ti = type(i)
if ti == "table" then
table.print(i,"table")
elseif is_node and is_node(i) then
table.print(nodes.astable(i),tostring(i))
elseif is_lpeg and is_lpeg(i) then
lpeg.print(i)
else
print(tostring(i))
end
end
-- from the lua book:
function traceback()
local level = 1
while true do
local info = debug.getinfo(level, "Sl")
if not info then
break
elseif info.what == "C" then
print(format("%3i : C function",level))
else
print(format("%3i : [%s]:%d",level,info.short_src,info.currentline))
end
level = level + 1
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['trac-inf'] = {
version = 1.001,
comment = "companion to trac-inf.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- As we want to protect the global tables, we no longer store the timing
-- in the tables themselves but in a hidden timers table so that we don't
-- get warnings about assignments. This is more efficient than using rawset
-- and rawget.
local format, lower = string.format, string.lower
local clock = os.gettimeofday or os.clock -- should go in environment
local write_nl = texio.write_nl
statistics = statistics or { }
local statistics = statistics
statistics.enable = true
statistics.threshold = 0.05
local statusinfo, n, registered, timers = { }, 0, { }, { }
local function hastiming(instance)
return instance and timers[instance]
end
local function resettiming(instance)
timers[instance or "notimer"] = { timing = 0, loadtime = 0 }
end
local function starttiming(instance)
local timer = timers[instance or "notimer"]
if not timer then
timer = { }
timers[instance or "notimer"] = timer
end
local it = timer.timing
if not it then
it = 0
end
if it == 0 then
timer.starttime = clock()
if not timer.loadtime then
timer.loadtime = 0
end
end
timer.timing = it + 1
end
local function stoptiming(instance, report)
local timer = timers[instance or "notimer"]
local it = timer.timing
if it > 1 then
timer.timing = it - 1
else
local starttime = timer.starttime
if starttime then
local stoptime = clock()
local loadtime = stoptime - starttime
timer.stoptime = stoptime
timer.loadtime = timer.loadtime + loadtime
if report then
statistics.report("load time %0.3f",loadtime)
end
timer.timing = 0
return loadtime
end
end
return 0
end
local function elapsedtime(instance)
local timer = timers[instance or "notimer"]
return format("%0.3f",timer and timer.loadtime or 0)
end
local function elapsedindeed(instance)
local timer = timers[instance or "notimer"]
return (timer and timer.loadtime or 0) > statistics.threshold
end
local function elapsedseconds(instance,rest) -- returns nil if 0 seconds
if elapsedindeed(instance) then
return format("%s seconds %s", elapsedtime(instance),rest or "")
end
end
statistics.hastiming = hastiming
statistics.resettiming = resettiming
statistics.starttiming = starttiming
statistics.stoptiming = stoptiming
statistics.elapsedtime = elapsedtime
statistics.elapsedindeed = elapsedindeed
statistics.elapsedseconds = elapsedseconds
-- general function
function statistics.register(tag,fnc)
if statistics.enable and type(fnc) == "function" then
local rt = registered[tag] or (#statusinfo + 1)
statusinfo[rt] = { tag, fnc }
registered[tag] = rt
if #tag > n then n = #tag end
end
end
function statistics.show(reporter)
if statistics.enable then
if not reporter then reporter = function(tag,data,n) write_nl(tag .. " " .. data) end end
-- this code will move
local register = statistics.register
register("luatex banner", function()
return lower(status.banner)
end)
register("control sequences", function()
return format("%s of %s", status.cs_count, status.hash_size+status.hash_extra)
end)
register("callbacks", function()
local total, indirect = status.callbacks or 0, status.indirect_callbacks or 0
return format("%s direct, %s indirect, %s total", total-indirect, indirect, total)
end)
collectgarbage("collect")
register("current memory usage", statistics.memused)
register("runtime",statistics.runtime)
for i=1,#statusinfo do
local s = statusinfo[i]
local r = s[2]()
if r then
reporter(s[1],r,n)
end
end
write_nl("") -- final newline
statistics.enable = false
end
end
local template, report_statistics, nn = nil, nil, 0 -- we only calcute it once
function statistics.showjobstat(tag,data,n)
if not logs then
-- sorry
elseif type(data) == "table" then
for i=1,#data do
statistics.showjobstat(tag,data[i],n)
end
else
if not template or n > nn then
template, n = format("%%-%ss - %%s",n), nn
report_statistics = logs.reporter("mkiv lua stats")
end
report_statistics(format(template,tag,data))
end
end
function statistics.memused() -- no math.round yet -)
local round = math.round or math.floor
return format("%s MB (ctx: %s MB)",round(collectgarbage("count")/1000), round(status.luastate_bytes/1000000))
end
starttiming(statistics)
function statistics.formatruntime(runtime) -- indirect so it can be overloaded and
return format("%s seconds", runtime) -- indeed that happens in cure-uti.lua
end
function statistics.runtime()
stoptiming(statistics)
return statistics.formatruntime(elapsedtime(statistics))
end
function statistics.timed(action,report)
report = report or logs.reporter("system")
starttiming("run")
action()
stoptiming("run")
report("total runtime: %s",elapsedtime("run"))
end
-- where, not really the best spot for this:
commands = commands or { }
function commands.resettimer(name)
resettiming(name or "whatever")
starttiming(name or "whatever")
end
function commands.elapsedtime(name)
stoptiming(name or "whatever")
context(elapsedtime(name or "whatever"))
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['trac-set'] = { -- might become util-set.lua
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local type, next, tostring = type, next, tostring
local concat = table.concat
local format, find, lower, gsub, escapedpattern = string.format, string.find, string.lower, string.gsub, string.escapedpattern
local is_boolean = string.is_boolean
local settings_to_hash = utilities.parsers.settings_to_hash
local allocate = utilities.storage.allocate
utilities = utilities or { }
local utilities = utilities
utilities.setters = utilities.setters or { }
local setters = utilities.setters
local data = { } -- maybe just local
-- We can initialize from the cnf file. This is sort of tricky as
-- later defined setters also need to be initialized then. If set
-- this way, we need to ensure that they are not reset later on.
local trace_initialize = false -- only for testing during development
function setters.initialize(filename,name,values) -- filename only for diagnostics
local setter = data[name]
if setter then
local data = setter.data
if data then
for key, value in next, values do
-- key = gsub(key,"_",".")
value = is_boolean(value,value)
local functions = data[key]
if functions then
if #functions > 0 and not functions.value then
if trace_initialize then
setter.report("executing %s (%s -> %s)",key,filename,tostring(value))
end
for i=1,#functions do
functions[i](value)
end
functions.value = value
else
if trace_initialize then
setter.report("skipping %s (%s -> %s)",key,filename,tostring(value))
end
end
else
-- we do a simple preregistration i.e. not in the
-- list as it might be an obsolete entry
functions = { default = value }
data[key] = functions
if trace_initialize then
setter.report("storing %s (%s -> %s)",key,filename,tostring(value))
end
end
end
return true
end
end
end
-- user interface code
local function set(t,what,newvalue)
local data, done = t.data, t.done
if type(what) == "string" then
what = settings_to_hash(what) -- inefficient but ok
end
if type(what) ~= "table" then
return
end
for w, value in next, what do
if value == "" then
value = newvalue
elseif not value then
value = false -- catch nil
else
value = is_boolean(value,value)
end
w = "^" .. escapedpattern(w,true) .. "$" -- new: anchored
for name, functions in next, data do
if done[name] then
-- prevent recursion due to wildcards
elseif find(name,w) then
done[name] = true
for i=1,#functions do
functions[i](value)
end
functions.value = value
end
end
end
end
local function reset(t)
for name, functions in next, t.data do
for i=1,#functions do
functions[i](false)
end
functions.value = false
end
end
local function enable(t,what)
set(t,what,true)
end
local function disable(t,what)
local data = t.data
if not what or what == "" then
t.done = { }
reset(t)
else
set(t,what,false)
end
end
function setters.register(t,what,...)
local data = t.data
what = lower(what)
local functions = data[what]
if not functions then
functions = { }
data[what] = functions
if trace_initialize then
t.report("defining %s",what)
end
end
local default = functions.default -- can be set from cnf file
for _, fnc in next, { ... } do
local typ = type(fnc)
if typ == "string" then
if trace_initialize then
t.report("coupling %s to %s",what,fnc)
end
local s = fnc -- else wrong reference
fnc = function(value) set(t,s,value) end
elseif typ ~= "function" then
fnc = nil
end
if fnc then
functions[#functions+1] = fnc
-- default: set at command line or in cnf file
-- value : set in tex run (needed when loading runtime)
local value = functions.value or default
if value ~= nil then
fnc(value)
functions.value = value
end
end
end
return false -- so we can use it in an assignment
end
function setters.enable(t,what)
local e = t.enable
t.enable, t.done = enable, { }
enable(t,what)
t.enable, t.done = e, { }
end
function setters.disable(t,what)
local e = t.disable
t.disable, t.done = disable, { }
disable(t,what)
t.disable, t.done = e, { }
end
function setters.reset(t)
t.done = { }
reset(t)
end
function setters.list(t) -- pattern
local list = table.sortedkeys(t.data)
local user, system = { }, { }
for l=1,#list do
local what = list[l]
if find(what,"^%*") then
system[#system+1] = what
else
user[#user+1] = what
end
end
return user, system
end
function setters.show(t)
local category = t.name
local list = setters.list(t)
t.report()
for k=1,#list do
local name = list[k]
local functions = t.data[name]
if functions then
local value, default, modules = functions.value, functions.default, #functions
value = value == nil and "unset" or tostring(value)
default = default == nil and "unset" or tostring(default)
t.report("%-30s modules: %2i default: %6s value: %6s",name,modules,default,value)
end
end
t.report()
end
-- we could have used a bit of oo and the trackers:enable syntax but
-- there is already a lot of code around using the singular tracker
-- we could make this into a module but we also want the rest avaliable
local enable, disable, register, list, show = setters.enable, setters.disable, setters.register, setters.list, setters.show
local function report(setter,...)
local report = logs and logs.report
if report then
report(setter.name,...)
else -- fallback, as this module is loaded before the logger
write_nl(format("%-15s : %s\n",setter.name,format(...)))
end
end
function setters.new(name)
local setter -- we need to access it in setter itself
setter = {
data = allocate(), -- indexed, but also default and value fields
name = name,
report = function(...) report (setter,...) end,
enable = function(...) enable (setter,...) end,
disable = function(...) disable (setter,...) end,
register = function(...) register(setter,...) end,
list = function(...) list (setter,...) end,
show = function(...) show (setter,...) end,
}
data[name] = setter
return setter
end
trackers = setters.new("trackers")
directives = setters.new("directives")
experiments = setters.new("experiments")
local t_enable, t_disable, t_report = trackers .enable, trackers .disable, trackers .report
local d_enable, d_disable, d_report = directives .enable, directives .disable, directives .report
local e_enable, e_disable, e_report = experiments.enable, experiments.disable, experiments.report
-- nice trick: we overload two of the directives related functions with variants that
-- do tracing (itself using a tracker) .. proof of concept
local trace_directives = false local trace_directives = false trackers.register("system.directives", function(v) trace_directives = v end)
local trace_experiments = false local trace_experiments = false trackers.register("system.experiments", function(v) trace_experiments = v end)
function directives.enable(...)
if trace_directives then
d_report("enabling: %s",concat({...}," "))
end
d_enable(...)
end
function directives.disable(...)
if trace_directives then
d_report("disabling: %s",concat({...}," "))
end
d_disable(...)
end
function experiments.enable(...)
if trace_experiments then
e_report("enabling: %s",concat({...}," "))
end
e_enable(...)
end
function experiments.disable(...)
if trace_experiments then
e_report("disabling: %s",concat({...}," "))
end
e_disable(...)
end
-- a useful example
directives.register("system.nostatistics", function(v)
statistics.enable = not v
end)
directives.register("system.nolibraries", function(v)
libraries = nil -- we discard this tracing for security
end)
-- experiment
local flags = environment and environment.engineflags
if flags then
if trackers and flags.trackers then
setters.initialize("flags","trackers", settings_to_hash(flags.trackers))
-- t_enable(flags.trackers)
end
if directives and flags.directives then
setters.initialize("flags","directives", settings_to_hash(flags.directives))
-- d_enable(flags.directives)
end
end
-- here
if texconfig then
local function set(k,v)
v = tonumber(v)
if v then
texconfig[k] = v
end
end
directives.register("luatex.expanddepth", function(v) set("expand_depth",v) end)
directives.register("luatex.hashextra", function(v) set("hash_extra",v) end)
directives.register("luatex.nestsize", function(v) set("nest_size",v) end)
directives.register("luatex.maxinopen", function(v) set("max_in_open",v) end)
directives.register("luatex.maxprintline", function(v) set("max_print_line",v) end)
directives.register("luatex.maxstrings", function(v) set("max_strings",v) end)
directives.register("luatex.paramsize", function(v) set("param_size",v) end)
directives.register("luatex.savesize", function(v) set("save_size",v) end)
directives.register("luatex.stacksize", function(v) set("stack_size",v) end)
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['trac-log'] = {
version = 1.001,
comment = "companion to trac-log.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- todo: less categories, more subcategories (e.g. nodes)
local write_nl, write = texio and texio.write_nl or print, texio and texio.write or io.write
local format, gmatch, find = string.format, string.gmatch, string.find
local concat, insert, remove = table.concat, table.insert, table.remove
local escapedpattern = string.escapedpattern
local texcount = tex and tex.count
local next, type = next, type
local setmetatableindex = table.setmetatableindex
--[[ldx--
<p>This is a prelude to a more extensive logging module. We no longer
provide <l n='xml'/> based logging a sparsing is relatively easy anyway.</p>
--ldx]]--
logs = logs or { }
local logs = logs
local moreinfo = [[
More information about ConTeXt and the tools that come with it can be found at:
maillist : ntg-context@ntg.nl / http://www.ntg.nl/mailman/listinfo/ntg-context
webpage : http://www.pragma-ade.nl / http://tex.aanhet.net
wiki : http://contextgarden.net
]]
-- basic loggers
local function ignore() end
setmetatableindex(logs, function(t,k) t[k] = ignore ; return ignore end)
local report, subreport, status, settarget, setformats, settranslations
local direct, subdirect, writer, pushtarget, poptarget
if tex and (tex.jobname or tex.formatname) then
local valueiskey = { __index = function(t,k) t[k] = k return k end } -- will be helper
local target = "term and log"
logs.flush = io.flush
local formats = { } setmetatable(formats, valueiskey)
local translations = { } setmetatable(translations,valueiskey)
writer = function(...)
write_nl(target,...)
end
newline = function()
write_nl(target,"\n")
end
report = function(a,b,c,...)
if c then
write_nl(target,format("%-15s > %s\n",translations[a],format(formats[b],c,...)))
elseif b then
write_nl(target,format("%-15s > %s\n",translations[a],formats[b]))
elseif a then
write_nl(target,format("%-15s >\n", translations[a]))
else
write_nl(target,"\n")
end
end
direct = function(a,b,c,...)
if c then
return format("%-15s > %s",translations[a],format(formats[b],c,...))
elseif b then
return format("%-15s > %s",translations[a],formats[b])
elseif a then
return format("%-15s >", translations[a])
else
return ""
end
end
subreport = function(a,s,b,c,...)
if c then
write_nl(target,format("%-15s > %s > %s\n",translations[a],translations[s],format(formats[b],c,...)))
elseif b then
write_nl(target,format("%-15s > %s > %s\n",translations[a],translations[s],formats[b]))
elseif a then
write_nl(target,format("%-15s > %s >\n", translations[a],translations[s]))
else
write_nl(target,"\n")
end
end
subdirect = function(a,s,b,c,...)
if c then
return format("%-15s > %s > %s",translations[a],translations[s],format(formats[b],c,...))
elseif b then
return format("%-15s > %s > %s",translations[a],translations[s],formats[b])
elseif a then
return format("%-15s > %s >", translations[a],translations[s])
else
return ""
end
end
status = function(a,b,c,...)
if c then
write_nl(target,format("%-15s : %s\n",translations[a],format(formats[b],c,...)))
elseif b then
write_nl(target,format("%-15s : %s\n",translations[a],formats[b]))
elseif a then
write_nl(target,format("%-15s :\n", translations[a]))
else
write_nl(target,"\n")
end
end
local targets = {
logfile = "log",
log = "log",
file = "log",
console = "term",
terminal = "term",
both = "term and log",
}
settarget = function(whereto)
target = targets[whereto or "both"] or targets.both
if target == "term" or target == "term and log" then
logs.flush = io.flush
else
logs.flush = ignore
end
end
local stack = { }
pushtarget = function(newtarget)
insert(stack,target)
settarget(newtarget)
end
poptarget = function()
if #stack > 0 then
settarget(remove(stack))
end
end
setformats = function(f)
formats = f
end
settranslations = function(t)
translations = t
end
else
logs.flush = ignore
writer = write_nl
newline = function()
write_nl("\n")
end
report = function(a,b,c,...)
if c then
write_nl(format("%-15s | %s",a,format(b,c,...)))
elseif b then
write_nl(format("%-15s | %s",a,b))
elseif a then
write_nl(format("%-15s |", a))
else
write_nl("")
end
end
subreport = function(a,sub,b,c,...)
if c then
write_nl(format("%-15s | %s | %s",a,sub,format(b,c,...)))
elseif b then
write_nl(format("%-15s | %s | %s",a,sub,b))
elseif a then
write_nl(format("%-15s | %s |", a,sub))
else
write_nl("")
end
end
status = function(a,b,c,...) -- not to be used in lua anyway
if c then
write_nl(format("%-15s : %s\n",a,format(b,c,...)))
elseif b then
write_nl(format("%-15s : %s\n",a,b)) -- b can have %'s
elseif a then
write_nl(format("%-15s :\n", a))
else
write_nl("\n")
end
end
direct = ignore
subdirect = ignore
settarget = ignore
pushtarget = ignore
poptarget = ignore
setformats = ignore
settranslations = ignore
end
logs.report = report
logs.subreport = subreport
logs.status = status
logs.settarget = settarget
logs.pushtarget = pushtarget
logs.poptarget = poptarget
logs.setformats = setformats
logs.settranslations = settranslations
logs.direct = direct
logs.subdirect = subdirect
logs.writer = writer
logs.newline = newline
-- installer
-- todo: renew (un) locks when a new one is added and wildcard
local data, states = { }, nil
function logs.reporter(category,subcategory)
local logger = data[category]
if not logger then
local state = false
if states == true then
state = true
elseif type(states) == "table" then
for c, _ in next, states do
if find(category,c) then
state = true
break
end
end
end
logger = {
reporters = { },
state = state,
}
data[category] = logger
end
local reporter = logger.reporters[subcategory or "default"]
if not reporter then
if subcategory then
reporter = function(...)
if not logger.state then
subreport(category,subcategory,...)
end
end
logger.reporters[subcategory] = reporter
else
local tag = category
reporter = function(...)
if not logger.state then
report(category,...)
end
end
logger.reporters.default = reporter
end
end
return reporter
end
logs.new = logs.reporter -- for old times sake
-- context specicific: this ends up in the macro stream
local ctxreport = logs.writer
function logs.setmessenger(m)
ctxreport = m
end
function logs.messenger(category,subcategory)
-- we need to avoid catcode mess (todo: fast context)
if subcategory then
return function(...)
ctxreport(subdirect(category,subcategory,...))
end
else
return function(...)
ctxreport(direct(category,...))
end
end
end
-- so far
local function setblocked(category,value)
if category == true then
-- lock all
category, value = "*", true
elseif category == false then
-- unlock all
category, value = "*", false
elseif value == nil then
-- lock selective
value = true
end
if category == "*" then
states = value
for k, v in next, data do
v.state = value
end
else
states = utilities.parsers.settings_to_hash(category)
for c, _ in next, states do
if data[c] then
v.state = value
else
c = escapedpattern(c,true)
for k, v in next, data do
if find(k,c) then
v.state = value
end
end
end
end
end
end
function logs.disable(category,value)
setblocked(category,value == nil and true or value)
end
function logs.enable(category)
setblocked(category,false)
end
function logs.categories()
return table.sortedkeys(data)
end
function logs.show()
local n, c, s, max = 0, 0, 0, 0
for category, v in table.sortedpairs(data) do
n = n + 1
local state = v.state
local reporters = v.reporters
local nc = #category
if nc > c then
c = nc
end
for subcategory, _ in next, reporters do
local ns = #subcategory
if ns > c then
s = ns
end
local m = nc + ns
if m > max then
max = m
end
end
local subcategories = concat(table.sortedkeys(reporters),", ")
if state == true then
state = "disabled"
elseif state == false then
state = "enabled"
else
state = "unknown"
end
-- no new here
report("logging","category: '%s', subcategories: '%s', state: '%s'",category,subcategories,state)
end
report("logging","categories: %s, max category: %s, max subcategory: %s, max combined: %s",n,c,s,max)
end
directives.register("logs.blocked", function(v)
setblocked(v,true)
end)
directives.register("logs.target", function(v)
settarget(v)
end)
-- tex specific loggers (might move elsewhere)
local report_pages = logs.reporter("pages") -- not needed but saves checking when we grep for it
local real, user, sub
function logs.start_page_number()
real, user, sub = texcount.realpageno, texcount.userpageno, texcount.subpageno
end
local timing = false
local starttime = nil
local lasttime = nil
trackers.register("pages.timing", function(v) -- only for myself (diagnostics)
starttime = os.clock()
timing = true
end)
function logs.stop_page_number() -- the first page can includes the initialization so we omit this in average
if timing then
local elapsed, average
local stoptime = os.clock()
if not lasttime or real < 2 then
elapsed = stoptime
average = stoptime
starttime = stoptime
else
elapsed = stoptime - lasttime
average = (stoptime - starttime) / (real - 1)
end
lasttime = stoptime
if real > 0 then
if user > 0 then
if sub > 0 then
report_pages("flushing realpage %s, userpage %s, subpage %s, time %0.04f / %0.04f",real,user,sub,elapsed,average)
else
report_pages("flushing realpage %s, userpage %s, time %0.04f / %0.04f",real,user,elapsed,average)
end
else
report_pages("flushing realpage %s, time %0.04f / %0.04f",real,elapsed,average)
end
else
report_pages("flushing page, time %0.04f / %0.04f",elapsed,average)
end
else
if real > 0 then
if user > 0 then
if sub > 0 then
report_pages("flushing realpage %s, userpage %s, subpage %s",real,user,sub)
else
report_pages("flushing realpage %s, userpage %s",real,user)
end
else
report_pages("flushing realpage %s",real)
end
else
report_pages("flushing page")
end
end
logs.flush()
end
logs.report_job_stat = statistics and statistics.showjobstat
local report_files = logs.reporter("files")
local nesting = 0
local verbose = false
local hasscheme = url.hasscheme
-- we don't have show_open and show_close callbacks yet
function logs.show_open(name)
-- if hasscheme(name) ~= "virtual" then
-- if verbose then
-- nesting = nesting + 1
-- report_files("level %s, opening %s",nesting,name)
-- else
-- write(format("(%s",name)) -- tex adds a space
-- end
-- end
end
function logs.show_close(name)
-- if hasscheme(name) ~= "virtual" then
-- if verbose then
-- report_files("level %s, closing %s",nesting,name)
-- nesting = nesting - 1
-- else
-- write(")") -- tex adds a space
-- end
-- end
end
function logs.show_load(name)
-- if hasscheme(name) ~= "virtual" then
-- if verbose then
-- report_files("level %s, loading %s",nesting+1,name)
-- else
-- write(format("(%s)",name))
-- end
-- end
end
-- there may be scripts out there using this:
local simple = logs.reporter("comment")
logs.simple = simple
logs.simpleline = simple
-- obsolete
function logs.setprogram () end -- obsolete
function logs.extendbanner() end -- obsolete
function logs.reportlines () end -- obsolete
function logs.reportbanner() end -- obsolete
function logs.reportline () end -- obsolete
function logs.simplelines () end -- obsolete
function logs.help () end -- obsolete
-- applications
local function reportlines(t,str)
if str then
for line in gmatch(str,"(.-)[\n\r]") do
t.report(line)
end
end
end
local function reportbanner(t)
local banner = t.banner
if banner then
t.report(banner)
t.report()
end
end
local function reporthelp(t,...)
local helpinfo = t.helpinfo
if type(helpinfo) == "string" then
reportlines(t,helpinfo)
elseif type(helpinfo) == "table" then
local tags = { ... }
for i=1,#tags do
reportlines(t,t.helpinfo[tags[i]])
if i < #tags then
t.report()
end
end
end
end
local function reportinfo(t)
t.report()
reportlines(t,moreinfo)
end
function logs.application(t)
t.name = t.name or "unknown"
t.banner = t.banner
t.report = logs.reporter(t.name)
t.help = function(...) reportbanner(t) ; reporthelp(t,...) ; reportinfo(t) end
t.identify = function() reportbanner(t) end
return t
end
-- somewhat special
-- logging to a file
function logs.system(whereto,process,jobname,category,...)
local message = format("%s %s => %s => %s => %s\r",os.date("%d/%m/%y %H:%m:%S"),process,jobname,category,format(...))
for i=1,10 do
local f = io.open(whereto,"a") -- we can consider keepint the file open
if f then
f:write(message)
f:close()
break
else
sleep(0.1)
end
end
end
local report_system = logs.reporter("system","logs")
function logs.obsolete(old,new)
local o = loadstring("return " .. new)()
if type(o) == "function" then
return function(...)
report_system("function %s is obsolete, use %s",old,new)
loadstring(old .. "=" .. new .. " return ".. old)()(...)
end
elseif type(o) == "table" then
local t, m = { }, { }
m.__index = function(t,k)
report_system("table %s is obsolete, use %s",old,new)
m.__index, m.__newindex = o, o
return o[k]
end
m.__newindex = function(t,k,v)
report_system("table %s is obsolete, use %s",old,new)
m.__index, m.__newindex = o, o
o[k] = v
end
if libraries then
libraries.obsolete[old] = t -- true
end
setmetatable(t,m)
return t
end
end
if utilities then
utilities.report = report_system
end
if tex and tex.error then
function logs.texerrormessage(...) -- for the moment we put this function here
tex.error(format(...), { })
end
else
function logs.texerrormessage(...)
print(format(...))
end
end
-- do we still need io.flush then?
io.stdout:setvbuf('no')
io.stderr:setvbuf('no')
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['trac-pro'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local getmetatable, setmetatable, rawset, type = getmetatable, setmetatable, rawset, type
-- The protection implemented here is probably not that tight but good enough to catch
-- problems due to naive usage.
--
-- There's a more extensive version (trac-xxx.lua) that supports nesting.
--
-- This will change when we have _ENV in lua 5.2+
local trace_namespaces = false trackers.register("system.namespaces", function(v) trace_namespaces = v end)
local report_system = logs.reporter("system","protection")
namespaces = namespaces or { }
local namespaces = namespaces
local registered = { }
local function report_index(k,name)
if trace_namespaces then
report_system("reference to '%s' in protected namespace '%s', %s",k,name,debug.traceback())
else
report_system("reference to '%s' in protected namespace '%s'",k,name)
end
end
local function report_newindex(k,name)
if trace_namespaces then
report_system("assignment to '%s' in protected namespace '%s', %s",k,name,debug.traceback())
else
report_system("assignment to '%s' in protected namespace '%s'",k,name)
end
end
local function register(name)
local data = name == "global" and _G or _G[name]
if not data then
return -- error
end
registered[name] = data
local m = getmetatable(data)
if not m then
m = { }
setmetatable(data,m)
end
local index, newindex = { }, { }
m.__saved__index = m.__index
m.__no__index = function(t,k)
if not index[k] then
index[k] = true
report_index(k,name)
end
return nil
end
m.__saved__newindex = m.__newindex
m.__no__newindex = function(t,k,v)
if not newindex[k] then
newindex[k] = true
report_newindex(k,name)
end
rawset(t,k,v)
end
m.__protection__depth = 0
end
local function private(name) -- maybe save name
local data = registered[name]
if not data then
data = _G[name]
if not data then
data = { }
_G[name] = data
end
register(name)
end
return data
end
local function protect(name)
local data = registered[name]
if not data then
return
end
local m = getmetatable(data)
local pd = m.__protection__depth
if pd > 0 then
m.__protection__depth = pd + 1
else
m.__save_d_index, m.__saved__newindex = m.__index, m.__newindex
m.__index, m.__newindex = m.__no__index, m.__no__newindex
m.__protection__depth = 1
end
end
local function unprotect(name)
local data = registered[name]
if not data then
return
end
local m = getmetatable(data)
local pd = m.__protection__depth
if pd > 1 then
m.__protection__depth = pd - 1
else
m.__index, m.__newindex = m.__saved__index, m.__saved__newindex
m.__protection__depth = 0
end
end
local function protectall()
for name, _ in next, registered do
if name ~= "global" then
protect(name)
end
end
end
local function unprotectall()
for name, _ in next, registered do
if name ~= "global" then
unprotect(name)
end
end
end
namespaces.register = register -- register when defined
namespaces.private = private -- allocate and register if needed
namespaces.protect = protect
namespaces.unprotect = unprotect
namespaces.protectall = protectall
namespaces.unprotectall = unprotectall
namespaces.private("namespaces") registered = { } register("global") -- unreachable
directives.register("system.protect", function(v)
if v then
protectall()
else
unprotectall()
end
end)
directives.register("system.checkglobals", function(v)
if v then
report_system("enabling global namespace guard")
protect("global")
else
report_system("disabling global namespace guard")
unprotect("global")
end
end)
-- dummy section (will go to luat-dum.lua)
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['luat-env'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- A former version provided functionality for non embeded core
-- scripts i.e. runtime library loading. Given the amount of
-- Lua code we use now, this no longer makes sense. Much of this
-- evolved before bytecode arrays were available and so a lot of
-- code has disappeared already.
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_lua = logs.reporter("resolvers","lua")
local allocate, mark = utilities.storage.allocate, utilities.storage.mark
local format, sub, match, gsub, find = string.format, string.sub, string.match, string.gsub, string.find
local unquoted, quoted = string.unquoted, string.quoted
local concat = table.concat
-- precautions
os.setlocale(nil,nil) -- useless feature and even dangerous in luatex
function os.setlocale()
-- no way you can mess with it
end
-- dirty tricks
if arg and (arg[0] == 'luatex' or arg[0] == 'luatex.exe') and arg[1] == "--luaonly" then
arg[-1] = arg[0]
arg[ 0] = arg[2]
for k=3,#arg do
arg[k-2] = arg[k]
end
arg[#arg] = nil -- last
arg[#arg] = nil -- pre-last
end
-- environment
environment = environment or { }
local environment = environment
environment.arguments = allocate()
environment.files = allocate()
environment.sortedflags = nil
local mt = {
__index = function(_,k)
if k == "version" then
local version = tex.toks and tex.toks.contextversiontoks
if version and version ~= "" then
rawset(environment,"version",version)
return version
else
return "unknown"
end
elseif k == "jobname" or k == "formatname" then
local name = tex and tex[k]
if name or name== "" then
rawset(environment,k,name)
return name
else
return "unknown"
end
elseif k == "outputfilename" then
local name = environment.jobname
rawset(environment,k,name)
return name
end
end
}
setmetatable(environment,mt)
function environment.initializearguments(arg)
local arguments, files = { }, { }
environment.arguments, environment.files, environment.sortedflags = arguments, files, nil
for index=1,#arg do
local argument = arg[index]
if index > 0 then
local flag, value = match(argument,"^%-+(.-)=(.-)$")
if flag then
arguments[flag] = unquoted(value or "")
else
flag = match(argument,"^%-+(.+)")
if flag then
arguments[flag] = true
else
files[#files+1] = argument
end
end
end
end
environment.ownname = environment.ownname or arg[0] or 'unknown.lua'
end
function environment.setargument(name,value)
environment.arguments[name] = value
end
-- todo: defaults, better checks e.g on type (boolean versus string)
--
-- tricky: too many hits when we support partials unless we add
-- a registration of arguments so from now on we have 'partial'
function environment.argument(name,partial)
local arguments, sortedflags = environment.arguments, environment.sortedflags
if arguments[name] then
return arguments[name]
elseif partial then
if not sortedflags then
sortedflags = allocate(table.sortedkeys(arguments))
for k=1,#sortedflags do
sortedflags[k] = "^" .. sortedflags[k]
end
environment.sortedflags = sortedflags
end
-- example of potential clash: ^mode ^modefile
for k=1,#sortedflags do
local v = sortedflags[k]
if find(name,v) then
return arguments[sub(v,2,#v)]
end
end
end
return nil
end
function environment.splitarguments(separator) -- rather special, cut-off before separator
local done, before, after = false, { }, { }
local originalarguments = environment.originalarguments
for k=1,#originalarguments do
local v = originalarguments[k]
if not done and v == separator then
done = true
elseif done then
after[#after+1] = v
else
before[#before+1] = v
end
end
return before, after
end
function environment.reconstructcommandline(arg,noquote)
arg = arg or environment.originalarguments
if noquote and #arg == 1 then
-- we could just do: return unquoted(resolvers.resolve(arg[i]))
local a = arg[1]
a = resolvers.resolve(a)
a = unquoted(a)
return a
elseif #arg > 0 then
local result = { }
for i=1,#arg do
-- we could just do: result[#result+1] = format("%q",unquoted(resolvers.resolve(arg[i])))
local a = arg[i]
a = resolvers.resolve(a)
a = unquoted(a)
a = gsub(a,'"','\\"') -- tricky
if find(a," ") then
result[#result+1] = quoted(a)
else
result[#result+1] = a
end
end
return concat(result," ")
else
return ""
end
end
if arg then
-- new, reconstruct quoted snippets (maybe better just remove the " then and add them later)
local newarg, instring = { }, false
for index=1,#arg do
local argument = arg[index]
if find(argument,"^\"") then
newarg[#newarg+1] = gsub(argument,"^\"","")
if not find(argument,"\"$") then
instring = true
end
elseif find(argument,"\"$") then
newarg[#newarg] = newarg[#newarg] .. " " .. gsub(argument,"\"$","")
instring = false
elseif instring then
newarg[#newarg] = newarg[#newarg] .. " " .. argument
else
newarg[#newarg+1] = argument
end
end
for i=1,-5,-1 do
newarg[i] = arg[i]
end
environment.initializearguments(newarg)
environment.originalarguments = mark(newarg)
environment.rawarguments = mark(arg)
arg = { } -- prevent duplicate handling
end
-- weird place ... depends on a not yet loaded module
function environment.texfile(filename)
return resolvers.findfile(filename,'tex')
end
function environment.luafile(filename)
local resolved = resolvers.findfile(filename,'tex') or ""
if resolved ~= "" then
return resolved
end
resolved = resolvers.findfile(filename,'texmfscripts') or ""
if resolved ~= "" then
return resolved
end
return resolvers.findfile(filename,'luatexlibs') or ""
end
environment.loadedluacode = loadfile -- can be overloaded
function environment.luafilechunk(filename,silent) -- used for loading lua bytecode in the format
filename = file.replacesuffix(filename, "lua")
local fullname = environment.luafile(filename)
if fullname and fullname ~= "" then
local data = environment.loadedluacode(fullname)
if trace_locating then
report_lua("loading file %s%s", fullname, not data and " failed" or "")
elseif not silent then
texio.write("<",data and "+ " or "- ",fullname,">")
end
return data
else
if trace_locating then
report_lua("unknown file %s", filename)
end
return nil
end
end
-- the next ones can use the previous ones / combine
function environment.loadluafile(filename, version)
local lucname, luaname, chunk
local basename = file.removesuffix(filename)
if basename == filename then
lucname, luaname = basename .. ".luc", basename .. ".lua"
else
lucname, luaname = nil, basename -- forced suffix
end
-- when not overloaded by explicit suffix we look for a luc file first
local fullname = (lucname and environment.luafile(lucname)) or ""
if fullname ~= "" then
if trace_locating then
report_lua("loading %s", fullname)
end
chunk = loadfile(fullname) -- this way we don't need a file exists check
end
if chunk then
assert(chunk)()
if version then
-- we check of the version number of this chunk matches
local v = version -- can be nil
if modules and modules[filename] then
v = modules[filename].version -- new method
elseif versions and versions[filename] then
v = versions[filename] -- old method
end
if v == version then
return true
else
if trace_locating then
report_lua("version mismatch for %s: lua=%s, luc=%s", filename, v, version)
end
environment.loadluafile(filename)
end
else
return true
end
end
fullname = (luaname and environment.luafile(luaname)) or ""
if fullname ~= "" then
if trace_locating then
report_lua("loading %s", fullname)
end
chunk = loadfile(fullname) -- this way we don't need a file exists check
if not chunk then
if trace_locating then
report_lua("unknown file %s", filename)
end
else
assert(chunk)()
return true
end
end
return false
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['lxml-tab'] = {
version = 1.001,
comment = "this module is the basis for the lxml-* ones",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- this module needs a cleanup: check latest lpeg, passing args, (sub)grammar, etc etc
-- stripping spaces from e.g. cont-en.xml saves .2 sec runtime so it's not worth the
-- trouble
local trace_entities = false trackers.register("xml.entities", function(v) trace_entities = v end)
local report_xml = logs and logs.reporter("xml","core") or function(...) print(format(...)) end
--[[ldx--
<p>The parser used here is inspired by the variant discussed in the lua book, but
handles comment and processing instructions, has a different structure, provides
parent access; a first version used different trickery but was less optimized to we
went this route. First we had a find based parser, now we have an <l n='lpeg'/> based one.
The find based parser can be found in l-xml-edu.lua along with other older code.</p>
<p>Beware, the interface may change. For instance at, ns, tg, dt may get more
verbose names. Once the code is stable we will also remove some tracing and
optimize the code.</p>
<p>I might even decide to reimplement the parser using the latest <l n='lpeg'/> trickery
as the current variant was written when <l n='lpeg'/> showed up and it's easier now to
build tables in one go.</p>
--ldx]]--
xml = xml or { }
local xml = xml
local utf = unicode.utf8
local concat, remove, insert = table.concat, table.remove, table.insert
local type, next, setmetatable, getmetatable, tonumber = type, next, setmetatable, getmetatable, tonumber
local format, lower, find, match, gsub = string.format, string.lower, string.find, string.match, string.gsub
local utfchar, utffind, utfgsub = utf.char, utf.find, utf.gsub
local lpegmatch = lpeg.match
local P, S, R, C, V, C, Cs = lpeg.P, lpeg.S, lpeg.R, lpeg.C, lpeg.V, lpeg.C, lpeg.Cs
--[[ldx--
<p>First a hack to enable namespace resolving. A namespace is characterized by
a <l n='url'/>. The following function associates a namespace prefix with a
pattern. We use <l n='lpeg'/>, which in this case is more than twice as fast as a
find based solution where we loop over an array of patterns. Less code and
much cleaner.</p>
--ldx]]--
xml.xmlns = xml.xmlns or { }
local check = P(false)
local parse = check
--[[ldx--
<p>The next function associates a namespace prefix with an <l n='url'/>. This
normally happens independent of parsing.</p>
<typing>
xml.registerns("mml","mathml")
</typing>
--ldx]]--
function xml.registerns(namespace, pattern) -- pattern can be an lpeg
check = check + C(P(lower(pattern))) / namespace
parse = P { P(check) + 1 * V(1) }
end
--[[ldx--
<p>The next function also registers a namespace, but this time we map a
given namespace prefix onto a registered one, using the given
<l n='url'/>. This used for attributes like <t>xmlns:m</t>.</p>
<typing>
xml.checkns("m","http://www.w3.org/mathml")
</typing>
--ldx]]--
function xml.checkns(namespace,url)
local ns = lpegmatch(parse,lower(url))
if ns and namespace ~= ns then
xml.xmlns[namespace] = ns
end
end
--[[ldx--
<p>Next we provide a way to turn an <l n='url'/> into a registered
namespace. This used for the <t>xmlns</t> attribute.</p>
<typing>
resolvedns = xml.resolvens("http://www.w3.org/mathml")
</typing>
This returns <t>mml</t>.
--ldx]]--
function xml.resolvens(url)
return lpegmatch(parse,lower(url)) or ""
end
--[[ldx--
<p>A namespace in an element can be remapped onto the registered
one efficiently by using the <t>xml.xmlns</t> table.</p>
--ldx]]--
--[[ldx--
<p>This version uses <l n='lpeg'/>. We follow the same approach as before, stack and top and
such. This version is about twice as fast which is mostly due to the fact that
we don't have to prepare the stream for cdata, doctype etc etc. This variant is
is dedicated to Luigi Scarso, who challenged me with 40 megabyte <l n='xml'/> files that
took 12.5 seconds to load (1.5 for file io and the rest for tree building). With
the <l n='lpeg'/> implementation we got that down to less 7.3 seconds. Loading the 14
<l n='context'/> interface definition files (2.6 meg) went down from 1.05 seconds to 0.55.</p>
<p>Next comes the parser. The rather messy doctype definition comes in many
disguises so it is no surprice that later on have to dedicate quite some
<l n='lpeg'/> code to it.</p>
<typing>
<!DOCTYPE Something PUBLIC "... ..." "..." [ ... ] >
<!DOCTYPE Something PUBLIC "... ..." "..." >
<!DOCTYPE Something SYSTEM "... ..." [ ... ] >
<!DOCTYPE Something SYSTEM "... ..." >
<!DOCTYPE Something [ ... ] >
<!DOCTYPE Something >
</typing>
<p>The code may look a bit complex but this is mostly due to the fact that we
resolve namespaces and attach metatables. There is only one public function:</p>
<typing>
local x = xml.convert(somestring)
</typing>
<p>An optional second boolean argument tells this function not to create a root
element.</p>
<p>Valid entities are:</p>
<typing>
<!ENTITY xxxx SYSTEM "yyyy" NDATA zzzz>
<!ENTITY xxxx PUBLIC "yyyy" >
<!ENTITY xxxx "yyyy" >
</typing>
--ldx]]--
-- not just one big nested table capture (lpeg overflow)
local nsremap, resolvens = xml.xmlns, xml.resolvens
local stack = { }
local top = { }
local dt = { }
local at = { }
local xmlns = { }
local errorstr = nil
local entities = { }
local strip = false
local cleanup = false
local utfize = false
local resolve_predefined = false
local unify_predefined = false
local dcache = { }
local hcache = { }
local acache = { }
local mt = { }
local function initialize_mt(root)
mt = { __index = root } -- will be redefined later
end
function xml.setproperty(root,k,v)
getmetatable(root).__index[k] = v
end
function xml.checkerror(top,toclose)
return "" -- can be set
end
local function add_attribute(namespace,tag,value)
if cleanup and #value > 0 then
value = cleanup(value) -- new
end
if tag == "xmlns" then
xmlns[#xmlns+1] = resolvens(value)
at[tag] = value
elseif namespace == "" then
at[tag] = value
elseif namespace == "xmlns" then
xml.checkns(tag,value)
at["xmlns:" .. tag] = value
else
-- for the moment this way:
at[namespace .. ":" .. tag] = value
end
end
local function add_empty(spacing, namespace, tag)
if #spacing > 0 then
dt[#dt+1] = spacing
end
local resolved = (namespace == "" and xmlns[#xmlns]) or nsremap[namespace] or namespace
top = stack[#stack]
dt = top.dt
local t = { ns=namespace or "", rn=resolved, tg=tag, at=at, dt={}, __p__ = top }
dt[#dt+1] = t
setmetatable(t, mt)
if at.xmlns then
remove(xmlns)
end
at = { }
end
local function add_begin(spacing, namespace, tag)
if #spacing > 0 then
dt[#dt+1] = spacing
end
local resolved = (namespace == "" and xmlns[#xmlns]) or nsremap[namespace] or namespace
top = { ns=namespace or "", rn=resolved, tg=tag, at=at, dt={}, __p__ = stack[#stack] }
setmetatable(top, mt)
dt = top.dt
stack[#stack+1] = top
at = { }
end
local function add_end(spacing, namespace, tag)
if #spacing > 0 then
dt[#dt+1] = spacing
end
local toclose = remove(stack)
top = stack[#stack]
if #stack < 1 then
errorstr = format("nothing to close with %s %s", tag, xml.checkerror(top,toclose) or "")
elseif toclose.tg ~= tag then -- no namespace check
errorstr = format("unable to close %s with %s %s", toclose.tg, tag, xml.checkerror(top,toclose) or "")
end
dt = top.dt
dt[#dt+1] = toclose
-- dt[0] = top -- nasty circular reference when serializing table
if toclose.at.xmlns then
remove(xmlns)
end
end
local function add_text(text)
if cleanup and #text > 0 then
dt[#dt+1] = cleanup(text)
else
dt[#dt+1] = text
end
end
local function add_special(what, spacing, text)
if #spacing > 0 then
dt[#dt+1] = spacing
end
if strip and (what == "@cm@" or what == "@dt@") then
-- forget it
else
dt[#dt+1] = { special=true, ns="", tg=what, dt={ text } }
end
end
local function set_message(txt)
errorstr = "garbage at the end of the file: " .. gsub(txt,"([ \n\r\t]*)","")
end
local reported_attribute_errors = { }
local function attribute_value_error(str)
if not reported_attribute_errors[str] then
report_xml("invalid attribute value: %q",str)
reported_attribute_errors[str] = true
at._error_ = str
end
return str
end
local function attribute_specification_error(str)
if not reported_attribute_errors[str] then
report_xml("invalid attribute specification: %q",str)
reported_attribute_errors[str] = true
at._error_ = str
end
return str
end
xml.placeholders = {
unknown_dec_entity = function(str) return (str == "" and "&error;") or format("&%s;",str) end,
unknown_hex_entity = function(str) return format("&#x%s;",str) end,
unknown_any_entity = function(str) return format("&#x%s;",str) end,
}
local placeholders = xml.placeholders
local function fromhex(s)
local n = tonumber(s,16)
if n then
return utfchar(n)
else
return format("h:%s",s), true
end
end
local function fromdec(s)
local n = tonumber(s)
if n then
return utfchar(n)
else
return format("d:%s",s), true
end
end
-- one level expansion (simple case), no checking done
local rest = (1-P(";"))^0
local many = P(1)^0
local parsedentity =
P("&") * (P("#x")*(rest/fromhex) + P("#")*(rest/fromdec)) * P(";") * P(-1) +
(P("#x")*(many/fromhex) + P("#")*(many/fromdec))
-- parsing in the xml file
local predefined_unified = {
[38] = "&",
[42] = """,
[47] = "'",
[74] = "<",
[76] = ">",
}
local predefined_simplified = {
[38] = "&", amp = "&",
[42] = '"', quot = '"',
[47] = "'", apos = "'",
[74] = "<", lt = "<",
[76] = ">", gt = ">",
}
local nofprivates = 0xF0000 -- shared but seldom used
local privates_u = { -- unescaped
[ [[&]] ] = "&",
[ [["]] ] = """,
[ [[']] ] = "'",
[ [[<]] ] = "<",
[ [[>]] ] = ">",
}
local privates_p = {
}
local privates_n = {
-- keeps track of defined ones
}
local function escaped(s)
if s == "" then
return ""
else -- if utffind(s,privates_u) then
return (utfgsub(s,".",privates_u))
-- else
-- return s
end
end
local function unescaped(s)
local p = privates_n[s]
if not p then
nofprivates = nofprivates + 1
p = utfchar(nofprivates)
privates_n[s] = p
s = "&" .. s .. ";"
privates_u[p] = s
privates_p[p] = s
end
return p
end
local function unprivatized(s,resolve)
if s == "" then
return ""
else
return (utfgsub(s,".",privates_p))
end
end
xml.privatetoken = unescaped
xml.unprivatized = unprivatized
local function handle_hex_entity(str)
local h = hcache[str]
if not h then
local n = tonumber(str,16)
h = unify_predefined and predefined_unified[n]
if h then
if trace_entities then
report_xml("utfize, converting hex entity &#x%s; into %s",str,h)
end
elseif utfize then
h = (n and utfchar(n)) or xml.unknown_hex_entity(str) or ""
if not n then
report_xml("utfize, ignoring hex entity &#x%s;",str)
elseif trace_entities then
report_xml("utfize, converting hex entity &#x%s; into %s",str,h)
end
else
if trace_entities then
report_xml("found entity &#x%s;",str)
end
h = "&#x" .. str .. ";"
end
hcache[str] = h
end
return h
end
local function handle_dec_entity(str)
local d = dcache[str]
if not d then
local n = tonumber(str)
d = unify_predefined and predefined_unified[n]
if d then
if trace_entities then
report_xml("utfize, converting dec entity &#%s; into %s",str,d)
end
elseif utfize then
d = (n and utfchar(n)) or placeholders.unknown_dec_entity(str) or ""
if not n then
report_xml("utfize, ignoring dec entity &#%s;",str)
elseif trace_entities then
report_xml("utfize, converting dec entity &#%s; into %s",str,d)
end
else
if trace_entities then
report_xml("found entity &#%s;",str)
end
d = "&#" .. str .. ";"
end
dcache[str] = d
end
return d
end
xml.parsedentitylpeg = parsedentity
local function handle_any_entity(str)
if resolve then
local a = acache[str] -- per instance ! todo
if not a then
a = resolve_predefined and predefined_simplified[str]
if a then
if trace_entities then
report_xml("resolved entity &%s; -> %s (predefined)",str,a)
end
else
if type(resolve) == "function" then
a = resolve(str) or entities[str]
else
a = entities[str]
end
if a then
if type(a) == "function" then
if trace_entities then
report_xml("expanding entity &%s; (function)",str)
end
a = a(str) or ""
end
a = lpegmatch(parsedentity,a) or a -- for nested
if trace_entities then
report_xml("resolved entity &%s; -> %s (internal)",str,a)
end
else
local unknown_any_entity = placeholders.unknown_any_entity
if unknown_any_entity then
a = unknown_any_entity(str) or ""
end
if a then
if trace_entities then
report_xml("resolved entity &%s; -> %s (external)",str,a)
end
else
if trace_entities then
report_xml("keeping entity &%s;",str)
end
if str == "" then
a = "&error;"
else
a = "&" .. str .. ";"
end
end
end
end
acache[str] = a
elseif trace_entities then
if not acache[str] then
report_xml("converting entity &%s; into %s",str,a)
acache[str] = a
end
end
return a
else
local a = acache[str]
if not a then
a = resolve_predefined and predefined_simplified[str]
if a then
-- one of the predefined
acache[str] = a
if trace_entities then
report_xml("entity &%s; becomes %s",str,tostring(a))
end
elseif str == "" then
if trace_entities then
report_xml("invalid entity &%s;",str)
end
a = "&error;"
acache[str] = a
else
if trace_entities then
report_xml("entity &%s; is made private",str)
end
-- a = "&" .. str .. ";"
a = unescaped(str)
acache[str] = a
end
end
return a
end
end
local function handle_end_entity(chr)
report_xml("error in entity, %q found instead of ';'",chr)
end
local space = S(' \r\n\t')
local open = P('<')
local close = P('>')
local squote = S("'")
local dquote = S('"')
local equal = P('=')
local slash = P('/')
local colon = P(':')
local semicolon = P(';')
local ampersand = P('&')
local valid = R('az', 'AZ', '09') + S('_-.')
local name_yes = C(valid^1) * colon * C(valid^1)
local name_nop = C(P(true)) * C(valid^1)
local name = name_yes + name_nop
local utfbom = lpeg.patterns.utfbom -- no capture
local spacing = C(space^0)
----- entitycontent = (1-open-semicolon)^0
local anyentitycontent = (1-open-semicolon-space-close)^0
local hexentitycontent = R("AF","af","09")^0
local decentitycontent = R("09")^0
local parsedentity = P("#")/"" * (
P("x")/"" * (hexentitycontent/handle_hex_entity) +
(decentitycontent/handle_dec_entity)
) + (anyentitycontent/handle_any_entity)
local entity = ampersand/"" * parsedentity * ( (semicolon/"") + #(P(1)/handle_end_entity))
local text_unparsed = C((1-open)^1)
local text_parsed = Cs(((1-open-ampersand)^1 + entity)^1)
local somespace = space^1
local optionalspace = space^0
----- value = (squote * C((1 - squote)^0) * squote) + (dquote * C((1 - dquote)^0) * dquote) -- ampersand and < also invalid in value
local value = (squote * Cs((entity + (1 - squote))^0) * squote) + (dquote * Cs((entity + (1 - dquote))^0) * dquote) -- ampersand and < also invalid in value
local endofattributes = slash * close + close -- recovery of flacky html
local whatever = space * name * optionalspace * equal
local wrongvalue = C(P(1-whatever-close)^1 + P(1-close)^1) / attribute_value_error
----- wrongvalue = C(P(1-whatever-endofattributes)^1 + P(1-endofattributes)^1) / attribute_value_error
----- wrongvalue = C(P(1-space-endofattributes)^1) / attribute_value_error
local wrongvalue = Cs(P(entity + (1-space-endofattributes))^1) / attribute_value_error
local attributevalue = value + wrongvalue
local attribute = (somespace * name * optionalspace * equal * optionalspace * attributevalue) / add_attribute
----- attributes = (attribute)^0
local attributes = (attribute + somespace^-1 * (((1-endofattributes)^1)/attribute_specification_error))^0
local parsedtext = text_parsed / add_text
local unparsedtext = text_unparsed / add_text
local balanced = P { "[" * ((1 - S"[]") + V(1))^0 * "]" } -- taken from lpeg manual, () example
local emptyelement = (spacing * open * name * attributes * optionalspace * slash * close) / add_empty
local beginelement = (spacing * open * name * attributes * optionalspace * close) / add_begin
local endelement = (spacing * open * slash * name * optionalspace * close) / add_end
local begincomment = open * P("!--")
local endcomment = P("--") * close
local begininstruction = open * P("?")
local endinstruction = P("?") * close
local begincdata = open * P("![CDATA[")
local endcdata = P("]]") * close
local someinstruction = C((1 - endinstruction)^0)
local somecomment = C((1 - endcomment )^0)
local somecdata = C((1 - endcdata )^0)
local function normalentity(k,v ) entities[k] = v end
local function systementity(k,v,n) entities[k] = v end
local function publicentity(k,v,n) entities[k] = v end
-- todo: separate dtd parser
local begindoctype = open * P("!DOCTYPE")
local enddoctype = close
local beginset = P("[")
local endset = P("]")
local doctypename = C((1-somespace-close)^0)
local elementdoctype = optionalspace * P("<!ELEMENT") * (1-close)^0 * close
local basiccomment = begincomment * ((1 - endcomment)^0) * endcomment
local normalentitytype = (doctypename * somespace * value)/normalentity
local publicentitytype = (doctypename * somespace * P("PUBLIC") * somespace * value)/publicentity
local systementitytype = (doctypename * somespace * P("SYSTEM") * somespace * value * somespace * P("NDATA") * somespace * doctypename)/systementity
local entitydoctype = optionalspace * P("<!ENTITY") * somespace * (systementitytype + publicentitytype + normalentitytype) * optionalspace * close
-- we accept comments in doctypes
local doctypeset = beginset * optionalspace * P(elementdoctype + entitydoctype + basiccomment + space)^0 * optionalspace * endset
local definitiondoctype= doctypename * somespace * doctypeset
local publicdoctype = doctypename * somespace * P("PUBLIC") * somespace * value * somespace * value * somespace * doctypeset
local systemdoctype = doctypename * somespace * P("SYSTEM") * somespace * value * somespace * doctypeset
local simpledoctype = (1-close)^1 -- * balanced^0
local somedoctype = C((somespace * (publicdoctype + systemdoctype + definitiondoctype + simpledoctype) * optionalspace)^0)
local somedoctype = C((somespace * (publicdoctype + systemdoctype + definitiondoctype + simpledoctype) * optionalspace)^0)
local instruction = (spacing * begininstruction * someinstruction * endinstruction) / function(...) add_special("@pi@",...) end
local comment = (spacing * begincomment * somecomment * endcomment ) / function(...) add_special("@cm@",...) end
local cdata = (spacing * begincdata * somecdata * endcdata ) / function(...) add_special("@cd@",...) end
local doctype = (spacing * begindoctype * somedoctype * enddoctype ) / function(...) add_special("@dt@",...) end
-- nicer but slower:
--
-- local instruction = (Cc("@pi@") * spacing * begininstruction * someinstruction * endinstruction) / add_special
-- local comment = (Cc("@cm@") * spacing * begincomment * somecomment * endcomment ) / add_special
-- local cdata = (Cc("@cd@") * spacing * begincdata * somecdata * endcdata ) / add_special
-- local doctype = (Cc("@dt@") * spacing * begindoctype * somedoctype * enddoctype ) / add_special
local trailer = space^0 * (text_unparsed/set_message)^0
-- comment + emptyelement + text + cdata + instruction + V("parent"), -- 6.5 seconds on 40 MB database file
-- text + comment + emptyelement + cdata + instruction + V("parent"), -- 5.8
-- text + V("parent") + emptyelement + comment + cdata + instruction, -- 5.5
local grammar_parsed_text = P { "preamble",
preamble = utfbom^0 * instruction^0 * (doctype + comment + instruction)^0 * V("parent") * trailer,
parent = beginelement * V("children")^0 * endelement,
children = parsedtext + V("parent") + emptyelement + comment + cdata + instruction,
}
local grammar_unparsed_text = P { "preamble",
preamble = utfbom^0 * instruction^0 * (doctype + comment + instruction)^0 * V("parent") * trailer,
parent = beginelement * V("children")^0 * endelement,
children = unparsedtext + V("parent") + emptyelement + comment + cdata + instruction,
}
-- maybe we will add settings to result as well
local function xmlconvert(data, settings)
settings = settings or { } -- no_root strip_cm_and_dt given_entities parent_root error_handler
--
strip = settings.strip_cm_and_dt
utfize = settings.utfize_entities
resolve = settings.resolve_entities
resolve_predefined = settings.resolve_predefined_entities -- in case we have escaped entities
unify_predefined = settings.unify_predefined_entities -- & -> &
cleanup = settings.text_cleanup
entities = settings.entities or { }
--
if utfize == nil then
settings.utfize_entities = true
utfize = true
end
if resolve_predefined == nil then
settings.resolve_predefined_entities = true
resolve_predefined = true
end
--
--
stack, top, at, xmlns, errorstr = { }, { }, { }, { }, nil
acache, hcache, dcache = { }, { }, { } -- not stored
reported_attribute_errors = { }
if settings.parent_root then
mt = getmetatable(settings.parent_root)
else
initialize_mt(top)
end
stack[#stack+1] = top
top.dt = { }
dt = top.dt
if not data or data == "" then
errorstr = "empty xml file"
elseif utfize or resolve then
if lpegmatch(grammar_parsed_text,data) then
errorstr = ""
else
errorstr = "invalid xml file - parsed text"
end
elseif type(data) == "string" then
if lpegmatch(grammar_unparsed_text,data) then
errorstr = ""
else
errorstr = "invalid xml file - unparsed text"
end
else
errorstr = "invalid xml file - no text at all"
end
local result
if errorstr and errorstr ~= "" then
result = { dt = { { ns = "", tg = "error", dt = { errorstr }, at={ }, er = true } } }
setmetatable(stack, mt)
local errorhandler = settings.error_handler
if errorhandler == false then
-- no error message
else
errorhandler = errorhandler or xml.errorhandler
if errorhandler then
xml.errorhandler("load",errorstr)
end
end
else
result = stack[1]
end
if not settings.no_root then
result = { special = true, ns = "", tg = '@rt@', dt = result.dt, at={ }, entities = entities, settings = settings }
setmetatable(result, mt)
local rdt = result.dt
for k=1,#rdt do
local v = rdt[k]
if type(v) == "table" and not v.special then -- always table -)
result.ri = k -- rootindex
v.__p__ = result -- new, experiment, else we cannot go back to settings, we need to test this !
break
end
end
end
if errorstr and errorstr ~= "" then
result.error = true
end
strip, utfize, resolve, resolve_predefined = nil, nil, nil, nil
unify_predefined, cleanup, entities = nil, nil, nil
stack, top, at, xmlns, errorstr = nil, nil, nil, nil, nil
acache, hcache, dcache = nil, nil, nil
reported_attribute_errors, mt, errorhandler = nil, nil, nil
return result
end
xml.convert = xmlconvert
function xml.inheritedconvert(data,xmldata)
local settings = xmldata.settings
settings.parent_root = xmldata -- to be tested
-- settings.no_root = true
local xc = xmlconvert(data,settings)
-- xc.settings = nil
-- xc.entities = nil
-- xc.special = nil
-- xc.ri = nil
-- print(xc.tg)
return xc
end
--[[ldx--
<p>Packaging data in an xml like table is done with the following
function. Maybe it will go away (when not used).</p>
--ldx]]--
function xml.is_valid(root)
return root and root.dt and root.dt[1] and type(root.dt[1]) == "table" and not root.dt[1].er
end
function xml.package(tag,attributes,data)
local ns, tg = match(tag,"^(.-):?([^:]+)$")
local t = { ns = ns, tg = tg, dt = data or "", at = attributes or {} }
setmetatable(t, mt)
return t
end
function xml.is_valid(root)
return root and not root.error
end
xml.errorhandler = report
--[[ldx--
<p>We cannot load an <l n='lpeg'/> from a filehandle so we need to load
the whole file first. The function accepts a string representing
a filename or a file handle.</p>
--ldx]]--
function xml.load(filename,settings)
local data = ""
if type(filename) == "string" then
-- local data = io.loaddata(filename) - -todo: check type in io.loaddata
local f = io.open(filename,'r')
if f then
data = f:read("*all")
f:close()
end
elseif filename then -- filehandle
data = filename:read("*all")
end
return xmlconvert(data,settings)
end
--[[ldx--
<p>When we inject new elements, we need to convert strings to
valid trees, which is what the next function does.</p>
--ldx]]--
local no_root = { no_root = true }
function xml.toxml(data)
if type(data) == "string" then
local root = { xmlconvert(data,no_root) }
return (#root > 1 and root) or root[1]
else
return data
end
end
--[[ldx--
<p>For copying a tree we use a dedicated function instead of the
generic table copier. Since we know what we're dealing with we
can speed up things a bit. The second argument is not to be used!</p>
--ldx]]--
local function copy(old,tables)
if old then
tables = tables or { }
local new = { }
if not tables[old] then
tables[old] = new
end
for k,v in next, old do
new[k] = (type(v) == "table" and (tables[v] or copy(v, tables))) or v
end
local mt = getmetatable(old)
if mt then
setmetatable(new,mt)
end
return new
else
return { }
end
end
xml.copy = copy
--[[ldx--
<p>In <l n='context'/> serializing the tree or parts of the tree is a major
actitivity which is why the following function is pretty optimized resulting
in a few more lines of code than needed. The variant that uses the formatting
function for all components is about 15% slower than the concatinating
alternative.</p>
--ldx]]--
-- todo: add <?xml version='1.0' standalone='yes'?> when not present
function xml.checkbom(root) -- can be made faster
if root.ri then
local dt = root.dt
for k=1,#dt do
local v = dt[k]
if type(v) == "table" and v.special and v.tg == "@pi@" and find(v.dt[1],"xml.*version=") then
return
end
end
insert(dt, 1, { special=true, ns="", tg="@pi@", dt = { "xml version='1.0' standalone='yes'"} } )
insert(dt, 2, "\n" )
end
end
--[[ldx--
<p>At the cost of some 25% runtime overhead you can first convert the tree to a string
and then handle the lot.</p>
--ldx]]--
-- new experimental reorganized serialize
local function verbose_element(e,handlers)
local handle = handlers.handle
local serialize = handlers.serialize
local ens, etg, eat, edt, ern = e.ns, e.tg, e.at, e.dt, e.rn
local ats = eat and next(eat) and { }
if ats then
for k,v in next, eat do
ats[#ats+1] = format('%s=%q',k,escaped(v))
end
end
if ern and trace_entities and ern ~= ens then
ens = ern
end
if ens ~= "" then
if edt and #edt > 0 then
if ats then
handle("<",ens,":",etg," ",concat(ats," "),">")
else
handle("<",ens,":",etg,">")
end
for i=1,#edt do
local e = edt[i]
if type(e) == "string" then
handle(escaped(e))
else
serialize(e,handlers)
end
end
handle("</",ens,":",etg,">")
else
if ats then
handle("<",ens,":",etg," ",concat(ats," "),"/>")
else
handle("<",ens,":",etg,"/>")
end
end
else
if edt and #edt > 0 then
if ats then
handle("<",etg," ",concat(ats," "),">")
else
handle("<",etg,">")
end
for i=1,#edt do
local e = edt[i]
if type(e) == "string" then
handle(escaped(e))
else
serialize(e,handlers)
end
end
handle("</",etg,">")
else
if ats then
handle("<",etg," ",concat(ats," "),"/>")
else
handle("<",etg,"/>")
end
end
end
end
local function verbose_pi(e,handlers)
handlers.handle("<?",e.dt[1],"?>")
end
local function verbose_comment(e,handlers)
handlers.handle("<!--",e.dt[1],"-->")
end
local function verbose_cdata(e,handlers)
handlers.handle("<![CDATA[", e.dt[1],"]]>")
end
local function verbose_doctype(e,handlers)
handlers.handle("<!DOCTYPE ",e.dt[1],">")
end
local function verbose_root(e,handlers)
handlers.serialize(e.dt,handlers)
end
local function verbose_text(e,handlers)
handlers.handle(escaped(e))
end
local function verbose_document(e,handlers)
local serialize = handlers.serialize
local functions = handlers.functions
for i=1,#e do
local ei = e[i]
if type(ei) == "string" then
functions["@tx@"](ei,handlers)
else
serialize(ei,handlers)
end
end
end
local function serialize(e,handlers,...)
local initialize = handlers.initialize
local finalize = handlers.finalize
local functions = handlers.functions
if initialize then
local state = initialize(...)
if not state == true then
return state
end
end
local etg = e.tg
if etg then
(functions[etg] or functions["@el@"])(e,handlers)
-- elseif type(e) == "string" then
-- functions["@tx@"](e,handlers)
else
functions["@dc@"](e,handlers) -- dc ?
end
if finalize then
return finalize()
end
end
local function xserialize(e,handlers)
local functions = handlers.functions
local etg = e.tg
if etg then
(functions[etg] or functions["@el@"])(e,handlers)
-- elseif type(e) == "string" then
-- functions["@tx@"](e,handlers)
else
functions["@dc@"](e,handlers)
end
end
local handlers = { }
local function newhandlers(settings)
local t = table.copy(handlers.verbose or { }) -- merge
if settings then
for k,v in next, settings do
if type(v) == "table" then
local tk = t[k] if not tk then tk = { } t[k] = tk end
for kk,vv in next, v do
tk[kk] = vv
end
else
t[k] = v
end
end
if settings.name then
handlers[settings.name] = t
end
end
utilities.storage.mark(t)
return t
end
local nofunction = function() end
function xml.sethandlersfunction(handler,name,fnc)
handler.functions[name] = fnc or nofunction
end
function xml.gethandlersfunction(handler,name)
return handler.functions[name]
end
function xml.gethandlers(name)
return handlers[name]
end
newhandlers {
name = "verbose",
initialize = false, -- faster than nil and mt lookup
finalize = false, -- faster than nil and mt lookup
serialize = xserialize,
handle = print,
functions = {
["@dc@"] = verbose_document,
["@dt@"] = verbose_doctype,
["@rt@"] = verbose_root,
["@el@"] = verbose_element,
["@pi@"] = verbose_pi,
["@cm@"] = verbose_comment,
["@cd@"] = verbose_cdata,
["@tx@"] = verbose_text,
}
}
--[[ldx--
<p>How you deal with saving data depends on your preferences. For a 40 MB database
file the timing on a 2.3 Core Duo are as follows (time in seconds):</p>
<lines>
1.3 : load data from file to string
6.1 : convert string into tree
5.3 : saving in file using xmlsave
6.8 : converting to string using xml.tostring
3.6 : saving converted string in file
</lines>
<p>Beware, these were timing with the old routine but measurements will not be that
much different I guess.</p>
--ldx]]--
-- maybe this will move to lxml-xml
local result
local xmlfilehandler = newhandlers {
name = "file",
initialize = function(name)
result = io.open(name,"wb")
return result
end,
finalize = function()
result:close()
return true
end,
handle = function(...)
result:write(...)
end,
}
-- no checking on writeability here but not faster either
--
-- local xmlfilehandler = newhandlers {
-- initialize = function(name)
-- io.output(name,"wb")
-- return true
-- end,
-- finalize = function()
-- io.close()
-- return true
-- end,
-- handle = io.write,
-- }
function xml.save(root,name)
serialize(root,xmlfilehandler,name)
end
local result
local xmlstringhandler = newhandlers {
name = "string",
initialize = function()
result = { }
return result
end,
finalize = function()
return concat(result)
end,
handle = function(...)
result[#result+1] = concat { ... }
end,
}
local function xmltostring(root) -- 25% overhead due to collecting
if not root then
return ""
elseif type(root) == 'string' then
return root
else -- if next(root) then -- next is faster than type (and >0 test)
return serialize(root,xmlstringhandler) or ""
end
end
local function __tostring(root) -- inline
return (root and xmltostring(root)) or ""
end
initialize_mt = function(root) -- redefinition
mt = { __tostring = __tostring, __index = root }
end
xml.defaulthandlers = handlers
xml.newhandlers = newhandlers
xml.serialize = serialize
xml.tostring = xmltostring
--[[ldx--
<p>The next function operated on the content only and needs a handle function
that accepts a string.</p>
--ldx]]--
local function xmlstring(e,handle)
if not handle or (e.special and e.tg ~= "@rt@") then
-- nothing
elseif e.tg then
local edt = e.dt
if edt then
for i=1,#edt do
xmlstring(edt[i],handle)
end
end
else
handle(e)
end
end
xml.string = xmlstring
--[[ldx--
<p>A few helpers:</p>
--ldx]]--
function xml.settings(e)
while e do
local s = e.settings
if s then
return s
else
e = e.__p__
end
end
return nil
end
function xml.root(e)
local r = e
while e do
e = e.__p__
if e then
r = e
end
end
return r
end
function xml.parent(root)
return root.__p__
end
function xml.body(root)
return (root.ri and root.dt[root.ri]) or root -- not ok yet
end
function xml.name(root)
if not root then
return ""
elseif root.ns == "" then
return root.tg
else
return root.ns .. ":" .. root.tg
end
end
--[[ldx--
<p>The next helper erases an element but keeps the table as it is,
and since empty strings are not serialized (effectively) it does
not harm. Copying the table would take more time. Usage:</p>
--ldx]]--
function xml.erase(dt,k)
if dt then
if k then
dt[k] = ""
else for k=1,#dt do
dt[1] = { "" }
end end
end
end
--[[ldx--
<p>The next helper assigns a tree (or string). Usage:</p>
<typing>
dt[k] = xml.assign(root) or xml.assign(dt,k,root)
</typing>
--ldx]]--
function xml.assign(dt,k,root)
if dt and k then
dt[k] = (type(root) == "table" and xml.body(root)) or root
return dt[k]
else
return xml.body(root)
end
end
-- the following helpers may move
--[[ldx--
<p>The next helper assigns a tree (or string). Usage:</p>
<typing>
xml.tocdata(e)
xml.tocdata(e,"error")
</typing>
--ldx]]--
function xml.tocdata(e,wrapper)
local whatever = xmltostring(e.dt)
if wrapper then
whatever = format("<%s>%s</%s>",wrapper,whatever,wrapper)
end
local t = { special = true, ns = "", tg = "@cd@", at = {}, rn = "", dt = { whatever }, __p__ = e }
setmetatable(t,getmetatable(e))
e.dt = { t }
end
function xml.makestandalone(root)
if root.ri then
local dt = root.dt
for k=1,#dt do
local v = dt[k]
if type(v) == "table" and v.special and v.tg == "@pi@" then
local txt = v.dt[1]
if find(txt,"xml.*version=") then
v.dt[1] = txt .. " standalone='yes'"
break
end
end
end
end
return root
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['lxml-pth'] = {
version = 1.001,
comment = "this module is the basis for the lxml-* ones",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- e.ni is only valid after a filter run
-- todo: B/C/[get first match]
local concat, remove, insert = table.concat, table.remove, table.insert
local type, next, tonumber, tostring, setmetatable, loadstring = type, next, tonumber, tostring, setmetatable, loadstring
local format, upper, lower, gmatch, gsub, find, rep = string.format, string.upper, string.lower, string.gmatch, string.gsub, string.find, string.rep
local lpegmatch, lpegpatterns = lpeg.match, lpeg.patterns
local setmetatableindex = table.setmetatableindex
-- beware, this is not xpath ... e.g. position is different (currently) and
-- we have reverse-sibling as reversed preceding sibling
--[[ldx--
<p>This module can be used stand alone but also inside <l n='mkiv'/> in
which case it hooks into the tracker code. Therefore we provide a few
functions that set the tracers. Here we overload a previously defined
function.</p>
<p>If I can get in the mood I will make a variant that is XSLT compliant
but I wonder if it makes sense.</P>
--ldx]]--
--[[ldx--
<p>Expecially the lpath code is experimental, we will support some of xpath, but
only things that make sense for us; as compensation it is possible to hook in your
own functions. Apart from preprocessing content for <l n='context'/> we also need
this module for process management, like handling <l n='ctx'/> and <l n='rlx'/>
files.</p>
<typing>
a/b/c /*/c
a/b/c/first() a/b/c/last() a/b/c/index(n) a/b/c/index(-n)
a/b/c/text() a/b/c/text(1) a/b/c/text(-1) a/b/c/text(n)
</typing>
--ldx]]--
local trace_lpath = false if trackers then trackers.register("xml.path", function(v) trace_lpath = v end) end
local trace_lparse = false if trackers then trackers.register("xml.parse", function(v) trace_lparse = v end) end
local trace_lprofile = false if trackers then trackers.register("xml.profile", function(v) trace_lpath = v trace_lparse = v trace_lprofile = v end) end
local report_lpath = logs.reporter("xml","lpath")
--[[ldx--
<p>We've now arrived at an interesting part: accessing the tree using a subset
of <l n='xpath'/> and since we're not compatible we call it <l n='lpath'/>. We
will explain more about its usage in other documents.</p>
--ldx]]--
local xml = xml
local lpathcalls = 0 function xml.lpathcalls () return lpathcalls end
local lpathcached = 0 function xml.lpathcached() return lpathcached end
xml.functions = xml.functions or { } -- internal
local functions = xml.functions
xml.expressions = xml.expressions or { } -- in expressions
local expressions = xml.expressions
xml.finalizers = xml.finalizers or { } -- fast do-with ... (with return value other than collection)
local finalizers = xml.finalizers
xml.specialhandler = xml.specialhandler or { }
local specialhandler = xml.specialhandler
lpegpatterns.xml = lpegpatterns.xml or { }
local xmlpatterns = lpegpatterns.xml
finalizers.xml = finalizers.xml or { }
finalizers.tex = finalizers.tex or { }
local function fallback (t, name)
local fn = finalizers[name]
if fn then
t[name] = fn
else
report_lpath("unknown sub finalizer '%s'",tostring(name))
fn = function() end
end
return fn
end
setmetatableindex(finalizers.xml, fallback)
setmetatableindex(finalizers.tex, fallback)
xml.defaultprotocol = "xml"
-- as xsl does not follow xpath completely here we will also
-- be more liberal especially with regards to the use of | and
-- the rootpath:
--
-- test : all 'test' under current
-- /test : 'test' relative to current
-- a|b|c : set of names
-- (a|b|c) : idem
-- ! : not
--
-- after all, we're not doing transformations but filtering. in
-- addition we provide filter functions (last bit)
--
-- todo: optimizer
--
-- .. : parent
-- * : all kids
-- / : anchor here
-- // : /**/
-- ** : all in between
--
-- so far we had (more practical as we don't transform)
--
-- {/test} : kids 'test' under current node
-- {test} : any kid with tag 'test'
-- {//test} : same as above
-- evaluator (needs to be redone, for the moment copied)
-- todo: apply_axis(list,notable) and collection vs single
local apply_axis = { }
apply_axis['root'] = function(list)
local collected = { }
for l=1,#list do
local ll = list[l]
local rt = ll
while ll do
ll = ll.__p__
if ll then
rt = ll
end
end
collected[l] = rt
end
return collected
end
apply_axis['self'] = function(list)
return list
end
apply_axis['child'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
local dt = ll.dt
if dt then -- weird that this is needed
local en = 0
for k=1,#dt do
local dk = dt[k]
if dk.tg then
c = c + 1
collected[c] = dk
dk.ni = k -- refresh
en = en + 1
dk.ei = en
end
end
ll.en = en
end
end
return collected
end
local function collect(list,collected,c)
local dt = list.dt
if dt then
local en = 0
for k=1,#dt do
local dk = dt[k]
if dk.tg then
c = c + 1
collected[c] = dk
dk.ni = k -- refresh
en = en + 1
dk.ei = en
c = collect(dk,collected,c)
end
end
list.en = en
end
return c
end
apply_axis['descendant'] = function(list)
local collected, c = { }, 0
for l=1,#list do
c = collect(list[l],collected,c)
end
return collected
end
local function collect(list,collected,c)
local dt = list.dt
if dt then
local en = 0
for k=1,#dt do
local dk = dt[k]
if dk.tg then
c = c + 1
collected[c] = dk
dk.ni = k -- refresh
en = en + 1
dk.ei = en
c = collect(dk,collected,c)
end
end
list.en = en
end
return c
end
apply_axis['descendant-or-self'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
if ll.special ~= true then -- catch double root
c = c + 1
collected[c] = ll
end
c = collect(ll,collected,c)
end
return collected
end
apply_axis['ancestor'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
while ll do
ll = ll.__p__
if ll then
c = c + 1
collected[c] = ll
end
end
end
return collected
end
apply_axis['ancestor-or-self'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
c = c + 1
collected[c] = ll
while ll do
ll = ll.__p__
if ll then
c = c + 1
collected[c] = ll
end
end
end
return collected
end
apply_axis['parent'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local pl = list[l].__p__
if pl then
c = c + 1
collected[c] = pl
end
end
return collected
end
apply_axis['attribute'] = function(list)
return { }
end
apply_axis['namespace'] = function(list)
return { }
end
apply_axis['following'] = function(list) -- incomplete
return { }
end
apply_axis['preceding'] = function(list) -- incomplete
return { }
end
apply_axis['following-sibling'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
local p = ll.__p__
local d = p.dt
for i=ll.ni+1,#d do
local di = d[i]
if type(di) == "table" then
c = c + 1
collected[c] = di
end
end
end
return collected
end
apply_axis['preceding-sibling'] = function(list)
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
local p = ll.__p__
local d = p.dt
for i=1,ll.ni-1 do
local di = d[i]
if type(di) == "table" then
c = c + 1
collected[c] = di
end
end
end
return collected
end
apply_axis['reverse-sibling'] = function(list) -- reverse preceding
local collected, c = { }, 0
for l=1,#list do
local ll = list[l]
local p = ll.__p__
local d = p.dt
for i=ll.ni-1,1,-1 do
local di = d[i]
if type(di) == "table" then
c = c + 1
collected[c] = di
end
end
end
return collected
end
apply_axis['auto-descendant-or-self'] = apply_axis['descendant-or-self']
apply_axis['auto-descendant'] = apply_axis['descendant']
apply_axis['auto-child'] = apply_axis['child']
apply_axis['auto-self'] = apply_axis['self']
apply_axis['initial-child'] = apply_axis['child']
local function apply_nodes(list,directive,nodes)
-- todo: nodes[1] etc ... negated node name in set ... when needed
-- ... currently ignored
local maxn = #nodes
if maxn == 3 then --optimized loop
local nns, ntg = nodes[2], nodes[3]
if not nns and not ntg then -- wildcard
if directive then
return list
else
return { }
end
else
local collected, c, m, p = { }, 0, 0, nil
if not nns then -- only check tag
for l=1,#list do
local ll = list[l]
local ltg = ll.tg
if ltg then
if directive then
if ntg == ltg then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
elseif ntg ~= ltg then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
end
end
elseif not ntg then -- only check namespace
for l=1,#list do
local ll = list[l]
local lns = ll.rn or ll.ns
if lns then
if directive then
if lns == nns then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
elseif lns ~= nns then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
end
end
else -- check both
for l=1,#list do
local ll = list[l]
local ltg = ll.tg
if ltg then
local lns = ll.rn or ll.ns
local ok = ltg == ntg and lns == nns
if directive then
if ok then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
elseif not ok then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
end
end
end
return collected
end
else
local collected, c, m, p = { }, 0, 0, nil
for l=1,#list do
local ll = list[l]
local ltg = ll.tg
if ltg then
local lns = ll.rn or ll.ns
local ok = false
for n=1,maxn,3 do
local nns, ntg = nodes[n+1], nodes[n+2]
ok = (not ntg or ltg == ntg) and (not nns or lns == nns)
if ok then
break
end
end
if directive then
if ok then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
elseif not ok then
local llp = ll.__p__ ; if llp ~= p then p, m = llp, 1 else m = m + 1 end
c = c + 1
collected[c], ll.mi = ll, m
end
end
end
return collected
end
end
local quit_expression = false
local function apply_expression(list,expression,order)
local collected, c = { }, 0
quit_expression = false
for l=1,#list do
local ll = list[l]
if expression(list,ll,l,order) then -- nasty, order alleen valid als n=1
c = c + 1
collected[c] = ll
end
if quit_expression then
break
end
end
return collected
end
local P, V, C, Cs, Cc, Ct, R, S, Cg, Cb = lpeg.P, lpeg.V, lpeg.C, lpeg.Cs, lpeg.Cc, lpeg.Ct, lpeg.R, lpeg.S, lpeg.Cg, lpeg.Cb
local spaces = S(" \n\r\t\f")^0
local lp_space = S(" \n\r\t\f")
local lp_any = P(1)
local lp_noequal = P("!=") / "~=" + P("<=") + P(">=") + P("==")
local lp_doequal = P("=") / "=="
local lp_or = P("|") / " or "
local lp_and = P("&") / " and "
local lp_builtin = P (
P("firstindex") / "1" +
P("lastindex") / "(#ll.__p__.dt or 1)" +
P("firstelement") / "1" +
P("lastelement") / "(ll.__p__.en or 1)" +
P("first") / "1" +
P("last") / "#list" +
P("rootposition") / "order" +
P("position") / "l" + -- is element in finalizer
P("order") / "order" +
P("element") / "(ll.ei or 1)" +
P("index") / "(ll.ni or 1)" +
P("match") / "(ll.mi or 1)" +
P("text") / "(ll.dt[1] or '')" +
-- P("name") / "(ll.ns~='' and ll.ns..':'..ll.tg)" +
P("name") / "((ll.ns~='' and ll.ns..':'..ll.tg) or ll.tg)" +
P("tag") / "ll.tg" +
P("ns") / "ll.ns"
) * ((spaces * P("(") * spaces * P(")"))/"")
-- for the moment we keep namespaces with attributes
local lp_attribute = (P("@") + P("attribute::")) / "" * Cc("(ll.at and ll.at['") * ((R("az","AZ") + S("-_:"))^1) * Cc("'])")
local lp_fastpos_p = ((P("+")^0 * R("09")^1 * P(-1)) / function(s) return "l==" .. s end)
local lp_fastpos_n = ((P("-") * R("09")^1 * P(-1)) / function(s) return "(" .. s .. "<0 and (#list+".. s .. "==l))" end)
local lp_fastpos = lp_fastpos_n + lp_fastpos_p
local lp_reserved = C("and") + C("or") + C("not") + C("div") + C("mod") + C("true") + C("false")
local lp_lua_function = C(R("az","AZ","__")^1 * (P(".") * R("az","AZ","__")^1)^1) * ("(") / function(t) -- todo: better . handling
return t .. "("
end
local lp_function = C(R("az","AZ","__")^1) * P("(") / function(t) -- todo: better . handling
if expressions[t] then
return "expr." .. t .. "("
else
return "expr.error("
end
end
local lparent = lpeg.P("(")
local rparent = lpeg.P(")")
local noparent = 1 - (lparent+rparent)
local nested = lpeg.P{lparent * (noparent + lpeg.V(1))^0 * rparent}
local value = lpeg.P(lparent * lpeg.C((noparent + nested)^0) * rparent) -- lpeg.P{"("*C(((1-S("()"))+V(1))^0)*")"}
local lp_child = Cc("expr.child(ll,'") * R("az","AZ","--","__")^1 * Cc("')")
local lp_number = S("+-") * R("09")^1
local lp_string = Cc("'") * R("az","AZ","--","__")^1 * Cc("'")
local lp_content = (P("'") * (1-P("'"))^0 * P("'") + P('"') * (1-P('"'))^0 * P('"'))
local cleaner
local lp_special = (C(P("name")+P("text")+P("tag")+P("count")+P("child"))) * value / function(t,s)
if expressions[t] then
s = s and s ~= "" and lpegmatch(cleaner,s)
if s and s ~= "" then
return "expr." .. t .. "(ll," .. s ..")"
else
return "expr." .. t .. "(ll)"
end
else
return "expr.error(" .. t .. ")"
end
end
local content =
lp_builtin +
lp_attribute +
lp_special +
lp_noequal + lp_doequal +
lp_or + lp_and +
lp_reserved +
lp_lua_function + lp_function +
lp_content + -- too fragile
lp_child +
lp_any
local converter = Cs (
lp_fastpos + (P { lparent * (V(1))^0 * rparent + content } )^0
)
cleaner = Cs ( (
lp_reserved +
lp_number +
lp_string +
1 )^1 )
local template_e = [[
local expr = xml.expressions
return function(list,ll,l,order)
return %s
end
]]
local template_f_y = [[
local finalizer = xml.finalizers['%s']['%s']
return function(collection)
return finalizer(collection,%s)
end
]]
local template_f_n = [[
return xml.finalizers['%s']['%s']
]]
--
local register_self = { kind = "axis", axis = "self" } -- , apply = apply_axis["self"] }
local register_parent = { kind = "axis", axis = "parent" } -- , apply = apply_axis["parent"] }
local register_descendant = { kind = "axis", axis = "descendant" } -- , apply = apply_axis["descendant"] }
local register_child = { kind = "axis", axis = "child" } -- , apply = apply_axis["child"] }
local register_descendant_or_self = { kind = "axis", axis = "descendant-or-self" } -- , apply = apply_axis["descendant-or-self"] }
local register_root = { kind = "axis", axis = "root" } -- , apply = apply_axis["root"] }
local register_ancestor = { kind = "axis", axis = "ancestor" } -- , apply = apply_axis["ancestor"] }
local register_ancestor_or_self = { kind = "axis", axis = "ancestor-or-self" } -- , apply = apply_axis["ancestor-or-self"] }
local register_attribute = { kind = "axis", axis = "attribute" } -- , apply = apply_axis["attribute"] }
local register_namespace = { kind = "axis", axis = "namespace" } -- , apply = apply_axis["namespace"] }
local register_following = { kind = "axis", axis = "following" } -- , apply = apply_axis["following"] }
local register_following_sibling = { kind = "axis", axis = "following-sibling" } -- , apply = apply_axis["following-sibling"] }
local register_preceding = { kind = "axis", axis = "preceding" } -- , apply = apply_axis["preceding"] }
local register_preceding_sibling = { kind = "axis", axis = "preceding-sibling" } -- , apply = apply_axis["preceding-sibling"] }
local register_reverse_sibling = { kind = "axis", axis = "reverse-sibling" } -- , apply = apply_axis["reverse-sibling"] }
local register_auto_descendant_or_self = { kind = "axis", axis = "auto-descendant-or-self" } -- , apply = apply_axis["auto-descendant-or-self"] }
local register_auto_descendant = { kind = "axis", axis = "auto-descendant" } -- , apply = apply_axis["auto-descendant"] }
local register_auto_self = { kind = "axis", axis = "auto-self" } -- , apply = apply_axis["auto-self"] }
local register_auto_child = { kind = "axis", axis = "auto-child" } -- , apply = apply_axis["auto-child"] }
local register_initial_child = { kind = "axis", axis = "initial-child" } -- , apply = apply_axis["initial-child"] }
local register_all_nodes = { kind = "nodes", nodetest = true, nodes = { true, false, false } }
local skip = { }
local function errorrunner_e(str,cnv)
if not skip[str] then
report_lpath("error in expression: %s => %s",str,cnv)
skip[str] = cnv or str
end
return false
end
local function errorrunner_f(str,arg)
report_lpath("error in finalizer: %s(%s)",str,arg or "")
return false
end
local function register_nodes(nodetest,nodes)
return { kind = "nodes", nodetest = nodetest, nodes = nodes }
end
local function register_expression(expression)
local converted = lpegmatch(converter,expression)
local runner = loadstring(format(template_e,converted))
runner = (runner and runner()) or function() errorrunner_e(expression,converted) end
return { kind = "expression", expression = expression, converted = converted, evaluator = runner }
end
local function register_finalizer(protocol,name,arguments)
local runner
if arguments and arguments ~= "" then
runner = loadstring(format(template_f_y,protocol or xml.defaultprotocol,name,arguments))
else
runner = loadstring(format(template_f_n,protocol or xml.defaultprotocol,name))
end
runner = (runner and runner()) or function() errorrunner_f(name,arguments) end
return { kind = "finalizer", name = name, arguments = arguments, finalizer = runner }
end
local expression = P { "ex",
ex = "[" * C((V("sq") + V("dq") + (1 - S("[]")) + V("ex"))^0) * "]",
sq = "'" * (1 - S("'"))^0 * "'",
dq = '"' * (1 - S('"'))^0 * '"',
}
local arguments = P { "ar",
ar = "(" * Cs((V("sq") + V("dq") + V("nq") + P(1-P(")")))^0) * ")",
nq = ((1 - S("),'\""))^1) / function(s) return format("%q",s) end,
sq = P("'") * (1 - P("'"))^0 * P("'"),
dq = P('"') * (1 - P('"'))^0 * P('"'),
}
-- todo: better arg parser
local function register_error(str)
return { kind = "error", error = format("unparsed: %s",str) }
end
-- there is a difference in * and /*/ and so we need to catch a few special cases
local special_1 = P("*") * Cc(register_auto_descendant) * Cc(register_all_nodes) -- last one not needed
local special_2 = P("/") * Cc(register_auto_self)
local special_3 = P("") * Cc(register_auto_self)
local no_nextcolon = P(-1) + #(1-P(":")) -- newer lpeg needs the P(-1)
local no_nextlparent = P(-1) + #(1-P("(")) -- newer lpeg needs the P(-1)
local pathparser = Ct { "patterns", -- can be made a bit faster by moving some patterns outside
patterns = spaces * V("protocol") * spaces * (
( V("special") * spaces * P(-1) ) +
( V("initial") * spaces * V("step") * spaces * (P("/") * spaces * V("step") * spaces)^0 )
),
protocol = Cg(V("letters"),"protocol") * P("://") + Cg(Cc(nil),"protocol"),
-- the / is needed for // as descendant or self is somewhat special
-- step = (V("shortcuts") + V("axis") * spaces * V("nodes")^0 + V("error")) * spaces * V("expressions")^0 * spaces * V("finalizer")^0,
step = ((V("shortcuts") + P("/") + V("axis")) * spaces * V("nodes")^0 + V("error")) * spaces * V("expressions")^0 * spaces * V("finalizer")^0,
axis = V("descendant") + V("child") + V("parent") + V("self") + V("root") + V("ancestor") +
V("descendant_or_self") + V("following_sibling") + V("following") +
V("reverse_sibling") + V("preceding_sibling") + V("preceding") + V("ancestor_or_self") +
#(1-P(-1)) * Cc(register_auto_child),
special = special_1 + special_2 + special_3,
initial = (P("/") * spaces * Cc(register_initial_child))^-1,
error = (P(1)^1) / register_error,
shortcuts_a = V("s_descendant_or_self") + V("s_descendant") + V("s_child") + V("s_parent") + V("s_self") + V("s_root") + V("s_ancestor"),
shortcuts = V("shortcuts_a") * (spaces * "/" * spaces * V("shortcuts_a"))^0,
s_descendant_or_self = (P("***/") + P("/")) * Cc(register_descendant_or_self), --- *** is a bonus
s_descendant = P("**") * Cc(register_descendant),
s_child = P("*") * no_nextcolon * Cc(register_child ),
s_parent = P("..") * Cc(register_parent ),
s_self = P("." ) * Cc(register_self ),
s_root = P("^^") * Cc(register_root ),
s_ancestor = P("^") * Cc(register_ancestor ),
descendant = P("descendant::") * Cc(register_descendant ),
child = P("child::") * Cc(register_child ),
parent = P("parent::") * Cc(register_parent ),
self = P("self::") * Cc(register_self ),
root = P('root::') * Cc(register_root ),
ancestor = P('ancestor::') * Cc(register_ancestor ),
descendant_or_self = P('descendant-or-self::') * Cc(register_descendant_or_self ),
ancestor_or_self = P('ancestor-or-self::') * Cc(register_ancestor_or_self ),
-- attribute = P('attribute::') * Cc(register_attribute ),
-- namespace = P('namespace::') * Cc(register_namespace ),
following = P('following::') * Cc(register_following ),
following_sibling = P('following-sibling::') * Cc(register_following_sibling ),
preceding = P('preceding::') * Cc(register_preceding ),
preceding_sibling = P('preceding-sibling::') * Cc(register_preceding_sibling ),
reverse_sibling = P('reverse-sibling::') * Cc(register_reverse_sibling ),
nodes = (V("nodefunction") * spaces * P("(") * V("nodeset") * P(")") + V("nodetest") * V("nodeset")) / register_nodes,
expressions = expression / register_expression,
letters = R("az")^1,
name = (1-lpeg.S("/[]()|:*!"))^1, -- make inline
negate = P("!") * Cc(false),
nodefunction = V("negate") + P("not") * Cc(false) + Cc(true),
nodetest = V("negate") + Cc(true),
nodename = (V("negate") + Cc(true)) * spaces * ((V("wildnodename") * P(":") * V("wildnodename")) + (Cc(false) * V("wildnodename"))),
wildnodename = (C(V("name")) + P("*") * Cc(false)) * no_nextlparent,
nodeset = spaces * Ct(V("nodename") * (spaces * P("|") * spaces * V("nodename"))^0) * spaces,
finalizer = (Cb("protocol") * P("/")^-1 * C(V("name")) * arguments * P(-1)) / register_finalizer,
}
xmlpatterns.pathparser = pathparser
local cache = { }
local function nodesettostring(set,nodetest)
local t = { }
for i=1,#set,3 do
local directive, ns, tg = set[i], set[i+1], set[i+2]
if not ns or ns == "" then ns = "*" end
if not tg or tg == "" then tg = "*" end
tg = (tg == "@rt@" and "[root]") or format("%s:%s",ns,tg)
t[i] = (directive and tg) or format("not(%s)",tg)
end
if nodetest == false then
return format("not(%s)",concat(t,"|"))
else
return concat(t,"|")
end
end
local function tagstostring(list)
if #list == 0 then
return "no elements"
else
local t = { }
for i=1, #list do
local li = list[i]
local ns, tg = li.ns, li.tg
if not ns or ns == "" then ns = "*" end
if not tg or tg == "" then tg = "*" end
t[i] = (tg == "@rt@" and "[root]") or format("%s:%s",ns,tg)
end
return concat(t," ")
end
end
xml.nodesettostring = nodesettostring
local lpath -- we have a harmless kind of circular reference
local lshowoptions = { functions = false }
local function lshow(parsed)
if type(parsed) == "string" then
parsed = lpath(parsed)
end
report_lpath("%s://%s => %s",parsed.protocol or xml.defaultprotocol,parsed.pattern,
table.serialize(parsed,false,lshowoptions))
end
xml.lshow = lshow
local function add_comment(p,str)
local pc = p.comment
if not pc then
p.comment = { str }
else
pc[#pc+1] = str
end
end
lpath = function (pattern) -- the gain of caching is rather minimal
lpathcalls = lpathcalls + 1
if type(pattern) == "table" then
return pattern
else
local parsed = cache[pattern]
if parsed then
lpathcached = lpathcached + 1
else
parsed = lpegmatch(pathparser,pattern)
if parsed then
parsed.pattern = pattern
local np = #parsed
if np == 0 then
parsed = { pattern = pattern, register_self, state = "parsing error" }
report_lpath("parsing error in '%s'",pattern)
lshow(parsed)
else
-- we could have done this with a more complex parser but this
-- is cleaner
local pi = parsed[1]
if pi.axis == "auto-child" then
if false then
add_comment(parsed, "auto-child replaced by auto-descendant-or-self")
parsed[1] = register_auto_descendant_or_self
else
add_comment(parsed, "auto-child replaced by auto-descendant")
parsed[1] = register_auto_descendant
end
elseif pi.axis == "initial-child" and np > 1 and parsed[2].axis then
add_comment(parsed, "initial-child removed") -- we could also make it a auto-self
remove(parsed,1)
end
local np = #parsed -- can have changed
if np > 1 then
local pnp = parsed[np]
if pnp.kind == "nodes" and pnp.nodetest == true then
local nodes = pnp.nodes
if nodes[1] == true and nodes[2] == false and nodes[3] == false then
add_comment(parsed, "redundant final wildcard filter removed")
remove(parsed,np)
end
end
end
end
else
parsed = { pattern = pattern }
end
cache[pattern] = parsed
if trace_lparse and not trace_lprofile then
lshow(parsed)
end
end
return parsed
end
end
xml.lpath = lpath
-- we can move all calls inline and then merge the trace back
-- technically we can combine axis and the next nodes which is
-- what we did before but this a bit cleaner (but slower too)
-- but interesting is that it's not that much faster when we
-- go inline
--
-- beware: we need to return a collection even when we filter
-- else the (simple) cache gets messed up
-- caching found lookups saves not that much (max .1 sec on a 8 sec run)
-- and it also messes up finalizers
-- watch out: when there is a finalizer, it's always called as there
-- can be cases that a finalizer returns (or does) something in case
-- there is no match; an example of this is count()
local profiled = { } xml.profiled = profiled
local function profiled_apply(list,parsed,nofparsed,order)
local p = profiled[parsed.pattern]
if p then
p.tested = p.tested + 1
else
p = { tested = 1, matched = 0, finalized = 0 }
profiled[parsed.pattern] = p
end
local collected = list
for i=1,nofparsed do
local pi = parsed[i]
local kind = pi.kind
if kind == "axis" then
collected = apply_axis[pi.axis](collected)
elseif kind == "nodes" then
collected = apply_nodes(collected,pi.nodetest,pi.nodes)
elseif kind == "expression" then
collected = apply_expression(collected,pi.evaluator,order)
elseif kind == "finalizer" then
collected = pi.finalizer(collected)
p.matched = p.matched + 1
p.finalized = p.finalized + 1
return collected
end
if not collected or #collected == 0 then
local pn = i < nofparsed and parsed[nofparsed]
if pn and pn.kind == "finalizer" then
collected = pn.finalizer(collected)
p.finalized = p.finalized + 1
return collected
end
return nil
end
end
if collected then
p.matched = p.matched + 1
end
return collected
end
local function traced_apply(list,parsed,nofparsed,order)
if trace_lparse then
lshow(parsed)
end
report_lpath("collecting: %s",parsed.pattern)
report_lpath("root tags : %s",tagstostring(list))
report_lpath("order : %s",order or "unset")
local collected = list
for i=1,nofparsed do
local pi = parsed[i]
local kind = pi.kind
if kind == "axis" then
collected = apply_axis[pi.axis](collected)
report_lpath("% 10i : ax : %s",(collected and #collected) or 0,pi.axis)
elseif kind == "nodes" then
collected = apply_nodes(collected,pi.nodetest,pi.nodes)
report_lpath("% 10i : ns : %s",(collected and #collected) or 0,nodesettostring(pi.nodes,pi.nodetest))
elseif kind == "expression" then
collected = apply_expression(collected,pi.evaluator,order)
report_lpath("% 10i : ex : %s -> %s",(collected and #collected) or 0,pi.expression,pi.converted)
elseif kind == "finalizer" then
collected = pi.finalizer(collected)
report_lpath("% 10i : fi : %s : %s(%s)",(type(collected) == "table" and #collected) or 0,parsed.protocol or xml.defaultprotocol,pi.name,pi.arguments or "")
return collected
end
if not collected or #collected == 0 then
local pn = i < nofparsed and parsed[nofparsed]
if pn and pn.kind == "finalizer" then
collected = pn.finalizer(collected)
report_lpath("% 10i : fi : %s : %s(%s)",(type(collected) == "table" and #collected) or 0,parsed.protocol or xml.defaultprotocol,pn.name,pn.arguments or "")
return collected
end
return nil
end
end
return collected
end
local function normal_apply(list,parsed,nofparsed,order)
local collected = list
for i=1,nofparsed do
local pi = parsed[i]
local kind = pi.kind
if kind == "axis" then
local axis = pi.axis
if axis ~= "self" then
collected = apply_axis[axis](collected)
end
elseif kind == "nodes" then
collected = apply_nodes(collected,pi.nodetest,pi.nodes)
elseif kind == "expression" then
collected = apply_expression(collected,pi.evaluator,order)
elseif kind == "finalizer" then
return pi.finalizer(collected)
end
if not collected or #collected == 0 then
local pf = i < nofparsed and parsed[nofparsed].finalizer
if pf then
return pf(collected) -- can be anything
end
return nil
end
end
return collected
end
local function applylpath(list,pattern)
if not list then
return
end
local parsed = cache[pattern]
if parsed then
lpathcalls = lpathcalls + 1
lpathcached = lpathcached + 1
elseif type(pattern) == "table" then
lpathcalls = lpathcalls + 1
parsed = pattern
else
parsed = lpath(pattern) or pattern
end
if not parsed then
return
end
local nofparsed = #parsed
if nofparsed == 0 then
return -- something is wrong
end
if not trace_lpath then
return normal_apply ({ list },parsed,nofparsed,list.mi)
elseif trace_lprofile then
return profiled_apply({ list },parsed,nofparsed,list.mi)
else
return traced_apply ({ list },parsed,nofparsed,list.mi)
end
end
xml.applylpath = applylpath -- takes a table as first argment, which is what xml.filter will do
--[[ldx--
<p>This is the main filter function. It returns whatever is asked for.</p>
--ldx]]--
function xml.filter(root,pattern) -- no longer funny attribute handling here
return applylpath(root,pattern)
end
-- internal (parsed)
expressions.child = function(e,pattern)
return applylpath(e,pattern) -- todo: cache
end
expressions.count = function(e,pattern)
local collected = applylpath(e,pattern) -- todo: cache
return (collected and #collected) or 0
end
-- external
expressions.oneof = function(s,...) -- slow
local t = {...} for i=1,#t do if s == t[i] then return true end end return false
end
expressions.error = function(str)
xml.errorhandler("unknown function in lpath expression",tostring(str or "?"))
return false
end
expressions.undefined = function(s)
return s == nil
end
expressions.quit = function(s)
if s or s == nil then
quit_expression = true
end
return true
end
expressions.print = function(...)
print(...)
return true
end
expressions.contains = find
expressions.find = find
expressions.upper = upper
expressions.lower = lower
expressions.number = tonumber
expressions.boolean = toboolean
-- user interface
local function traverse(root,pattern,handle)
report_lpath("use 'xml.selection' instead for '%s'",pattern)
local collected = applylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
local r = e.__p__
handle(r,r.dt,e.ni)
end
end
end
local function selection(root,pattern,handle)
local collected = applylpath(root,pattern)
if collected then
if handle then
for c=1,#collected do
handle(collected[c])
end
else
return collected
end
end
end
xml.traverse = traverse -- old method, r, d, k
xml.selection = selection -- new method, simple handle
-- generic function finalizer (independant namespace)
local function dofunction(collected,fnc)
if collected then
local f = functions[fnc]
if f then
for c=1,#collected do
f(collected[c])
end
else
report_lpath("unknown function '%s'",fnc)
end
end
end
finalizers.xml["function"] = dofunction
finalizers.tex["function"] = dofunction
-- functions
expressions.text = function(e,n)
local rdt = e.__p__.dt
return (rdt and rdt[n]) or ""
end
expressions.name = function(e,n) -- ns + tg
local found = false
n = tonumber(n) or 0
if n == 0 then
found = type(e) == "table" and e
elseif n < 0 then
local d, k = e.__p__.dt, e.ni
for i=k-1,1,-1 do
local di = d[i]
if type(di) == "table" then
if n == -1 then
found = di
break
else
n = n + 1
end
end
end
else
local d, k = e.__p__.dt, e.ni
for i=k+1,#d,1 do
local di = d[i]
if type(di) == "table" then
if n == 1 then
found = di
break
else
n = n - 1
end
end
end
end
if found then
local ns, tg = found.rn or found.ns or "", found.tg
if ns ~= "" then
return ns .. ":" .. tg
else
return tg
end
else
return ""
end
end
expressions.tag = function(e,n) -- only tg
if not e then
return ""
else
local found = false
n = tonumber(n) or 0
if n == 0 then
found = (type(e) == "table") and e -- seems to fail
elseif n < 0 then
local d, k = e.__p__.dt, e.ni
for i=k-1,1,-1 do
local di = d[i]
if type(di) == "table" then
if n == -1 then
found = di
break
else
n = n + 1
end
end
end
else
local d, k = e.__p__.dt, e.ni
for i=k+1,#d,1 do
local di = d[i]
if type(di) == "table" then
if n == 1 then
found = di
break
else
n = n - 1
end
end
end
end
return (found and found.tg) or ""
end
end
--[[ldx--
<p>Often using an iterators looks nicer in the code than passing handler
functions. The <l n='lua'/> book describes how to use coroutines for that
purpose (<url href='http://www.lua.org/pil/9.3.html'/>). This permits
code like:</p>
<typing>
for r, d, k in xml.elements(xml.load('text.xml'),"title") do
print(d[k]) -- old method
end
for e in xml.collected(xml.load('text.xml'),"title") do
print(e) -- new one
end
</typing>
--ldx]]--
local wrap, yield = coroutine.wrap, coroutine.yield
function xml.elements(root,pattern,reverse) -- r, d, k
local collected = applylpath(root,pattern)
if collected then
if reverse then
return wrap(function() for c=#collected,1,-1 do
local e = collected[c] local r = e.__p__ yield(r,r.dt,e.ni)
end end)
else
return wrap(function() for c=1,#collected do
local e = collected[c] local r = e.__p__ yield(r,r.dt,e.ni)
end end)
end
end
return wrap(function() end)
end
function xml.collected(root,pattern,reverse) -- e
local collected = applylpath(root,pattern)
if collected then
if reverse then
return wrap(function() for c=#collected,1,-1 do yield(collected[c]) end end)
else
return wrap(function() for c=1,#collected do yield(collected[c]) end end)
end
end
return wrap(function() end)
end
-- handy
function xml.inspect(collection,pattern)
pattern = pattern or "."
for e in xml.collected(collection,pattern or ".") do
report_lpath("pattern %q\n\n%s\n",pattern,xml.tostring(e))
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['lxml-mis'] = {
version = 1.001,
comment = "this module is the basis for the lxml-* ones",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local xml, lpeg, string = xml, lpeg, string
local concat = table.concat
local type, next, tonumber, tostring, setmetatable, loadstring = type, next, tonumber, tostring, setmetatable, loadstring
local format, gsub, match = string.format, string.gsub, string.match
local lpegmatch, lpegpatterns = lpeg.match, lpeg.patterns
local P, S, R, C, V, Cc, Cs = lpeg.P, lpeg.S, lpeg.R, lpeg.C, lpeg.V, lpeg.Cc, lpeg.Cs
lpegpatterns.xml = lpegpatterns.xml or { }
local xmlpatterns = lpegpatterns.xml
--[[ldx--
<p>The following helper functions best belong to the <t>lxml-ini</t>
module. Some are here because we need then in the <t>mk</t>
document and other manuals, others came up when playing with
this module. Since this module is also used in <l n='mtxrun'/> we've
put them here instead of loading mode modules there then needed.</p>
--ldx]]--
local function xmlgsub(t,old,new) -- will be replaced
local dt = t.dt
if dt then
for k=1,#dt do
local v = dt[k]
if type(v) == "string" then
dt[k] = gsub(v,old,new)
else
xmlgsub(v,old,new)
end
end
end
end
function xml.stripleadingspaces(dk,d,k) -- cosmetic, for manual
if d and k then
local dkm = d[k-1]
if dkm and type(dkm) == "string" then
local s = match(dkm,"\n(%s+)")
xmlgsub(dk,"\n"..rep(" ",#s),"\n")
end
end
end
-- 100 * 2500 * "oeps< oeps> oeps&" : gsub:lpeg|lpeg|lpeg
--
-- 1021:0335:0287:0247
-- 10 * 1000 * "oeps< oeps> oeps& asfjhalskfjh alskfjh alskfjh alskfjh ;al J;LSFDJ"
--
-- 1559:0257:0288:0190 (last one suggested by roberto)
-- escaped = Cs((S("<&>") / xml.escapes + 1)^0)
-- escaped = Cs((S("<")/"<" + S(">")/">" + S("&")/"&" + 1)^0)
local normal = (1 - S("<&>"))^0
local special = P("<")/"<" + P(">")/">" + P("&")/"&"
local escaped = Cs(normal * (special * normal)^0)
-- 100 * 1000 * "oeps< oeps> oeps&" : gsub:lpeg == 0153:0280:0151:0080 (last one by roberto)
local normal = (1 - S"&")^0
local special = P("<")/"<" + P(">")/">" + P("&")/"&"
local unescaped = Cs(normal * (special * normal)^0)
-- 100 * 5000 * "oeps <oeps bla='oeps' foo='bar'> oeps </oeps> oeps " : gsub:lpeg == 623:501 msec (short tags, less difference)
local cleansed = Cs(((P("<") * (1-P(">"))^0 * P(">"))/"" + 1)^0)
xmlpatterns.escaped = escaped
xmlpatterns.unescaped = unescaped
xmlpatterns.cleansed = cleansed
function xml.escaped (str) return lpegmatch(escaped,str) end
function xml.unescaped(str) return lpegmatch(unescaped,str) end
function xml.cleansed (str) return lpegmatch(cleansed,str) end
-- this might move
function xml.fillin(root,pattern,str,check)
local e = xml.first(root,pattern)
if e then
local n = #e.dt
if not check or n == 0 or (n == 1 and e.dt[1] == "") then
e.dt = { str }
end
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['lxml-aux'] = {
version = 1.001,
comment = "this module is the basis for the lxml-* ones",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- not all functions here make sense anymore vbut we keep them for
-- compatibility reasons
local trace_manipulations = false trackers.register("lxml.manipulations", function(v) trace_manipulations = v end)
local report_xml = logs.reporter("xml")
local xml = xml
local xmlconvert, xmlcopy, xmlname = xml.convert, xml.copy, xml.name
local xmlinheritedconvert = xml.inheritedconvert
local xmlapplylpath = xml.applylpath
local type, setmetatable, getmetatable = type, setmetatable, getmetatable
local insert, remove, fastcopy = table.insert, table.remove, table.fastcopy
local gmatch, gsub = string.gmatch, string.gsub
local function report(what,pattern,c,e)
report_xml("%s element '%s' (root: '%s', position: %s, index: %s, pattern: %s)",what,xmlname(e),xmlname(e.__p__),c,e.ni,pattern)
end
local function withelements(e,handle,depth)
if e and handle then
local edt = e.dt
if edt then
depth = depth or 0
for i=1,#edt do
local e = edt[i]
if type(e) == "table" then
handle(e,depth)
withelements(e,handle,depth+1)
end
end
end
end
end
xml.withelements = withelements
function xml.withelement(e,n,handle) -- slow
if e and n ~= 0 and handle then
local edt = e.dt
if edt then
if n > 0 then
for i=1,#edt do
local ei = edt[i]
if type(ei) == "table" then
if n == 1 then
handle(ei)
return
else
n = n - 1
end
end
end
elseif n < 0 then
for i=#edt,1,-1 do
local ei = edt[i]
if type(ei) == "table" then
if n == -1 then
handle(ei)
return
else
n = n + 1
end
end
end
end
end
end
end
function xml.each(root,pattern,handle,reverse)
local collected = xmlapplylpath(root,pattern)
if collected then
if reverse then
for c=#collected,1,-1 do
handle(collected[c])
end
else
for c=1,#collected do
handle(collected[c])
end
end
return collected
end
end
function xml.processattributes(root,pattern,handle)
local collected = xmlapplylpath(root,pattern)
if collected and handle then
for c=1,#collected do
handle(collected[c].at)
end
end
return collected
end
--[[ldx--
<p>The following functions collect elements and texts.</p>
--ldx]]--
-- are these still needed -> lxml-cmp.lua
function xml.collect(root, pattern)
return xmlapplylpath(root,pattern)
end
function xml.collecttexts(root, pattern, flatten) -- todo: variant with handle
local collected = xmlapplylpath(root,pattern)
if collected and flatten then
local xmltostring = xml.tostring
for c=1,#collected do
collected[c] = xmltostring(collected[c].dt)
end
end
return collected or { }
end
function xml.collect_tags(root, pattern, nonamespace)
local collected = xmlapplylpath(root,pattern)
if collected then
local t, n = { }, 0
for c=1,#collected do
local e = collected[c]
local ns, tg = e.ns, e.tg
n = n + 1
if nonamespace then
t[n] = tg
elseif ns == "" then
t[n] = tg
else
t[n] = ns .. ":" .. tg
end
end
return t
end
end
--[[ldx--
<p>We've now arrived at the functions that manipulate the tree.</p>
--ldx]]--
local no_root = { no_root = true }
local function redo_ni(d)
for k=1,#d do
local dk = d[k]
if type(dk) == "table" then
dk.ni = k
end
end
end
local function xmltoelement(whatever,root)
if not whatever then
return nil
end
local element
if type(whatever) == "string" then
element = xmlinheritedconvert(whatever,root)
else
element = whatever -- we assume a table
end
if element.error then
return whatever -- string
end
if element then
end
return element
end
xml.toelement = xmltoelement
local function copiedelement(element,newparent)
if type(element) == "string" then
return element
else
element = xmlcopy(element).dt
if newparent and type(element) == "table" then
element.__p__ = newparent
end
return element
end
end
function xml.delete(root,pattern)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
local p = e.__p__
if p then
if trace_manipulations then
report('deleting',pattern,c,e)
end
local d = p.dt
remove(d,e.ni)
redo_ni(d) -- can be made faster and inlined
end
end
end
end
function xml.replace(root,pattern,whatever)
local element = root and xmltoelement(whatever,root)
local collected = element and xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
local p = e.__p__
if p then
if trace_manipulations then
report('replacing',pattern,c,e)
end
local d = p.dt
d[e.ni] = copiedelement(element,p)
redo_ni(d) -- probably not needed
end
end
end
end
local function wrap(e,wrapper)
local t = {
rn = e.rn,
tg = e.tg,
ns = e.ns,
at = e.at,
dt = e.dt,
__p__ = e,
}
setmetatable(t,getmetatable(e))
e.rn = wrapper.rn or e.rn or ""
e.tg = wrapper.tg or e.tg or ""
e.ns = wrapper.ns or e.ns or ""
e.at = fastcopy(wrapper.at)
e.dt = { t }
end
function xml.wrap(root,pattern,whatever)
if whatever then
local wrapper = xmltoelement(whatever,root)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
if trace_manipulations then
report('wrapping',pattern,c,e)
end
wrap(e,wrapper)
end
end
else
wrap(root,xmltoelement(pattern))
end
end
local function inject_element(root,pattern,whatever,prepend)
local element = root and xmltoelement(whatever,root)
local collected = element and xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
local r = e.__p__
local d, k, rri = r.dt, e.ni, r.ri
local edt = (rri and d[rri].dt) or (d and d[k] and d[k].dt)
if edt then
local be, af
local cp = copiedelement(element,e)
if prepend then
be, af = cp, edt
else
be, af = edt, cp
end
local bn = #be
for i=1,#af do
bn = bn + 1
be[bn] = af[i]
end
if rri then
r.dt[rri].dt = be
else
d[k].dt = be
end
redo_ni(d)
end
end
end
end
local function insert_element(root,pattern,whatever,before) -- todo: element als functie
local element = root and xmltoelement(whatever,root)
local collected = element and xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
local r = e.__p__
local d, k = r.dt, e.ni
if not before then
k = k + 1
end
insert(d,k,copiedelement(element,r))
redo_ni(d)
end
end
end
xml.insert_element = insert_element
xml.insertafter = insert_element
xml.insertbefore = function(r,p,e) insert_element(r,p,e,true) end
xml.injectafter = inject_element
xml.injectbefore = function(r,p,e) inject_element(r,p,e,true) end
local function include(xmldata,pattern,attribute,recursive,loaddata)
-- parse="text" (default: xml), encoding="" (todo)
-- attribute = attribute or 'href'
pattern = pattern or 'include'
loaddata = loaddata or io.loaddata
local collected = xmlapplylpath(xmldata,pattern)
if collected then
for c=1,#collected do
local ek = collected[c]
local name = nil
local ekdt = ek.dt
local ekat = ek.at
local epdt = ek.__p__.dt
if not attribute or attribute == "" then
name = (type(ekdt) == "table" and ekdt[1]) or ekdt -- check, probably always tab or str
end
if not name then
for a in gmatch(attribute or "href","([^|]+)") do
name = ekat[a]
if name then break end
end
end
local data = (name and name ~= "" and loaddata(name)) or ""
if data == "" then
epdt[ek.ni] = "" -- xml.empty(d,k)
elseif ekat["parse"] == "text" then
-- for the moment hard coded
epdt[ek.ni] = xml.escaped(data) -- d[k] = xml.escaped(data)
else
local xi = xmlinheritedconvert(data,xmldata)
if not xi then
epdt[ek.ni] = "" -- xml.empty(d,k)
else
if recursive then
include(xi,pattern,attribute,recursive,loaddata)
end
epdt[ek.ni] = xml.body(xi) -- xml.assign(d,k,xi)
end
end
end
end
end
xml.include = include
local function stripelement(e,nolines,anywhere)
local edt = e.dt
if edt then
if anywhere then
local t, n = { }, 0
for e=1,#edt do
local str = edt[e]
if type(str) ~= "string" then
n = n + 1
t[n] = str
elseif str ~= "" then
-- todo: lpeg for each case
if nolines then
str = gsub(str,"%s+"," ")
end
str = gsub(str,"^%s*(.-)%s*$","%1")
if str ~= "" then
n = n + 1
t[n] = str
end
end
end
e.dt = t
else
-- we can assume a regular sparse xml table with no successive strings
-- otherwise we should use a while loop
if #edt > 0 then
-- strip front
local str = edt[1]
if type(str) ~= "string" then
-- nothing
elseif str == "" then
remove(edt,1)
else
if nolines then
str = gsub(str,"%s+"," ")
end
str = gsub(str,"^%s+","")
if str == "" then
remove(edt,1)
else
edt[1] = str
end
end
end
local nedt = #edt
if nedt > 0 then
-- strip end
local str = edt[nedt]
if type(str) ~= "string" then
-- nothing
elseif str == "" then
remove(edt)
else
if nolines then
str = gsub(str,"%s+"," ")
end
str = gsub(str,"%s+$","")
if str == "" then
remove(edt)
else
edt[nedt] = str
end
end
end
end
end
return e -- convenient
end
xml.stripelement = stripelement
function xml.strip(root,pattern,nolines,anywhere) -- strips all leading and trailing spacing
local collected = xmlapplylpath(root,pattern) -- beware, indices no longer are valid now
if collected then
for i=1,#collected do
stripelement(collected[i],nolines,anywhere)
end
end
end
local function renamespace(root, oldspace, newspace) -- fast variant
local ndt = #root.dt
for i=1,ndt or 0 do
local e = root[i]
if type(e) == "table" then
if e.ns == oldspace then
e.ns = newspace
if e.rn then
e.rn = newspace
end
end
local edt = e.dt
if edt then
renamespace(edt, oldspace, newspace)
end
end
end
end
xml.renamespace = renamespace
function xml.remaptag(root, pattern, newtg)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
collected[c].tg = newtg
end
end
end
function xml.remapnamespace(root, pattern, newns)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
collected[c].ns = newns
end
end
end
function xml.checknamespace(root, pattern, newns)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
if (not e.rn or e.rn == "") and e.ns == "" then
e.rn = newns
end
end
end
end
function xml.remapname(root, pattern, newtg, newns, newrn)
local collected = xmlapplylpath(root,pattern)
if collected then
for c=1,#collected do
local e = collected[c]
e.tg, e.ns, e.rn = newtg, newns, newrn
end
end
end
--[[ldx--
<p>Here are a few synonyms.</p>
--ldx]]--
xml.all = xml.each
xml.insert = xml.insertafter
xml.inject = xml.injectafter
xml.after = xml.insertafter
xml.before = xml.insertbefore
xml.process = xml.each
-- obsolete
xml.obsolete = xml.obsolete or { }
local obsolete = xml.obsolete
xml.strip_whitespace = xml.strip obsolete.strip_whitespace = xml.strip
xml.collect_elements = xml.collect obsolete.collect_elements = xml.collect
xml.delete_element = xml.delete obsolete.delete_element = xml.delete
xml.replace_element = xml.replace obsolete.replace_element = xml.replacet
xml.each_element = xml.each obsolete.each_element = xml.each
xml.process_elements = xml.process obsolete.process_elements = xml.process
xml.insert_element_after = xml.insertafter obsolete.insert_element_after = xml.insertafter
xml.insert_element_before = xml.insertbefore obsolete.insert_element_before = xml.insertbefore
xml.inject_element_after = xml.injectafter obsolete.inject_element_after = xml.injectafter
xml.inject_element_before = xml.injectbefore obsolete.inject_element_before = xml.injectbefore
xml.process_attributes = xml.processattributes obsolete.process_attributes = xml.processattributes
xml.collect_texts = xml.collecttexts obsolete.collect_texts = xml.collecttexts
xml.inject_element = xml.inject obsolete.inject_element = xml.inject
xml.remap_tag = xml.remaptag obsolete.remap_tag = xml.remaptag
xml.remap_name = xml.remapname obsolete.remap_name = xml.remapname
xml.remap_namespace = xml.remapnamespace obsolete.remap_namespace = xml.remapnamespace
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['lxml-xml'] = {
version = 1.001,
comment = "this module is the basis for the lxml-* ones",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local concat = table.concat
local xml = xml
local finalizers = xml.finalizers.xml
local xmlfilter = xml.filter -- we could inline this one for speed
local xmltostring = xml.tostring
local xmlserialize = xml.serialize
local xmlcollected = xml.collected
local xmlnewhandlers = xml.newhandlers
local function first(collected) -- wrong ?
return collected and collected[1]
end
local function last(collected)
return collected and collected[#collected]
end
local function all(collected)
return collected
end
local reverse = table.reversed
local function attribute(collected,name)
if collected and #collected > 0 then
local at = collected[1].at
return at and at[name]
end
end
local function att(id,name)
local at = id.at
return at and at[name]
end
local function count(collected)
return (collected and #collected) or 0
end
local function position(collected,n)
if collected then
n = tonumber(n) or 0
if n < 0 then
return collected[#collected + n + 1]
elseif n > 0 then
return collected[n]
else
return collected[1].mi or 0
end
end
end
local function match(collected)
return (collected and collected[1].mi) or 0 -- match
end
local function index(collected)
if collected then
return collected[1].ni
end
end
local function attributes(collected,arguments)
if collected then
local at = collected[1].at
if arguments then
return at[arguments]
elseif next(at) then
return at -- all of them
end
end
end
local function chainattribute(collected,arguments) -- todo: optional levels
if collected then
local e = collected[1]
while e do
local at = e.at
if at then
local a = at[arguments]
if a then
return a
end
else
break -- error
end
e = e.__p__
end
end
return ""
end
local function raw(collected) -- hybrid (not much different from text so it might go)
if collected then
local e = collected[1] or collected
return e and xmltostring(e) or "" -- only first as we cannot concat function
else
return ""
end
end
--
local xmltexthandler = xmlnewhandlers {
name = "string",
initialize = function()
result = { }
return result
end,
finalize = function()
return concat(result)
end,
handle = function(...)
result[#result+1] = concat { ... }
end,
escape = false,
}
local function xmltotext(root)
local dt = root.dt
if not dt then
return ""
end
local nt = #dt -- string or table
if nt == 0 then
return ""
elseif nt == 1 and type(dt[1]) == "string" then
return dt[1] -- no escaping of " ' < > &
else
return xmlserialize(root,xmltexthandler) or ""
end
end
--
local function text(collected) -- hybrid
if collected then
local e = collected[1] or collected
return (e and xmltotext(e)) or ""
else
return ""
end
end
local function texts(collected)
if collected then
local t, n = { }, 0
for c=1,#collected do
local e = collected[c]
if e and e.dt then
n = n + 1
t[n] = e.dt
end
end
return t
end
end
local function tag(collected,n)
if collected then
local c
if n == 0 or not n then
c = collected[1]
elseif n > 1 then
c = collected[n]
else
c = collected[#collected-n+1]
end
return c and c.tg
end
end
local function name(collected,n)
if collected then
local c
if n == 0 or not n then
c = collected[1]
elseif n > 1 then
c = collected[n]
else
c = collected[#collected-n+1]
end
if c then
if c.ns == "" then
return c.tg
else
return c.ns .. ":" .. c.tg
end
end
end
end
local function tags(collected,nonamespace)
if collected then
local t, n = { }, 0
for c=1,#collected do
local e = collected[c]
local ns, tg = e.ns, e.tg
n = n + 1
if nonamespace or ns == "" then
t[n] = tg
else
t[n] = ns .. ":" .. tg
end
end
return t
end
end
local function empty(collected)
if collected then
for c=1,#collected do
local e = collected[c]
if e then
local edt = e.dt
if edt then
local n = #edt
if n == 1 then
local edk = edt[1]
local typ = type(edk)
if typ == "table" then
return false
elseif edk ~= "" then -- maybe an extra tester for spacing only
return false
end
elseif n > 1 then
return false
end
end
end
end
end
return true
end
finalizers.first = first
finalizers.last = last
finalizers.all = all
finalizers.reverse = reverse
finalizers.elements = all
finalizers.default = all
finalizers.attribute = attribute
finalizers.att = att
finalizers.count = count
finalizers.position = position
finalizers.match = match
finalizers.index = index
finalizers.attributes = attributes
finalizers.chainattribute = chainattribute
finalizers.text = text
finalizers.texts = texts
finalizers.tag = tag
finalizers.name = name
finalizers.tags = tags
finalizers.empty = empty
-- shortcuts -- we could support xmlfilter(id,pattern,first)
function xml.first(id,pattern)
return first(xmlfilter(id,pattern))
end
function xml.last(id,pattern)
return last(xmlfilter(id,pattern))
end
function xml.count(id,pattern)
return count(xmlfilter(id,pattern))
end
function xml.attribute(id,pattern,a,default)
return attribute(xmlfilter(id,pattern),a,default)
end
function xml.raw(id,pattern)
if pattern then
return raw(xmlfilter(id,pattern))
else
return raw(id)
end
end
function xml.text(id,pattern)
if pattern then
-- return text(xmlfilter(id,pattern))
local collected = xmlfilter(id,pattern)
return (collected and xmltotext(collected[1])) or ""
elseif id then
-- return text(id)
return xmltotext(id) or ""
else
return ""
end
end
xml.content = text
--
function xml.position(id,pattern,n) -- element
return position(xmlfilter(id,pattern),n)
end
function xml.match(id,pattern) -- number
return match(xmlfilter(id,pattern))
end
function xml.empty(id,pattern)
return empty(xmlfilter(id,pattern))
end
xml.all = xml.filter
xml.index = xml.position
xml.found = xml.filter
-- a nice one:
local function totable(x)
local t = { }
for e in xmlcollected(x[1] or x,"/*") do
t[e.tg] = xmltostring(e.dt) or ""
end
return next(t) and t or nil
end
xml.table = totable
finalizers.table = totable
local function textonly(e,t)
if e then
local edt = e.dt
if edt then
for i=1,#edt do
local e = edt[i]
if type(e) == "table" then
textonly(e,t)
else
t[#t+1] = e
end
end
end
end
return t
end
function xml.textonly(e) -- no pattern
return concat(textonly(e,{}))
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-ini'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files",
}
local gsub, find, gmatch, char = string.gsub, string.find, string.gmatch, string.char
local concat = table.concat
local next, type = next, type
local filedirname, filebasename, fileextname, filejoin = file.dirname, file.basename, file.extname, file.join
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local trace_detail = false trackers.register("resolvers.details", function(v) trace_detail = v end)
local trace_expansions = false trackers.register("resolvers.expansions", function(v) trace_expansions = v end)
local report_initialization = logs.reporter("resolvers","initialization")
local ostype, osname, ossetenv, osgetenv = os.type, os.name, os.setenv, os.getenv
-- The code here used to be part of a data-res but for convenience
-- we now split it over multiple files. As this file is now the
-- starting point we introduce resolvers here.
resolvers = resolvers or { }
local resolvers = resolvers
-- We don't want the kpse library to kick in. Also, we want to be able to
-- execute programs. Control over execution is implemented later.
texconfig.kpse_init = false
texconfig.shell_escape = 't'
kpse = { original = kpse }
setmetatable(kpse, {
__index = function(kp,name)
report_initialization("fatal error: kpse library is accessed (key: %s)",name)
os.exit()
end
} )
-- First we check a couple of environment variables. Some might be
-- set already but we need then later on. We start with the system
-- font path.
do
local osfontdir = osgetenv("OSFONTDIR")
if osfontdir and osfontdir ~= "" then
-- ok
elseif osname == "windows" then
ossetenv("OSFONTDIR","c:/windows/fonts//")
elseif osname == "macosx" then
ossetenv("OSFONTDIR","$HOME/Library/Fonts//;/Library/Fonts//;/System/Library/Fonts//")
end
end
-- Next comes the user's home path. We need this as later on we have
-- to replace ~ with its value.
do
local homedir = osgetenv(ostype == "windows" and 'USERPROFILE' or 'HOME') or ''
if not homedir or homedir == "" then
homedir = char(127) -- we need a value, later we wil trigger on it
end
homedir = file.collapsepath(homedir)
ossetenv("HOME", homedir) -- can be used in unix cnf files
ossetenv("USERPROFILE",homedir) -- can be used in windows cnf files
environment.homedir = homedir
end
-- The following code sets the name of the own binary and its
-- path. This is fallback code as we have os.selfdir now.
do
local args = environment.originalarguments or arg -- this needs a cleanup
local ownbin = environment.ownbin or args[-2] or arg[-2] or args[-1] or arg[-1] or arg[0] or "luatex"
local ownpath = environment.ownpath or os.selfdir
ownbin = file.collapsepath(ownbin)
ownpath = file.collapsepath(ownpath)
if not ownpath or ownpath == "" or ownpath == "unset" then
ownpath = args[-1] or arg[-1]
ownpath = ownpath and filedirname(gsub(ownpath,"\\","/"))
if not ownpath or ownpath == "" then
ownpath = args[-0] or arg[-0]
ownpath = ownpath and filedirname(gsub(ownpath,"\\","/"))
end
local binary = ownbin
if not ownpath or ownpath == "" then
ownpath = ownpath and filedirname(binary)
end
if not ownpath or ownpath == "" then
if os.binsuffix ~= "" then
binary = file.replacesuffix(binary,os.binsuffix)
end
local path = osgetenv("PATH")
if path then
for p in gmatch(path,"[^"..io.pathseparator.."]+") do
local b = filejoin(p,binary)
if lfs.isfile(b) then
-- we assume that after changing to the path the currentdir function
-- resolves to the real location and use this side effect here; this
-- trick is needed because on the mac installations use symlinks in the
-- path instead of real locations
local olddir = lfs.currentdir()
if lfs.chdir(p) then
local pp = lfs.currentdir()
if trace_locating and p ~= pp then
report_initialization("following symlink '%s' to '%s'",p,pp)
end
ownpath = pp
lfs.chdir(olddir)
else
if trace_locating then
report_initialization("unable to check path '%s'",p)
end
ownpath = p
end
break
end
end
end
end
if not ownpath or ownpath == "" then
ownpath = "."
report_initialization("forcing fallback ownpath .")
elseif trace_locating then
report_initialization("using ownpath '%s'",ownpath)
end
end
environment.ownbin = ownbin
environment.ownpath = ownpath
end
resolvers.ownpath = environment.ownpath
function resolvers.getownpath()
return environment.ownpath
end
-- The self variables permit us to use only a few (or even no)
-- environment variables.
do
local ownpath = environment.ownpath or dir.current()
if ownpath then
ossetenv('SELFAUTOLOC', file.collapsepath(ownpath))
ossetenv('SELFAUTODIR', file.collapsepath(ownpath .. "/.."))
ossetenv('SELFAUTOPARENT', file.collapsepath(ownpath .. "/../.."))
else
report_initialization("error: unable to locate ownpath")
os.exit()
end
end
-- The running os:
-- todo: check is context sits here os.platform is more trustworthy
-- that the bin check as mtx-update runs from another path
local texos = environment.texos or osgetenv("TEXOS")
local texmfos = environment.texmfos or osgetenv('SELFAUTODIR')
if not texos or texos == "" then
texos = file.basename(texmfos)
end
ossetenv('TEXMFOS', texmfos) -- full bin path
ossetenv('TEXOS', texos) -- partial bin parent
ossetenv('SELFAUTOSYSTEM',os.platform) -- bonus
environment.texos = texos
environment.texmfos = texmfos
-- The current root:
local texroot = environment.texroot or osgetenv("TEXROOT")
if not texroot or texroot == "" then
texroot = osgetenv('SELFAUTOPARENT')
ossetenv('TEXROOT',texroot)
end
environment.texroot = file.collapsepath(texroot)
-- Tracing. Todo ...
function resolvers.settrace(n) -- no longer number but: 'locating' or 'detail'
if n then
trackers.disable("resolvers.*")
trackers.enable("resolvers."..n)
end
end
resolvers.settrace(osgetenv("MTX_INPUT_TRACE"))
-- todo:
-- if profiler and osgetenv("MTX_PROFILE_RUN") == "YES" then
-- profiler.start("luatex-profile.log")
-- end
-- a forward definition
if not resolvers.resolve then
function resolvers.resolve (s) return s end
function resolvers.unresolve(s) return s end
function resolvers.repath (s) return s end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-exp'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files",
}
local format, find, gmatch, lower, char, sub = string.format, string.find, string.gmatch, string.lower, string.char, string.sub
local concat, sort = table.concat, table.sort
local lpegmatch, lpegpatterns = lpeg.match, lpeg.patterns
local Ct, Cs, Cc, P, C, S = lpeg.Ct, lpeg.Cs, lpeg.Cc, lpeg.P, lpeg.C, lpeg.S
local type, next = type, next
local ostype = os.type
local collapsepath = file.collapsepath
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local trace_expansions = false trackers.register("resolvers.expansions", function(v) trace_expansions = v end)
local report_expansions = logs.reporter("resolvers","expansions")
local resolvers = resolvers
-- As this bit of code is somewhat special it gets its own module. After
-- all, when working on the main resolver code, I don't want to scroll
-- past this every time. See data-obs.lua for the gsub variant.
local function f_first(a,b)
local t, n = { }, 0
for s in gmatch(b,"[^,]+") do
n = n + 1 ; t[n] = a .. s
end
return concat(t,",")
end
local function f_second(a,b)
local t, n = { }, 0
for s in gmatch(a,"[^,]+") do
n = n + 1 ; t[n] = s .. b
end
return concat(t,",")
end
local function f_both(a,b)
local t, n = { }, 0
for sa in gmatch(a,"[^,]+") do
for sb in gmatch(b,"[^,]+") do
n = n + 1 ; t[n] = sa .. sb
end
end
return concat(t,",")
end
local left = P("{")
local right = P("}")
local var = P((1 - S("{}" ))^0)
local set = P((1 - S("{},"))^0)
local other = P(1)
local l_first = Cs( ( Cc("{") * (C(set) * left * C(var) * right / f_first) * Cc("}") + other )^0 )
local l_second = Cs( ( Cc("{") * (left * C(var) * right * C(set) / f_second) * Cc("}") + other )^0 )
local l_both = Cs( ( Cc("{") * (left * C(var) * right * left * C(var) * right / f_both) * Cc("}") + other )^0 )
local l_rest = Cs( ( left * var * (left/"") * var * (right/"") * var * right + other )^0 )
local stripper_1 = lpeg.stripper ("{}@")
local replacer_1 = lpeg.replacer { { ",}", ",@}" }, { "{,", "{@," }, }
local function splitpathexpr(str, newlist, validate) -- I couldn't resist lpegging it (nice exercise).
if trace_expansions then
report_expansions("expanding variable '%s'",str)
end
local t, ok, done = newlist or { }, false, false
local n = #t
str = lpegmatch(replacer_1,str)
repeat local old = str
repeat local old = str ; str = lpegmatch(l_first, str) until old == str
repeat local old = str ; str = lpegmatch(l_second,str) until old == str
repeat local old = str ; str = lpegmatch(l_both, str) until old == str
repeat local old = str ; str = lpegmatch(l_rest, str) until old == str
until old == str -- or not find(str,"{")
str = lpegmatch(stripper_1,str)
if validate then
for s in gmatch(str,"[^,]+") do
s = validate(s)
if s then
n = n + 1 ; t[n] = s
end
end
else
for s in gmatch(str,"[^,]+") do
n = n + 1 ; t[n] = s
end
end
if trace_expansions then
for k=1,#t do
report_expansions("% 4i: %s",k,t[k])
end
end
return t
end
-- We could make the previous one public.
local function validate(s)
s = collapsepath(s) -- already keeps the //
return s ~= "" and not find(s,"^!*unset/*$") and s
end
resolvers.validatedpath = validate -- keeps the trailing //
function resolvers.expandedpathfromlist(pathlist)
local newlist = { }
for k=1,#pathlist do
splitpathexpr(pathlist[k],newlist,validate)
end
return newlist
end
-- {a,b,c,d}
-- a,b,c/{p,q,r},d
-- a,b,c/{p,q,r}/d/{x,y,z}//
-- a,b,c/{p,q/{x,y,z},r},d/{p,q,r}
-- a,b,c/{p,q/{x,y,z},r},d/{p,q,r}
-- a{b,c}{d,e}f
-- {a,b,c,d}
-- {a,b,c/{p,q,r},d}
-- {a,b,c/{p,q,r}/d/{x,y,z}//}
-- {a,b,c/{p,q/{x,y,z}},d/{p,q,r}}
-- {a,b,c/{p,q/{x,y,z},w}v,d/{p,q,r}}
-- {$SELFAUTODIR,$SELFAUTOPARENT}{,{/share,}/texmf{-local,.local,}/web2c}
-- local cleanup = lpeg.replacer {
-- { "!" , "" },
-- { "\\" , "/" },
-- }
--
-- local homedir
--
-- function resolvers.cleanpath(str) -- tricky, maybe only simple paths
-- if not homedir then
-- homedir = lpegmatch(cleanup,environment.homedir or "")
-- if homedir == char(127) or homedir == "" or not lfs.isdir(homedir) then
-- if trace_expansions then
-- report_expansions("no home dir set, ignoring dependent paths")
-- end
-- function resolvers.cleanpath(str)
-- if find(str,"~") then
-- return "" -- special case
-- else
-- return str and lpegmatch(cleanup,str)
-- end
-- end
-- else
-- cleanup = lpeg.replacer {
-- { "!" , "" },
-- { "\\" , "/" },
-- { "~" , homedir },
-- }
-- function resolvers.cleanpath(str)
-- return str and lpegmatch(cleanup,str)
-- end
-- end
-- end
-- return resolvers.cleanpath(str)
-- end
function resolvers.cleanpath(str) -- tricky, maybe only simple paths
local doslashes = (P("\\")/"/" + 1)^0
local donegation = (P("!") /"" )^0
local homedir = lpegmatch(Cs(donegation * doslashes),environment.homedir or "")
if homedir == "~" or homedir == "" or not lfs.isdir(homedir) then
if trace_expansions then
report_expansions("no home dir set, ignoring dependent paths")
end
function resolvers.cleanpath(str)
if not str or find(str,"~") then
return "" -- special case
else
return lpegmatch(cleanup,str)
end
end
else
local dohome = ((P("~")+P("$HOME"))/homedir)^0
local cleanup = Cs(donegation * dohome * doslashes)
function resolvers.cleanpath(str)
return str and lpegmatch(cleanup,str) or ""
end
end
return resolvers.cleanpath(str)
end
-- print(resolvers.cleanpath(""))
-- print(resolvers.cleanpath("!"))
-- print(resolvers.cleanpath("~"))
-- print(resolvers.cleanpath("~/test"))
-- print(resolvers.cleanpath("!~/test"))
-- print(resolvers.cleanpath("~/test~test"))
-- This one strips quotes and funny tokens.
local expandhome = P("~") / "$HOME" -- environment.homedir
local dodouble = P('"')/"" * (expandhome + (1 - P('"')))^0 * P('"')/""
local dosingle = P("'")/"" * (expandhome + (1 - P("'")))^0 * P("'")/""
local dostring = (expandhome + 1 )^0
local stripper = Cs(
lpegpatterns.unspacer * (dosingle + dodouble + dostring) * lpegpatterns.unspacer
)
function resolvers.checkedvariable(str) -- assumes str is a string
return lpegmatch(stripper,str) or str
end
-- The path splitter:
-- A config (optionally) has the paths split in tables. Internally
-- we join them and split them after the expansion has taken place. This
-- is more convenient.
local cache = { }
----- splitter = lpeg.tsplitat(S(ostype == "windows" and ";" or ":;")) -- maybe add ,
local splitter = lpeg.tsplitat(";") -- as we move towards urls, prefixes and use tables we no longer do :
local backslashswapper = lpeg.replacer("\\","/")
local function splitconfigurationpath(str) -- beware, this can be either a path or a { specification }
if str then
local found = cache[str]
if not found then
if str == "" then
found = { }
else
local split = lpegmatch(splitter,lpegmatch(backslashswapper,str)) -- can be combined
found = { }
local noffound = 0
for i=1,#split do
local s = split[i]
if not find(s,"^{*unset}*") then
noffound = noffound + 1
found[noffound] = s
end
end
if trace_expansions then
report_expansions("splitting path specification '%s'",str)
for k=1,noffound do
report_expansions("% 4i: %s",k,found[k])
end
end
cache[str] = found
end
end
return found
end
end
resolvers.splitconfigurationpath = splitconfigurationpath
function resolvers.splitpath(str)
if type(str) == 'table' then
return str
else
return splitconfigurationpath(str)
end
end
function resolvers.joinpath(str)
if type(str) == 'table' then
return file.joinpath(str)
else
return str
end
end
-- The next function scans directories and returns a hash where the
-- entries are either strings or tables.
-- starting with . or .. etc or funny char
-- a lot of this caching can be stripped away when we have ssd's everywhere
--
-- we could cache all the (sub)paths here if needed
local attributes, directory = lfs.attributes, lfs.dir
local weird = P(".")^1 + lpeg.anywhere(S("~`!#$%^&*()={}[]:;\"\'||<>,?\n\r\t"))
local timer = { }
local scanned = { }
local nofscans = 0
local scancache = { }
local function scan(files,spec,path,n,m,r)
local full = (path == "" and spec) or (spec .. path .. '/')
local dirs = { }
local nofdirs = 0
for name in directory(full) do
if not lpegmatch(weird,name) then
local mode = attributes(full..name,'mode')
if mode == 'file' then
n = n + 1
local f = files[name]
if f then
if type(f) == 'string' then
files[name] = { f, path }
else
f[#f+1] = path
end
else -- probably unique anyway
files[name] = path
local lower = lower(name)
if name ~= lower then
files["remap:"..lower] = name
r = r + 1
end
end
elseif mode == 'directory' then
m = m + 1
nofdirs = nofdirs + 1
if path ~= "" then
dirs[nofdirs] = path..'/'..name
else
dirs[nofdirs] = name
end
end
end
end
if nofdirs > 0 then
sort(dirs)
for i=1,nofdirs do
files, n, m, r = scan(files,spec,dirs[i],n,m,r)
end
end
scancache[sub(full,1,-2)] = files
return files, n, m, r
end
local fullcache = { }
function resolvers.scanfiles(path,branch,usecache)
statistics.starttiming(timer)
local realpath = resolvers.resolve(path) -- no shortcut
if usecache then
local files = fullcache[realpath]
if files then
if trace_locating then
report_expansions("using caches scan of path '%s', branch '%s'",path,branch or path)
end
return files
end
end
if trace_locating then
report_expansions("scanning path '%s', branch '%s'",path,branch or path)
end
local files, n, m, r = scan({ },realpath .. '/',"",0,0,0)
files.__path__ = path -- can be selfautoparent:texmf-whatever
files.__files__ = n
files.__directories__ = m
files.__remappings__ = r
if trace_locating then
report_expansions("%s files found on %s directories with %s uppercase remappings",n,m,r)
end
if usecache then
scanned[#scanned+1] = realpath
fullcache[realpath] = files
end
nofscans = nofscans + 1
statistics.stoptiming(timer)
return files
end
local function simplescan(files,spec,path) -- first match only, no map and such
local full = (path == "" and spec) or (spec .. path .. '/')
local dirs = { }
local nofdirs = 0
for name in directory(full) do
if not lpegmatch(weird,name) then
local mode = attributes(full..name,'mode')
if mode == 'file' then
if not files[name] then
-- only first match
files[name] = path
end
elseif mode == 'directory' then
nofdirs = nofdirs + 1
if path ~= "" then
dirs[nofdirs] = path..'/'..name
else
dirs[nofdirs] = name
end
end
end
end
if nofdirs > 0 then
sort(dirs)
for i=1,nofdirs do
files = simplescan(files,spec,dirs[i])
end
end
return files
end
local simplecache = { }
local nofsharedscans = 0
function resolvers.simplescanfiles(path,branch,usecache)
statistics.starttiming(timer)
local realpath = resolvers.resolve(path) -- no shortcut
if usecache then
local files = simplecache[realpath]
if not files then
files = scancache[realpath]
if files then
nofsharedscans = nofsharedscans + 1
end
end
if files then
if trace_locating then
report_expansions("using caches scan of path '%s', branch '%s'",path,branch or path)
end
return files
end
end
if trace_locating then
report_expansions("scanning path '%s', branch '%s'",path,branch or path)
end
local files = simplescan({ },realpath .. '/',"")
if trace_locating then
report_expansions("%s files found",table.count(files))
end
if usecache then
scanned[#scanned+1] = realpath
simplecache[realpath] = files
end
nofscans = nofscans + 1
statistics.stoptiming(timer)
return files
end
function resolvers.scandata()
table.sort(scanned)
return {
n = nofscans,
shared = nofsharedscans,
time = statistics.elapsedtime(timer),
paths = scanned,
}
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-env'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files",
}
local lower, gsub = string.lower, string.gsub
local resolvers = resolvers
local allocate = utilities.storage.allocate
local setmetatableindex = table.setmetatableindex
local fileextname = file.extname
local formats = allocate()
local suffixes = allocate()
local dangerous = allocate()
local suffixmap = allocate()
resolvers.formats = formats
resolvers.suffixes = suffixes
resolvers.dangerous = dangerous
resolvers.suffixmap = suffixmap
local relations = allocate { -- todo: handlers also here
core = {
ofm = { -- will become obsolete
names = { "ofm", "omega font metric", "omega font metrics" },
variable = 'OFMFONTS',
suffixes = { 'ofm', 'tfm' },
},
ovf = { -- will become obsolete
names = { "ovf", "omega virtual font", "omega virtual fonts" },
variable = 'OVFFONTS',
suffixes = { 'ovf', 'vf' },
},
tfm = {
names = { "tfm", "tex font metric", "tex font metrics" },
variable = 'TFMFONTS',
suffixes = { 'tfm' },
},
vf = {
names = { "vf", "virtual font", "virtual fonts" },
variable = 'VFFONTS',
suffixes = { 'vf' },
},
otf = {
names = { "otf", "opentype", "opentype font", "opentype fonts"},
variable = 'OPENTYPEFONTS',
suffixes = { 'otf' },
},
ttf = {
names = { "ttf", "truetype", "truetype font", "truetype fonts", "truetype collection", "truetype collections", "truetype dictionary", "truetype dictionaries" },
variable = 'TTFONTS',
suffixes = { 'ttf', 'ttc', 'dfont' },
},
afm = {
names = { "afm", "adobe font metric", "adobe font metrics" },
variable = "AFMFONTS",
suffixes = { "afm" },
},
pfb = {
names = { "pfb", "type1", "type 1", "type1 font", "type 1 font", "type1 fonts", "type 1 fonts" },
variable = 'T1FONTS',
suffixes = { 'pfb', 'pfa' },
},
fea = {
names = { "fea", "font feature", "font features", "font feature file", "font feature files" },
variable = 'FONTFEATURES',
suffixes = { 'fea' },
},
cid = {
names = { "cid", "cid map", "cid maps", "cid file", "cid files" },
variable = 'FONTCIDMAPS',
suffixes = { 'cid', 'cidmap' },
},
fmt = {
names = { "fmt", "format", "tex format" },
variable = 'TEXFORMATS',
suffixes = { 'fmt' },
},
mem = { -- will become obsolete
names = { 'mem', "metapost format" },
variable = 'MPMEMS',
suffixes = { 'mem' },
},
mp = {
names = { "mp" },
variable = 'MPINPUTS',
suffixes = { 'mp', 'mpvi', 'mpiv', 'mpii' },
},
tex = {
names = { "tex" },
variable = 'TEXINPUTS',
suffixes = { 'tex', "mkvi", "mkiv", "mkii" },
},
icc = {
names = { "icc", "icc profile", "icc profiles" },
variable = 'ICCPROFILES',
suffixes = { 'icc' },
},
texmfscripts = {
names = { "texmfscript", "texmfscripts", "script", "scripts" },
variable = 'TEXMFSCRIPTS',
suffixes = { 'rb', 'pl', 'py' },
},
lua = {
names = { "lua" },
variable = 'LUAINPUTS',
suffixes = { 'lua', 'luc', 'tma', 'tmc' },
},
lib = {
names = { "lib" },
variable = 'CLUAINPUTS',
suffixes = os.libsuffix and { os.libsuffix } or { 'dll', 'so' },
},
bib = {
names = { 'bib' },
suffixes = { 'bib' },
},
bst = {
names = { 'bst' },
suffixes = { 'bst' },
},
fontconfig = {
names = { 'fontconfig', 'fontconfig file', 'fontconfig files' },
variable = 'FONTCONFIG_PATH',
},
},
obsolete = {
enc = {
names = { "enc", "enc files", "enc file", "encoding files", "encoding file" },
variable = 'ENCFONTS',
suffixes = { 'enc' },
},
map = {
names = { "map", "map files", "map file" },
variable = 'TEXFONTMAPS',
suffixes = { 'map' },
},
lig = {
names = { "lig files", "lig file", "ligature file", "ligature files" },
variable = 'LIGFONTS',
suffixes = { 'lig' },
},
opl = {
names = { "opl" },
variable = 'OPLFONTS',
suffixes = { 'opl' },
},
ovp = {
names = { "ovp" },
variable = 'OVPFONTS',
suffixes = { 'ovp' },
},
},
kpse = { -- subset
base = {
names = { 'base', "metafont format" },
variable = 'MFBASES',
suffixes = { 'base', 'bas' },
},
cmap = {
names = { 'cmap', 'cmap files', 'cmap file' },
variable = 'CMAPFONTS',
suffixes = { 'cmap' },
},
cnf = {
names = { 'cnf' },
suffixes = { 'cnf' },
},
web = {
names = { 'web' },
suffixes = { 'web', 'ch' }
},
cweb = {
names = { 'cweb' },
suffixes = { 'w', 'web', 'ch' },
},
gf = {
names = { 'gf' },
suffixes = { '<resolution>gf' },
},
mf = {
names = { 'mf' },
variable = 'MFINPUTS',
suffixes = { 'mf' },
},
mft = {
names = { 'mft' },
suffixes = { 'mft' },
},
pk = {
names = { 'pk' },
suffixes = { '<resolution>pk' },
},
},
}
resolvers.relations = relations
-- formats: maps a format onto a variable
function resolvers.updaterelations()
for category, categories in next, relations do
for name, relation in next, categories do
local rn = relation.names
local rv = relation.variable
local rs = relation.suffixes
if rn and rv then
for i=1,#rn do
local rni = lower(gsub(rn[i]," ",""))
formats[rni] = rv
if rs then
suffixes[rni] = rs
for i=1,#rs do
local rsi = rs[i]
suffixmap[rsi] = rni
end
end
end
end
if rs then
end
end
end
end
resolvers.updaterelations() -- push this in the metatable -> newindex
local function simplified(t,k)
return k and rawget(t,lower(gsub(k," ",""))) or nil
end
setmetatableindex(formats, simplified)
setmetatableindex(suffixes, simplified)
setmetatableindex(suffixmap, simplified)
-- A few accessors, mostly for command line tool.
function resolvers.suffixofformat(str)
local s = suffixes[str]
return s and s[1] or ""
end
function resolvers.suffixofformat(str)
return suffixes[str] or { }
end
for name, format in next, formats do
dangerous[name] = true -- still needed ?
end
-- because vf searching is somewhat dangerous, we want to prevent
-- too liberal searching esp because we do a lookup on the current
-- path anyway; only tex (or any) is safe
dangerous.tex = nil
-- more helpers
function resolvers.formatofvariable(str)
return formats[str] or ''
end
function resolvers.formatofsuffix(str) -- of file
return suffixmap[fileextname(str)] or 'tex' -- so many map onto tex (like mkiv, cld etc)
end
function resolvers.variableofformat(str)
return formats[str] or ''
end
function resolvers.variableofformatorsuffix(str)
local v = formats[str]
if v then
return v
end
v = suffixmap[fileextname(str)]
if v then
return formats[v]
end
return ''
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-tmp'] = {
version = 1.100,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
--[[ldx--
<p>This module deals with caching data. It sets up the paths and
implements loaders and savers for tables. Best is to set the
following variable. When not set, the usual paths will be
checked. Personally I prefer the (users) temporary path.</p>
</code>
TEXMFCACHE=$TMP;$TEMP;$TMPDIR;$TEMPDIR;$HOME;$TEXMFVAR;$VARTEXMF;.
</code>
<p>Currently we do no locking when we write files. This is no real
problem because most caching involves fonts and the chance of them
being written at the same time is small. We also need to extend
luatools with a recache feature.</p>
--ldx]]--
local format, lower, gsub, concat = string.format, string.lower, string.gsub, table.concat
local serialize, serializetofile = table.serialize, table.tofile
local mkdirs, isdir = dir.mkdirs, lfs.isdir
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local trace_cache = false trackers.register("resolvers.cache", function(v) trace_cache = v end)
local report_caches = logs.reporter("resolvers","caches")
local report_resolvers = logs.reporter("resolvers","caching")
local resolvers = resolvers
-- intermezzo
local directive_cleanup = false directives.register("system.compile.cleanup", function(v) directive_cleanup = v end)
local directive_strip = true directives.register("system.compile.strip", function(v) directive_strip = v end)
local compile = utilities.lua.compile
function utilities.lua.compile(luafile,lucfile,cleanup,strip)
if cleanup == nil then cleanup = directive_cleanup end
if strip == nil then strip = directive_strip end
return compile(luafile,lucfile,cleanup,strip)
end
-- end of intermezzo
caches = caches or { }
local caches = caches
caches.base = caches.base or "luatex-cache"
caches.more = caches.more or "context"
caches.direct = false -- true is faster but may need huge amounts of memory
caches.tree = false
caches.force = true
caches.ask = false
caches.relocate = false
caches.defaults = { "TMPDIR", "TEMPDIR", "TMP", "TEMP", "HOME", "HOMEPATH" }
local writable, readables, usedreadables = nil, { }, { }
-- we could use a metatable for writable and readable but not yet
local function identify()
-- Combining the loops makes it messy. First we check the format cache path
-- and when the last component is not present we try to create it.
local texmfcaches = resolvers.cleanpathlist("TEXMFCACHE")
if texmfcaches then
for k=1,#texmfcaches do
local cachepath = texmfcaches[k]
if cachepath ~= "" then
cachepath = resolvers.resolve(cachepath)
cachepath = resolvers.cleanpath(cachepath)
cachepath = file.collapsepath(cachepath)
local valid = isdir(cachepath)
if valid then
if file.is_readable(cachepath) then
readables[#readables+1] = cachepath
if not writable and file.is_writable(cachepath) then
writable = cachepath
end
end
elseif not writable and caches.force then
local cacheparent = file.dirname(cachepath)
if file.is_writable(cacheparent) and true then -- we go on anyway (needed for mojca's kind of paths)
if not caches.ask or io.ask(format("\nShould I create the cache path %s?",cachepath), "no", { "yes", "no" }) == "yes" then
mkdirs(cachepath)
if isdir(cachepath) and file.is_writable(cachepath) then
report_caches("created: %s",cachepath)
writable = cachepath
readables[#readables+1] = cachepath
end
end
end
end
end
end
end
-- As a last resort we check some temporary paths but this time we don't
-- create them.
local texmfcaches = caches.defaults
if texmfcaches then
for k=1,#texmfcaches do
local cachepath = texmfcaches[k]
cachepath = resolvers.expansion(cachepath) -- was getenv
if cachepath ~= "" then
cachepath = resolvers.resolve(cachepath)
cachepath = resolvers.cleanpath(cachepath)
local valid = isdir(cachepath)
if valid and file.is_readable(cachepath) then
if not writable and file.is_writable(cachepath) then
readables[#readables+1] = cachepath
writable = cachepath
break
end
end
end
end
end
-- Some extra checking. If we have no writable or readable path then we simply
-- quit.
if not writable then
report_caches("fatal error: there is no valid writable cache path defined")
os.exit()
elseif #readables == 0 then
report_caches("fatal error: there is no valid readable cache path defined")
os.exit()
end
-- why here
writable = dir.expandname(resolvers.cleanpath(writable)) -- just in case
-- moved here
local base, more, tree = caches.base, caches.more, caches.tree or caches.treehash() -- we have only one writable tree
if tree then
caches.tree = tree
writable = mkdirs(writable,base,more,tree)
for i=1,#readables do
readables[i] = file.join(readables[i],base,more,tree)
end
else
writable = mkdirs(writable,base,more)
for i=1,#readables do
readables[i] = file.join(readables[i],base,more)
end
end
-- end
if trace_cache then
for i=1,#readables do
report_caches("using readable path '%s' (order %s)",readables[i],i)
end
report_caches("using writable path '%s'",writable)
end
identify = function()
return writable, readables
end
return writable, readables
end
function caches.usedpaths()
local writable, readables = identify()
if #readables > 1 then
local result = { }
for i=1,#readables do
local readable = readables[i]
if usedreadables[i] or readable == writable then
result[#result+1] = format("readable: '%s' (order %s)",readable,i)
end
end
result[#result+1] = format("writable: '%s'",writable)
return result
else
return writable
end
end
function caches.configfiles()
return concat(resolvers.instance.specification,";")
end
function caches.hashed(tree)
tree = gsub(tree,"\\$","/")
tree = gsub(tree,"/+$","")
tree = lower(tree)
local hash = md5.hex(tree)
if trace_cache or trace_locating then
report_caches("hashing tree %s, hash %s",tree,hash)
end
return hash
end
function caches.treehash()
local tree = caches.configfiles()
if not tree or tree == "" then
return false
else
return caches.hashed(tree)
end
end
local r_cache, w_cache = { }, { } -- normally w in in r but who cares
local function getreadablepaths(...) -- we can optimize this as we have at most 2 tags
local tags = { ... }
local hash = concat(tags,"/")
local done = r_cache[hash]
if not done then
local writable, readables = identify() -- exit if not found
if #tags > 0 then
done = { }
for i=1,#readables do
done[i] = file.join(readables[i],...)
end
else
done = readables
end
r_cache[hash] = done
end
return done
end
local function getwritablepath(...)
local tags = { ... }
local hash = concat(tags,"/")
local done = w_cache[hash]
if not done then
local writable, readables = identify() -- exit if not found
if #tags > 0 then
done = mkdirs(writable,...)
else
done = writable
end
w_cache[hash] = done
end
return done
end
caches.getreadablepaths = getreadablepaths
caches.getwritablepath = getwritablepath
function caches.getfirstreadablefile(filename,...)
local rd = getreadablepaths(...)
for i=1,#rd do
local path = rd[i]
local fullname = file.join(path,filename)
if file.is_readable(fullname) then
usedreadables[i] = true
return fullname, path
end
end
return caches.setfirstwritablefile(filename,...)
end
function caches.setfirstwritablefile(filename,...)
local wr = getwritablepath(...)
local fullname = file.join(wr,filename)
return fullname, wr
end
function caches.define(category,subcategory) -- for old times sake
return function()
return getwritablepath(category,subcategory)
end
end
function caches.setluanames(path,name)
return path .. "/" .. name .. ".tma", path .. "/" .. name .. ".tmc"
end
function caches.loaddata(readables,name)
if type(readables) == "string" then
readables = { readables }
end
for i=1,#readables do
local path = readables[i]
local tmaname, tmcname = caches.setluanames(path,name)
local loader = loadfile(tmcname) or loadfile(tmaname)
if loader then
loader = loader()
collectgarbage("step")
return loader
end
end
return false
end
function caches.is_writable(filepath,filename)
local tmaname, tmcname = caches.setluanames(filepath,filename)
return file.is_writable(tmaname)
end
local saveoptions = { compact = true }
function caches.savedata(filepath,filename,data,raw)
local tmaname, tmcname = caches.setluanames(filepath,filename)
local reduce, simplify = true, true
if raw then
reduce, simplify = false, false
end
data.cache_uuid = os.uuid()
if caches.direct then
file.savedata(tmaname,serialize(data,true,saveoptions))
else
serializetofile(tmaname,data,true,saveoptions)
end
utilities.lua.compile(tmaname,tmcname)
end
-- moved from data-res:
local content_state = { }
function caches.contentstate()
return content_state or { }
end
function caches.loadcontent(cachename,dataname)
local name = caches.hashed(cachename)
local full, path = caches.getfirstreadablefile(name ..".lua","trees")
local filename = file.join(path,name)
local blob = loadfile(filename .. ".luc") or loadfile(filename .. ".lua")
if blob then
local data = blob()
if data and data.content then
if data.type == dataname then
if data.version == resolvers.cacheversion then
content_state[#content_state+1] = data.uuid
if trace_locating then
report_resolvers("loading '%s' for '%s' from '%s'",dataname,cachename,filename)
end
return data.content
else
report_resolvers("skipping '%s' for '%s' from '%s' (version mismatch)",dataname,cachename,filename)
end
else
report_resolvers("skipping '%s' for '%s' from '%s' (datatype mismatch)",dataname,cachename,filename)
end
elseif trace_locating then
report_resolvers("skipping '%s' for '%s' from '%s' (no content)",dataname,cachename,filename)
end
elseif trace_locating then
report_resolvers("skipping '%s' for '%s' from '%s' (invalid file)",dataname,cachename,filename)
end
end
function caches.collapsecontent(content)
for k, v in next, content do
if type(v) == "table" and #v == 1 then
content[k] = v[1]
end
end
end
function caches.savecontent(cachename,dataname,content)
local name = caches.hashed(cachename)
local full, path = caches.setfirstwritablefile(name ..".lua","trees")
local filename = file.join(path,name) -- is full
local luaname, lucname = filename .. ".lua", filename .. ".luc"
if trace_locating then
report_resolvers("preparing '%s' for '%s'",dataname,cachename)
end
local data = {
type = dataname,
root = cachename,
version = resolvers.cacheversion,
date = os.date("%Y-%m-%d"),
time = os.date("%H:%M:%S"),
content = content,
uuid = os.uuid(),
}
local ok = io.savedata(luaname,serialize(data,true))
if ok then
if trace_locating then
report_resolvers("category '%s', cachename '%s' saved in '%s'",dataname,cachename,luaname)
end
if utilities.lua.compile(luaname,lucname) then
if trace_locating then
report_resolvers("'%s' compiled to '%s'",dataname,lucname)
end
return true
else
if trace_locating then
report_resolvers("compiling failed for '%s', deleting file '%s'",dataname,lucname)
end
os.remove(lucname)
end
elseif trace_locating then
report_resolvers("unable to save '%s' in '%s' (access error)",dataname,luaname)
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-met'] = {
version = 1.100,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local find, format = string.find, string.format
local sequenced = table.sequenced
local addurlscheme, urlhashed = url.addscheme, url.hashed
local trace_locating = false
trackers.register("resolvers.locating", function(v) trace_methods = v end)
trackers.register("resolvers.methods", function(v) trace_methods = v end)
local report_methods = logs.reporter("resolvers","methods")
local allocate = utilities.storage.allocate
local resolvers = resolvers
local registered = { }
local function splitmethod(filename) -- todo: filetype in specification
if not filename then
return { scheme = "unknown", original = filename }
end
if type(filename) == "table" then
return filename -- already split
end
filename = file.collapsepath(filename)
if not find(filename,"://") then
return { scheme = "file", path = filename, original = filename, filename = filename }
end
local specification = url.hashed(filename)
if not specification.scheme or specification.scheme == "" then
return { scheme = "file", path = filename, original = filename, filename = filename }
else
return specification
end
end
resolvers.splitmethod = splitmethod -- bad name but ok
-- the second argument is always analyzed (saves time later on) and the original
-- gets passed as original but also as argument
local function methodhandler(what,first,...) -- filename can be nil or false
local method = registered[what]
if method then
local how, namespace = method.how, method.namespace
if how == "uri" or how == "url" then
local specification = splitmethod(first)
local scheme = specification.scheme
local resolver = namespace and namespace[scheme]
if resolver then
if trace_methods then
report_methods("resolver: method=%s, how=%s, scheme=%s, argument=%s",what,how,scheme,first)
end
return resolver(specification,...)
else
resolver = namespace.default or namespace.file
if resolver then
if trace_methods then
report_methods("resolver: method=%s, how=%s, default, argument=%s",what,how,first)
end
return resolver(specification,...)
elseif trace_methods then
report_methods("resolver: method=%s, how=%s, no handler",what,how)
end
end
elseif how == "tag" then
local resolver = namespace and namespace[first]
if resolver then
if trace_methods then
report_methods("resolver: method=%s, how=%s, tag=%s",what,how,first)
end
return resolver(...)
else
resolver = namespace.default or namespace.file
if resolver then
if trace_methods then
report_methods("resolver: method=%s, how=%s, default",what,how)
end
return resolver(...)
elseif trace_methods then
report_methods("resolver: method=%s, how=%s, unknown",what,how)
end
end
end
else
report_methods("resolver: method=%s, unknown",what)
end
end
resolvers.methodhandler = methodhandler
function resolvers.registermethod(name,namespace,how)
registered[name] = { how = how or "tag", namespace = namespace }
namespace["byscheme"] = function(scheme,filename,...)
if scheme == "file" then
return methodhandler(name,filename,...)
else
return methodhandler(name,addurlscheme(filename,scheme),...)
end
end
end
local concatinators = allocate { notfound = file.join } -- concatinate paths
local locators = allocate { notfound = function() end } -- locate databases
local hashers = allocate { notfound = function() end } -- load databases
local generators = allocate { notfound = function() end } -- generate databases
resolvers.concatinators = concatinators
resolvers.locators = locators
resolvers.hashers = hashers
resolvers.generators = generators
local registermethod = resolvers.registermethod
registermethod("concatinators",concatinators,"tag")
registermethod("locators", locators, "uri")
registermethod("hashers", hashers, "uri")
registermethod("generators", generators, "uri")
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-res'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files",
}
-- In practice we will work within one tds tree, but i want to keep
-- the option open to build tools that look at multiple trees, which is
-- why we keep the tree specific data in a table. We used to pass the
-- instance but for practical purposes we now avoid this and use a
-- instance variable. We always have one instance active (sort of global).
-- todo: cache:/// home:/// selfautoparent:/// (sometime end 2012)
local format, gsub, find, lower, upper, match, gmatch = string.format, string.gsub, string.find, string.lower, string.upper, string.match, string.gmatch
local concat, insert, sortedkeys = table.concat, table.insert, table.sortedkeys
local next, type, rawget = next, type, rawget
local os = os
local P, S, R, C, Cc, Cs, Ct, Carg = lpeg.P, lpeg.S, lpeg.R, lpeg.C, lpeg.Cc, lpeg.Cs, lpeg.Ct, lpeg.Carg
local lpegmatch, lpegpatterns = lpeg.match, lpeg.patterns
local filedirname = file.dirname
local filebasename = file.basename
local fileextname = file.extname
local filejoin = file.join
local collapsepath = file.collapsepath
local joinpath = file.joinpath
local allocate = utilities.storage.allocate
local setmetatableindex = table.setmetatableindex
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local trace_detail = false trackers.register("resolvers.details", function(v) trace_detail = v end)
local trace_expansions = false trackers.register("resolvers.expansions", function(v) trace_expansions = v end)
local report_resolving = logs.reporter("resolvers","resolving")
local resolvers = resolvers
local expandedpathfromlist = resolvers.expandedpathfromlist
local checkedvariable = resolvers.checkedvariable
local splitconfigurationpath = resolvers.splitconfigurationpath
local methodhandler = resolvers.methodhandler
local initializesetter = utilities.setters.initialize
local ostype, osname, osenv, ossetenv, osgetenv = os.type, os.name, os.env, os.setenv, os.getenv
resolvers.cacheversion = '1.0.1'
resolvers.configbanner = ''
resolvers.homedir = environment.homedir
resolvers.criticalvars = allocate { "SELFAUTOLOC", "SELFAUTODIR", "SELFAUTOPARENT", "TEXMFCNF", "TEXMF", "TEXOS" }
resolvers.luacnfname = 'texmfcnf.lua'
resolvers.luacnfstate = "unknown"
-- The web2c tex binaries as well as kpse have built in paths for the configuration
-- files and there can be a depressing truckload of them. This is actually the weak
-- spot of a distribution. So we don't want:
--
-- resolvers.luacnfspec = '{$SELFAUTODIR,$SELFAUTOPARENT}{,{/share,}/texmf{-local,}/web2c}'
--
-- but instead use:
--
-- resolvers.luacnfspec = 'selfautoparent:{/texmf{-local,}{,/web2c}}'
--
-- which does not make texlive happy as there is a texmf-local tree one level up
-- (sigh), so we need this. (We can assume web2c as mkiv does not run on older
-- texlives anyway.
--
-- texlive:
--
-- selfautodir:
-- selfautoparent:
-- selfautodir:share/texmf-local/web2c
-- selfautodir:share/texmf/web2c
-- selfautodir:texmf-local/web2c
-- selfautodir:texmf/web2c
-- selfautoparent:share/texmf-local/web2c
-- selfautoparent:share/texmf/web2c
-- selfautoparent:texmf-local/web2c
-- selfautoparent:texmf/web2c
--
-- minimals:
--
-- home:texmf/web2c
-- selfautoparent:texmf-local/web2c
-- selfautoparent:texmf-context/web2c
-- selfautoparent:texmf/web2c
if this_is_texlive then
-- resolvers.luacnfspec = '{selfautodir:,selfautoparent:}{,{/share,}/texmf{-local,}/web2c}'
-- resolvers.luacnfspec = '{selfautodir:{/share,}/texmf-local/web2c,selfautoparent:{/share,}/texmf{-local,}/web2c}'
-- resolvers.luacnfspec = 'selfautodir:/texmf-local/web2c;selfautoparent:/texmf{-local,}/web2c'
resolvers.luacnfspec = 'selfautodir:;selfautoparent:;{selfautodir:,selfautoparent:}{/share,}/texmf{-local,}/web2c'
else
resolvers.luacnfspec = 'home:texmf/web2c;selfautoparent:texmf{-local,-context,}/web2c'
end
-- which (as we want users to use the web2c path) be can be simplified to this:
--
-- if environment and environment.ownpath and string.find(environment.ownpath,"[\\/]texlive[\\/]") then
-- resolvers.luacnfspec = 'selfautodir:/texmf-local/web2c,selfautoparent:/texmf-local/web2c,selfautoparent:/texmf/web2c'
-- else
-- resolvers.luacnfspec = 'selfautoparent:/texmf-local/web2c,selfautoparent:/texmf/web2c'
-- end
local unset_variable = "unset"
local formats = resolvers.formats
local suffixes = resolvers.suffixes
local dangerous = resolvers.dangerous
local suffixmap = resolvers.suffixmap
resolvers.defaultsuffixes = { "tex" } -- "mkiv", "cld" -- too tricky
resolvers.instance = resolvers.instance or nil -- the current one (slow access)
local instance = resolvers.instance or nil -- the current one (fast access)
-- An instance has an environment (coming from the outside, kept raw), variables
-- (coming from the configuration file), and expansions (variables with nested
-- variables replaced). One can push something into the outer environment and
-- its internal copy, but only the later one will be the raw unprefixed variant.
function resolvers.setenv(key,value,raw)
if instance then
-- this one will be consulted first when we stay inside
-- the current environment (prefixes are not resolved here)
instance.environment[key] = value
-- we feed back into the environment, and as this is used
-- by other applications (via os.execute) we need to make
-- sure that prefixes are resolve
ossetenv(key,raw and value or resolvers.resolve(value))
end
end
-- Beware we don't want empty here as this one can be called early on
-- and therefore we use rawget.
local function getenv(key)
local value = rawget(instance.environment,key)
if value and value ~= "" then
return value
else
local e = osgetenv(key)
return e ~= nil and e ~= "" and checkedvariable(e) or ""
end
end
resolvers.getenv = getenv
resolvers.env = getenv
-- We are going to use some metatable trickery where we backtrack from
-- expansion to variable to environment.
local function resolve(k)
return instance.expansions[k]
end
local dollarstripper = lpeg.stripper("$")
local inhibitstripper = P("!")^0 * Cs(P(1)^0)
local backslashswapper = lpeg.replacer("\\","/")
local somevariable = P("$") / ""
local somekey = C(R("az","AZ","09","__","--")^1)
local somethingelse = P(";") * ((1-S("!{}/\\"))^1 * P(";") / "")
+ P(";") * (P(";") / "")
+ P(1)
local variableexpander = Cs( (somevariable * (somekey/resolve) + somethingelse)^1 )
local cleaner = P("\\") / "/" + P(";") * S("!{}/\\")^0 * P(";")^1 / ";"
local variablecleaner = Cs((cleaner + P(1))^0)
local somevariable = R("az","AZ","09","__","--")^1 / resolve
local variable = (P("$")/"") * (somevariable + (P("{")/"") * somevariable * (P("}")/""))
local variableresolver = Cs((variable + P(1))^0)
local function expandedvariable(var)
return lpegmatch(variableexpander,var) or var
end
function resolvers.newinstance() -- todo: all vars will become lowercase and alphanum only
if trace_locating then
report_resolving("creating instance")
end
local environment, variables, expansions, order = allocate(), allocate(), allocate(), allocate()
local newinstance = {
environment = environment,
variables = variables,
expansions = expansions,
order = order,
files = allocate(),
setups = allocate(),
found = allocate(),
foundintrees = allocate(),
hashes = allocate(),
hashed = allocate(),
specification = allocate(),
lists = allocate(),
data = allocate(), -- only for loading
fakepaths = allocate(),
remember = true,
diskcache = true,
renewcache = false,
loaderror = false,
savelists = true,
pattern = nil, -- lists
force_suffixes = true,
}
setmetatableindex(variables,function(t,k)
local v
for i=1,#order do
v = order[i][k]
if v ~= nil then
t[k] = v
return v
end
end
if v == nil then
v = ""
end
t[k] = v
return v
end)
setmetatableindex(environment, function(t,k)
local v = osgetenv(k)
if v == nil then
v = variables[k]
end
if v ~= nil then
v = checkedvariable(v) or ""
end
v = resolvers.repath(v) -- for taco who has a : separated osfontdir
t[k] = v
return v
end)
setmetatableindex(expansions, function(t,k)
local v = environment[k]
if type(v) == "string" then
v = lpegmatch(variableresolver,v)
v = lpegmatch(variablecleaner,v)
end
t[k] = v
return v
end)
return newinstance
end
function resolvers.setinstance(someinstance) -- only one instance is active
instance = someinstance
resolvers.instance = someinstance
return someinstance
end
function resolvers.reset()
return resolvers.setinstance(resolvers.newinstance())
end
local function reset_hashes()
instance.lists = { }
instance.found = { }
end
local slash = P("/")
local pathexpressionpattern = Cs (
Cc("^") * (
Cc("%") * S(".-")
+ slash^2 * P(-1) / "/.*"
+ slash^2 / "/.-/"
+ (1-slash) * P(-1) * Cc("/")
+ P(1)
)^1 * Cc("$") -- yes or no $
)
local cache = { }
local function makepathexpression(str)
if str == "." then
return "^%./$"
else
local c = cache[str]
if not c then
c = lpegmatch(pathexpressionpattern,str)
cache[str] = c
end
return c
end
end
local function reportcriticalvariables(cnfspec)
if trace_locating then
for i=1,#resolvers.criticalvars do
local k = resolvers.criticalvars[i]
local v = resolvers.getenv(k) or "unknown" -- this one will not resolve !
report_resolving("variable '%s' set to '%s'",k,v)
end
report_resolving()
if cnfspec then
if type(cnfspec) == "table" then
report_resolving("using configuration specification '%s'",concat(cnfspec,","))
else
report_resolving("using configuration specification '%s'",cnfspec)
end
end
report_resolving()
end
reportcriticalvariables = function() end
end
local function identify_configuration_files()
local specification = instance.specification
if #specification == 0 then
local cnfspec = getenv('TEXMFCNF')
if cnfspec == "" then
cnfspec = resolvers.luacnfspec
resolvers.luacnfstate = "default"
else
resolvers.luacnfstate = "environment"
end
reportcriticalvariables(cnfspec)
local cnfpaths = expandedpathfromlist(resolvers.splitpath(cnfspec))
local luacnfname = resolvers.luacnfname
for i=1,#cnfpaths do
local filename = collapsepath(filejoin(cnfpaths[i],luacnfname))
local realname = resolvers.resolve(filename)
if lfs.isfile(realname) then
specification[#specification+1] = filename
if trace_locating then
report_resolving("found configuration file '%s'",realname)
end
elseif trace_locating then
report_resolving("unknown configuration file '%s'",realname)
end
end
if trace_locating then
report_resolving()
end
elseif trace_locating then
report_resolving("configuration files already identified")
end
end
local function load_configuration_files()
local specification = instance.specification
if #specification > 0 then
local luacnfname = resolvers.luacnfname
for i=1,#specification do
local filename = specification[i]
local pathname = filedirname(filename)
local filename = filejoin(pathname,luacnfname)
local realname = resolvers.resolve(filename) -- no shortcut
local blob = loadfile(realname)
if blob then
local setups = instance.setups
local data = blob()
local parent = data and data.parent
if parent then
local filename = filejoin(pathname,parent)
local realname = resolvers.resolve(filename) -- no shortcut
local blob = loadfile(realname)
if blob then
local parentdata = blob()
if parentdata then
report_resolving("loading configuration file '%s'",filename)
data = table.merged(parentdata,data)
end
end
end
data = data and data.content
if data then
if trace_locating then
report_resolving("loading configuration file '%s'",filename)
report_resolving()
end
local variables = data.variables or { }
local warning = false
for k, v in next, data do
local variant = type(v)
if variant == "table" then
initializesetter(filename,k,v)
elseif variables[k] == nil then
if trace_locating and not warning then
report_resolving("variables like '%s' in configuration file '%s' should move to the 'variables' subtable",
k,resolvers.resolve(filename))
warning = true
end
variables[k] = v
end
end
setups[pathname] = variables
if resolvers.luacnfstate == "default" then
-- the following code is not tested
local cnfspec = variables["TEXMFCNF"]
if cnfspec then
if trace_locating then
report_resolving("reloading configuration due to TEXMF redefinition")
end
-- we push the value into the main environment (osenv) so
-- that it takes precedence over the default one and therefore
-- also over following definitions
resolvers.setenv('TEXMFCNF',cnfspec) -- resolves prefixes
-- we now identify and load the specified configuration files
instance.specification = { }
identify_configuration_files()
load_configuration_files()
-- we prevent further overload of the configuration variable
resolvers.luacnfstate = "configuration"
-- we quit the outer loop
break
end
end
else
if trace_locating then
report_resolving("skipping configuration file '%s' (no content)",filename)
end
setups[pathname] = { }
instance.loaderror = true
end
elseif trace_locating then
report_resolving("skipping configuration file '%s' (no file)",filename)
end
instance.order[#instance.order+1] = instance.setups[pathname]
if instance.loaderror then
break
end
end
elseif trace_locating then
report_resolving("warning: no lua configuration files found")
end
end
-- scheme magic ... database loading
local function load_file_databases()
instance.loaderror, instance.files = false, allocate()
if not instance.renewcache then
local hashes = instance.hashes
for k=1,#hashes do
local hash = hashes[k]
resolvers.hashers.byscheme(hash.type,hash.name)
if instance.loaderror then break end
end
end
end
local function locate_file_databases()
-- todo: cache:// and tree:// (runtime)
local texmfpaths = resolvers.expandedpathlist('TEXMF')
if #texmfpaths > 0 then
for i=1,#texmfpaths do
local path = collapsepath(texmfpaths[i])
local stripped = lpegmatch(inhibitstripper,path) -- the !! thing
if stripped ~= "" then
local runtime = stripped == path
path = resolvers.cleanpath(path)
local spec = resolvers.splitmethod(stripped)
if runtime and (spec.noscheme or spec.scheme == "file") then
stripped = "tree:///" .. stripped
elseif spec.scheme == "cache" or spec.scheme == "file" then
stripped = spec.path
end
if trace_locating then
if runtime then
report_resolving("locating list of '%s' (runtime) (%s)",path,stripped)
else
report_resolving("locating list of '%s' (cached)",path)
end
end
methodhandler('locators',stripped)
end
end
if trace_locating then
report_resolving()
end
elseif trace_locating then
report_resolving("no texmf paths are defined (using TEXMF)")
end
end
local function generate_file_databases()
local hashes = instance.hashes
for k=1,#hashes do
local hash = hashes[k]
methodhandler('generators',hash.name)
end
if trace_locating then
report_resolving()
end
end
local function save_file_databases() -- will become cachers
for i=1,#instance.hashes do
local hash = instance.hashes[i]
local cachename = hash.name
if hash.cache then
local content = instance.files[cachename]
caches.collapsecontent(content)
if trace_locating then
report_resolving("saving tree '%s'",cachename)
end
caches.savecontent(cachename,"files",content)
elseif trace_locating then
report_resolving("not saving runtime tree '%s'",cachename)
end
end
end
local function load_databases()
locate_file_databases()
if instance.diskcache and not instance.renewcache then
load_file_databases()
if instance.loaderror then
generate_file_databases()
save_file_databases()
end
else
generate_file_databases()
if instance.renewcache then
save_file_databases()
end
end
end
function resolvers.appendhash(type,name,cache)
-- safeguard ... tricky as it's actually a bug when seen twice
if not instance.hashed[name] then
if trace_locating then
report_resolving("hash '%s' appended",name)
end
insert(instance.hashes, { type = type, name = name, cache = cache } )
instance.hashed[name] = cache
end
end
function resolvers.prependhash(type,name,cache)
-- safeguard ... tricky as it's actually a bug when seen twice
if not instance.hashed[name] then
if trace_locating then
report_resolving("hash '%s' prepended",name)
end
insert(instance.hashes, 1, { type = type, name = name, cache = cache } )
instance.hashed[name] = cache
end
end
function resolvers.extendtexmfvariable(specification) -- crap, we could better prepend the hash
local t = resolvers.splitpath(getenv('TEXMF'))
insert(t,1,specification)
local newspec = concat(t,";")
if instance.environment["TEXMF"] then
instance.environment["TEXMF"] = newspec
elseif instance.variables["TEXMF"] then
instance.variables["TEXMF"] = newspec
else
-- weird
end
reset_hashes()
end
function resolvers.splitexpansions()
local ie = instance.expansions
for k,v in next, ie do
local t, tn, h, p = { }, 0, { }, splitconfigurationpath(v)
for kk=1,#p do
local vv = p[kk]
if vv ~= "" and not h[vv] then
tn = tn + 1
t[tn] = vv
h[vv] = true
end
end
if #t > 1 then
ie[k] = t
else
ie[k] = t[1]
end
end
end
-- end of split/join code
-- we used to have 'files' and 'configurations' so therefore the following
-- shared function
function resolvers.datastate()
return caches.contentstate()
end
function resolvers.variable(name)
local name = name and lpegmatch(dollarstripper,name)
local result = name and instance.variables[name]
return result ~= nil and result or ""
end
function resolvers.expansion(name)
local name = name and lpegmatch(dollarstripper,name)
local result = name and instance.expansions[name]
return result ~= nil and result or ""
end
function resolvers.unexpandedpathlist(str)
local pth = resolvers.variable(str)
local lst = resolvers.splitpath(pth)
return expandedpathfromlist(lst)
end
function resolvers.unexpandedpath(str)
return joinpath(resolvers.unexpandedpathlist(str))
end
local done = { }
function resolvers.resetextrapath()
local ep = instance.extra_paths
if not ep then
ep, done = { }, { }
instance.extra_paths = ep
elseif #ep > 0 then
instance.lists, done = { }, { }
end
end
function resolvers.registerextrapath(paths,subpaths)
local ep = instance.extra_paths or { }
local oldn = #ep
local newn = oldn
if paths and paths ~= "" then
if subpaths and subpaths ~= "" then
for p in gmatch(paths,"[^,]+") do
-- we gmatch each step again, not that fast, but used seldom
for s in gmatch(subpaths,"[^,]+") do
local ps = p .. "/" .. s
if not done[ps] then
newn = newn + 1
ep[newn] = resolvers.cleanpath(ps)
done[ps] = true
end
end
end
else
for p in gmatch(paths,"[^,]+") do
if not done[p] then
newn = newn + 1
ep[newn] = resolvers.cleanpath(p)
done[p] = true
end
end
end
elseif subpaths and subpaths ~= "" then
for i=1,oldn do
-- we gmatch each step again, not that fast, but used seldom
for s in gmatch(subpaths,"[^,]+") do
local ps = ep[i] .. "/" .. s
if not done[ps] then
newn = newn + 1
ep[newn] = resolvers.cleanpath(ps)
done[ps] = true
end
end
end
end
if newn > 0 then
instance.extra_paths = ep -- register paths
end
if newn > oldn then
instance.lists = { } -- erase the cache
end
end
local function made_list(instance,list)
local ep = instance.extra_paths
if not ep or #ep == 0 then
return list
else
local done, new, newn = { }, { }, 0
-- honour . .. ../.. but only when at the start
for k=1,#list do
local v = list[k]
if not done[v] then
if find(v,"^[%.%/]$") then
done[v] = true
newn = newn + 1
new[newn] = v
else
break
end
end
end
-- first the extra paths
for k=1,#ep do
local v = ep[k]
if not done[v] then
done[v] = true
newn = newn + 1
new[newn] = v
end
end
-- next the formal paths
for k=1,#list do
local v = list[k]
if not done[v] then
done[v] = true
newn = newn + 1
new[newn] = v
end
end
return new
end
end
function resolvers.cleanpathlist(str)
local t = resolvers.expandedpathlist(str)
if t then
for i=1,#t do
t[i] = collapsepath(resolvers.cleanpath(t[i]))
end
end
return t
end
function resolvers.expandpath(str)
return joinpath(resolvers.expandedpathlist(str))
end
function resolvers.expandedpathlist(str)
if not str then
return { }
elseif instance.savelists then
str = lpegmatch(dollarstripper,str)
if not instance.lists[str] then -- cached
local lst = made_list(instance,resolvers.splitpath(resolvers.expansion(str)))
instance.lists[str] = expandedpathfromlist(lst)
end
return instance.lists[str]
else
local lst = resolvers.splitpath(resolvers.expansion(str))
return made_list(instance,expandedpathfromlist(lst))
end
end
function resolvers.expandedpathlistfromvariable(str) -- brrr
str = lpegmatch(dollarstripper,str)
local tmp = resolvers.variableofformatorsuffix(str)
return resolvers.expandedpathlist(tmp ~= "" and tmp or str)
end
function resolvers.expandpathfromvariable(str)
return joinpath(resolvers.expandedpathlistfromvariable(str))
end
function resolvers.expandbraces(str) -- output variable and brace expansion of STRING
local ori = resolvers.variable(str)
local pth = expandedpathfromlist(resolvers.splitpath(ori))
return joinpath(pth)
end
function resolvers.registerfilehash(name,content,someerror)
if content then
instance.files[name] = content
else
instance.files[name] = { }
if somerror == true then -- can be unset
instance.loaderror = someerror
end
end
end
local function isreadable(name)
local readable = lfs.isfile(name) -- not file.is_readable(name) asit can be a dir
if trace_detail then
if readable then
report_resolving("file '%s' is readable",name)
else
report_resolving("file '%s' is not readable", name)
end
end
return readable
end
-- name
-- name/name
local function collect_files(names)
local filelist, noffiles = { }, 0
for k=1,#names do
local fname = names[k]
if trace_detail then
report_resolving("checking name '%s'",fname)
end
local bname = filebasename(fname)
local dname = filedirname(fname)
if dname == "" or find(dname,"^%.") then
dname = false
else
dname = gsub(dname,"*","%.*")
dname = "/" .. dname .. "$"
end
local hashes = instance.hashes
for h=1,#hashes do
local hash = hashes[h]
local blobpath = hash.name
local files = blobpath and instance.files[blobpath]
if files then
if trace_detail then
report_resolving("deep checking '%s' (%s)",blobpath,bname)
end
local blobfile = files[bname]
if not blobfile then
local rname = "remap:"..bname
blobfile = files[rname]
if blobfile then
bname = files[rname]
blobfile = files[bname]
end
end
if blobfile then
local blobroot = files.__path__ or blobpath
if type(blobfile) == 'string' then
if not dname or find(blobfile,dname) then
local variant = hash.type
-- local search = filejoin(blobpath,blobfile,bname)
local search = filejoin(blobroot,blobfile,bname)
local result = methodhandler('concatinators',hash.type,blobroot,blobfile,bname)
if trace_detail then
report_resolving("match: variant '%s', search '%s', result '%s'",variant,search,result)
end
noffiles = noffiles + 1
filelist[noffiles] = { variant, search, result }
end
else
for kk=1,#blobfile do
local vv = blobfile[kk]
if not dname or find(vv,dname) then
local variant = hash.type
-- local search = filejoin(blobpath,vv,bname)
local search = filejoin(blobroot,vv,bname)
local result = methodhandler('concatinators',hash.type,blobroot,vv,bname)
if trace_detail then
report_resolving("match: variant '%s', search '%s', result '%s'",variant,search,result)
end
noffiles = noffiles + 1
filelist[noffiles] = { variant, search, result }
end
end
end
end
elseif trace_locating then
report_resolving("no match in '%s' (%s)",blobpath,bname)
end
end
end
return noffiles > 0 and filelist or nil
end
local fit = { }
function resolvers.registerintrees(filename,format,filetype,usedmethod,foundname)
local foundintrees = instance.foundintrees
if usedmethod == "direct" and filename == foundname and fit[foundname] then
-- just an extra lookup after a test on presence
else
local t = {
filename = filename,
format = format ~= "" and format or nil,
filetype = filetype ~= "" and filetype or nil,
usedmethod = usedmethod,
foundname = foundname,
}
fit[foundname] = t
foundintrees[#foundintrees+1] = t
end
end
-- split the next one up for readability (but this module needs a cleanup anyway)
local function can_be_dir(name) -- can become local
local fakepaths = instance.fakepaths
if not fakepaths[name] then
if lfs.isdir(name) then
fakepaths[name] = 1 -- directory
else
fakepaths[name] = 2 -- no directory
end
end
return fakepaths[name] == 1
end
local preparetreepattern = Cs((P(".")/"%%." + P("-")/"%%-" + P(1))^0 * Cc("$"))
-- -- -- begin of main file search routing -- -- -- needs checking as previous has been patched
local collect_instance_files
local function find_analyze(filename,askedformat,allresults)
local filetype, wantedfiles, ext = '', { }, fileextname(filename)
-- too tricky as filename can be bla.1.2.3:
--
-- if not suffixmap[ext] then
-- wantedfiles[#wantedfiles+1] = filename
-- end
wantedfiles[#wantedfiles+1] = filename
if askedformat == "" then
if ext == "" or not suffixmap[ext] then
local defaultsuffixes = resolvers.defaultsuffixes
for i=1,#defaultsuffixes do
local forcedname = filename .. '.' .. defaultsuffixes[i]
wantedfiles[#wantedfiles+1] = forcedname
filetype = resolvers.formatofsuffix(forcedname)
if trace_locating then
report_resolving("forcing filetype '%s'",filetype)
end
end
else
filetype = resolvers.formatofsuffix(filename)
if trace_locating then
report_resolving("using suffix based filetype '%s'",filetype)
end
end
else
if ext == "" or not suffixmap[ext] then
local format_suffixes = suffixes[askedformat]
if format_suffixes then
for i=1,#format_suffixes do
wantedfiles[#wantedfiles+1] = filename .. "." .. format_suffixes[i]
end
end
end
filetype = askedformat
if trace_locating then
report_resolving("using given filetype '%s'",filetype)
end
end
return filetype, wantedfiles
end
local function find_direct(filename,allresults)
if not dangerous[askedformat] and isreadable(filename) then
if trace_detail then
report_resolving("file '%s' found directly",filename)
end
return "direct", { filename }
end
end
local function find_wildcard(filename,allresults)
if find(filename,'%*') then
if trace_locating then
report_resolving("checking wildcard '%s'", filename)
end
local method, result = resolvers.findwildcardfiles(filename)
if result then
return "wildcard", result
end
end
end
local function find_qualified(filename,allresults) -- this one will be split too
if not file.is_qualified_path(filename) then
return
end
if trace_locating then
report_resolving("checking qualified name '%s'", filename)
end
if isreadable(filename) then
if trace_detail then
report_resolving("qualified file '%s' found", filename)
end
return "qualified", { filename }
end
if trace_detail then
report_resolving("locating qualified file '%s'", filename)
end
local forcedname, suffix = "", fileextname(filename)
if suffix == "" then -- why
local format_suffixes = askedformat == "" and resolvers.defaultsuffixes or suffixes[askedformat]
if format_suffixes then
for i=1,#format_suffixes do
local s = format_suffixes[i]
forcedname = filename .. "." .. s
if isreadable(forcedname) then
if trace_locating then
report_resolving("no suffix, forcing format filetype '%s'", s)
end
return "qualified", { forcedname }
end
end
end
end
if suffix and suffix ~= "" then
-- try to find in tree (no suffix manipulation), here we search for the
-- matching last part of the name
local basename = filebasename(filename)
local pattern = lpegmatch(preparetreepattern,filename)
-- messy .. to be sorted out
local savedformat = askedformat
local format = savedformat or ""
if format == "" then
askedformat = resolvers.formatofsuffix(suffix)
end
if not format then
askedformat = "othertextfiles" -- kind of everything, maybe all
end
--
if basename ~= filename then
local resolved = collect_instance_files(basename,askedformat,allresults)
if #resolved == 0 then
local lowered = lower(basename)
if filename ~= lowered then
resolved = collect_instance_files(lowered,askedformat,allresults)
end
end
resolvers.format = savedformat
--
if #resolved > 0 then
local result = { }
for r=1,#resolved do
local rr = resolved[r]
if find(rr,pattern) then
result[#result+1] = rr
end
end
if #result > 0 then
return "qualified", result
end
end
end
-- a real wildcard:
--
-- local filelist = collect_files({basename})
-- result = { }
-- for f=1,#filelist do
-- local ff = filelist[f][3] or ""
-- if find(ff,pattern) then
-- result[#result+1], ok = ff, true
-- end
-- end
-- if #result > 0 then
-- return "qualified", result
-- end
end
end
local function check_subpath(fname)
if isreadable(fname) then
if trace_detail then
report_resolving("found '%s' by deep scanning",fname)
end
return fname
end
end
local function find_intree(filename,filetype,wantedfiles,allresults)
local typespec = resolvers.variableofformat(filetype)
local pathlist = resolvers.expandedpathlist(typespec)
local method = "intree"
if pathlist and #pathlist > 0 then
-- list search
local filelist = collect_files(wantedfiles)
local dirlist = { }
if filelist then
for i=1,#filelist do
dirlist[i] = filedirname(filelist[i][3]) .. "/" -- was [2] .. gamble
end
end
if trace_detail then
report_resolving("checking filename '%s'",filename)
end
local result = { }
for k=1,#pathlist do
local path = pathlist[k]
local pathname = lpegmatch(inhibitstripper,path)
local doscan = path == pathname -- no ^!!
if not find (pathname,'//$') then
doscan = false -- we check directly on the path
end
local done = false
-- using file list
if filelist then -- database
-- compare list entries with permitted pattern -- /xx /xx//
local expression = makepathexpression(pathname)
if trace_detail then
report_resolving("using pattern '%s' for path '%s'",expression,pathname)
end
for k=1,#filelist do
local fl = filelist[k]
local f = fl[2]
local d = dirlist[k]
if find(d,expression) then
-- todo, test for readable
result[#result+1] = resolvers.resolve(fl[3]) -- no shortcut
done = true
if allresults then
if trace_detail then
report_resolving("match to '%s' in hash for file '%s' and path '%s', continue scanning",expression,f,d)
end
else
if trace_detail then
report_resolving("match to '%s' in hash for file '%s' and path '%s', quit scanning",expression,f,d)
end
break
end
elseif trace_detail then
report_resolving("no match to '%s' in hash for file '%s' and path '%s'",expression,f,d)
end
end
end
if done then
method = "database"
else
method = "filesystem" -- bonus, even when !! is specified
pathname = gsub(pathname,"/+$","")
pathname = resolvers.resolve(pathname)
local scheme = url.hasscheme(pathname)
if not scheme or scheme == "file" then
local pname = gsub(pathname,"%.%*$",'')
if not find(pname,"%*") then
if can_be_dir(pname) then
-- quick root scan first
for k=1,#wantedfiles do
local w = wantedfiles[k]
local fname = check_subpath(filejoin(pname,w))
if fname then
result[#result+1] = fname
done = true
if not allresults then
break
end
end
end
if not done and doscan then
-- collect files in path (and cache the result)
local files = resolvers.simplescanfiles(pname,false,true)
for k=1,#wantedfiles do
local w = wantedfiles[k]
local subpath = files[w]
if not subpath or subpath == "" then
-- rootscan already done
elseif type(subpath) == "string" then
local fname = check_subpath(filejoin(pname,subpath,w))
if fname then
result[#result+1] = fname
done = true
if not allresults then
break
end
end
else
for i=1,#subpath do
local sp = subpath[i]
if sp == "" then
-- roottest already done
else
local fname = check_subpath(filejoin(pname,sp,w))
if fname then
result[#result+1] = fname
done = true
if not allresults then
break
end
end
end
end
if done and not allresults then
break
end
end
end
end
end
else
-- no access needed for non existing path, speedup (esp in large tree with lots of fake)
end
end
end
-- todo recursive scanning
if done and not allresults then
break
end
end
if #result > 0 then
return method, result
end
end
end
local function find_onpath(filename,filetype,wantedfiles,allresults)
if trace_detail then
report_resolving("checking filename '%s', filetype '%s', wanted files '%s'",filename, filetype or '?',concat(wantedfiles," | "))
end
local result = { }
for k=1,#wantedfiles do
local fname = wantedfiles[k]
if fname and isreadable(fname) then
filename = fname
result[#result+1] = filejoin('.',fname)
if not allresults then
break
end
end
end
if #result > 0 then
return "onpath", result
end
end
local function find_otherwise(filename,filetype,wantedfiles,allresults) -- other text files | any | whatever
local filelist = collect_files(wantedfiles)
local fl = filelist and filelist[1]
if fl then
return "otherwise", { resolvers.resolve(fl[3]) } -- filename
end
end
-- we could have a loop over the 6 functions but then we'd have to
-- always analyze
collect_instance_files = function(filename,askedformat,allresults) -- uses nested
askedformat = askedformat or ""
filename = collapsepath(filename)
if allresults then
-- no need for caching, only used for tracing
local filetype, wantedfiles = find_analyze(filename,askedformat)
local results = {
{ find_direct (filename,true) },
{ find_wildcard (filename,true) },
{ find_qualified(filename,true) },
{ find_intree (filename,filetype,wantedfiles,true) },
{ find_onpath (filename,filetype,wantedfiles,true) },
{ find_otherwise(filename,filetype,wantedfiles,true) },
}
local result, status, done = { }, { }, { }
for k, r in next, results do
local method, list = r[1], r[2]
if method and list then
for i=1,#list do
local c = collapsepath(list[i])
if not done[c] then
result[#result+1] = c
done[c] = true
end
status[#status+1] = format("%-10s: %s",method,c)
end
end
end
if trace_detail then
report_resolving("lookup status: %s",table.serialize(status,filename))
end
return result, status
else
local method, result, stamp, filetype, wantedfiles
if instance.remember then
stamp = format("%s--%s", filename, askedformat)
result = stamp and instance.found[stamp]
if result then
if trace_locating then
report_resolving("remembered file '%s'",filename)
end
return result
end
end
method, result = find_direct(filename)
if not result then
method, result = find_wildcard(filename)
if not result then
method, result = find_qualified(filename)
if not result then
filetype, wantedfiles = find_analyze(filename,askedformat)
method, result = find_intree(filename,filetype,wantedfiles)
if not result then
method, result = find_onpath(filename,filetype,wantedfiles)
if not result then
method, result = find_otherwise(filename,filetype,wantedfiles)
end
end
end
end
end
if result and #result > 0 then
local foundname = collapsepath(result[1])
resolvers.registerintrees(filename,askedformat,filetype,method,foundname)
result = { foundname }
else
result = { } -- maybe false
end
if stamp then
if trace_locating then
report_resolving("remembering file '%s'",filename)
end
instance.found[stamp] = result
end
return result
end
end
-- -- -- end of main file search routing -- -- --
local function findfiles(filename,filetype,allresults)
local result, status = collect_instance_files(filename,filetype or "",allresults)
if not result or #result == 0 then
local lowered = lower(filename)
if filename ~= lowered then
result, status = collect_instance_files(lowered,filetype or "",allresults)
end
end
return result or { }, status
end
function resolvers.findfiles(filename,filetype)
return findfiles(filename,filetype,true)
end
function resolvers.findfile(filename,filetype)
return findfiles(filename,filetype,false)[1] or ""
end
function resolvers.findpath(filename,filetype)
return filedirname(findfiles(filename,filetype,false)[1] or "")
end
local function findgivenfiles(filename,allresults)
local bname, result = filebasename(filename), { }
local hashes = instance.hashes
local noffound = 0
for k=1,#hashes do
local hash = hashes[k]
local files = instance.files[hash.name] or { }
local blist = files[bname]
if not blist then
local rname = "remap:"..bname
blist = files[rname]
if blist then
bname = files[rname]
blist = files[bname]
end
end
if blist then
if type(blist) == 'string' then
local found = methodhandler('concatinators',hash.type,hash.name,blist,bname) or ""
if found ~= "" then
noffound = noffound + 1
result[noffound] = resolvers.resolve(found)
if not allresults then break end
end
else
for kk=1,#blist do
local vv = blist[kk]
local found = methodhandler('concatinators',hash.type,hash.name,vv,bname) or ""
if found ~= "" then
noffound = noffound + 1
result[noffound] = resolvers.resolve(found)
if not allresults then break end
end
end
end
end
end
return result
end
function resolvers.findgivenfiles(filename)
return findgivenfiles(filename,true)
end
function resolvers.findgivenfile(filename)
return findgivenfiles(filename,false)[1] or ""
end
local function doit(path,blist,bname,tag,variant,result,allresults)
local done = false
if blist and variant then
local resolve = resolvers.resolve -- added
if type(blist) == 'string' then
-- make function and share code
if find(lower(blist),path) then
local full = methodhandler('concatinators',variant,tag,blist,bname) or ""
result[#result+1] = resolve(full)
done = true
end
else
for kk=1,#blist do
local vv = blist[kk]
if find(lower(vv),path) then
local full = methodhandler('concatinators',variant,tag,vv,bname) or ""
result[#result+1] = resolve(full)
done = true
if not allresults then break end
end
end
end
end
return done
end
local makewildcard = Cs(
(P("^")^0 * P("/") * P(-1) + P(-1)) /".*"
+ (P("^")^0 * P("/") / "")^0 * (P("*")/".*" + P("-")/"%%-" + P(".")/"%%." + P("?")/"."+ P("\\")/"/" + P(1))^0
)
function resolvers.wildcardpattern(pattern)
return lpegmatch(makewildcard,pattern) or pattern
end
local function findwildcardfiles(filename,allresults,result) -- todo: remap: and lpeg
result = result or { }
local base = filebasename(filename)
local dirn = filedirname(filename)
local path = lower(lpegmatch(makewildcard,dirn) or dirn)
local name = lower(lpegmatch(makewildcard,base) or base)
local files, done = instance.files, false
if find(name,"%*") then
local hashes = instance.hashes
for k=1,#hashes do
local hash = hashes[k]
local hashname, hashtype = hash.name, hash.type
for kk, hh in next, files[hashname] do
if not find(kk,"^remap:") then
if find(lower(kk),name) then
if doit(path,hh,kk,hashname,hashtype,result,allresults) then done = true end
if done and not allresults then break end
end
end
end
end
else
local hashes = instance.hashes
for k=1,#hashes do
local hash = hashes[k]
local hashname, hashtype = hash.name, hash.type
if doit(path,files[hashname][bname],bname,hashname,hashtype,result,allresults) then done = true end
if done and not allresults then break end
end
end
-- we can consider also searching the paths not in the database, but then
-- we end up with a messy search (all // in all path specs)
return result
end
function resolvers.findwildcardfiles(filename,result)
return findwildcardfiles(filename,true,result)
end
function resolvers.findwildcardfile(filename)
return findwildcardfiles(filename,false)[1] or ""
end
-- main user functions
function resolvers.automount()
-- implemented later
end
function resolvers.load(option)
statistics.starttiming(instance)
identify_configuration_files()
load_configuration_files()
if option ~= "nofiles" then
load_databases()
resolvers.automount()
end
statistics.stoptiming(instance)
local files = instance.files
return files and next(files) and true
end
function resolvers.loadtime()
return statistics.elapsedtime(instance)
end
local function report(str)
if trace_locating then
report_resolving(str) -- has already verbose
else
print(str)
end
end
function resolvers.dowithfilesandreport(command, files, ...) -- will move
if files and #files > 0 then
if trace_locating then
report('') -- ?
end
if type(files) == "string" then
files = { files }
end
for f=1,#files do
local file = files[f]
local result = command(file,...)
if type(result) == 'string' then
report(result)
else
for i=1,#result do
report(result[i]) -- could be unpack
end
end
end
end
end
-- obsolete
-- resolvers.varvalue = resolvers.variable -- output the value of variable $STRING.
-- resolvers.expandvar = resolvers.expansion -- output variable expansion of STRING.
function resolvers.showpath(str) -- output search path for file type NAME
return joinpath(resolvers.expandedpathlist(resolvers.formatofvariable(str)))
end
function resolvers.registerfile(files, name, path)
if files[name] then
if type(files[name]) == 'string' then
files[name] = { files[name], path }
else
files[name] = path
end
else
files[name] = path
end
end
function resolvers.dowithpath(name,func)
local pathlist = resolvers.expandedpathlist(name)
for i=1,#pathlist do
func("^"..resolvers.cleanpath(pathlist[i]))
end
end
function resolvers.dowithvariable(name,func)
func(expandedvariable(name))
end
function resolvers.locateformat(name)
local barename = file.removesuffix(name) -- gsub(name,"%.%a+$","")
local fmtname = caches.getfirstreadablefile(barename..".fmt","formats") or ""
if fmtname == "" then
fmtname = resolvers.findfile(barename..".fmt")
fmtname = resolvers.cleanpath(fmtname)
end
if fmtname ~= "" then
local barename = file.removesuffix(fmtname)
local luaname, lucname, luiname = barename .. ".lua", barename .. ".luc", barename .. ".lui"
if lfs.isfile(luiname) then
return barename, luiname
elseif lfs.isfile(lucname) then
return barename, lucname
elseif lfs.isfile(luaname) then
return barename, luaname
end
end
return nil, nil
end
function resolvers.booleanvariable(str,default)
local b = resolvers.expansion(str)
if b == "" then
return default
else
b = toboolean(b)
return (b == nil and default) or b
end
end
function resolvers.dowithfilesintree(pattern,handle,before,after) -- will move, can be a nice iterator instead
local instance = resolvers.instance
local hashes = instance.hashes
for i=1,#hashes do
local hash = hashes[i]
local blobtype = hash.type
local blobpath = hash.name
if blobpath then
if before then
before(blobtype,blobpath,pattern)
end
local files = instance.files[blobpath]
local total, checked, done = 0, 0, 0
if files then
for k,v in next, files do
total = total + 1
if find(k,"^remap:") then
k = files[k]
v = k -- files[k] -- chained
end
if find(k,pattern) then
if type(v) == "string" then
checked = checked + 1
if handle(blobtype,blobpath,v,k) then
done = done + 1
end
else
checked = checked + #v
for i=1,#v do
if handle(blobtype,blobpath,v[i],k) then
done = done + 1
end
end
end
end
end
end
if after then
after(blobtype,blobpath,pattern,total,checked,done)
end
end
end
end
resolvers.obsolete = resolvers.obsolete or { }
local obsolete = resolvers.obsolete
resolvers.find_file = resolvers.findfile obsolete.find_file = resolvers.findfile
resolvers.find_files = resolvers.findfiles obsolete.find_files = resolvers.findfiles
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-pre'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- It could be interesting to hook the resolver in the file
-- opener so that unresolved prefixes travel around and we
-- get more abstraction.
-- As we use this beforehand we will move this up in the chain
-- of loading.
local resolvers = resolvers
local prefixes = utilities.storage.allocate()
resolvers.prefixes = prefixes
local gsub = string.gsub
local cleanpath, findgivenfile, expansion = resolvers.cleanpath, resolvers.findgivenfile, resolvers.expansion
local getenv = resolvers.getenv -- we can probably also use resolvers.expansion
local P, Cs, lpegmatch = lpeg.P, lpeg.Cs, lpeg.match
-- getenv = function(...) return resolvers.getenv(...) end -- needs checking (definitions changes later on)
prefixes.environment = function(str)
return cleanpath(expansion(str))
end
prefixes.relative = function(str,n) -- lfs.isfile
if io.exists(str) then
-- nothing
elseif io.exists("./" .. str) then
str = "./" .. str
else
local p = "../"
for i=1,n or 2 do
if io.exists(p .. str) then
str = p .. str
break
else
p = p .. "../"
end
end
end
return cleanpath(str)
end
prefixes.auto = function(str)
local fullname = prefixes.relative(str)
if not lfs.isfile(fullname) then
fullname = prefixes.locate(str)
end
return fullname
end
prefixes.locate = function(str)
local fullname = findgivenfile(str) or ""
return cleanpath((fullname ~= "" and fullname) or str)
end
prefixes.filename = function(str)
local fullname = findgivenfile(str) or ""
return cleanpath(file.basename((fullname ~= "" and fullname) or str)) -- no cleanpath needed here
end
prefixes.pathname = function(str)
local fullname = findgivenfile(str) or ""
return cleanpath(file.dirname((fullname ~= "" and fullname) or str))
end
prefixes.selfautoloc = function(str)
return cleanpath(file.join(getenv('SELFAUTOLOC'),str))
end
prefixes.selfautoparent = function(str)
return cleanpath(file.join(getenv('SELFAUTOPARENT'),str))
end
prefixes.selfautodir = function(str)
return cleanpath(file.join(getenv('SELFAUTODIR'),str))
end
prefixes.home = function(str)
return cleanpath(file.join(getenv('HOME'),str))
end
prefixes.env = prefixes.environment
prefixes.rel = prefixes.relative
prefixes.loc = prefixes.locate
prefixes.kpse = prefixes.locate
prefixes.full = prefixes.locate
prefixes.file = prefixes.filename
prefixes.path = prefixes.pathname
function resolvers.allprefixes(separator)
local all = table.sortedkeys(prefixes)
if separator then
for i=1,#all do
all[i] = all[i] .. ":"
end
end
return all
end
local function _resolve_(method,target)
local action = prefixes[method]
if action then
return action(target)
else
return method .. ":" .. target
end
end
local resolved, abstract = { }, { }
function resolvers.resetresolve(str)
resolved, abstract = { }, { }
end
local function resolve(str) -- use schemes, this one is then for the commandline only
local res = resolved[str]
if not res then
res = gsub(str,"([a-z][a-z]+):([^ \"\';]*)",_resolve_) -- home:xx;selfautoparent:xx; etc
resolved[str] = res
abstract[res] = str
end
return res
end
local function unresolve(str)
return abstract[str] or str
end
resolvers.resolve = resolve
resolvers.unresolve = unresolve
if os.uname then
for k, v in next, os.uname() do
if not prefixes[k] then
prefixes[k] = function() return v end
end
end
end
if os.type == "unix" then
local pattern
local function makepattern(t,k,v)
local colon = P(":")
local p
for k, v in table.sortedpairs(prefixes) do
if p then
p = P(k) + p
else
p = P(k)
end
end
pattern = Cs((p * colon + colon/";" + P(1))^0)
if t then
t[k] = v
end
end
makepattern()
getmetatable(prefixes).__newindex = makepattern
function resolvers.repath(str)
return lpegmatch(pattern,str)
end
else -- already the default:
function resolvers.repath(str)
return str
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-inp'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local allocate = utilities.storage.allocate
local resolvers = resolvers
local methodhandler = resolvers.methodhandler
local registermethod = resolvers.registermethod
local finders = allocate { helpers = { }, notfound = function() end }
local openers = allocate { helpers = { }, notfound = function() end }
local loaders = allocate { helpers = { }, notfound = function() return false, nil, 0 end }
registermethod("finders", finders, "uri")
registermethod("openers", openers, "uri")
registermethod("loaders", loaders, "uri")
resolvers.finders = finders
resolvers.openers = openers
resolvers.loaders = loaders
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-out'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local allocate = utilities.storage.allocate
local resolvers = resolvers
local registermethod = resolvers.registermethod
local savers = allocate { helpers = { } }
resolvers.savers = savers
registermethod("savers", savers, "uri")
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-fil'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_files = logs.reporter("resolvers","files")
local resolvers = resolvers
local finders, openers, loaders, savers = resolvers.finders, resolvers.openers, resolvers.loaders, resolvers.savers
local locators, hashers, generators, concatinators = resolvers.locators, resolvers.hashers, resolvers.generators, resolvers.concatinators
local checkgarbage = utilities.garbagecollector and utilities.garbagecollector.check
function locators.file(specification)
local name = specification.filename
local realname = resolvers.resolve(name) -- no shortcut
if realname and realname ~= '' and lfs.isdir(realname) then
if trace_locating then
report_files("file locator '%s' found as '%s'",name,realname)
end
resolvers.appendhash('file',name,true) -- cache
elseif trace_locating then
report_files("file locator '%s' not found",name)
end
end
function hashers.file(specification)
local name = specification.filename
local content = caches.loadcontent(name,'files')
resolvers.registerfilehash(name,content,content==nil)
end
function generators.file(specification)
local path = specification.filename
local content = resolvers.scanfiles(path,false,true) -- scan once
resolvers.registerfilehash(path,content,true)
end
concatinators.file = file.join
function finders.file(specification,filetype)
local filename = specification.filename
local foundname = resolvers.findfile(filename,filetype)
if foundname and foundname ~= "" then
if trace_locating then
report_files("file finder: '%s' found",filename)
end
return foundname
else
if trace_locating then
report_files("file finder: %s' not found",filename)
end
return finders.notfound()
end
end
-- The default textopener will be overloaded later on.
function openers.helpers.textopener(tag,filename,f)
return {
reader = function() return f:read () end,
close = function() logs.show_close(filename) return f:close() end,
}
end
function openers.file(specification,filetype)
local filename = specification.filename
if filename and filename ~= "" then
local f = io.open(filename,"r")
if f then
if trace_locating then
report_files("file opener, '%s' opened",filename)
end
return openers.helpers.textopener("file",filename,f)
end
end
if trace_locating then
report_files("file opener, '%s' not found",filename)
end
return openers.notfound()
end
function loaders.file(specification,filetype)
local filename = specification.filename
if filename and filename ~= "" then
local f = io.open(filename,"rb")
if f then
logs.show_load(filename)
if trace_locating then
report_files("file loader, '%s' loaded",filename)
end
local s = f:read("*a")
if checkgarbage then
checkgarbage(#s)
end
f:close()
if s then
return true, s, #s
end
end
end
if trace_locating then
report_files("file loader, '%s' not found",filename)
end
return loaders.notfound()
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-con'] = {
version = 1.100,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local format, lower, gsub = string.format, string.lower, string.gsub
local trace_cache = false trackers.register("resolvers.cache", function(v) trace_cache = v end)
local trace_containers = false trackers.register("resolvers.containers", function(v) trace_containers = v end)
local trace_storage = false trackers.register("resolvers.storage", function(v) trace_storage = v end)
--[[ldx--
<p>Once we found ourselves defining similar cache constructs
several times, containers were introduced. Containers are used
to collect tables in memory and reuse them when possible based
on (unique) hashes (to be provided by the calling function).</p>
<p>Caching to disk is disabled by default. Version numbers are
stored in the saved table which makes it possible to change the
table structures without bothering about the disk cache.</p>
<p>Examples of usage can be found in the font related code.</p>
--ldx]]--
containers = containers or { }
local containers = containers
containers.usecache = true
local report_containers = logs.reporter("resolvers","containers")
local function report(container,tag,name)
if trace_cache or trace_containers then
report_containers("container: %s, tag: %s, name: %s",container.subcategory,tag,name or 'invalid')
end
end
local allocated = { }
local mt = {
__index = function(t,k)
if k == "writable" then
local writable = caches.getwritablepath(t.category,t.subcategory) or { "." }
t.writable = writable
return writable
elseif k == "readables" then
local readables = caches.getreadablepaths(t.category,t.subcategory) or { "." }
t.readables = readables
return readables
end
end,
__storage__ = true
}
function containers.define(category, subcategory, version, enabled)
if category and subcategory then
local c = allocated[category]
if not c then
c = { }
allocated[category] = c
end
local s = c[subcategory]
if not s then
s = {
category = category,
subcategory = subcategory,
storage = { },
enabled = enabled,
version = version or math.pi, -- after all, this is TeX
trace = false,
-- writable = caches.getwritablepath and caches.getwritablepath (category,subcategory) or { "." },
-- readables = caches.getreadablepaths and caches.getreadablepaths(category,subcategory) or { "." },
}
setmetatable(s,mt)
c[subcategory] = s
end
return s
end
end
function containers.is_usable(container, name)
return container.enabled and caches and caches.is_writable(container.writable, name)
end
function containers.is_valid(container, name)
if name and name ~= "" then
local storage = container.storage[name]
return storage and storage.cache_version == container.version
else
return false
end
end
function containers.read(container,name)
local storage = container.storage
local stored = storage[name]
if not stored and container.enabled and caches and containers.usecache then
stored = caches.loaddata(container.readables,name)
if stored and stored.cache_version == container.version then
report(container,"loaded",name)
else
stored = nil
end
storage[name] = stored
elseif stored then
report(container,"reusing",name)
end
return stored
end
function containers.write(container, name, data)
if data then
data.cache_version = container.version
if container.enabled and caches then
local unique, shared = data.unique, data.shared
data.unique, data.shared = nil, nil
caches.savedata(container.writable, name, data)
report(container,"saved",name)
data.unique, data.shared = unique, shared
end
report(container,"stored",name)
container.storage[name] = data
end
return data
end
function containers.content(container,name)
return container.storage[name]
end
function containers.cleanname(name)
return (gsub(lower(name),"[^%w%d]+","-"))
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-use'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local format, lower, gsub, find = string.format, string.lower, string.gsub, string.find
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_mounts = logs.reporter("resolvers","mounts")
local resolvers = resolvers
-- we will make a better format, maybe something xml or just text or lua
resolvers.automounted = resolvers.automounted or { }
function resolvers.automount(usecache)
local mountpaths = resolvers.cleanpathlist(resolvers.expansion('TEXMFMOUNT'))
if (not mountpaths or #mountpaths == 0) and usecache then
mountpaths = caches.getreadablepaths("mount")
end
if mountpaths and #mountpaths > 0 then
statistics.starttiming(resolvers.instance)
for k=1,#mountpaths do
local root = mountpaths[k]
local f = io.open(root.."/url.tmi")
if f then
for line in f:lines() do
if line then
if find(line,"^[%%#%-]") then -- or %W
-- skip
elseif find(line,"^zip://") then
if trace_locating then
report_mounts("mounting %s",line)
end
table.insert(resolvers.automounted,line)
resolvers.usezipfile(line)
end
end
end
f:close()
end
end
statistics.stoptiming(resolvers.instance)
end
end
-- status info
statistics.register("used config file", function() return caches.configfiles() end)
statistics.register("used cache path", function() return caches.usedpaths() end)
-- experiment (code will move)
function statistics.savefmtstatus(texname,formatbanner,sourcefile) -- texname == formatname
local enginebanner = status.list().banner
if formatbanner and enginebanner and sourcefile then
local luvname = file.replacesuffix(texname,"luv")
local luvdata = {
enginebanner = enginebanner,
formatbanner = formatbanner,
sourcehash = md5.hex(io.loaddata(resolvers.findfile(sourcefile)) or "unknown"),
sourcefile = sourcefile,
}
io.savedata(luvname,table.serialize(luvdata,true))
end
end
function statistics.checkfmtstatus(texname)
local enginebanner = status.list().banner
if enginebanner and texname then
local luvname = file.replacesuffix(texname,"luv")
if lfs.isfile(luvname) then
local luv = dofile(luvname)
if luv and luv.sourcefile then
local sourcehash = md5.hex(io.loaddata(resolvers.findfile(luv.sourcefile)) or "unknown")
local luvbanner = luv.enginebanner or "?"
if luvbanner ~= enginebanner then
return format("engine mismatch (luv: %s <> bin: %s)",luvbanner,enginebanner)
end
local luvhash = luv.sourcehash or "?"
if luvhash ~= sourcehash then
return format("source mismatch (luv: %s <> bin: %s)",luvhash,sourcehash)
end
else
return "invalid status file"
end
else
return "missing status file"
end
end
return true
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-zip'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- partly redone .. needs testing
local format, find, match = string.format, string.find, string.match
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_zip = logs.reporter("resolvers","zip")
-- zip:///oeps.zip?name=bla/bla.tex
-- zip:///oeps.zip?tree=tex/texmf-local
-- zip:///texmf.zip?tree=/tex/texmf
-- zip:///texmf.zip?tree=/tex/texmf-local
-- zip:///texmf-mine.zip?tree=/tex/texmf-projects
local resolvers = resolvers
zip = zip or { }
local zip = zip
zip.archives = zip.archives or { }
local archives = zip.archives
zip.registeredfiles = zip.registeredfiles or { }
local registeredfiles = zip.registeredfiles
local function validzip(str) -- todo: use url splitter
if not find(str,"^zip://") then
return "zip:///" .. str
else
return str
end
end
function zip.openarchive(name)
if not name or name == "" then
return nil
else
local arch = archives[name]
if not arch then
local full = resolvers.findfile(name) or ""
arch = (full ~= "" and zip.open(full)) or false
archives[name] = arch
end
return arch
end
end
function zip.closearchive(name)
if not name or (name == "" and archives[name]) then
zip.close(archives[name])
archives[name] = nil
end
end
function resolvers.locators.zip(specification)
local archive = specification.filename
local zipfile = archive and archive ~= "" and zip.openarchive(archive) -- tricky, could be in to be initialized tree
if trace_locating then
if zipfile then
report_zip("locator, archive '%s' found",archive)
else
report_zip("locator, archive '%s' not found",archive)
end
end
end
function resolvers.hashers.zip(specification)
local archive = specification.filename
if trace_locating then
report_zip("loading file '%s'",archive)
end
resolvers.usezipfile(specification.original)
end
function resolvers.concatinators.zip(zipfile,path,name) -- ok ?
if not path or path == "" then
return format('%s?name=%s',zipfile,name)
else
return format('%s?name=%s/%s',zipfile,path,name)
end
end
function resolvers.finders.zip(specification)
local original = specification.original
local archive = specification.filename
if archive then
local query = url.query(specification.query)
local queryname = query.name
if queryname then
local zfile = zip.openarchive(archive)
if zfile then
if trace_locating then
report_zip("finder, archive '%s' found",archive)
end
local dfile = zfile:open(queryname)
if dfile then
dfile = zfile:close()
if trace_locating then
report_zip("finder, file '%s' found",queryname)
end
return specification.original
elseif trace_locating then
report_zip("finder, file '%s' not found",queryname)
end
elseif trace_locating then
report_zip("finder, unknown archive '%s'",archive)
end
end
end
if trace_locating then
report_zip("finder, '%s' not found",original)
end
return resolvers.finders.notfound()
end
function resolvers.openers.zip(specification)
local original = specification.original
local archive = specification.filename
if archive then
local query = url.query(specification.query)
local queryname = query.name
if queryname then
local zfile = zip.openarchive(archive)
if zfile then
if trace_locating then
report_zip("opener, archive '%s' opened",archive)
end
local dfile = zfile:open(queryname)
if dfile then
if trace_locating then
report_zip("opener, file '%s' found",queryname)
end
return resolvers.openers.helpers.textopener('zip',original,dfile)
elseif trace_locating then
report_zip("opener, file '%s' not found",queryname)
end
elseif trace_locating then
report_zip("opener, unknown archive '%s'",archive)
end
end
end
if trace_locating then
report_zip("opener, '%s' not found",original)
end
return resolvers.openers.notfound()
end
function resolvers.loaders.zip(specification)
local original = specification.original
local archive = specification.filename
if archive then
local query = url.query(specification.query)
local queryname = query.name
if queryname then
local zfile = zip.openarchive(archive)
if zfile then
if trace_locating then
report_zip("loader, archive '%s' opened",archive)
end
local dfile = zfile:open(queryname)
if dfile then
logs.show_load(original)
if trace_locating then
report_zip("loader, file '%s' loaded",original)
end
local s = dfile:read("*all")
dfile:close()
return true, s, #s
elseif trace_locating then
report_zip("loader, file '%s' not found",queryname)
end
elseif trace_locating then
report_zip("loader, unknown archive '%s'",archive)
end
end
end
if trace_locating then
report_zip("loader, '%s' not found",original)
end
return resolvers.openers.notfound()
end
-- zip:///somefile.zip
-- zip:///somefile.zip?tree=texmf-local -> mount
function resolvers.usezipfile(archive)
local specification = resolvers.splitmethod(archive) -- to be sure
local archive = specification.filename
if archive and not registeredfiles[archive] then
local z = zip.openarchive(archive)
if z then
local tree = url.query(specification.query).tree or ""
if trace_locating then
report_zip("registering, registering archive '%s'",archive)
end
statistics.starttiming(resolvers.instance)
resolvers.prependhash('zip',archive)
resolvers.extendtexmfvariable(archive) -- resets hashes too
registeredfiles[archive] = z
instance.files[archive] = resolvers.registerzipfile(z,tree)
statistics.stoptiming(resolvers.instance)
elseif trace_locating then
report_zip("registering, unknown archive '%s'",archive)
end
elseif trace_locating then
report_zip("registering, '%s' not found",archive)
end
end
function resolvers.registerzipfile(z,tree)
local files, filter = { }, ""
if tree == "" then
filter = "^(.+)/(.-)$"
else
filter = format("^%s/(.+)/(.-)$",tree)
end
if trace_locating then
report_zip("registering, using filter '%s'",filter)
end
local register, n = resolvers.registerfile, 0
for i in z:files() do
local path, name = match(i.filename,filter)
if path then
if name and name ~= '' then
register(files, name, path)
n = n + 1
else
-- directory
end
else
register(files, i.filename, '')
n = n + 1
end
end
report_zip("registering, %s files registered",n)
return files
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-tre'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- \input tree://oeps1/**/oeps.tex
local find, gsub, format = string.find, string.gsub, string.format
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_trees = logs.reporter("resolvers","trees")
local resolvers = resolvers
local done, found, notfound = { }, { }, resolvers.finders.notfound
function resolvers.finders.tree(specification)
local spec = specification.filename
local fnd = found[spec]
if fnd == nil then
if spec ~= "" then
local path, name = file.dirname(spec), file.basename(spec)
if path == "" then path = "." end
local hash = done[path]
if not hash then
local pattern = path .. "/*" -- we will use the proper splitter
hash = dir.glob(pattern)
done[path] = hash
end
local pattern = "/" .. gsub(name,"([%.%-%+])", "%%%1") .. "$"
for k=1,#hash do
local v = hash[k]
if find(v,pattern) then
found[spec] = v
return v
end
end
end
fnd = notfound() -- false
found[spec] = fnd
end
return fnd
end
function resolvers.locators.tree(specification)
local name = specification.filename
local realname = resolvers.resolve(name) -- no shortcut
if realname and realname ~= '' and lfs.isdir(realname) then
if trace_locating then
report_trees("locator '%s' found",realname)
end
resolvers.appendhash('tree',name,false) -- don't cache
elseif trace_locating then
report_trees("locator '%s' not found",name)
end
end
function resolvers.hashers.tree(specification)
local name = specification.filename
if trace_locating then
report_trees("analysing '%s'",name)
end
resolvers.methodhandler("hashers",name)
resolvers.generators.file(specification)
end
resolvers.concatinators.tree = resolvers.concatinators.file
resolvers.generators.tree = resolvers.generators.file
resolvers.openers.tree = resolvers.openers.file
resolvers.loaders.tree = resolvers.loaders.file
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-crl'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- this one is replaced by data-sch.lua --
local gsub = string.gsub
local resolvers = resolvers
local finders, openers, loaders = resolvers.finders, resolvers.openers, resolvers.loaders
resolvers.curl = resolvers.curl or { }
local curl = resolvers.curl
local cached = { }
local function runcurl(specification)
local original = specification.original
-- local scheme = specification.scheme
local cleanname = gsub(original,"[^%a%d%.]+","-")
local cachename = caches.setfirstwritablefile(cleanname,"curl")
if not cached[original] then
if not io.exists(cachename) then
cached[original] = cachename
local command = "curl --silent --create-dirs --output " .. cachename .. " " .. original
os.spawn(command)
end
if io.exists(cachename) then
cached[original] = cachename
else
cached[original] = ""
end
end
return cached[original]
end
-- old code: we could be cleaner using specification (see schemes)
local function finder(specification,filetype)
return resolvers.methodhandler("finders",runcurl(specification),filetype)
end
local opener = openers.file
local loader = loaders.file
local function install(scheme)
finders[scheme] = finder
openers[scheme] = opener
loaders[scheme] = loader
end
resolvers.curl.install = install
install('http')
install('https')
install('ftp')
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-lua'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- some loading stuff ... we might move this one to slot 2 depending
-- on the developments (the loaders must not trigger kpse); we could
-- of course use a more extensive lib path spec
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local report_libraries = logs.reporter("resolvers","libraries")
local gsub, insert = string.gsub, table.insert
local unpack = unpack or table.unpack
local resolvers, package = resolvers, package
local libformats = { 'luatexlibs', 'tex', 'texmfscripts', 'othertextfiles' } -- 'luainputs'
local clibformats = { 'lib' }
local _path_, libpaths, _cpath_, clibpaths
function package.libpaths()
if not _path_ or package.path ~= _path_ then
_path_ = package.path
libpaths = file.splitpath(_path_,";")
end
return libpaths
end
function package.clibpaths()
if not _cpath_ or package.cpath ~= _cpath_ then
_cpath_ = package.cpath
clibpaths = file.splitpath(_cpath_,";")
end
return clibpaths
end
local function thepath(...)
local t = { ... } t[#t+1] = "?.lua"
local path = file.join(unpack(t))
if trace_locating then
report_libraries("! appending '%s' to 'package.path'",path)
end
return path
end
local p_libpaths, a_libpaths = { }, { }
function package.appendtolibpath(...)
insert(a_libpath,thepath(...))
end
function package.prependtolibpath(...)
insert(p_libpaths,1,thepath(...))
end
-- beware, we need to return a loadfile result !
local function loaded(libpaths,name,simple)
for i=1,#libpaths do -- package.path, might become option
local libpath = libpaths[i]
local resolved = gsub(libpath,"%?",simple)
if trace_locating then -- more detail
report_libraries("! checking for '%s' on 'package.path': '%s' => '%s'",simple,libpath,resolved)
end
if file.is_readable(resolved) then
if trace_locating then
report_libraries("! lib '%s' located via 'package.path': '%s'",name,resolved)
end
return loadfile(resolved)
end
end
end
package.loaders[2] = function(name) -- was [#package.loaders+1]
if trace_locating then -- mode detail
report_libraries("! locating '%s'",name)
end
for i=1,#libformats do
local format = libformats[i]
local resolved = resolvers.findfile(name,format) or ""
if trace_locating then -- mode detail
report_libraries("! checking for '%s' using 'libformat path': '%s'",name,format)
end
if resolved ~= "" then
if trace_locating then
report_libraries("! lib '%s' located via environment: '%s'",name,resolved)
end
return loadfile(resolved)
end
end
-- libpaths
local libpaths, clibpaths = package.libpaths(), package.clibpaths()
local simple = gsub(name,"%.lua$","")
local simple = gsub(simple,"%.","/")
local resolved = loaded(p_libpaths,name,simple) or loaded(libpaths,name,simple) or loaded(a_libpaths,name,simple)
if resolved then
return resolved
end
--
local libname = file.addsuffix(simple,os.libsuffix)
for i=1,#clibformats do
-- better have a dedicated loop
local format = clibformats[i]
local paths = resolvers.expandedpathlistfromvariable(format)
for p=1,#paths do
local path = paths[p]
local resolved = file.join(path,libname)
if trace_locating then -- mode detail
report_libraries("! checking for '%s' using 'clibformat path': '%s'",libname,path)
end
if file.is_readable(resolved) then
if trace_locating then
report_libraries("! lib '%s' located via 'clibformat': '%s'",libname,resolved)
end
return package.loadlib(resolved,name)
end
end
end
for i=1,#clibpaths do -- package.path, might become option
local libpath = clibpaths[i]
local resolved = gsub(libpath,"?",simple)
if trace_locating then -- more detail
report_libraries("! checking for '%s' on 'package.cpath': '%s'",simple,libpath)
end
if file.is_readable(resolved) then
if trace_locating then
report_libraries("! lib '%s' located via 'package.cpath': '%s'",name,resolved)
end
return package.loadlib(resolved,name)
end
end
-- just in case the distribution is messed up
if trace_loading then -- more detail
report_libraries("! checking for '%s' using 'luatexlibs': '%s'",name)
end
local resolved = resolvers.findfile(file.basename(name),'luatexlibs') or ""
if resolved ~= "" then
if trace_locating then
report_libraries("! lib '%s' located by basename via environment: '%s'",name,resolved)
end
return loadfile(resolved)
end
if trace_locating then
report_libraries('? unable to locate lib: %s',name)
end
-- return "unable to locate " .. name
end
resolvers.loadlualib = require
-- -- -- --
package.obsolete = package.obsolete or { }
package.append_libpath = appendtolibpath -- will become obsolete
package.prepend_libpath = prependtolibpath -- will become obsolete
package.obsolete.append_libpath = appendtolibpath -- will become obsolete
package.obsolete.prepend_libpath = prependtolibpath -- will become obsolete
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-aux'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local find = string.find
local type, next = type, next
local trace_locating = false trackers.register("resolvers.locating", function(v) trace_locating = v end)
local resolvers = resolvers
local report_scripts = logs.reporter("resolvers","scripts")
function resolvers.updatescript(oldname,newname) -- oldname -> own.name, not per se a suffix
local scriptpath = "scripts/context/lua"
newname = file.addsuffix(newname,"lua")
local oldscript = resolvers.cleanpath(oldname)
if trace_locating then
report_scripts("to be replaced old script %s", oldscript)
end
local newscripts = resolvers.findfiles(newname) or { }
if #newscripts == 0 then
if trace_locating then
report_scripts("unable to locate new script")
end
else
for i=1,#newscripts do
local newscript = resolvers.cleanpath(newscripts[i])
if trace_locating then
report_scripts("checking new script %s", newscript)
end
if oldscript == newscript then
if trace_locating then
report_scripts("old and new script are the same")
end
elseif not find(newscript,scriptpath) then
if trace_locating then
report_scripts("new script should come from %s",scriptpath)
end
elseif not (find(oldscript,file.removesuffix(newname).."$") or find(oldscript,newname.."$")) then
if trace_locating then
report_scripts("invalid new script name")
end
else
local newdata = io.loaddata(newscript)
if newdata then
if trace_locating then
report_scripts("old script content replaced by new content")
end
io.savedata(oldscript,newdata)
break
elseif trace_locating then
report_scripts("unable to load new script")
end
end
end
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-tmf'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local resolvers = resolvers
local report_tds = logs.reporter("resolvers","tds")
-- = <<
-- ? ??
-- < +=
-- > =+
function resolvers.load_tree(tree,resolve)
if type(tree) == "string" and tree ~= "" then
local getenv, setenv = resolvers.getenv, resolvers.setenv
-- later might listen to the raw osenv var as well
local texos = "texmf-" .. os.platform
local oldroot = environment.texroot
local newroot = file.collapsepath(tree)
local newtree = file.join(newroot,texos)
local newpath = file.join(newtree,"bin")
if not lfs.isdir(newtree) then
report_tds("no '%s' under tree %s",texos,tree)
os.exit()
end
if not lfs.isdir(newpath) then
report_tds("no '%s/bin' under tree %s",texos,tree)
os.exit()
end
local texmfos = newtree
environment.texroot = newroot
environment.texos = texos
environment.texmfos = texmfos
-- Beware, we need to obey the relocatable autoparent so we
-- set TEXMFCNF to its raw value. This is somewhat tricky when
-- we run a mkii job from within. Therefore, in mtxrun, there
-- is a resolve applied when we're in mkii/kpse mode or when
-- --resolve is passed to mtxrun. Maybe we should also set the
-- local AUTOPARENT etc. although these are alwasy set new.
if resolve then
resolvers.luacnfspec = resolvers.resolve(resolvers.luacnfspec)
end
setenv('SELFAUTOPARENT', newroot)
setenv('SELFAUTODIR', newtree)
setenv('SELFAUTOLOC', newpath)
setenv('TEXROOT', newroot)
setenv('TEXOS', texos)
setenv('TEXMFOS', texmfos)
setenv('TEXMFCNF', resolvers.luacnfspec,true) -- already resolved
setenv('PATH', newpath .. io.pathseparator .. getenv('PATH'))
report_tds("changing from root '%s' to '%s'",oldroot,newroot)
report_tds("prepending '%s' to PATH",newpath)
report_tds("setting TEXMFCNF to '%s'",resolvers.luacnfspec)
report_tds()
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['data-lst'] = {
version = 1.001,
comment = "companion to luat-lib.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- used in mtxrun, can be loaded later .. todo
local find, concat, upper, format = string.find, table.concat, string.upper, string.format
local fastcopy, sortedpairs = table.fastcopy, table.sortedpairs
resolvers.listers = resolvers.listers or { }
local resolvers = resolvers
local report_lists = logs.reporter("resolvers","lists")
local function tabstr(str)
if type(str) == 'table' then
return concat(str," | ")
else
return str
end
end
function resolvers.listers.variables(pattern)
local instance = resolvers.instance
local environment = instance.environment
local variables = instance.variables
local expansions = instance.expansions
local pattern = upper(pattern or "")
local configured = { }
local order = instance.order
for i=1,#order do
for k, v in next, order[i] do
if v ~= nil and configured[k] == nil then
configured[k] = v
end
end
end
local env = fastcopy(environment)
local var = fastcopy(variables)
local exp = fastcopy(expansions)
for key, value in sortedpairs(configured) do
if key ~= "" and (pattern == "" or find(upper(key),pattern)) then
report_lists(key)
report_lists(" env: %s",tabstr(rawget(environment,key)) or "unset")
report_lists(" var: %s",tabstr(configured[key]) or "unset")
report_lists(" exp: %s",tabstr(expansions[key]) or "unset")
report_lists(" res: %s",resolvers.resolve(expansions[key]) or "unset")
end
end
instance.environment = fastcopy(env)
instance.variables = fastcopy(var)
instance.expansions = fastcopy(exp)
end
function resolvers.listers.configurations(report)
local configurations = resolvers.instance.specification
local report = report or texio.write_nl
for i=1,#configurations do
report(resolvers.resolve(configurations[i]))
end
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['luat-sta'] = {
version = 1.001,
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
-- this code is used in the updater
local gmatch, match = string.gmatch, string.match
local type = type
states = states or { }
local states = states
states.data = states.data or { }
local data = states.data
states.hash = states.hash or { }
local hash = states.hash
states.tag = states.tag or ""
states.filename = states.filename or ""
function states.save(filename,tag)
tag = tag or states.tag
filename = file.addsuffix(filename or states.filename,'lus')
io.savedata(filename,
"-- generator : luat-sta.lua\n" ..
"-- state tag : " .. tag .. "\n\n" ..
table.serialize(data[tag or states.tag] or {},true)
)
end
function states.load(filename,tag)
states.filename = filename
states.tag = tag or "whatever"
states.filename = file.addsuffix(states.filename,'lus')
data[states.tag], hash[states.tag] = (io.exists(filename) and dofile(filename)) or { }, { }
end
local function set_by_tag(tag,key,value,default,persistent)
local d, h = data[tag], hash[tag]
if d then
if type(d) == "table" then
local dkey, hkey = key, key
local pre, post = match(key,"(.+)%.([^%.]+)$")
if pre and post then
for k in gmatch(pre,"[^%.]+") do
local dk = d[k]
if not dk then
dk = { }
d[k] = dk
elseif type(dk) == "string" then
-- invalid table, unable to upgrade structure
-- hope for the best or delete the state file
break
end
d = dk
end
dkey, hkey = post, key
end
if value == nil then
value = default
elseif value == false then
-- special case
elseif persistent then
value = value or d[dkey] or default
else
value = value or default
end
d[dkey], h[hkey] = value, value
elseif type(d) == "string" then
-- weird
data[tag], hash[tag] = value, value
end
end
end
local function get_by_tag(tag,key,default)
local h = hash[tag]
if h and h[key] then
return h[key]
else
local d = data[tag]
if d then
for k in gmatch(key,"[^%.]+") do
local dk = d[k]
if dk ~= nil then
d = dk
else
return default
end
end
if d == false then
return false
else
return d or default
end
end
end
end
states.set_by_tag = set_by_tag
states.get_by_tag = get_by_tag
function states.set(key,value,default,persistent)
set_by_tag(states.tag,key,value,default,persistent)
end
function states.get(key,default)
return get_by_tag(states.tag,key,default)
end
end -- of closure
do -- create closure to overcome 200 locals limit
if not modules then modules = { } end modules ['luat-fmt'] = {
version = 1.001,
comment = "companion to mtxrun",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local format = string.format
local report_format = logs.reporter("resolvers","formats")
-- helper for mtxrun
local quoted = string.quoted
local function primaryflags() -- not yet ok
local trackers = environment.argument("trackers")
local directives = environment.argument("directives")
local flags = ""
if trackers and trackers ~= "" then
flags = flags .. "--trackers=" .. quoted(trackers)
end
if directives and directives ~= "" then
flags = flags .. "--directives=" .. quoted(directives)
end
return flags
end
function environment.make_format(name)
-- change to format path (early as we need expanded paths)
local olddir = lfs.currentdir()
local path = caches.getwritablepath("formats") or "" -- maybe platform
if path ~= "" then
lfs.chdir(path)
end
report_format("format path: %s",lfs.currentdir())
-- check source file
local texsourcename = file.addsuffix(name,"mkiv")
local fulltexsourcename = resolvers.findfile(texsourcename,"tex") or ""
if fulltexsourcename == "" then
texsourcename = file.addsuffix(name,"tex")
fulltexsourcename = resolvers.findfile(texsourcename,"tex") or ""
end
if fulltexsourcename == "" then
report_format("no tex source file with name: %s (mkiv or tex)",name)
lfs.chdir(olddir)
return
else
report_format("using tex source file: %s",fulltexsourcename)
end
local texsourcepath = dir.expandname(file.dirname(fulltexsourcename)) -- really needed
-- check specification
local specificationname = file.replacesuffix(fulltexsourcename,"lus")
local fullspecificationname = resolvers.findfile(specificationname,"tex") or ""
if fullspecificationname == "" then
specificationname = file.join(texsourcepath,"context.lus")
fullspecificationname = resolvers.findfile(specificationname,"tex") or ""
end
if fullspecificationname == "" then
report_format("unknown stub specification: %s",specificationname)
lfs.chdir(olddir)
return
end
local specificationpath = file.dirname(fullspecificationname)
-- load specification
local usedluastub = nil
local usedlualibs = dofile(fullspecificationname)
if type(usedlualibs) == "string" then
usedluastub = file.join(file.dirname(fullspecificationname),usedlualibs)
elseif type(usedlualibs) == "table" then
report_format("using stub specification: %s",fullspecificationname)
local texbasename = file.basename(name)
local luastubname = file.addsuffix(texbasename,"lua")
local lucstubname = file.addsuffix(texbasename,"luc")
-- pack libraries in stub
report_format("creating initialization file: %s",luastubname)
utilities.merger.selfcreate(usedlualibs,specificationpath,luastubname)
-- compile stub file (does not save that much as we don't use this stub at startup any more)
local strip = resolvers.booleanvariable("LUACSTRIP", true)
if utilities.lua.compile(luastubname,lucstubname) and lfs.isfile(lucstubname) then
report_format("using compiled initialization file: %s",lucstubname)
usedluastub = lucstubname
else
report_format("using uncompiled initialization file: %s",luastubname)
usedluastub = luastubname
end
else
report_format("invalid stub specification: %s",fullspecificationname)
lfs.chdir(olddir)
return
end
-- generate format
local command = format("luatex --ini %s --lua=%s %s %sdump",primaryflags(),quoted(usedluastub),quoted(fulltexsourcename),os.platform == "unix" and "\\\\" or "\\")
report_format("running command: %s\n",command)
os.spawn(command)
-- remove related mem files
local pattern = file.removesuffix(file.basename(usedluastub)).."-*.mem"
-- report_format("removing related mplib format with pattern '%s'", pattern)
local mp = dir.glob(pattern)
if mp then
for i=1,#mp do
local name = mp[i]
report_format("removing related mplib format %s", file.basename(name))
os.remove(name)
end
end
lfs.chdir(olddir)
end
function environment.run_format(name,data,more)
-- hm, rather old code here; we can now use the file.whatever functions
if name and name ~= "" then
local barename = file.removesuffix(name)
local fmtname = caches.getfirstreadablefile(file.addsuffix(barename,"fmt"),"formats")
if fmtname == "" then
fmtname = resolvers.findfile(file.addsuffix(barename,"fmt")) or ""
end
fmtname = resolvers.cleanpath(fmtname)
if fmtname == "" then
report_format("no format with name: %s",name)
else
local barename = file.removesuffix(name) -- expanded name
local luaname = file.addsuffix(barename,"luc")
if not lfs.isfile(luaname) then
luaname = file.addsuffix(barename,"lua")
end
if not lfs.isfile(luaname) then
report_format("using format name: %s",fmtname)
report_format("no luc/lua with name: %s",barename)
else
local command = format("luatex %s --fmt=%s --lua=%s %s %s",primaryflags(),quoted(barename),quoted(luaname),quoted(data),more ~= "" and quoted(more) or "")
report_format("running command: %s",command)
os.spawn(command)
end
end
end
end
end -- of closure
-- end library merge
own = { } -- not local, might change
own.libs = { -- order can be made better
'l-string.lua',
'l-table.lua',
'l-lpeg.lua',
'l-io.lua',
'l-number.lua',
'l-set.lua',
'l-os.lua',
'l-file.lua',
'l-md5.lua',
'l-url.lua',
'l-dir.lua',
'l-boolean.lua',
'l-unicode.lua',
'l-math.lua',
'util-tab.lua',
'util-sto.lua',
'util-mrg.lua',
'util-lua.lua',
'util-prs.lua',
'util-fmt.lua',
'util-deb.lua',
'trac-inf.lua',
'trac-set.lua',
'trac-log.lua',
'trac-pro.lua',
'luat-env.lua', -- can come before inf (as in mkiv)
'lxml-tab.lua',
'lxml-lpt.lua',
-- 'lxml-ent.lua',
'lxml-mis.lua',
'lxml-aux.lua',
'lxml-xml.lua',
'data-ini.lua',
'data-exp.lua',
'data-env.lua',
'data-tmp.lua',
'data-met.lua',
'data-res.lua',
'data-pre.lua',
'data-inp.lua',
'data-out.lua',
'data-fil.lua',
'data-con.lua',
'data-use.lua',
-- 'data-tex.lua',
-- 'data-bin.lua',
'data-zip.lua',
'data-tre.lua',
'data-crl.lua',
'data-lua.lua',
'data-aux.lua', -- updater
'data-tmf.lua',
'data-lst.lua',
'luat-sta.lua',
'luat-fmt.lua',
}
-- We need this hack till luatex is fixed.
--
-- for k,v in pairs(arg) do print(k,v) end
if arg and (arg[0] == 'luatex' or arg[0] == 'luatex.exe') and arg[1] == "--luaonly" then
arg[-1]=arg[0] arg[0]=arg[2] for k=3,#arg do arg[k-2]=arg[k] end arg[#arg]=nil arg[#arg]=nil
end
-- End of hack.
local format, gsub, gmatch, match = string.format, string.gsub, string.gmatch, string.match
local concat = table.concat
own.name = (environment and environment.ownname) or arg[0] or 'mtxrun.lua'
own.path = gsub(match(own.name,"^(.+)[\\/].-$") or ".","\\","/")
local ownpath, owntree = own.path, environment and environment.ownpath or own.path
own.list = {
'.',
ownpath ,
ownpath .. "/../sources", -- HH's development path
owntree .. "/../../texmf-local/tex/context/base",
owntree .. "/../../texmf-context/tex/context/base",
owntree .. "/../../texmf-dist/tex/context/base",
owntree .. "/../../texmf/tex/context/base",
owntree .. "/../../../texmf-local/tex/context/base",
owntree .. "/../../../texmf-context/tex/context/base",
owntree .. "/../../../texmf-dist/tex/context/base",
owntree .. "/../../../texmf/tex/context/base",
}
if own.path == "." then table.remove(own.list,1) end
local function locate_libs()
for l=1,#own.libs do
local lib = own.libs[l]
for p =1,#own.list do
local pth = own.list[p]
local filename = pth .. "/" .. lib
local found = lfs.isfile(filename)
if found then
package.path = package.path .. ";" .. pth .. "/?.lua" -- in case l-* does a require
return pth
end
end
end
end
local function load_libs()
local found = locate_libs()
if found then
for l=1,#own.libs do
local filename = found .. "/" .. own.libs[l]
local codeblob = loadfile(filename)
if codeblob then
codeblob()
end
end
else
resolvers = nil
end
end
if not resolvers then
load_libs()
end
if not resolvers then
print("")
print("Mtxrun is unable to start up due to lack of libraries. You may")
print("try to run 'lua mtxrun.lua --selfmerge' in the path where this")
print("script is located (normally under ..../scripts/context/lua) which")
print("will make this script library independent.")
os.exit()
end
-- verbosity
local e_verbose = environment.arguments["verbose"]
if e_verbose then
trackers.enable("resolvers.locating")
end
-- some common flags (also passed through environment)
local e_silent = environment.argument("silent")
local e_noconsole = environment.argument("noconsole")
local e_trackers = environment.argument("trackers")
local e_directives = environment.argument("directives")
local e_experiments = environment.argument("experiments")
if e_silent == true then
e_silent = "*"
end
if type(e_silent) == "string" then
if type(e_directives) == "string" then
e_directives = format("%s,logs.blocked={%s}",e_directives,e_silent)
else
e_directives = format("logs.blocked={%s}",e_silent)
end
end
if e_noconsole then
if type(e_directives) == "string" then
e_directives = format("%s,logs.target=file",e_directives)
else
e_directives = format("logs.target=file")
end
end
if e_trackers then trackers .enable(e_trackers) end
if e_directives then directives .enable(e_directives) end
if e_experiments then experiments.enable(e_experiments) end
if not environment.trackers then environment.trackers = e_trackers end
if not environment.directives then environment.directives = e_directives end
if not environment.experiments then environment.experiments = e_experiments end
--
local instance = resolvers.reset()
local helpinfo = [[
--script run an mtx script (lua prefered method) (--noquotes), no script gives list
--execute run a script or program (texmfstart method) (--noquotes)
--resolve resolve prefixed arguments
--ctxlua run internally (using preloaded libs)
--internal run script using built in libraries (same as --ctxlua)
--locate locate given filename in database (default) or system (--first --all --detail)
--autotree use texmf tree cf. env 'texmfstart_tree' or 'texmfstarttree'
--tree=pathtotree use given texmf tree (default file: 'setuptex.tmf')
--environment=name use given (tmf) environment file
--path=runpath go to given path before execution
--ifchanged=filename only execute when given file has changed (md checksum)
--iftouched=old,new only execute when given file has changed (time stamp)
--makestubs create stubs for (context related) scripts
--removestubs remove stubs (context related) scripts
--stubpath=binpath paths where stubs wil be written
--windows create windows (mswin) stubs
--unix create unix (linux) stubs
--verbose give a bit more info
--trackers=list enable given trackers
--progname=str format or backend
--edit launch editor with found file
--launch (--all) launch files like manuals, assumes os support
--timedrun run a script an time its run
--autogenerate regenerate databases if needed (handy when used to run context in an editor)
--usekpse use kpse as fallback (when no mkiv and cache installed, often slower)
--forcekpse force using kpse (handy when no mkiv and cache installed but less functionality)
--prefixes show supported prefixes
--generate generate file database
--variables show configuration variables
--configurations show configuration order
--expand-braces expand complex variable
--expand-path expand variable (resolve paths)
--expand-var expand variable (resolve references)
--show-path show path expansion of ...
--var-value report value of variable
--find-file report file location
--find-path report path of file
--pattern=str filter variables
]]
local application = logs.application {
name = "mtxrun",
banner = "ConTeXt TDS Runner Tool 1.31",
helpinfo = helpinfo,
}
local report = application.report
messages = messages or { } -- for the moment
runners = runners or { } -- global (might become local)
runners.applications = {
["lua"] = "luatex --luaonly",
["luc"] = "luatex --luaonly",
["pl"] = "perl",
["py"] = "python",
["rb"] = "ruby",
}
runners.suffixes = {
'rb', 'lua', 'py', 'pl'
}
runners.registered = {
texexec = { 'texexec.rb', false }, -- context mkii runner (only tool not to be luafied)
texutil = { 'texutil.rb', true }, -- old perl based index sorter for mkii (old versions need it)
texfont = { 'texfont.pl', true }, -- perl script that makes mkii font metric files
texfind = { 'texfind.pl', false }, -- perltk based tex searching tool, mostly used at pragma
texshow = { 'texshow.pl', false }, -- perltk based context help system, will be luafied
-- texwork = { 'texwork.pl', false }, -- perltk based editing environment, only used at pragma
makempy = { 'makempy.pl', true },
mptopdf = { 'mptopdf.pl', true },
pstopdf = { 'pstopdf.rb', true }, -- converts ps (and some more) images, does some cleaning (replaced)
-- examplex = { 'examplex.rb', false },
concheck = { 'concheck.rb', false },
runtools = { 'runtools.rb', true },
textools = { 'textools.rb', true },
tmftools = { 'tmftools.rb', true },
ctxtools = { 'ctxtools.rb', true },
rlxtools = { 'rlxtools.rb', true },
pdftools = { 'pdftools.rb', true },
mpstools = { 'mpstools.rb', true },
-- exatools = { 'exatools.rb', true },
xmltools = { 'xmltools.rb', true },
-- luatools = { 'luatools.lua', true },
mtxtools = { 'mtxtools.rb', true },
pdftrimwhite = { 'pdftrimwhite.pl', false },
}
runners.launchers = {
windows = { },
unix = { },
}
-- like runners.libpath("framework"): looks on script's subpath
function runners.libpath(...)
package.prepend_libpath(file.dirname(environment.ownscript),...)
package.prepend_libpath(file.dirname(environment.ownname) ,...)
end
function runners.prepare()
local checkname = environment.argument("ifchanged")
if type(checkname) == "string" and checkname ~= "" then
local oldchecksum = file.loadchecksum(checkname)
local newchecksum = file.checksum(checkname)
if oldchecksum == newchecksum then
if e_verbose then
report("file '%s' is unchanged",checkname)
end
return "skip"
elseif e_verbose then
report("file '%s' is changed, processing started",checkname)
end
file.savechecksum(checkname)
end
local touchname = environment.argument("iftouched")
if type(touchname) == "string" and touchname ~= "" then
local oldname, newname = string.splitup(touchname, ",")
if oldname and newname and oldname ~= "" and newname ~= "" then
if not file.needs_updating(oldname,newname) then
if e_verbose then
report("file '%s' and '%s' have same age",oldname,newname)
end
return "skip"
elseif e_verbose then
report("file '%s' is older than '%s'",oldname,newname)
end
end
end
local runpath = environment.argument("path")
if type(runpath) == "string" and not lfs.chdir(runpath) then
report("unable to change to path '%s'",runpath)
return "error"
end
runners.prepare = function() end
return "run"
end
function runners.execute_script(fullname,internal,nosplit)
local noquote = environment.argument("noquotes")
if fullname and fullname ~= "" then
local state = runners.prepare()
if state == 'error' then
return false
elseif state == 'skip' then
return true
elseif state == "run" then
local path, name, suffix, result = file.dirname(fullname), file.basename(fullname), file.extname(fullname), ""
if path ~= "" then
result = fullname
elseif name then
name = name:gsub("^int[%a]*:",function()
internal = true
return ""
end )
name = name:gsub("^script:","")
if suffix == "" and runners.registered[name] and runners.registered[name][1] then
name = runners.registered[name][1]
suffix = file.extname(name)
end
if suffix == "" then
-- loop over known suffixes
for _,s in pairs(runners.suffixes) do
result = resolvers.findfile(name .. "." .. s, 'texmfscripts')
if result ~= "" then
break
end
end
elseif runners.applications[suffix] then
result = resolvers.findfile(name, 'texmfscripts')
else
-- maybe look on path
result = resolvers.findfile(name, 'other text files')
end
end
if result and result ~= "" then
if not no_split then
local before, after = environment.splitarguments(fullname) -- already done
environment.arguments_before, environment.arguments_after = before, after
end
if internal then
arg = { } for _,v in pairs(environment.arguments_after) do arg[#arg+1] = v end
environment.ownscript = result
dofile(result)
else
local binary = runners.applications[file.extname(result)]
result = string.quoted(string.unquoted(result))
-- if string.match(result,' ') and not string.match(result,"^\".*\"$") then
-- result = '"' .. result .. '"'
-- end
if binary and binary ~= "" then
result = binary .. " " .. result
end
local command = result .. " " .. environment.reconstructcommandline(environment.arguments_after,noquote)
if e_verbose then
report()
report("executing: %s",command)
report()
report()
io.flush()
end
-- no os.exec because otherwise we get the wrong return value
local code = os.execute(command) -- maybe spawn
if code == 0 then
return true
else
if binary then
binary = file.addsuffix(binary,os.binsuffix)
for p in gmatch(os.getenv("PATH"),"[^"..io.pathseparator.."]+") do
if lfs.isfile(file.join(p,binary)) then
return false
end
end
report()
report("This script needs '%s' which seems not to be installed.",binary)
report()
end
return false
end
end
end
end
end
return false
end
function runners.execute_program(fullname)
local noquote = environment.argument("noquotes")
if fullname and fullname ~= "" then
local state = runners.prepare()
if state == 'error' then
return false
elseif state == 'skip' then
return true
elseif state == "run" then
local before, after = environment.splitarguments(fullname)
for k=1,#after do after[k] = resolvers.resolve(after[k]) end
environment.initializearguments(after)
fullname = fullname:gsub("^bin:","")
local command = fullname .. " " .. (environment.reconstructcommandline(after or "",noquote) or "")
report()
report("executing: %s",command)
report()
report()
io.flush()
local code = os.exec(command) -- (fullname,unpack(after)) does not work / maybe spawn
return code == 0
end
end
return false
end
-- the --usekpse flag will fallback (not default) on kpse (hm, we can better update mtx-stubs)
local windows_stub = '@echo off\013\010setlocal\013\010set ownpath=%%~dp0%%\013\010texlua "%%ownpath%%mtxrun.lua" --usekpse --execute %s %%*\013\010endlocal\013\010'
local unix_stub = '#!/bin/sh\010mtxrun --usekpse --execute %s \"$@\"\010'
function runners.handle_stubs(create)
local stubpath = environment.argument('stubpath') or '.' -- 'auto' no longer subpathssupported
local windows = environment.argument('windows') or environment.argument('mswin') or false
local unix = environment.argument('unix') or environment.argument('linux') or false
if not windows and not unix then
if os.platform == "unix" then
unix = true
else
windows = true
end
end
for _,v in pairs(runners.registered) do
local name, doit = v[1], v[2]
if doit then
local base = gsub(file.basename(name), "%.(.-)$", "")
if create then
if windows then
io.savedata(file.join(stubpath,base..".bat"),format(windows_stub,name))
report("windows stub for '%s' created",base)
end
if unix then
io.savedata(file.join(stubpath,base),format(unix_stub,name))
report("unix stub for '%s' created",base)
end
else
if windows and (os.remove(file.join(stubpath,base..'.bat')) or os.remove(file.join(stubpath,base..'.cmd'))) then
report("windows stub for '%s' removed", base)
end
if unix and (os.remove(file.join(stubpath,base)) or os.remove(file.join(stubpath,base..'.sh'))) then
report("unix stub for '%s' removed",base)
end
end
end
end
end
function runners.resolve_string(filename)
if filename and filename ~= "" then
runners.report_location(resolvers.resolve(filename))
end
end
-- differs from texmfstart where locate appends .com .exe .bat ... todo
function runners.locate_file(filename) -- was given file but only searches in tree
if filename and filename ~= "" then
if environment.argument("first") then
runners.report_location(resolvers.findfile(filename))
-- resolvers.dowithfilesandreport(resolvers.findfile,filename)
elseif environment.argument("all") then
local result, status = resolvers.findfiles(filename)
if status and environment.argument("detail") then
runners.report_location(status)
else
runners.report_location(result)
end
else
runners.report_location(resolvers.findgivenfile(filename))
-- resolvers.dowithfilesandreport(resolvers.findgivenfile,filename)
end
end
end
function runners.locate_platform()
runners.report_location(os.platform)
end
function runners.report_location(result)
if type(result) == "table" then
for i=1,#result do
if i > 1 then
io.write("\n")
end
io.write(result[i])
end
else
io.write(result)
end
end
function runners.edit_script(filename) -- we assume that gvim is present on most systems (todo: also in cnf file)
local editor = os.getenv("MTXRUN_EDITOR") or os.getenv("TEXMFSTART_EDITOR") or os.getenv("EDITOR") or 'gvim'
local rest = resolvers.resolve(filename)
if rest ~= "" then
local command = editor .. " " .. rest
if e_verbose then
report()
report("starting editor: %s",command)
report()
report()
end
os.launch(command)
end
end
function runners.save_script_session(filename, list)
local t = { }
for i=1,#list do
local key = list[i]
t[key] = environment.arguments[key]
end
io.savedata(filename,table.serialize(t,true))
end
function runners.load_script_session(filename)
if lfs.isfile(filename) then
local t = io.loaddata(filename)
if t then
t = loadstring(t)
if t then t = t() end
for key, value in pairs(t) do
environment.arguments[key] = value
end
end
end
end
function resolvers.launch(str)
-- maybe we also need to test on mtxrun.launcher.suffix environment
-- variable or on windows consult the assoc and ftype vars and such
local launchers = runners.launchers[os.platform] if launchers then
local suffix = file.extname(str) if suffix then
local runner = launchers[suffix] if runner then
str = runner .. " " .. str
end
end
end
os.launch(str)
end
function runners.launch_file(filename)
trackers.enable("resolvers.locating")
local allresults = environment.arguments["all"]
local pattern = environment.arguments["pattern"]
if not pattern or pattern == "" then
pattern = filename
end
if not pattern or pattern == "" then
report("provide name or --pattern=")
else
local t = resolvers.findfiles(pattern,nil,allresults)
if not t or #t == 0 then
t = resolvers.findfiles("*/" .. pattern,nil,allresults)
end
if not t or #t == 0 then
t = resolvers.findfiles("*/" .. pattern .. "*",nil,allresults)
end
if t and #t > 0 then
if allresults then
for _, v in pairs(t) do
report("launching %s", v)
resolvers.launch(v)
end
else
report("launching %s", t[1])
resolvers.launch(t[1])
end
else
report("no match for %s", pattern)
end
end
end
function runners.find_mtx_script(filename)
local function found(name)
local path = file.dirname(name)
if path and path ~= "" then
return false
else
local fullname = own and own.path and file.join(own.path,name)
return io.exists(fullname) and fullname
end
end
filename = file.addsuffix(filename,"lua")
local basename = file.removesuffix(file.basename(filename))
local suffix = file.extname(filename)
-- qualified path, raw name
local fullname = file.is_qualified_path(filename) and io.exists(filename) and filename
if fullname and fullname ~= "" then
return fullname
end
-- current path, raw name
fullname = "./" .. filename
fullname = io.exists(fullname) and fullname
if fullname and fullname ~= "" then
return fullname
end
-- mtx- prefix checking
local mtxprefix = (filename:find("^mtx%-") and "") or "mtx-"
-- context namespace, mtx-<filename>
fullname = mtxprefix .. filename
fullname = found(fullname) or resolvers.findfile(fullname)
if fullname and fullname ~= "" then
return fullname
end
-- context namespace, mtx-<filename>s
fullname = mtxprefix .. basename .. "s" .. "." .. suffix
fullname = found(fullname) or resolvers.findfile(fullname)
if fullname and fullname ~= "" then
return fullname
end
-- context namespace, mtx-<filename minus trailing s>
fullname = mtxprefix .. basename:gsub("s$","") .. "." .. suffix
fullname = found(fullname) or resolvers.findfile(fullname)
if fullname and fullname ~= "" then
return fullname
end
-- context namespace, just <filename>
fullname = resolvers.findfile(filename)
return fullname
end
function runners.register_arguments(...)
local arguments = environment.arguments_after
local passedon = { ... }
for i=#passedon,1,-1 do
local pi = passedon[i]
if pi then
table.insert(arguments,1,pi)
end
end
end
function runners.execute_ctx_script(filename,...)
runners.register_arguments(...)
local arguments = environment.arguments_after
local fullname = runners.find_mtx_script(filename) or ""
if file.extname(fullname) == "cld" then
-- handy in editors where we force --autopdf
report("running cld script: %s",filename)
table.insert(arguments,1,fullname)
table.insert(arguments,"--autopdf")
fullname = runners.find_mtx_script("context") or ""
end
-- retry after generate but only if --autogenerate
if fullname == "" and environment.argument("autogenerate") then -- might become the default
instance.renewcache = true
trackers.enable("resolvers.locating")
resolvers.load()
--
fullname = runners.find_mtx_script(filename) or ""
end
-- that should do it
if fullname ~= "" then
local state = runners.prepare()
if state == 'error' then
return false
elseif state == 'skip' then
return true
elseif state == "run" then
-- load and save ... kind of undocumented
arg = { } for _,v in pairs(arguments) do arg[#arg+1] = resolvers.resolve(v) end
environment.initializearguments(arg)
local loadname = environment.arguments['load']
if loadname then
if type(loadname) ~= "string" then loadname = file.basename(fullname) end
loadname = file.replacesuffix(loadname,"cfg")
runners.load_script_session(loadname)
end
filename = environment.files[1]
if e_verbose then
report("using script: %s\n",fullname)
end
environment.ownscript = fullname
dofile(fullname)
local savename = environment.arguments['save']
if savename then
local save_list = runners.save_list
if save_list and next(save_list) then
if type(savename) ~= "string" then savename = file.basename(fullname) end
savename = file.replacesuffix(savename,"cfg")
runners.save_script_session(savename,save_list)
end
end
return true
end
else
if filename == "" or filename == "help" then
local context = resolvers.findfile("mtx-context.lua")
trackers.enable("resolvers.locating")
if context ~= "" then
local result = dir.glob((gsub(context,"mtx%-context","mtx-*"))) -- () needed
local valid = { }
table.sort(result)
for i=1,#result do
local scriptname = result[i]
local scriptbase = match(scriptname,".*mtx%-([^%-]-)%.lua")
if scriptbase then
local data = io.loaddata(scriptname)
local banner, version = match(data,"[\n\r]logs%.extendbanner%s*%(%s*[\"\']([^\n\r]+)%s*(%d+%.%d+)")
if banner then
valid[#valid+1] = { scriptbase, version, banner }
end
end
end
if #valid > 0 then
application.identify()
report("no script name given, known scripts:")
report()
for k=1,#valid do
local v = valid[k]
report("%-12s %4s %s",v[1],v[2],v[3])
end
end
else
report("no script name given")
end
else
filename = file.addsuffix(filename,"lua")
if file.is_qualified_path(filename) then
report("unknown script '%s'",filename)
else
report("unknown script '%s' or 'mtx-%s'",filename,filename)
end
end
return false
end
end
function runners.prefixes()
application.identify()
report()
report(concat(resolvers.allprefixes(true)," "))
end
function runners.timedrun(filename) -- just for me
if filename and filename ~= "" then
runners.timed(function() os.execute(filename) end)
end
end
function runners.timed(action)
statistics.timed(action)
end
-- this is a bit dirty ... first we store the first filename and next we
-- split the arguments so that we only see the ones meant for this script
-- ... later we will use the second half
local filename = environment.files[1] or ""
local ok = true
local before, after = environment.splitarguments(filename)
environment.arguments_before, environment.arguments_after = before, after
environment.initializearguments(before)
instance.lsrmode = environment.argument("lsr") or false
-- maybe the unset has to go to this level
local is_mkii_stub = runners.registered[file.removesuffix(file.basename(filename))]
local e_argument = environment.argument
if e_argument("usekpse") or e_argument("forcekpse") or is_mkii_stub then
resolvers.load_tree(e_argument('tree'),true) -- force resolve of TEXMFCNF
os.setenv("engine","")
os.setenv("progname","")
local remapper = {
otf = "opentype fonts",
ttf = "truetype fonts",
ttc = "truetype fonts",
pfb = "type1 fonts",
other = "other text files",
}
local progname = e_argument("progname") or 'context'
local function kpse_initialized()
texconfig.kpse_init = true
local t = os.clock()
local k = kpse.original.new("luatex",progname)
local dummy = k:find_file("mtxrun.lua") -- so that we're initialized
report("kpse fallback with progname '%s' initialized in %s seconds",progname,os.clock()-t)
kpse_initialized = function() return k end
return k
end
local findfile = resolvers.findfile
local showpath = resolvers.showpath
if e_argument("forcekpse") then
function resolvers.findfile(name,kind)
return (kpse_initialized():find_file(resolvers.cleanpath(name),(kind ~= "" and (remapper[kind] or kind)) or "tex") or "") or ""
end
function resolvers.showpath(name)
return (kpse_initialized():show_path(name)) or ""
end
elseif e_argument("usekpse") or is_mkii_stub then
resolvers.load()
function resolvers.findfile(name,kind)
local found = findfile(name,kind) or ""
if found ~= "" then
return found
else
return (kpse_initialized():find_file(resolvers.cleanpath(name),(kind ~= "" and (remapper[kind] or kind)) or "tex") or "") or ""
end
end
function resolvers.showpath(name)
local found = showpath(name) or ""
if found ~= "" then
return found
else
return (kpse_initialized():show_path(name)) or ""
end
end
end
function runners.loadbase()
end
else
function runners.loadbase(...)
if not resolvers.load(...) then
report("forcing cache reload")
instance.renewcache = true
trackers.enable("resolvers.locating")
if not resolvers.load(...) then
report("the resolver databases are not present or outdated")
end
end
end
resolvers.load_tree(e_argument('tree'),e_argument("resolve"))
end
if e_argument("selfmerge") then
-- embed used libraries
runners.loadbase()
local found = locate_libs()
if found then
utilities.merger.selfmerge(own.name,own.libs,{ found })
end
elseif e_argument("selfclean") then
-- remove embedded libraries
runners.loadbase()
utilities.merger.selfclean(own.name)
elseif e_argument("selfupdate") then
runners.loadbase()
trackers.enable("resolvers.locating")
resolvers.updatescript(own.name,"mtxrun")
elseif e_argument("ctxlua") or e_argument("internal") then
-- run a script by loading it (using libs)
runners.loadbase()
ok = runners.execute_script(filename,true)
elseif e_argument("script") or e_argument("scripts") then
-- run a script by loading it (using libs), pass args
runners.loadbase()
if is_mkii_stub then
ok = runners.execute_script(filename,false,true)
else
ok = runners.execute_ctx_script(filename)
end
elseif e_argument("execute") then
-- execute script
runners.loadbase()
ok = runners.execute_script(filename)
elseif e_argument("direct") then
-- equals bin:
runners.loadbase()
ok = runners.execute_program(filename)
elseif e_argument("edit") then
-- edit file
runners.loadbase()
runners.edit_script(filename)
elseif e_argument("launch") then
runners.loadbase()
runners.launch_file(filename)
elseif e_argument("makestubs") then
-- make stubs (depricated)
runners.handle_stubs(true)
elseif e_argument("removestubs") then
-- remove stub (depricated)
runners.loadbase()
runners.handle_stubs(false)
elseif e_argument("resolve") then
-- resolve string
runners.loadbase()
runners.resolve_string(filename)
elseif e_argument("locate") then
-- locate file (only database)
runners.loadbase()
runners.locate_file(filename)
elseif e_argument("platform") or e_argument("show-platform") then
-- locate platform
runners.loadbase()
runners.locate_platform()
elseif e_argument("prefixes") then
runners.loadbase()
runners.prefixes()
elseif e_argument("timedrun") then
-- locate platform
runners.loadbase()
runners.timedrun(filename)
elseif e_argument("variables") or e_argument("show-variables") or e_argument("expansions") or e_argument("show-expansions") then
-- luatools: runners.execute_ctx_script("mtx-base","--expansions",filename)
resolvers.load("nofiles")
resolvers.listers.variables(e_argument("pattern"))
elseif e_argument("configurations") or e_argument("show-configurations") then
-- luatools: runners.execute_ctx_script("mtx-base","--configurations",filename)
resolvers.load("nofiles")
resolvers.listers.configurations()
elseif e_argument("find-file") then
-- luatools: runners.execute_ctx_script("mtx-base","--find-file",filename)
resolvers.load()
local e_all = e_argument("all")
local e_pattern = e_argument("pattern")
local e_format = e_argument("format")
local finder = e_all and resolvers.findfiles or resolvers.findfile
if not e_pattern then
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(finder,environment.files,e_format)
elseif type(e_pattern) == "string" then
resolvers.dowithfilesandreport(finder,{ e_pattern },e_format)
end
elseif e_argument("find-path") then
-- luatools: runners.execute_ctx_script("mtx-base","--find-path",filename)
resolvers.load()
local path = resolvers.findpath(filename, instance.my_format)
if e_verbose then
report(path)
else
print(path)
end
elseif e_argument("expand-braces") then
-- luatools: runners.execute_ctx_script("mtx-base","--expand-braces",filename)
resolvers.load("nofiles")
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(resolvers.expandbraces, environment.files)
elseif e_argument("expand-path") then
-- luatools: runners.execute_ctx_script("mtx-base","--expand-path",filename)
resolvers.load("nofiles")
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(resolvers.expandpath, environment.files)
elseif e_argument("expand-var") or e_argument("expand-variable") then
-- luatools: runners.execute_ctx_script("mtx-base","--expand-var",filename)
resolvers.load("nofiles")
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(resolvers.expansion, environment.files)
elseif e_argument("show-path") or e_argument("path-value") then
-- luatools: runners.execute_ctx_script("mtx-base","--show-path",filename)
resolvers.load("nofiles")
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(resolvers.showpath, environment.files)
elseif e_argument("var-value") or e_argument("show-value") then
-- luatools: runners.execute_ctx_script("mtx-base","--show-value",filename)
resolvers.load("nofiles")
runners.register_arguments(filename)
environment.initializearguments(environment.arguments_after)
resolvers.dowithfilesandreport(resolvers.variable,environment.files)
elseif e_argument("format-path") then
-- luatools: runners.execute_ctx_script("mtx-base","--format-path",filename)
resolvers.load()
report(caches.getwritablepath("format"))
elseif e_argument("pattern") then
-- luatools
runners.execute_ctx_script("mtx-base","--pattern='" .. e_argument("pattern") .. "'",filename)
elseif e_argument("generate") then
-- luatools
instance.renewcache = true
trackers.enable("resolvers.locating")
resolvers.load()
e_verbose = true
elseif e_argument("make") or e_argument("ini") or e_argument("compile") then
-- luatools: runners.execute_ctx_script("mtx-base","--make",filename)
resolvers.load()
trackers.enable("resolvers.locating")
environment.make_format(filename)
elseif e_argument("run") then
-- luatools
runners.execute_ctx_script("mtx-base","--run",filename)
elseif e_argument("fmt") then
-- luatools
runners.execute_ctx_script("mtx-base","--fmt",filename)
elseif e_argument("help") and filename=='base' then
-- luatools
runners.execute_ctx_script("mtx-base","--help")
elseif e_argument("help") or filename=='help' or filename == "" then
application.help()
elseif filename:find("^bin:") then
runners.loadbase()
ok = runners.execute_program(filename)
elseif is_mkii_stub then
-- execute mkii script
runners.loadbase()
ok = runners.execute_script(filename,false,true)
elseif false then
runners.loadbase()
ok = runners.execute_ctx_script(filename)
if not ok then
ok = runners.execute_script(filename)
end
elseif environment.files[1] == 'texmfcnf.lua' then -- so that we don't need to load mtx-base
resolvers.load("nofiles")
resolvers.listers.configurations()
else
runners.loadbase()
runners.execute_ctx_script("mtx-base",filename)
end
if e_verbose then
report()
report("runtime: %0.3f seconds",os.runtime())
end
if os.type ~= "windows" then
texio.write("\n") -- is this still valid?
end
if ok == false then ok = 1 elseif ok == true then ok = 0 end
os.exit(ok)
|