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
|
% \iffalse meta-comment
%
% File: siunitx-number.dtx Copyright (C) 2014-2019,2021-2023 Joseph Wright
%
% It may be distributed and/or modified under the conditions of the
% LaTeX Project Public License (LPPL), either version 1.3c of this
% license or (at your option) any later version. The latest version
% of this license is in the file
%
% https://www.latex-project.org/lppl.txt
%
% This file is part of the "siunitx bundle" (The Work in LPPL)
% and all files in that bundle must be distributed together.
%
% The released version of this bundle is available from CTAN.
%
% -----------------------------------------------------------------------
%
% The development version of the bundle can be found at
%
% https://github.com/josephwright/siunitx
%
% for those people who are interested.
%
% -----------------------------------------------------------------------
%
%<*driver>
\documentclass{l3doc}
% Additional commands needed in this source
\ProvideDocumentCommand\email{m}{\href{mailto:#1}{\nolinkurl{#1}}}
\ProvideDocumentCommand\foreign{m}{\textit{#1}}
% The next line is needed so that \GetFileInfo will be able to pick up
% version data
\usepackage{siunitx}
\begin{document}
\DocInput{\jobname.dtx}
\end{document}
%</driver>
% \fi
%
% \GetFileInfo{siunitx.sty}
%
% \title{^^A
% \pkg{siunitx-number} -- Parsing and formatting numbers^^A
% \thanks{This file describes \fileversion,
% last revised \filedate.}^^A
% }
%
% \author{^^A
% Joseph Wright^^A
% \thanks{^^A
% E-mail:
% \email{joseph.wright@morningstar2.co.uk}^^A
% }^^A
% }
%
% \date{Released \filedate}
%
% \maketitle
%
% \begin{documentation}
%
% This submodule is dedicated to parsing and formatting numbers. A small number
% of \LaTeXe{} math mode commands are assumed to be available as part of the
% formatted output. The sign commands \cs{mp}, \cs{pm}, \cs{ll}, \cs{le},
% \cs{gg} and \cs{ge} are used to replace two-character input; \cs{pm}
% is also required for the output of uncertainties. The standard settings
% require \cs{times}. For the display of colored negative numbers, the command
% \cs{color} is assumed to be available. Where the latter may apply, numbers
% should be printed inside a group: note that \TeX{} grouping is not added
% \emph{within} formatted numbers as they may need to be decomposed into parts
% (see \cs{siunitx_number_output:NN}). Such a color will be the \emph{first}
% part of the result, meaning that a test for an initial |\color| and following
% brace group may be used to detect/remove/adjust this part.
%
% \section{Formatting numbers}
%
% \begin{function}{\siunitx_number_parse:nN, \siunitx_number_parse:VN}
% \begin{syntax}
% \cs{siunitx_number_parse:nN} \Arg{number} \meta{tl~var}
% \end{syntax}
% Parses the \emph{number} and stores the resulting internal representation
% in the \meta{tl~var}. The parsing is influenced by the various key--value
% settings for numerical input. The \meta{number} should comprise a single
% real value, possibly with comparator, uncertainty and exponent parts.
% If the number is invalid, or if number parsing is disabled, the result will
% be an entirely empty \meta{tl~var}.
%
% The structure of a valid number is:
% \begin{quote}
% \marg{comparator}\marg{sign}\marg{integer}\marg{decimal}
% \marg{uncertainty}\\
% \marg{exponent sign}\marg{exponent}
% \end{quote}
% where the two sign parts must be single tokens if present,
% and all other components
% must be given in braces. The number will have at least one digit for either the
% \meta{integer} and \meta{exponent} parts.. The
% \meta{uncertainty} part should either be blank or contain an
% \meta{identifier} (as a brace group), followed by one or more data entries.
% Valid uncertainty \meta{identifiers} currently are
% \begin{itemize}
% \item[\texttt{S}] A single symmetrical uncertainty (\foreign{e.g.}~a
% statistical standard uncertainty). The data item here is a single
% value representing the uncertainty in the least-significant digits.
% \item[\texttt{A}] A single unsymmetrical uncertainty. The data item here
% contains two brace groups, each using the same least-significant digit
% approach as the \texttt{S} type. The positive component is given first
% and the negative second, and neither has a sign.
% \item A combination of \texttt{S} and \texttt{A} entries, with one data
% item per entry. These are then iterated over to be output in order.
% \end{itemize}
% If a decimal marker should be explicitly recorded as present for a value
% with no decimal digits, the \meta{decimal} part should contain
% \cs{empty}.
% \end{function}
%
% \begin{function}{\siunitx_number_process:NN, \siunitx_number_process:cc}
% \begin{syntax}
% \cs{siunitx_number_process:N} \meta{tl~var1} \meta{tl~var2}
% \end{syntax}
% Applies a set of number processing operations to the \meta{internal
% number} stored in the \meta{tl~var1}, \foreign{viz.}~in order
% \begin{enumerate}
% \item Dropping uncertainty
% \item Converting to scientific mode (or similar)
% \item Rounding
% \item Dropping zero decimal part
% \item Forcing a minimum number of digits
% \end{enumerate}
% with the result stored in \meta{tl~var2}.
% \end{function}
%
% \begin{function}[EXP]
% {
% \siunitx_number_output:N, \siunitx_number_output:c
% \siunitx_number_output:n,
% \siunitx_number_output:NN, \siunitx_number_output:cN
% \siunitx_number_output:nN
% }
% \begin{syntax}
% \cs{siunitx_number_output:N} \meta{number}
% \cs{siunitx_number_output:NN} \meta{number} \meta{marker}
% \end{syntax}
% Formats the \meta{number} (in the \pkg{siunitx} internal format),
% producing the result in a form suitable for typesetting in math mode.
% The details for the formatting are controlled by a number of key--value
% options. Note that \emph{formatting} does not apply any manipulation
% (processing) to the number. This function is usable in an \texttt{e}-
% or \texttt{x}-type expansion, and further uncontrolled expansion is
% prevented by appropriate use of |\exp_not:n| internally.
%
% In the \texttt{NN} version, the \meta{marker} token is inserted at each
% possible alignment position in the output, \foreign{viz.}
% \begin{itemize}
% \item Between the comparator and the integer (\emph{before} any
% sign for the integer)
% \item Between the sign and the first digit of the integer
% \item Both sides of the decimal marker
% \item Both sides of the separated uncertainty sign (\foreign{i.e.}~after
% the decimal part and before any integer uncertainty part)
% \item Both sides of the decimal marker for a separated uncertainty
% \item Both sides of the multiplication symbol for the exponent part.
% \end{itemize}
%
% The \texttt{n} and \texttt{nN} version take a token list, which should
% be in the internal \pkg{siunitx} format.
% \end{function}
%
% \begin{function}{\siunitx_number_format:nN}
% \begin{syntax}
% \cs{siunitx_number_format:nN} \Arg{number} \meta{tl~var}
% \end{syntax}
% Carries out a combination of \cs{siunitx_number_parse:nN},
% \cs{siunitx_number_process:NN} and \cs{siunitx_number_output:N} using
% \texttt{x}-type expansion to place the result in the \meta{tl~var}. If
% \cs{l_siunitx_number_parse_bool} if \texttt{false}, the input is simply
% stored inside the \meta{tl~var} inside \cs{ensuremath}.
% \end{function}
%
% \begin{function}[EXP]
% {
% \siunitx_number_adjust_exponent:Nn ,
% \siunitx_number_adjust_exponent:nn ,
% \siunitx_number_adjust_exponent:Vn
% }
% \begin{syntax}
% \cs{siunitx_number_adjust_exponent:Nn} \meta{number} \Arg{fp~expr}
% \end{syntax}
% Adjusts the exponent of the \meta{number} (in internal format) by the
% \meta{fp~expr} and leaves the result in the input stream.
% \end{function}
%
% \begin{function}{\siunitx_number_normalize_symbols:N}
% \begin{syntax}
% \cs{siunitx_number_normalize_symbols:N} \meta{tl~var}
% \end{syntax}
% Replaces all multi-token signs and comparators in the \meta{tl~var}
% with their single-token equivalents. Replaces any active hyphen tokens
% with non-active versions.
% \end{function}
%
% \begin{function}[pTF, EXP]{\siunitx_if_number:n}
% \begin{syntax}
% \cs{siunitx_if_number_token:NTF} \Arg{tokens}
% \Arg{true code} \Arg{false code}
% \end{syntax}
% Determines if the \meta{tokens} form a valid number which can be fully
% parsed by \pkg{siunitx}.
% \end{function}
%
% \begin{function}[TF]{\siunitx_if_number_token:N}
% \begin{syntax}
% \cs{siunitx_if_number_token:NTF} \Arg{token}
% \Arg{true code} \Arg{false code}
% \end{syntax}
% Determines if the \meta{token} is valid in a number based on those
% tokens currently set up for detection in a number.
% \end{function}
%
% \begin{variable}{\l_siunitx_bracket_ambiguous_bool}
% A switch to control whether ambiguous numbers are bracketed: this can
% also be covered in quantity formatting by a setting there.
% \end{variable}
%
% \begin{variable}{\l_siunitx_number_parse_bool}
% A switch to control whether any parsing is attempted for numbers.
% \end{variable}
%
% \begin{variable}
% {
% \l_siunitx_number_comparator_tl ,
% \l_siunitx_number_exponent_tl ,
% \l_siunitx_number_sign_tl
% }
% The list of possible input comparators, exponent markers and signs.
% \end{variable}
%
% \begin{variable}
% {\l_siunitx_number_input_decimal_tl, \l_siunitx_number_output_decimal_tl}
% The list of possible input decimal marker(s), and the output marker.
% \end{variable}
%
% \subsection{Key--value options}
%
% The options defined by this submodule are available within the \pkg{l3keys}
% |siunitx| tree.
%
% \begin{function}{bracket-ambiguous-numbers}
% \begin{syntax}
% |bracket-ambiguous-numbers| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{bracket-negative-numbers}
% \begin{syntax}
% |bracket-negative-numbers| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{drop-exponent}
% \begin{syntax}
% |drop-exponent| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{drop-uncertainty}
% \begin{syntax}
% |drop-uncertainty| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{drop-zero-decimal}
% \begin{syntax}
% |drop-zero-decimal| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{evaluate-expression}
% \begin{syntax}
% |evaluate-expression| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{exponent-base}
% \begin{syntax}
% |exponent-base| = \meta{base}
% \end{syntax}
% \end{function}
%
% \begin{function}{exponent-mode}
% \begin{syntax}
% |exponent-mode| = |engineering|\verb"|"|fixed|\verb"|"|input|\verb"|"|scientific|\verb"|"|threshold|
% \end{syntax}
% Choice which determines whether numbers are converted to exponent form. The
% option |engineering| forces exponent form with an exponent which is the
% smallest power of three which gives a mantissa with an integer part. The
% option |fixed| uses a fixed exponent (set in |fixed-exponent|). The
% option |input| leaves the input unchanged (which will therefore produce an
% exponent only if the input contained one). The choice |scientific| gives
% an exponent with the mantissa~$m$ in the range $1 \le m < 10$. Finally,
% the option |threshold| will apply |scientific| if the exponent of input
% is outside of the range stored in |exponent-thresholds|. The standard
% setting is |input|.
% \end{function}
%
% \begin{function}{exponent-product}
% \begin{syntax}
% |exponent-product| = \meta{symbol}
% \end{syntax}
% \end{function}
%
% \begin{function}{expression}
% \begin{syntax}
% |expression| = \meta{expression}
% \end{syntax}
% \end{function}
%
% \begin{function}{fixed-exponent}
% \begin{syntax}
% |fixed-exponent| = \meta{exponent}
% \end{syntax}
% \end{function}
%
% \begin{function}
% {digit-group-size, digit-group-first-size, digit-group-other-size}
% \begin{syntax}
% |digit-group-number| = \meta{integer}
% \end{syntax}
% Sets the size of the block (the number of digits) used when grouping
% digits. The option |digit-group-first-size| applies to the first grouping,
% \foreign{i.e.}~immediately next to the decimal marker, while
% |digit-group-other-size| applies to all other groups. Both can be set
% using |digit-group-size|. The standard setting for both options is $3$.
% \end{function}
%
% \begin{function}{group-digits}
% \begin{syntax}
% |group-digits| = |all|\verb"|"|decimal|\verb"|"|integer|\verb"|"|none|
% \end{syntax}
% Choice to specify whether digits in a number are grouped. The option |none|
% entirely disables this, while |all| means that both the integer and decimal
% parts are grouped. The settings |integer| and |decimal| activate grouping
% for the relevant part only. The standard setting is |all|.
% \end{function}
%
% \begin{function}{group-minimum-digits}
% \begin{syntax}
% |group-minimum-digits| = \meta{value}
% \end{syntax}
% The number of digits that must be present in a numerical part (integer or
% decimal) before digit grouping is attempted. The standard setting is $4$.
% \end{function}
%
% \begin{function}{group-separator}
% \begin{syntax}
% |group-separator| = \meta{symbol}
% \end{syntax}
% Sets the symbol inserted between groups of digits. The standard setting is
% a thin space (\cs{,}).
% \end{function}
%
% \begin{function}{input-close-uncertainty}
% \begin{syntax}
% |input-close-uncertainty| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-comparators}
% \begin{syntax}
% |input-comparators| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-close-uncertainty}
% \begin{syntax}
% |input-close-uncertainty| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-decimal-markers}
% \begin{syntax}
% |input-decimal-markers| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-digits}
% \begin{syntax}
% |input-digits| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-exponent-markers}
% \begin{syntax}
% |input-exponent-markers| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-open-uncertainty}
% \begin{syntax}
% |input-open-uncertainty| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-signs}
% \begin{syntax}
% |input-signs| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-uncertainty-signs}
% \begin{syntax}
% |input-uncertainty-signs| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{input-uncertainty-divider}
% \begin{syntax}
% |input-uncertainty-divider| = \meta{tokens}
% \end{syntax}
% \end{function}
%
% \begin{function}{minimum-decimal-digits}
% \begin{syntax}
% |minimum-decimal-digits| = \meta{min}
% \end{syntax}
% \end{function}
%
% \begin{function}{minimum-integer-digits}
% \begin{syntax}
% |minimum-integer-digits| = \meta{min}
% \end{syntax}
% \end{function}
%
% \begin{function}{negative-color}
% \begin{syntax}
% |negative-color| = \meta{color}
% \end{syntax}
% \end{function}
%
% \begin{function}{output-close-uncertainty}
% \begin{syntax}
% |output-close-uncertainty| = \meta{symbol}
% \end{syntax}
% \end{function}
%
% \begin{function}{output-decimal-marker}
% \begin{syntax}
% |output-decimal-marker| = \meta{symbol}
% \end{syntax}
% \end{function}
%
% \begin{function}{output-open-uncertainty}
% \begin{syntax}
% |output-open-uncertainty| = \meta{symbol}
% \end{syntax}
% \end{function}
%
% \begin{function}{parse-numbers}
% \begin{syntax}
% |parse-numbers| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}
% {
% print-implicit-plus ,
% print-mantissa-implicit-plus ,
% print-exponent-implicit-plus
% }
% \begin{syntax}
% |print-implicit-plus| = |true|\verb"|"|false|
% |print-mantissa-implicit-plus| = |true|\verb"|"|false|
% |print-exponent-implicit-plus| = |true|\verb"|"|false|
% \end{syntax}
% Controls whether the plus sign implicit in a positive number is printed;
% this can be controlled at the level of the mantissa or exponent, or
% can be activated for both.
% \end{function}
%
% \begin{function}{print-unity-mantissa}
% \begin{syntax}
% |print-unity-mantissa| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{print-zero-exponent}
% \begin{syntax}
% |print-zero-exponent| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{print-zero-integer}
% \begin{syntax}
% |print-zero-integer| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{retain-explicit-plus}
% \begin{syntax}
% |retain-explicit-plus| = |true|\verb"|"|false|
% \end{syntax}
% Switch which determines if an explicit |+| is retained as a sign when
% parsing. The standard setting is |false|.
% \end{function}
%
% \begin{function}{retain-explicit-decimal-marker}
% \begin{syntax}
% |retain-explicit-decimal-marker| = |true|\verb"|"|false|
% \end{syntax}
% Switch which determines if an explicit decimal marker is retained when
% parsing a number where there is no decimal part to a number
% (\foreign{i.e.}~whether to differentiate |10| and |10.|). The standard
% setting is |false|.
% \end{function}
%
% \begin{function}{retain-negative-zero}
% \begin{syntax}
% |retain-negative-zero| = |true|\verb"|"|false|
% \end{syntax}
% Switch which determines if a negative sign is retained where the value of
% a parsed number is exactly zero. The standard setting is |false|.
% \end{function}
%
% \begin{function}{retain-zero-uncertainty}
% \begin{syntax}
% |retain-zero-uncertainty| = |true|\verb"|"|false|
% \end{syntax}
% Switch which determines if an entirely zero uncertainty part is retained
% on parsing, or whether this is normalised to remove the uncertainty.
% The standard setting is |false|.
% \end{function}
%
% \begin{function}{round-direction}
% \begin{syntax}
% |round-direction| = |down|\verb"|"|nearest|\verb"|"|up|
% \end{syntax}
% Choice which determines how values values are rounded. The setting
% |up| means that the value is always rounded away from zero, whereas the
% setting |down| means that the value will be rounded toward zero. The
% setting |nearest| means that the value will be rounded to the nearest
% (either up or down), taking account of the setting of |round-half|.
% The standard setting is |nearest|.
% \end{function}
%
% \begin{function}{round-half}
% \begin{syntax}
% |round-half| = |even|\verb"|"|up|
% \end{syntax}
% Choice which determines how values of exactly half are rounded. The setting
% |up| means that the value is always rounded away from zero, whereas the
% setting |even| means that the value will be rounded to the closes even
% number. The standard setting is |up|.
% \end{function}
%
% \begin{function}{round-minimum}
% \begin{syntax}
% |round-minimum| = \meta{min}
% \end{syntax}
% Literal which sets a minimum value below which rounded values will be
% replaced by this value and a |>| or |<|, as appropriate for the sign of
% the value. The standard setting is empty, \foreign{i.e.}~there is no
% minimum.
% \end{function}
%
% \begin{function}{round-mode}
% \begin{syntax}
% |round-mode| = |figures|\verb"|"|none|\verb"|"|places|\verb"|"|uncertainty|
% \end{syntax}
% Choice which specifies the rounding approach used for numbers. The choice
% |figures| means that values are rounding to the number of significant
% figures specified by |round-precision|. The setting |places| rounds to
% |round-precision| interpreted as a number of decimal places: this may be
% negative (rounding to an integer). The setting |none| disables rounding.
% The setting |uncertainty| first rounds the uncertainty to the number of
% significant figures specified by |round-precision|, then rounds the main
% value such that its accuracy is correctly specified by this updated
% uncertainty. The standard setting is |none|.
% \end{function}
%
% \begin{function}{round-pad}
% \begin{syntax}
% |round-pad| = |true|\verb"|"|false|
% \end{syntax}
% Switch which specifies if values should be padded to the required number
% length when rounding to a number of decimal places. The standard setting is
% |true|.
% \end{function}
%
% \begin{function}{round-precision}
% \begin{syntax}
% |round-precision| = \meta{precision}
% \end{syntax}
% Integer specifying the number of digits used as a target when rounding:
% this may be interpreted as decimal places or significant figures,
% depending on active |round-mode|. The standard setting is $2$.
% \end{function}
%
% \begin{function}{round-zero-positive}
% \begin{syntax}
% |round-zero-positive| = |true|\verb"|"|false|
% \end{syntax}
% Switch to control whether a value rounded to zero is regarded as a positive
% number if the input was negative. The standard setting is |true|.
% \end{function}
%
% \begin{function}{tight-spacing}
% \begin{syntax}
% |tight-spacing| = |true|\verb"|"|false|
% \end{syntax}
% \end{function}
%
% \begin{function}{uncertainty-descriptor-mode}
% \begin{syntax}
% |uncertainty-descriptor| = |bracket|\verb"|"|bracket-separator|\verb"|"|separator|\verb"|"|subscript|
% \end{syntax}
% Selects how uncertainty descriptors are formatted: a choice from the
% options |bracket|, |text| and |subscript|. The option |bracket| wraps the
% descriptor in parenthesis, |bracket-separator| does the same but also
% includes a separator between the uncertainty and opening bracket,
% |separator| places the descriptor after the uncertainty and a separator,
% and |subscript| formats the descriptor as a subscript. The
% standard setting is |bracket-separator|.
% \end{function}
%
% \begin{function}{uncertainty-descriptor-separator}
% \begin{syntax}
% |uncertainty-descriptor-separator| = \meta{separator}
% \end{syntax}
% Separateor inserted between the uncertainty and descriptor when one is
% required by |uncertainty-separator-mode|. The standard setting is
% \verb*|\ |.
% \end{function}
%
% \begin{function}{uncertainty-descriptors}
% \begin{syntax}
% |uncertainty-descriptors| = \meta{clist}
% \end{syntax}
% Stores the list of descriptors used when there are multiple uncertainty
% components given. This is not used when there is only a single uncertainty
% component present. The standard setting is |empty|.
% \end{function}
%
% \begin{function}{uncertainty-mode}
% \begin{syntax}
% |uncertainty-mode| = |compact|\verb"|"|compact-marker|\verb"|"|full|\verb"|"|separate|
% \end{syntax}
% Switch to determine how single symmetrical uncertainties are formatted.
% When this is set to |separate|, the uncertainty is printed as an entirely
% separate number preceded by \cs{pm}. Other settings all place the
% uncertainty in parentheses directly attached to the main value. The
% standard setting of |compact| prints digits of uncertainty in the
% least-significant digits. It does \emph{not} print a decimal marker if the
% uncertainty crosses the decimal. The setting |full| prints the full value
% of the uncertainty. The setting |compact-marker| is available to print in the
% |compact| style except where the uncertainty crosses the decimal, in which case the
% |full| style is used. The standard setting is |compact|.
% \end{function}
%
% \begin{function}{uncertainty-round-direction}
% \begin{syntax}
% |uncertainty-round-direction| = |down|\verb"|"|nearest|\verb"|"|up|
% \end{syntax}
% Choice which determines how uncertainty values are rounded. The setting
% |up| means that the uncertainty is always rounded away from zero, whereas
% the setting |down| means that the uncertainty will be rounded toward zero.
% The setting |nearest| means that the uncertainty will be rounded to the
% nearest (either up or down), taking account of the setting of |round-half|.
% The standard setting is |nearest|.
% \end{function}
%
% \begin{function}{uncertainty-separator}
% \begin{syntax}
% |uncertainty-separator| = \meta{separator}
% \end{syntax}
% Stores the separator used between the main value and uncertainty when using
% the |compact| or |compact-marker| style setting for |uncertainty-mode|.
% \end{function}
%
% \begin{function}{zero-decimal-as-symbol}
% \begin{syntax}
% |zero-decimal-as-symbol| = |true|\verb"|"|false|
% \end{syntax}
% Switch to determine if an entirely zero decimal part is replaced by a
% symbol. Does not apply if the decimal part is marked as entirely absent.
% \end{function}
%
% \begin{function}{zero-symbol}
% \begin{syntax}
% |zero-symbol| = \meta{symbol}
% \end{syntax}
% Material printed when a zero numerical component is replaced by a symbol.
% \end{function}
%
% \end{documentation}
%
% \begin{implementation}
%
% \section{\pkg{siunitx-number} implementation}
%
% Start the \pkg{DocStrip} guards.
% \begin{macrocode}
%<*package>
% \end{macrocode}
%
% Identify the internal prefix (\LaTeX3 \pkg{DocStrip} convention): only
% internal material in this \emph{submodule} should be used directly.
% \begin{macrocode}
%<@@=siunitx_number>
% \end{macrocode}
%
% \subsection{Initial set-up}
%
% Variants not provided by \pkg{expl3}.
% \begin{macrocode}
\cs_generate_variant:Nn \keys_set:nn { nx }
\cs_generate_variant:Nn \tl_if_blank:nTF { e }
\cs_generate_variant:Nn \tl_if_in:NnTF { NV }
\cs_generate_variant:Nn \tl_if_in:nnTF { nV }
\cs_generate_variant:Nn \tl_remove_all:Nn { NV }
\cs_generate_variant:Nn \tl_replace_all:Nnn { NnV }
% \end{macrocode}
%
% \begin{variable}{\l_@@_tmp_tl}
% Scratch space.
% \begin{macrocode}
\tl_new:N \l_@@_tmp_tl
% \end{macrocode}
% \end{variable}
%
% \subsection{Main formatting routine}
%
% \begin{variable}{\l_@@_outputted_tl}
% A token list for the final formatted result: may or may not be generated
% by the parser, depending on settings which are active.
% \begin{macrocode}
\tl_new:N \l_@@_outputted_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_siunitx_number_parse_bool}
% Tracks whether to parse numbers: public as this may affect other
% behaviors.
% \begin{macrocode}
\tl_new:N \l_siunitx_number_parse_bool
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_siunitx_number_parse_bool}
% Top-level options.
% \begin{macrocode}
\keys_define:nn { siunitx }
{
parse-numbers .bool_set:N = \l_siunitx_number_parse_bool
}
% \end{macrocode}
% \end{variable}
%
% \begin{macro}{\siunitx_number_format:nN}
% \begin{macrocode}
\cs_new_protected:Npn \siunitx_number_format:nN #1#2
{
\group_begin:
\bool_if:NTF \l_siunitx_number_parse_bool
{
\siunitx_number_parse:nN {#1} \l_@@_parsed_tl
\siunitx_number_process:NN \l_@@_parsed_tl \l_@@_parsed_tl
\tl_set:Nx \l_@@_outputted_tl
{ \siunitx_number_output:N \l_@@_parsed_tl }
}
{ \tl_set:Nn \l_@@_outputted_tl { \ensuremath {#1} } }
\exp_args:NNNV \group_end:
\tl_set:Nn #2 \l_@@_outputted_tl
}
% \end{macrocode}
% \end{macro}
%
% \subsection{Parsing numbers}
%
% Before numbers can be manipulated or formatted they need to be parsed into
% an internal form. In particular, if multiple code paths are to be avoided,
% it is necessary to do such parsing even for relatively simple cases such
% as converting |1e10| to |1 \times 10^{10}|.
%
% Storing the result of such parsing can be done in a number of ways. In the
% first version of \pkg{siunitx} a series of separate data stores were used.
% This is potentially quite fast (as recovery of items relies only on \TeX{}'s
% hash table) but makes managing the various data entries somewhat tedious and
% error-prone. For version two of the package, a single data structure
% (property list) was used for each part of the parsed number. Whilst this is
% easy to manage and extend, it is somewhat slower as at a \TeX{} level there
% are repeated pack--unpack steps. In particular, the fact that there are a
% limited number of items to track for a \enquote{number} means that a more
% efficient approach is desirable (contrast parsing units, which is open-ended
% and therefore fits well with using a property list).
%
% In this release, the structure of a valid number is:
% \begin{quote}
% \marg{comparator}\meta{sign}\marg{integer}\marg{decimal}
% \marg{uncertainty}\\
% \meta{exponent sign}\marg{exponent}
% \end{quote}
% where all components must be given in braces. \emph{All} of the components
% must be present in a stored number (\foreign{i.e.}~at the end of parsing).
%
% A non-empty \meta{uncertainty} must contain one leading brace group
% containing an identifier, then zero or more brace groups which contain
% the uncertainty data. In this release, the known uncertainty types are
% \begin{itemize}
% \item \texttt{A}: An unsymmetrical uncertainty made up of two values.
% Each is stored as uncertainty in significant digits, with no radix point
% in the stored value. The two parts are stored within one brace group,
% within which are two brace groups: the first contains the positive
% component, the second the negative component. Neither component has a
% sign.
% \item \texttt{S}: A symmetrical statistical uncertainty made up of
% a single value. These are stored as uncertainty in significant digits,
% with no radix point in the stored value.
% \end{itemize}
%
% \begin{variable}{\l_siunitx_number_input_decimal_tl}
% The input decimal markers(s).
% \begin{macrocode}
\tl_new:N \l_siunitx_number_input_decimal_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}
% {
% \l_@@_expression_bool ,
% \l_@@_input_uncert_close_tl ,
% \l_siunitx_number_input_comparator_tl ,
% \l_@@_input_digit_tl ,
% \l_siunitx_number_input_exponent_tl ,
% \l_@@_input_ignore_tl ,
% \l_@@_input_uncert_open_tl ,
% \l_@@_input_uncert_divide_tl ,
% \l_siunitx_number_input_sign_tl ,
% \l_@@_input_uncert_sign_tl ,
% \l_@@_explicit_decimal_bool ,
% \l_@@_explicit_plus_bool ,
% \l_@@_negative_zero_bool ,
% \l_@@_zero_uncert_bool
% }
% \begin{macro}[EXP]{\@@_expression:n}
% Options which determine the various valid parts of a parsed number.
% \begin{macrocode}
\keys_define:nn { siunitx }
{
evaluate-expression .bool_set:N =
\l_@@_expression_bool ,
expression .code:n =
\cs_set:Npn \@@_expression:n ##1 {#1} ,
input-close-uncertainty .tl_set:N =
\l_@@_input_uncert_close_tl ,
input-comparators .tl_set:N =
\l_siunitx_number_input_comparator_tl ,
input-decimal-markers .tl_set:N =
\l_siunitx_number_input_decimal_tl ,
input-digits .tl_set:N =
\l_@@_input_digit_tl ,
input-exponent-markers .tl_set:N =
\l_siunitx_number_input_exponent_tl ,
input-ignore .tl_set:N =
\l_@@_input_ignore_tl ,
input-open-uncertainty .tl_set:N =
\l_@@_input_uncert_open_tl ,
input-signs .tl_set:N =
\l_siunitx_number_input_sign_tl ,
input-uncertainty-signs .code:n =
{
\tl_set:Nn \l_@@_input_uncert_sign_tl {#1}
\tl_map_inline:nn {#1}
{
\tl_if_in:NnF \l_siunitx_number_input_sign_tl {##1}
{ \tl_put_right:Nn \l_siunitx_number_input_sign_tl {##1} }
}
} ,
input-uncertainty-divider .tl_set:N =
\l_@@_input_uncert_divide_tl ,
parse-numbers .bool_set:N =
\l_siunitx_number_parse_bool ,
retain-explicit-decimal-marker .bool_set:N =
\l_@@_explicit_decimal_bool ,
retain-explicit-plus .bool_set:N =
\l_@@_explicit_plus_bool ,
retain-negative-zero .bool_set:N =
\l_@@_negative_zero_bool ,
retain-zero-uncertainty .bool_set:N =
\l_@@_zero_uncert_bool
}
\cs_new:Npn \@@_expression:n #1 { }
\tl_new:N \l_@@_input_uncert_sign_tl
% \end{macrocode}
% \end{macro}
% \end{variable}
%
% \begin{variable}{\l_@@_arg_tl}
% The input argument or a part thereof, depending on the position in
% the parsing routine.
% \begin{macrocode}
\tl_new:N \l_@@_arg_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_comparator_tl}
% A comparator, if found, is held here.
% \begin{macrocode}
\tl_new:N \l_@@_comparator_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_exponent_tl}
% The exponent part of a parsed number. It is easiest to find this
% relatively early in the parsing process, but as it needs to go at
% the end of the internal format is held separately until required.
% \begin{macrocode}
\tl_new:N \l_@@_exponent_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_flex_tl}
% In a number with an uncertainty, the exact meaning of a second part is
% not fully resolved until parsing is complete. That is handled using
% this \enquote{flexible} store.
% \begin{macrocode}
\tl_new:N \l_@@_flex_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_parsed_tl}
% The number parsed into internal format.
% \begin{macrocode}
\tl_new:N \l_@@_parsed_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_input_tl}
% The numerical input exactly as given by the user.
% \begin{macrocode}
\tl_new:N \l_@@_input_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_partial_tl}
% To avoid needing to worry about the fact that the final data stores are
% somewhat tricky to add to token-by-token, a simple store is used to build
% up the parsed part of a number before transferring in one go.
% \begin{macrocode}
\tl_new:N \l_@@_partial_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}
% {
% \l_@@_tolerance_tl ,
% \l_@@_uncert_tl ,
% \l_@@_uncert_offset_int,
% \l_@@_uncert_types_tl
% }
% To allow multiple uncertainties, we want to build this up as possibly
% multiple entries. For asymmetrical uncertainties/tolerances, we need
% an additional store.
% \begin{macrocode}
\tl_new:N \l_@@_tolerance_tl
\tl_new:N \l_@@_uncert_tl
\int_new:N \l_@@_uncert_offset_int
\tl_new:N \l_@@_uncert_types_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_validate_bool}
% Used to set up for validation with no error production.
% \begin{macrocode}
\bool_new:N \l_@@_validate_bool
% \end{macrocode}
% \end{variable}
%
% \begin{macro}{\siunitx_number_normalize_symbols:N}
% \begin{macro}{\@@_normalize_aux:nN}
% \begin{macro}{\@@_normalize_sign:N}
% \begin{variable}{\c_@@_normalize_tl}
% There are two parts to the replacement code. First, any active
% hyphens signs are normalised: these can come up with some packages and
% cause issues. Multi-token signs then are converted to the single token
% equivalents so that everything else can work on a one token basis.
% \begin{macrocode}
\cs_new_protected:Npn \siunitx_number_normalize_symbols:N #1
{
\@@_normalize_minus:N #1
\exp_after:wN \@@_normalize_aux:NnN \exp_after:wN #1
\c_@@_normalize_tl
{ ? } \q_recursion_tail
\q_recursion_stop
}
\cs_set_protected:Npn \@@_normalize_aux:NnN #1#2#3
{
\quark_if_recursion_tail_stop:N #3
\tl_replace_all:Nnn #1 {#2} {#3}
\@@_normalize_aux:NnN #1
}
\tl_const:Nn \c_@@_normalize_tl
{
{ -+ } \mp
{ +- } \pm
{ << } \ll
{ <= } \le
{ >> } \gg
{ >= } \ge
}
\group_begin:
\char_set_catcode_active:N \-
\cs_new_protected:Npx \@@_normalize_minus:N #1
{
\tl_replace_all:Nnn #1
{ \exp_not:N - } { \token_to_str:N - }
}
\group_end:
% \end{macrocode}
% \end{variable}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\siunitx_number_parse:nN, \siunitx_number_parse:VN}
% \begin{macro}{\@@_parse:nN}
% After some initial set up, the parser expands the input and then replaces
% as far as possible tricky tokens with ones that can be handled using
% delimited arguments. To avoid multiple conditionals here, the parser is
% set up as a chain of commands initially, with a loop only later. This
% avoids more conditionals than are necessary.
% \begin{macrocode}
\cs_new_protected:Npn \siunitx_number_parse:nN #1#2
{
\bool_if:NTF \l_siunitx_number_parse_bool
{ \@@_parse:nN {#1} #2 }
{ \tl_clear:N #2 }
}
\cs_generate_variant:Nn \siunitx_number_parse:nN { V }
\cs_new_protected:Npn \@@_parse:nN #1#2
{
\group_begin:
\tl_clear:N \l_@@_parsed_tl
\tl_clear:N \l_@@_uncert_tl
\tl_clear:N \l_@@_uncert_types_tl
\tl_map_inline:Nn \l_@@_input_ignore_tl
{
\token_if_macro:NT ##1
{ \cs_set_eq:NN ##1 \scan_stop: }
}
\protected@edef \l_@@_arg_tl
{
\bool_if:NTF \l_@@_expression_bool
{ \fp_eval:n { \@@_expression:n {#1} } }
{#1}
}
\tl_set_eq:NN \l_@@_input_tl \l_@@_arg_tl
\siunitx_number_normalize_symbols:N \l_@@_arg_tl
\tl_map_inline:Nn \l_@@_input_ignore_tl
{ \tl_remove_all:Nn \l_@@_arg_tl {##1} }
\tl_if_empty:NF \l_@@_arg_tl
{ \@@_parse_comparator: }
\@@_parse_check:
\exp_args:NNNV \group_end:
\tl_set:Nn #2 \l_@@_parsed_tl
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_check:}
% After the loop there is one case that might need tidying up. If a
% separated uncertainty was found it will be currently in \cs{l_@@_flex_tl}
% and needs moving. A series of tests pick up that case, then the check is
% made that some content was found
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_check:
{
\tl_put_right:NV \l_@@_uncert_tl \l_@@_flex_tl
\tl_if_empty:NF \l_@@_uncert_tl
{
\tl_if_blank:eTF { \exp_after:wN \use_iv:nnnn \l_@@_parsed_tl }
{ \@@_parse_combine_uncert: }
{ \tl_clear:N \l_@@_parsed_tl }
}
\tl_if_empty:NTF \l_@@_parsed_tl
{
\bool_if:NF \l_@@_validate_bool
{
\msg_error:nnx { siunitx } { invalid-number }
{ \exp_not:V \l_@@_input_tl }
}
}
{ \@@_parse_finalise: }
}
% \end{macrocode}
% \end{macro}
%
% \begin{macro}{\@@_parse_combine_uncert:}
% \begin{macro}[EXP]{\@@_parse_combine_uncert:nnnn}
% \begin{macro}[EXP]{\@@_parse_combine_uncert:nn}
% \begin{macro}[EXP]
% {
% \@@_parse_combine_uncert_loop:nnnnnnn ,
% \@@_parse_combine_uncert_loop:nnnnnnn
% }
% \begin{macro}[EXP]
% {\@@_parse_combine_uncert:nnnnnn, \@@_parse_combine_uncert:ennnnn}
% \begin{macro}[EXP]
% {\@@_parse_combine_uncert:nnnnnnn, \@@_parse_combine_uncert:ennnnnn}
% \begin{macro}[EXP]{\@@_parse_combine_uncert:nnnnn}
% \begin{macro}[EXP]
% {
% \@@_parse_combine_uncert_aux:nnnn ,
% \@@_parse_combine_uncert_aux:eenn
% }
% \begin{macro}[EXP]{\@@_parse_combine_uncert:N}
% \begin{macro}[EXP]{\@@_parse_combine_uncert:w}
% \begin{macro}[EXP]{\@@_parse_combine_uncert_end:nnn}
% \begin{macro}[EXP]{\@@_parse_combine_uncert_end:nnnn}
% Conversion of a second numerical part to an uncertainty needs a bit of
% work. The first step is to extract the useful information from the two
% stores: the sign, integer and decimal parts from the real number. Then
% set up a loop to deal with each uncertainty to combine. Everything is done
% by expansion to avoid repeated assignments. To allow for the case where
% there is an error, the setup doesn't insert any tokens until the end of
% the loop, which means a bit of work on the stack.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_combine_uncert:
{
\tl_set:Nx \l_@@_parsed_tl
{
\exp_after:wN \@@_parse_combine_uncert:nnnn
\l_@@_parsed_tl
}
}
% \end{macrocode}
% Here, |#1| and |#2| are not required at this stage, while |#4| is junk.
% Thus |#3| is the only item needed for the rest of the process. After a
% little argument shuffling, the main loop can begin.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert:nnnn #1#2#3#4
{
\exp_after:wN \@@_parse_combine_uncert:nn
\exp_after:wN { \l_@@_uncert_tl } {#3}
}
\cs_new:Npn \@@_parse_combine_uncert:nn #1#2
{
\@@_parse_combine_uncert_loop:nnnnnnn {#2} { } { }
#1
{ \q_recursion_tail } { } { } { } \q_recursion_stop
}
% \end{macrocode}
% Here, |#4| and |#7| are junk arguments simply there to mop up
% tokens, with the exception that |#4| is also used for the end-of-loop
% test.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert_loop:nnnnnnn #1#2#3#4#5#6#7
{
\quark_if_recursion_tail_stop_do:nn {#4}
{ \@@_parse_combine_uncert_end:nnn {#1} {#2} {#3} }
\@@_parse_combine_uncert:ennnnn
{ \int_eval:n { \tl_count:n {#1} - \tl_count:n {#6} } }
{#1} {#2} {#3} {#5} {#6}
}
\cs_generate_variant:Nn \@@_parse_combine_uncert_loop:nnnnnnn { nee }
% \end{macrocode}
% The difference in places between the two decimal parts is now found: this
% is done just once to avoid having to parse token lists twice. The value
% is then used to generate a number of filler |0| tokens, and these are added
% to the appropriate part of the number.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert:nnnnnn #1
{
\@@_parse_combine_uncert:ennnnnn
{ \prg_replicate:nn { \int_abs:n {#1} } { 0 } }
{#1}
}
\cs_generate_variant:Nn \@@_parse_combine_uncert:nnnnnn { e }
\cs_new:Npn \@@_parse_combine_uncert:nnnnnnn #1#2#3#4#5#6#7
{
\int_compare:nNnTF {#2} > 0
{
\@@_parse_combine_uncert:nnnnn
{#3} {#4} {#5} {#6} { #7 #1 }
}
{
\@@_parse_combine_uncert:nnnnn
{ #3 #1 } {#4} {#5} {#6} {#7}
}
}
\cs_generate_variant:Nn \@@_parse_combine_uncert:nnnnnnn { e }
% \end{macrocode}
% We now ensure that the decimal part is never entirely blank \emph{if} there
% are decimal-part uncertainty digits. There is also a need to handle the
% possibly of an entirely empty uncertainty, where the value is zero and that
% is not being retained.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert:nnnnn #1#2#3#4#5
{
\@@_parse_combine_uncert_aux:eenn
{
\bool_lazy_and:nnTF
{ \tl_if_blank_p:n {#1} }
{ ! \tl_if_blank_p:n {#5} }
{ 0 }
{ \exp_not:n {#1} }
}
{
\@@_parse_combine_uncert:N #4#5
\q_recursion_tail \q_recursion_stop
}
{#2}
{#3}
}
\cs_new:Npn \@@_parse_combine_uncert_aux:nnnn #1#2#3#4
{
\@@_parse_combine_uncert_loop:neennnn
{#1}
{
\exp_not:n {#3}
\tl_if_blank:nF {#2} { S }
}
{
\exp_not:n {#4}
\tl_if_blank:nF {#2} { { \exp_not:n {#2} } }
}
}
\cs_generate_variant:Nn \@@_parse_combine_uncert_aux:nnnn { ee }
% \end{macrocode}
% A short routine to remove any leading zeros in the uncertainty part,
% which are not needed for the compact representation used by the module.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert:N #1
{
\quark_if_recursion_tail_stop_do:Nn #1
{ \bool_if:NT \l_@@_zero_uncert_bool { 0 } }
\str_if_eq:nnTF {#1} { 0 }
{ \@@_parse_combine_uncert:N }
{ \@@_parse_combine_uncert:w #1 }
}
\cs_new:Npn \@@_parse_combine_uncert:w
#1 \q_recursion_tail \q_recursion_stop
{ \exp_not:n {#1} }
% \end{macrocode}
% Recover the sign and integer part, then add in the new decimal and the
% uncertainties.
% \begin{macrocode}
\cs_new:Npn \@@_parse_combine_uncert_end:nnn #1#2#3
{
\exp_after:wN \@@_parse_combine_uncert_end:nnnn
\l_@@_parsed_tl
{ \exp_not:n {#1} }
{
\tl_if_blank:nF {#2}
{ \exp_not:n { {#2} #3 } }
}
}
\cs_new:Npn \@@_parse_combine_uncert_end:nnnn #1#2#3#4
{ \exp_not:n { {#1} {#2} } }
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_comparator:}
% \begin{macro}{\@@_parse_comparator_aux:Nw}
% A comparator has to be the very first token in the input. A such, the
% test for this can be very fast: grab the first token, do a check and
% if appropriate store the result.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_comparator:
{
\exp_after:wN \@@_parse_comparator_aux:Nw
\l_@@_arg_tl \q_stop
}
\cs_new_protected:Npn \@@_parse_comparator_aux:Nw #1#2 \q_stop
{
\tl_if_in:NnTF \l_siunitx_number_input_comparator_tl {#1}
{
\tl_set:Nn \l_@@_comparator_tl {#1}
\tl_set:Nn \l_@@_arg_tl {#2}
}
{ \tl_clear:N \l_@@_comparator_tl }
\tl_if_empty:NF \l_@@_arg_tl
{ \@@_parse_sign: }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_exponent:}
% \begin{macro}{\@@_parse_exponent_auxi:w}
% \begin{macro}{\@@_parse_exponent_auxii:nn}
% \begin{macro}{\@@_parse_exponent_auxiii:Nw}
% \begin{macro}{\@@_parse_exponent_auxiv:nn}
% \begin{macro}
% {\@@_parse_exponent_zero_test:N, \@@_parse_exponent_check:N}
% \begin{macro}{\@@_parse_exponent_cleanup:N}
% An exponent part of a number has to come at the end and can only occur
% once. Thus it is relatively easy to parse. First, there is a check that
% an exponent part is allowed, and if so a split is made (the previous
% part of the chain checks that there is some content in \cs{l_@@_arg_tl}
% before calling this function). After splitting, if there is no exponent
% then simply save a default. Otherwise, check for a sign and then store
% either this or an implicit plus, and the digits after a check that nothing
% else is present after the~|e|. The only slight complication to all of
% this is allowing an arbitrary token in the input to represent the exponent:
% this is done by setting any exponent tokens to the first of the allowed
% list, then using that in a delimited argument set up. Once an exponent
% part is found, there is a loop to check that each of the tokens is a digit
% then a tidy up step to remove any leading zeros.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_exponent:
{
\tl_if_empty:NTF \l_siunitx_number_input_exponent_tl
{
\tl_set:Nn \l_@@_exponent_tl { { } { } }
\tl_if_empty:NF \l_@@_parsed_tl
{ \@@_parse_loop: }
}
{
\tl_set:Nx \l_@@_tmp_tl
{ \tl_head:V \l_siunitx_number_input_exponent_tl }
\tl_map_inline:Nn \l_siunitx_number_input_exponent_tl
{
\tl_replace_all:NnV \l_@@_arg_tl
{##1} \l_@@_tmp_tl
}
\use:x
{
\cs_set_protected:Npn
\exp_not:N \@@_parse_exponent_auxi:w
####1 \exp_not:V \l_@@_tmp_tl
####2 \exp_not:V \l_@@_tmp_tl
####3 \exp_not:N \q_stop
}
{ \@@_parse_exponent_auxii:nn {##1} {##2} }
\use:x
{
\@@_parse_exponent_auxi:w
\exp_not:V \l_@@_arg_tl
\exp_not:V \l_@@_tmp_tl \exp_not:N \q_nil
\exp_not:V \l_@@_tmp_tl \exp_not:N \q_stop
}
}
}
\cs_new_protected:Npn \@@_parse_exponent_auxi:w { }
\cs_new_protected:Npn \@@_parse_exponent_auxii:nn #1#2
{
\quark_if_nil:nTF {#2}
{ \tl_set:Nn \l_@@_exponent_tl { { } { } } }
{
\tl_set:Nn \l_@@_arg_tl {#1}
\tl_if_blank:nTF {#2}
{ \tl_clear:N \l_@@_parsed_tl }
{ \@@_parse_exponent_auxiii:Nw #2 \q_stop }
}
\tl_if_empty:NF \l_@@_parsed_tl
{ \@@_parse_loop: }
}
\cs_new_protected:Npn \@@_parse_exponent_auxiii:Nw #1#2 \q_stop
{
\tl_if_in:NnTF \l_siunitx_number_input_sign_tl {#1}
{ \@@_parse_exponent_auxiv:nn {#1} {#2} }
{ \@@_parse_exponent_auxiv:nn { } {#1#2} }
\tl_if_empty:NT \l_@@_exponent_tl
{ \tl_clear:N \l_@@_parsed_tl }
}
\cs_new_protected:Npn \@@_parse_exponent_auxiv:nn #1#2
{
\bool_lazy_or:nnTF
{ \l_@@_explicit_plus_bool }
{ ! \str_if_eq_p:nn {#1} { + } }
{ \tl_set:Nn \l_@@_exponent_tl { {#1} } }
{ \tl_set:Nn \l_@@_exponent_tl { { } } }
\tl_if_blank:nTF {#2}
{ \tl_clear:N \l_@@_parsed_tl }
{
\@@_parse_exponent_zero_test:N #2
\q_recursion_tail \q_recursion_stop
}
}
\cs_new_protected:Npn \@@_parse_exponent_zero_test:N #1
{
\quark_if_recursion_tail_stop_do:Nn #1
{ \tl_set:Nn \l_@@_exponent_tl { { } 0 } }
\str_if_eq:nnTF {#1} { 0 }
{ \@@_parse_exponent_zero_test:N }
{ \@@_parse_exponent_check:N #1 }
}
\cs_new_protected:Npn \@@_parse_exponent_check:N #1
{
\quark_if_recursion_tail_stop:N #1
\tl_if_in:NnTF \l_@@_input_digit_tl {#1}
{
\tl_put_right:Nn \l_@@_exponent_tl {#1}
\@@_parse_exponent_check:N
}
{ \@@_parse_exponent_cleanup:wN }
}
\cs_new_protected:Npn \@@_parse_exponent_cleanup:wN
#1 \q_recursion_stop
{ \tl_clear:N \l_@@_parsed_tl }
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_finalise:}
% \begin{macro}[EXP]{\@@_parse_finalise:nnnn}
% \begin{macro}[EXP]{\@@_parse_finalise:nw}
% Combine all of the bits of a number together, dealing with negative zero
% if required.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_finalise:
{
\tl_if_empty:NF \l_@@_parsed_tl
{
\tl_set:Nx \l_@@_parsed_tl
{
{ \exp_not:V \l_@@_comparator_tl }
\exp_after:wN \@@_parse_finalise:nnnn \l_@@_parsed_tl
\exp_after:wN \@@_parse_finalise:nw
\l_@@_exponent_tl \q_stop
}
}
}
\cs_new:Npn \@@_parse_finalise:nnnn #1#2#3#4
{
\bool_lazy_all:nTF
{
{ ! \l_@@_negative_zero_bool }
{ \str_if_eq_p:nn {#1} { - } }
{ ! \tl_if_blank_p:n {#2#3} }
{
\str_if_eq_p:ee
{ \exp_not:n {#2#3} }
{ \prg_replicate:nn { \tl_count:n {#2#3} } { 0 } }
}
}
{ \exp_not:n { { } {#2} {#3} {#4} } }
{ \exp_not:n { {#1} {#2} {#3} {#4} } }
}
\cs_new:Npn \@@_parse_finalise:nw #1#2 \q_stop
{
{ \exp_not:n {#1} }
{ \exp_not:n {#2} }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_loop:}
% \begin{macro}{\@@_parse_loop_first:NNN}
% \begin{macro}{\@@_parse_loop_main:NNNN}
% \begin{macro}{\@@_parse_loop_main_end:NN}
% \begin{macro}{\@@_parse_loop_main_digit:NNNN}
% \begin{macro}{\@@_parse_loop_main_decimal:N}
% \begin{macro}{\@@_parse_loop_main_uncert:NN}
% \begin{macro}{\@@_parse_loop_main_sign:NNN}
% \begin{macro}{\@@_parse_loop_main_store:NNN}
% \begin{macro}{\@@_parse_loop_after_decimal:NN}
% \begin{macro}{\@@_parse_loop_break:w}
% At this stage, the partial input \cs{l_@@_arg_tl} will contain any
% mantissa, which may contain one or more uncertainties. Parsing this
% and allowing for all of the different formats possible is best done using
% a token-by-token approach. However, as at each stage only a subset of
% tokens are valid, the approach take is to use a set of semi-dedicated
% functions to parse different components along with switches to allow a
% sensible amount of code sharing.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop:
{
\tl_clear:N \l_@@_partial_tl
\exp_after:wN \@@_parse_loop_first:NNN
\exp_after:wN \l_@@_parsed_tl \exp_after:wN \c_true_bool
\l_@@_arg_tl
\q_recursion_tail \q_recursion_stop
}
% \end{macrocode}
% The very first token of the input is handled with a dedicated function.
% Valid cases here are
% \begin{itemize}
% \item Entirely blank if the original input was for example |+e10|:
% simply clean up if in the integer part or issue an error if in
% a second part (uncertainty).
% \item An integer part digit: pass through to the main collection
% routine.
% \item A decimal marker: store an empty integer part and move to
% the main collection routine for a decimal part.
% \end{itemize}
% Anything else is invalid and sends the code to the abort function.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_first:NNN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3
{
\bool_if:NTF #2
{ \tl_put_right:Nn #1 { { } { } { } } }
{ \@@_parse_loop_break:w \q_recursion_stop }
}
\tl_if_in:NnTF \l_@@_input_digit_tl {#3}
{
\@@_parse_loop_main:NNNN
#1 \c_true_bool \c_false_bool #3
}
{
\tl_if_in:NnTF \l_siunitx_number_input_decimal_tl {#3}
{
\tl_put_right:Nn #1 { { 0 } }
\@@_parse_loop_after_decimal:NN #1
}
{ \@@_parse_loop_break:w }
}
}
% \end{macrocode}
% A single function is used to cover the \enquote{main} part of numbers:
% finding the main or separated uncertainty parts and covering both
% the integer and decimal components. This works because these elements
% share a lot of concepts: a small number of switches can be used to
% differentiate between them. To keep the code at least somewhat readable,
% this main function deals with the validity testing but hands off other
% tasks to dedicated auxiliaries for each case.
%
% The possibilities are
% \begin{itemize}
% \item The number terminates, meaning that some digits were collected
% and everything is simply tidied up (as far as the loop is concerned).
% \item A digit is found: this is the common case and leads to a storage
% auxiliary (which handles non-significant zeros).
% \item A decimal marker is found: only valid in the integer part and
% there leading to a store-and-switch situation.
% \item An open-uncertainty token: switch to the dedicated collector
% for uncertainties.
% \item A sign token: stop collecting this number and
% restart collection for the next part.
% \end{itemize}
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main:NNNN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4
{ \@@_parse_loop_main_end:NN #1#2 }
\tl_if_in:NnTF \l_@@_input_digit_tl {#4}
{ \@@_parse_loop_main_digit:NNNN #1#2#3#4 }
{
\tl_if_in:NnTF \l_siunitx_number_input_decimal_tl {#4}
{
\bool_if:NTF #2
{ \@@_parse_loop_main_decimal:N #1 }
{ \@@_parse_loop_break:w }
}
{
\tl_if_in:NnTF \l_@@_input_uncert_open_tl {#4}
{ \@@_parse_loop_main_uncert:NN #1 #2 }
{
\tl_if_in:NnTF \l_@@_input_uncert_sign_tl {#4}
{
\@@_parse_loop_main_sign:NNN
#1 #2 #4
}
{ \@@_parse_loop_break:w }
}
}
}
}
% \end{macrocode}
% If the main loop finds the end marker then there is a tidy up phase.
% The current partial number is stored either as the integer or decimal,
% depending on the setting for the indicator switch. For the integer
% part, if no number has been collected then one or more non-significant
% zeros have been dropped. Exactly one zero is therefore needed to make
% sure the parsed result is correct. On the other hand, if the decimal
% is empty \emph{and} we are asked to track the presence of a marker,
% we store the indicator value \cs{empty}.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_end:NN #1#2
{
\tl_if_empty:NT \l_@@_partial_tl
{
\bool_if:NTF #2
{ \tl_set:Nn \l_@@_partial_tl { 0 } }
{
\bool_if:NT \l_@@_explicit_decimal_bool
{ \tl_set:Nn \l_@@_partial_tl { \empty } }
}
}
\tl_put_right:Nx #1
{
{ \exp_not:V \l_@@_partial_tl }
\bool_if:NT #2 { { } }
{ }
}
}
% \end{macrocode}
% The most common case for the main loop collector is to find a digit.
% Here, in the integer part it is possible that zeros are non-significant:
% that is handled using a combination of a switch and a string test. Other
% than that, the situation here is simple: store the input and loop.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_digit:NNNN #1#2#3#4
{
\bool_lazy_or:nnTF
{#3} { ! \str_if_eq_p:nn {#4} { 0 } }
{
\tl_put_right:Nn \l_@@_partial_tl {#4}
\@@_parse_loop_main:NNNN #1 #2 \c_true_bool
}
{ \@@_parse_loop_main:NNNN #1 #2 \c_false_bool }
}
% \end{macrocode}
% When a decimal marker was found, move the integer part to the
% store and then go back to the loop with the flags set correctly.
% There is the case of non-significant zeros to cover before that, of course.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_decimal:N #1
{
\@@_parse_loop_main_store:NNN #1 \c_false_bool \c_false_bool
\@@_parse_loop_after_decimal:NN #1
}
% \end{macrocode}
% Starting an uncertainty part means storing the number to date as in other
% cases, with the possibility of a blank decimal part allowed for. The
% uncertainty itself is collected by a dedicated function as it is extremely
% restricted.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_uncert:NN #1#2
{
\@@_parse_loop_main_store:NNN #1 #2 \c_false_bool
\@@_parse_uncert:N
}
% \end{macrocode}
% If a sign is found, terminate the current number, store the sign as the
% first token of the second part and go back to do the dedicated first-token
% function.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_sign:NNN #1#2#3
{
\@@_parse_loop_main_store:NNN #1 #2 \c_true_bool
\tl_put_right:NV \l_@@_uncert_tl \l_@@_flex_tl
\tl_set:Nn \l_@@_flex_tl { {#3} }
\@@_parse_loop_first:NNN
\l_@@_flex_tl \c_false_bool
}
% \end{macrocode}
% A common auxiliary for the various non-digit token functions: tidy up the
% integer and decimal parts of a number. Here, the two flags are used to
% indicate if empty decimal and uncertainty parts should be included in
% the storage cycle.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_main_store:NNN #1#2#3
{
\tl_put_right:Nx #1
{
{
\tl_if_empty:NTF \l_@@_partial_tl
{ 0 }
{ \exp_not:V \l_@@_partial_tl }
}
\bool_if:NT #2 { { } }
\bool_if:NT #3 { { } }
}
\tl_clear:N \l_@@_partial_tl
}
% \end{macrocode}
% After a decimal marker there has to be a digit if there wasn't one before
% it. That is handled by using a dedicated function, which checks for
% an empty integer part first then either simply hands off or looks for
% a digit.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_after_decimal:NN #1#2
{
\tl_if_blank:eTF { \exp_after:wN \use_none:n #1 }
{
\quark_if_recursion_tail_stop_do:Nn #2
{ \@@_parse_loop_break:w \q_recursion_stop }
\tl_if_in:NnTF \l_@@_input_digit_tl {#1}
{
\tl_put_right:Nn \l_@@_partial_tl {#2}
\@@_parse_loop_main:NNNN
#1 \c_false_bool \c_true_bool
}
{ \@@_parse_loop_break:w }
}
{
\@@_parse_loop_main:NNNN
#1 \c_false_bool \c_true_bool #2
}
}
% \end{macrocode}
% Something is not right: remove all of the remaining tokens from the
% number and clear the storage areas as a signal for the next part of the
% code.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_loop_break:w
#1 \q_recursion_stop
{
\tl_clear:N \l_@@_flex_tl
\tl_clear:N \l_@@_parsed_tl
\tl_clear:N \l_@@_uncert_tl
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_sign:}
% \begin{macro}{\@@_parse_sign_aux:Nw}
% The first token of a number after a comparator could be a sign. A quick
% check is made and if found stored. For the number to be valid it has to be
% more than just a sign, so the next part of the chain is only called if that
% is the case.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_sign:
{
\exp_after:wN \@@_parse_sign_aux:Nw
\l_@@_arg_tl \q_stop
}
\cs_new_protected:Npn \@@_parse_sign_aux:Nw #1#2 \q_stop
{
\tl_if_in:NnTF \l_siunitx_number_input_sign_tl {#1}
{
\tl_set:Nn \l_@@_arg_tl {#2}
\bool_lazy_and:nnTF
{ \token_if_eq_charcode_p:NN #1 + }
{ ! \l_@@_explicit_plus_bool }
{ \tl_set:Nn \l_@@_parsed_tl { { } } }
{ \tl_set:Nn \l_@@_parsed_tl { {#1} } }
}
{ \tl_set:Nn \l_@@_parsed_tl { { } } }
\tl_if_empty:NTF \l_@@_arg_tl
{ \tl_clear:N \l_@@_parsed_tl }
{ \@@_parse_exponent: }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_parse_uncert:N}
% \begin{macro}{\@@_parse_uncert:NNN}
% \begin{macro}
% {
% \@@_parse_uncert_auxi:N ,
% \@@_parse_uncert_auxii:N ,
% \@@_parse_uncert_auxiv:N
% }
% \begin{macro}{\@@_parse_uncert_auxiv:}
% \begin{macro}{\@@_parse_uncert_marker:}
% \begin{macro}{\@@_parse_uncert_marker:nnn}
% \begin{macro}{\@@_parse_uncert_marker:nnnw}
% \begin{macro}{\@@_parse_uncert_marker:Nnnn}
% \begin{macro}{\@@_parse_uncert_marker:w}
% \begin{macro}{\@@_parse_uncert_marker:nnnnN}
% \begin{macro}{\@@_parse_uncert_marker:nnnnnN}
% \begin{macro}
% {
% \@@_parse_uncert_marker:nnnnnnN ,
% \@@_parse_uncert_marker:ennnnnN
% }
% \begin{macro}{\@@_parse_uncert_after:N}
% Parsing a combined uncertainty has a very restricted range of allowed
% tokens. A closing uncertainty token in the first place is an error,
% so we filter that out explicitly. After that, we check for digits,
% which require checking for significant digits. The non-digit function
% is separate to make the flow clearer.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert:N #1
{
\quark_if_recursion_tail_stop_do:Nn #1
{ \@@_parse_loop_break:w \q_recursion_stop }
\tl_if_in:NnTF \l_@@_input_uncert_close_tl {#1}
{ \@@_parse_loop_break:w }
{
\@@_parse_uncert:NNN
\c_false_bool \@@_parse_uncert_auxi:N #1
}
}
% \end{macrocode}
% Deal with digits: a simple question of whether they are significant.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert:NNN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3
{ \@@_parse_loop_break:w \q_recursion_stop }
\tl_if_in:NnTF \l_@@_input_digit_tl {#3}
{
\bool_lazy_or:nnTF
{#1} { ! \str_if_eq_p:nn {#3} { 0 } }
{
\tl_put_right:Nn \l_@@_partial_tl {#3}
\@@_parse_uncert:NNN \c_true_bool #2
}
{ \@@_parse_uncert:NNN \c_false_bool #2 }
}
{ #2 #3 }
}
% \end{macrocode}
% For the two auxiliaries, the difference is the handling of a
% decimal marker: one may be present, but only exactly one.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_auxi:N #1
{
\tl_if_in:NnTF \l_@@_input_uncert_close_tl {#1}
{
\@@_parse_uncert_auxiii:
\@@_parse_uncert_after:N
}
{
\tl_if_in:NnTF \l_siunitx_number_input_decimal_tl {#1}
{ \@@_parse_uncert_marker: }
{ \@@_parse_uncert_auxiv:N #1 }
}
}
\cs_new_protected:Npn \@@_parse_uncert_auxii:N #1
{
\tl_if_in:NnTF \l_@@_input_uncert_close_tl {#1}
{
\@@_parse_uncert_auxiii:
\@@_parse_uncert_after:N
}
{ \@@_parse_uncert_auxiv:N #1 }
}
% \end{macrocode}
% Deal with the closing bracket, which might leave us with nothing if there
% were no significant digits.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_auxiii:
{
\bool_lazy_and:nnT
{ \l_@@_zero_uncert_bool }
{ \tl_if_empty_p:N \l_@@_partial_tl }
{ \tl_set:Nn \l_@@_partial_tl { 0 } }
}
% \end{macrocode}
% A common auxiliary for the case where the token is not a digit, a
% decimal mark or a closing parenthesis.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_auxiv:N #1
{
\tl_if_empty:NTF \l_@@_tolerance_tl
{
\tl_if_in:NnTF \l_@@_input_uncert_divide_tl {#1}
{
\cs_set_eq:NN \l_@@_tolerance_tl \l_@@_partial_tl
\tl_clear:N \l_@@_partial_tl
\@@_parse_uncert:N
}
{ \@@_parse_loop_break:w }
}
{ \@@_parse_loop_break:w }
}
% \end{macrocode}
% Handling a decimal marker in the uncertainty is a bit tricky: we need to make
% sure it's valid. First, we need to be sure that the integer part of the captured
% uncertainty is not too long. Then we need to check that the decimal part is
% not too long, and extend the decimal if it is.
% Both of these require data from the collected partial number,
% so we extract that first. Checking the decimal part needs the length of the
% not-yet-collected uncertainty. There may be one or more parts to that, so
% we have to grab up to the \emph{first} closing token to count the length:
% just grabbing everything only works if there is only a single uncertainty.
% We take protective steps against an entirely-missing closing token so that
% there is not an uncontrolled error.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_marker:
{
\exp_after:wN \@@_parse_uncert_marker:nnn
\l_@@_parsed_tl
}
\cs_new_protected:Npn \@@_parse_uncert_marker:nnn #1#2#3
{
\int_compare:nNnTF
{ \tl_count:N \l_@@_partial_tl } > { \tl_count:n {#2} }
{ \@@_parse_loop_break:w }
{ \@@_parse_uncert_marker:nnnw {#1} {#2} {#3} }
}
\cs_new_protected:Npn \@@_parse_uncert_marker:nnnw
#1#2#3#4 \q_recursion_tail \q_recursion_stop
{
\tl_if_in:nVTF {#4} \l_@@_input_uncert_close_tl
{
\exp_after:wN \@@_parse_uncert_marker:Nnnn
\l_@@_input_uncert_close_tl
{#1} {#2} {#3}
}
{ \@@_parse_loop_break:w }
#4 \q_recursion_tail \q_recursion_stop
}
\cs_new_protected:Npn \@@_parse_uncert_marker:Nnnn
#1#2#3#4
{
\cs_set_protected:Npn \@@_parse_uncert_marker:w ##1 #1
{ \@@_parse_uncert_marker:nnnnN {#2} {#3} {#4} {##1} #1 }
\@@_parse_uncert_marker:w
}
\cs_new_protected:Npn \@@_parse_uncert_marker:w { }
% \end{macrocode}
% With the separated out main part and the current uncertainty part
% available, we can pad the main part if required then restart the
% collection of the uncertainty having thrown away the decimal marker
% and with the lengths lined up. To account for asymmetrical
% uncertainties, there is a bit of work in tracking.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_marker:nnnnN #1#2#3#4#5
{
\tl_set:Nx \l_@@_tmp_tl { \tl_head:V \l_@@_input_uncert_divide_tl }
\tl_if_empty:NTF \l_@@_tmp_tl
{ \@@_parse_uncert_marker:nnnnnN {#1} {#2} {#3} {#4} { } #5 }
{
\use:x
{
\cs_set_protected:Npn \exp_not:N \@@_parse_uncert_marker:w
####1 \l_@@_tmp_tl ####2 \l_@@_tmp_tl ####3 \exp_not:N \q_stop
{
\exp_not:N \tl_if_blank:nTF {####2}
{
\@@_parse_uncert_marker:nnnnnN
\exp_not:n { {#1} {#2} {#3} }
{####1} { }
}
{
\@@_parse_uncert_marker:nnnnnN
\exp_not:n { {#1} {#2} {#3} }
{####1} { \l_@@_tmp_tl ####2 }
}
\exp_not:N #5
}
\exp_not:N \@@_parse_uncert_marker:w #4
\l_@@_tmp_tl \l_@@_tmp_tl \exp_not:N \q_stop
}
}
}
\cs_new_protected:Npn \@@_parse_uncert_marker:nnnnnN #1#2#3#4#5#6
{
\@@_parse_uncert_marker:ennnnnN
{ \int_eval:n { \tl_count:n {#4} } }
{#1} {#2} {#3} {#4} {#5} #6
}
\cs_new_protected:Npn \@@_parse_uncert_marker:nnnnnnN #1#2#3#4#5#6#7
{
\bool_lazy_and:nnF
{ \tl_if_empty_p:N \l_@@_tolerance_tl }
{ \tl_if_empty_p:N \l_@@_uncert_types_tl }
{
\int_compare:nNnF {#1} = \l_@@_uncert_offset_int
{ \@@_parse_loop_break:w }
}
\int_set:Nn \l_@@_uncert_offset_int {#1}
\tl_set:Nx \l_@@_parsed_tl
{
{#2}
{#3}
{
#4
\prg_replicate:nn
{ \int_max:nn { 0 } { #1 - \tl_count:n {#4} } }
{ 0 }
}
}
\tl_if_empty:NTF \l_@@_partial_tl
{
\@@_parse_uncert:NNN \c_false_bool
\@@_parse_uncert_auxii:N
}
{
\@@_parse_uncert:NNN \c_true_bool
\@@_parse_uncert_auxii:N
}
#5#6#7
}
\cs_generate_variant:Nn \@@_parse_uncert_marker:nnnnnnN { e }
% \end{macrocode}
% At the end of collection, we can either start another one or be done:
% either way we move the data around.
% \begin{macrocode}
\cs_new_protected:Npn \@@_parse_uncert_after:N #1
{
\tl_set:Nx \l_@@_uncert_tl
{
\exp_not:V \l_@@_uncert_tl
\tl_if_empty:NF \l_@@_partial_tl
{
{
\tl_if_empty:NTF \l_@@_tolerance_tl
{ \exp_not:V \l_@@_partial_tl }
{
{ \exp_not:V \l_@@_tolerance_tl }
{ \exp_not:V \l_@@_partial_tl }
}
}
}
}
\tl_set:Nx \l_@@_uncert_types_tl
{
\l_@@_uncert_types_tl
\tl_if_empty:NTF \l_@@_tolerance_tl
{ S }
{ A }
}
\tl_clear:N \l_@@_partial_tl
\tl_clear:N \l_@@_tolerance_tl
\quark_if_recursion_tail_stop_do:Nn #1
{
\tl_set:Nx \l_@@_parsed_tl
{
\exp_not:V \l_@@_parsed_tl
{
\tl_if_empty:NF \l_@@_uncert_tl
{
{ \l_@@_uncert_types_tl }
\exp_not:V \l_@@_uncert_tl
}
}
}
\tl_clear:N \l_@@_partial_tl
\tl_clear:N \l_@@_uncert_tl
\int_zero:N \l_@@_uncert_offset_int
}
\tl_if_in:NnTF \l_@@_input_uncert_open_tl {#1}
{ \@@_parse_uncert:N }
{ \@@_parse_loop_break:w }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \subsection{Processing numbers}
%
% \begin{variable}
% {
% \l_@@_drop_exponent_bool ,
% \l_@@_drop_uncertainty_bool ,
% \l_@@_drop_zero_decimal_bool ,
% \l_@@_exponent_mode_tl ,
% \l_@@_exponent_fixed_int ,
% \l_@@_min_decimal_int ,
% \l_@@_min_integer_int ,
% \l_@@_round_dir_tl ,
% \l_@@_round_half_even_bool ,
% \l_@@_round_mode_tl ,
% \l_@@_round_pad_bool ,
% \l_@@_round_precision_int ,
% \l_@@_round_positive_bool ,
% \l_@@_round_uncert_dir_tl
% }
% \begin{macrocode}
\keys_define:nn { siunitx }
{
drop-exponent .bool_set:N =
\l_@@_drop_exponent_bool ,
drop-uncertainty .bool_set:N =
\l_@@_drop_uncertainty_bool ,
drop-zero-decimal .bool_set:N =
\l_@@_drop_zero_decimal_bool ,
exponent-mode .choices:nn =
{ engineering , fixed , input , scientific , threshold }
{ \tl_set_eq:NN \l_@@_exponent_mode_tl \l_keys_choice_tl } ,
exponent-thresholds .code:n =
{ \@@_set_thresholds:n {#1} } ,
fixed-exponent .int_set:N =
\l_@@_exponent_fixed_int ,
minimum-decimal-digits .int_set:N =
\l_@@_min_decimal_int ,
minimum-integer-digits .int_set:N =
\l_@@_min_integer_int ,
round-direction .choices:nn =
{ down , nearest , up }
{ \tl_set_eq:NN \l_@@_round_dir_tl \l_keys_choice_tl } ,
round-half .choice: ,
round-half / even .code:n =
{ \bool_set_true:N \l_@@_round_half_even_bool } ,
round-half / up .code:n =
{ \bool_set_false:N \l_@@_round_half_even_bool } ,
round-minimum .code:n =
{ \@@_set_round_min:n {#1} } ,
round-mode .choices:nn =
{ figures , none , places, uncertainty }
{ \tl_set_eq:NN \l_@@_round_mode_tl \l_keys_choice_tl } ,
round-pad .bool_set:N =
\l_@@_round_pad_bool ,
round-precision .int_set:N =
\l_@@_round_precision_int ,
round-zero-positive .bool_set:N =
\l_@@_round_positive_bool ,
uncertainty-round-direction .choices:nn =
{ down , nearest , up }
{ \tl_set_eq:NN \l_@@_round_uncert_dir_tl \l_keys_choice_tl } ,
}
\bool_new:N \l_@@_round_half_even_bool
\tl_new:N \l_@@_exponent_mode_tl
\tl_new:N \l_@@_round_dir_tl
\tl_new:N \l_@@_round_mode_tl
\tl_new:N \l_@@_round_uncert_dir_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_@@_round_min_tl}
% For storing the minimum for rounding.
% \begin{macrocode}
\tl_new:N \l_@@_round_min_tl
% \end{macrocode}
% \end{variable}
%
% \begin{macro}{\@@_set_round_min:n}
% \begin{macro}{\@@_set_round_min:nnnnnnn}
% For setting the rounding minimum, the aim is to do as much of the work
% now as possible. That's mainly a question of checking if there are any
% significant digits in the mantissa given.
% \begin{macrocode}
\cs_new_protected:Npn \@@_set_round_min:n #1
{
\siunitx_number_parse:nN {#1} \l_@@_tmp_tl
\exp_after:wN \@@_set_round_min:nnnnnnn \l_@@_tmp_tl
}
\cs_new_protected:Npn \@@_set_round_min:nnnnnnn #1#2#3#4#5#6#7
{
\tl_set:Nx \l_@@_round_min_tl
{
\bool_lazy_and:nnF
{ \str_if_eq_p:nn {#3} { 0 } }
{
\str_if_eq_p:ee
{ \exp_not:n {#4} }
{ \prg_replicate:nn { \tl_count:n {#4} } { 0 } }
}
{ \exp_not:n { {#3} {#4} } }
}
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{variable}{\l_@@_lower_threshold_int, \l_@@_upper_threshold_int}
% For storing the range for exponents.
% \begin{macrocode}
\int_new:N \l_@@_lower_threshold_int
\int_new:N \l_@@_upper_threshold_int
% \end{macrocode}
% \end{variable}
%
% \begin{macro}{\@@_set_round_thresholds:n}
% \begin{macro}{\@@_set_round_thresholds:w}
% \begin{macro}{\@@_set_round_threshold:nn}
% Split the range, parse each part, set the data structures.
% \begin{macrocode}
\cs_new_protected:Npx \@@_set_thresholds:n #1
{
\exp_not:N \@@_set_thresholds:w
#1 \token_to_str:N : \token_to_str:N : \exp_not:N \q_stop
}
\use:x
{
\cs_new_protected:Npn \exp_not:N \@@_set_thresholds:w
##1 \token_to_str:N : ##2 \token_to_str:N : ##3 \exp_not:N \q_stop
}
{
\@@_set_threshold:nn { lower } {#1}
\@@_set_threshold:nn { upper } {#2}
}
\cs_new_protected:Npn \@@_set_threshold:nn #1#2
{ \int_set:cn { l__@@_ #1 _threshold_int } { 0 #2 } }
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\siunitx_number_process:NN, \siunitx_number_process:cc}
% \begin{macro}{\@@_process:nnnnnnnNN}
% A top-level interface for the processing tools. Rounding happens in all
% cases, but exponents are only processed if the value is not $0$.
% \begin{macrocode}
\cs_new_protected:Npn \siunitx_number_process:NN #1#2
{
\tl_if_empty:NTF #1
{ \tl_clear:N #2 }
{
\@@_drop_uncertainty:NN #1 #2
\exp_after:wN \@@_process:nnnnnnnNN #2 #2 #2
\@@_drop_exponent:NN #2 #2
\@@_zero_decimal:NN #2 #2
\@@_digits:NN #2 #2
}
}
\cs_generate_variant:Nn \siunitx_number_process:NN { cc }
\cs_new_protected:Npn \@@_process:nnnnnnnNN #1#2#3#4#5#6#7#8#9
{
\bool_lazy_and:nnTF
{ \str_if_eq_p:nn {#3} { 0 } }
{
\str_if_eq_p:ee
{ \exp_not:n {#4} } { \prg_replicate:nn { \tl_count:n {#4} } { 0 } }
}
{ \@@_round:NN #8 #9 }
{
\@@_exponent:NN #8 #9
\@@_round:NN #9 #9
}
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_exponent:NN}
% \begin{macro}[EXP]
% {
% \@@_exponent:nnnnnnn ,
% \@@_exponent_aux:nnnnnnn ,
% \@@_exponent_engineering:nnnnnnn ,
% \@@_exponent_fixed:nnnnnnn ,
% \@@_exponent_scientific:nnnnnnn
% }
% \begin{macro}[EXP]
% {
% \@@_exponent_fixed:nnnnnnnn ,
% \@@_exponent_fixed:ennnnnnn ,
% \@@_exponent_scientific:nnnnnnnn ,
% \@@_exponent_scientific:ennnnnnn
% }
% \begin{macro}[EXP]{\@@_exponent_scientific:nnnw}
% \begin{macro}[EXP]{\@@_exponent_shift:nnn, \@@_exponent_shift:nne}
% \begin{macro}[EXP]{\@@_exponent_shift_down:nnnw}
% \begin{macro}[EXP]{\@@_exponent_shift_down:nnn}
% \begin{macro}[EXP]{\@@_exponent_shift_down:nw}
% \begin{macro}[EXP]{\@@_exponent_shift_up:nnn}
% \begin{macro}[EXP]{\@@_exponent_shift_up:nnw}
% \begin{macro}[EXP]
% {\@@_exponent_shift_up_aux:nnn, \@@_exponent_shift_up_aux:een}
% \begin{macro}[EXP]{\@@_exponent_shift_uncert:nw}
% \begin{macro}[EXP]
% {\@@_exponent_shift_uncert_S:nnnn, \@@_exponent_shift_uncert_S:ennn}
% \begin{macro}[EXP]{\@@_exponent_uncert:n}
% \begin{macro}[EXP]{\@@_exponent_finalise:n}
% \begin{macro}[EXP]{\@@_exponentcd te_engineering_aux:nnnnnnn}
% \begin{macro}[EXP]
% {
% \@@_exponent_engineering_0:nnnn ,
% \@@_exponent_engineering_1:nnnn ,
% \@@_exponent_engineering_2:nnnn
% }
% \begin{macro}[EXP]{\@@_exponent_engineering:nnNw}
% \begin{macro}[EXP]{\@@_exponent_engineering_uncert:nn}
% \begin{macro}[EXP]{\@@_exponent_engineering_uncert_S:nnn}
% \begin{macro}[EXP]{\@@_exponent_threshold:nnnnnnn}
% \begin{macro}[EXP]{\@@_exponent_threshold:nn, \@@_exponent_threshold:en}
% \begin{macro}[EXP]{\@@_exponent_threshold:nnnnnnnn}
% Manipulating an exponent is done using a single expansion function
% \emph{unless} dealing with engineering-style output. The latter is easier
% to handle by first converting to scientific output, then post-processing.
% (Once \texttt{e}-type expansion is generally available, this will be
% handling using a single \cs{tl_set:Nx}.)
% \begin{macrocode}
\cs_new_protected:Npn \@@_exponent:NN #1#2
{
\tl_set:Nx #2
{ \exp_after:wN \@@_exponent:nnnnnnn #1 }
\str_if_eq:VnT \l_@@_exponent_mode_tl { engineering }
{
\tl_set:Nx #2
{ \exp_after:wN \@@_exponent_engineering_aux:nnnnnnn #2 }
}
}
\cs_new:Npn \@@_exponent:nnnnnnn #1#2#3#4#5#6#7
{
\str_if_eq:VnTF \l_@@_exponent_mode_tl { input }
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
{
\tl_if_blank:nTF {#7}
{ \@@_exponent_aux:nnnnnnn {#1} {#2} {#3} {#4} {#5} {#6} { 0 } }
{ \@@_exponent_aux:nnnnnnn {#1} {#2} {#3} {#4} {#5} {#6} {#7} }
}
}
\cs_new:Npn \@@_exponent_aux:nnnnnnn #1#2#3#4#5#6#7
{
\use:c { @@_exponent_ \l_@@_exponent_mode_tl :nnnnnnn }
{#1} {#2} {#3} {#4} {#5} {#6} {#7}
}
\cs_new:Npn \@@_exponent_fixed:nnnnnnn #1#2#3#4#5#6#7
{
\@@_exponent_fixed:ennnnnnn
{ \int_eval:n { \l_@@_exponent_fixed_int - (#6#7) } }
{#1} {#2} {#3} {#4} {#5} {#6} {#7}
}
\cs_new:Npn \@@_exponent_fixed:nnnnnnnn #1#2#3#4#5#6#7#8
{
\exp_not:n { {#2} {#3} }
\@@_exponent_shift:nnn {#1} {#4} {#5}
\@@_exponent_uncert:n {#6}
{ \int_compare:nNnT \l_@@_exponent_fixed_int < 0 { - } }
{ \int_abs:n \l_@@_exponent_fixed_int }
}
\cs_generate_variant:Nn \@@_exponent_fixed:nnnnnnnn { e }
% \end{macrocode}
% To convert to scientific notation, the key question is to find the number
% of significant places. That is easy enough if the number has a non-zero
% integer component. For a pure decimal, we have to trim off leading
% zeros in a loop.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_scientific:nnnnnnn #1#2#3#4#5#6#7
{
\@@_exponent_scientific:ennnnnnn
{ \int_eval:n { \tl_count:n {#3} } }
{#1} {#2} {#3} {#4} {#5} {#6} {#7}
}
\cs_new:Npn \@@_exponent_scientific:nnnnnnnn #1#2#3#4#5#6#7#8
{
\exp_not:n { {#2} {#3} }
\int_compare:nNnTF {#1} = 1
{
\str_if_eq:nnTF {#4} { 0 }
{
\@@_exponent_scientific:nnnw
{ 0 } {#6} { #7#8 } #5 \q_stop
}
{ \exp_not:n { {#4} {#5} {#6} {#7} {#8} } }
}
{
\@@_exponent_shift:nnn { #1 - 1 } {#4} {#5}
\@@_exponent_uncert:n {#6}
\@@_exponent_finalise:n { #1 + #7#8 - 1 }
}
}
\cs_generate_variant:Nn \@@_exponent_scientific:nnnnnnnn { e }
\cs_new_eq:NN \@@_exponent_engineering:nnnnnnn
\@@_exponent_scientific:nnnnnnn
\cs_new:Npn \@@_exponent_scientific:nnnw #1#2#3#4#5 \q_stop
{
\str_if_eq:nnTF {#4} { 0 }
{
\@@_exponent_scientific:nnnw
{ #1 - 1 } {#2} {#3} #5 \q_stop
}
{
\exp_not:n { {#4} {#5} {#2} }
\@@_exponent_finalise:n { #1 + #3 - 1 }
}
}
% \end{macrocode}
% When adjusting the exponent position, there are two paths depending on
% which way the shift takes place.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_shift:nnn #1#2#3
{
\int_compare:nNnTF {#1} > 0
{ \@@_exponent_shift_down:nnnw {#1} {#3} { } #2 \q_stop }
{
\int_compare:nNnTF {#1} < 0
{ \@@_exponent_shift_up:nnn {#1} {#2} {#3} }
{ {#2} {#3} }
}
}
\cs_generate_variant:Nn \@@_exponent_shift:nnn { nne }
% \end{macrocode}
% For shifting the exponent down, there is first a loop to reserve the
% integer part before doing the work: that of course has to be undone
% for any remainder at he end of the process.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_shift_down:nnnw #1#2#3#4#5 \q_stop
{
\tl_if_blank:nTF {#5}
{ \@@_exponent_shift_down:nnn {#1} { #4 #3 } {#2} }
{ \@@_exponent_shift_down:nnnw {#1} {#2} { #4 #3 } #5 \q_stop }
}
\cs_new:Npn \@@_exponent_shift_down:nnn #1#2#3
{
\int_compare:nNnTF {#1} = 0
{ { \tl_reverse:n {#2} } \exp_not:n { {#3} } }
{ \@@_exponent_shift_down:nw {#1} #2 \q_stop {#3} }
}
\cs_new:Npn \@@_exponent_shift_down:nw #1#2#3 \q_stop #4
{
\tl_if_blank:nTF {#3}
{ \@@_exponent_shift_down:nnn { #1 - 1 } { 0 } { #2#4 } }
{ \@@_exponent_shift_down:nnn { #1 - 1 } {#3} { #2#4 } }
}
% \end{macrocode}
% For shifting the exponent up, we can run out of decimal digits, at which
% point filling is easy. Other than that a simple loop as we are picking
% input off the front of the decimal part. We also need to deal with leading
% zeros: these cannot accumulate.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_shift_up:nnn #1#2#3
{
\tl_if_blank:nTF {#3}
{
\@@_exponent_shift_up_aux:een
{ \int_eval:n { #1 + 1 } }
{ \str_if_eq:nnF {#2} { 0 } {#2} 0 }
{ }
\@@_exponent_shift_uncert:nw { 1 }
}
{ \@@_exponent_shift_up:nnw {#1} {#2} #3 \q_stop }
}
\cs_new:Npn \@@_exponent_shift_up:nnw #1#2#3#4 \q_stop
{
\@@_exponent_shift_up_aux:een
{ \int_eval:n { #1 + 1 } }
{ \str_if_eq:nnF {#2} { 0 } {#2} #3 }
{#4}
}
\cs_new:Npn \@@_exponent_shift_up_aux:nnn #1#2#3
{
\int_compare:nNnTF {#1} = 0
{ \exp_not:n { {#2} {#3} } }
{
\tl_if_blank:nTF {#3}
{
{
\exp_not:n {#2}
\prg_replicate:nn { \int_abs:n {#1} } { 0 }
}
{ }
\@@_exponent_shift_uncert:nw { \int_abs:n {#1} }
}
{ \@@_exponent_shift_up:nnn {#1} {#2} {#3} }
}
}
\cs_generate_variant:Nn \@@_exponent_shift_up_aux:nnn { ee }
% \end{macrocode}
% If the shift has put digits into the integer part, we have to adjust the
% uncertainty accordingly. First, we grab the data, then adjust by the
% number of places that have been transferred.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_shift_uncert:nw
#1#2 \@@_exponent_uncert:n #3
{
\tl_if_blank:nTF {#3}
{
#2
\@@_exponent_uncert:n { }
}
{
\str_if_eq:nnTF {#3} { 0 }
{
#2
\@@_exponent_uncert:n { { S } { 0 } }
}
{
\@@_exponent_shift_uncert_S:ennn
{ \prg_replicate:nn {#1} { 0 } }
{#2}
#3
}
}
}
\cs_new:Npn \@@_exponent_shift_uncert_S:nnnn #1#2#3#4
{
#2
\@@_exponent_uncert:n { { S } { #4#1 } }
}
\cs_generate_variant:Nn \@@_exponent_shift_uncert_S:nnnn { e }
\cs_new:Npn \@@_exponent_uncert:n #1 { { \exp_not:n {#1} } }
% \end{macrocode}
% Tidy up the exponent to put the sign in the right place.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_finalise:n #1
{
\int_compare:nNnTF {#1} < 0
{ { - } }
{ { } }
{ \int_abs:n {#1} }
}
% \end{macrocode}
% This could (and eventually will) be combined with the main function above:
% that will need \texttt{e}-type expansion. The input has already been
% normalised such that the integer part is in the range $1 \le n < 10$.
% Thus there are only three cases to deal with, depending on the required
% adjustment to the exponent.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_engineering_aux:nnnnnnn #1#2#3#4#5#6#7
{
\exp_not:n { {#1} {#2} }
\use:c
{
@@_exponent_engineering_
\int_compare:nNnTF {#6#7} < 0
{
\int_case:nnF { \int_mod:nn { #7 } { 3 } }
{
{ 1 } { 2 }
{ 2 } { 1 }
}
{ 0 }
}
{ \int_mod:nn {#7} { 3 } }
:nnnn
}
{#3} {#4} {#5} {#6#7}
}
\cs_new:cpn { @@_exponent_engineering_0:nnnn } #1#2#3#4
{
\exp_not:n { {#1} {#2} {#3} }
\@@_exponent_finalise:n {#4}
}
\cs_new:cpn { @@_exponent_engineering_1:nnnn } #1#2#3#4
{
\tl_if_blank:nTF {#2}
{
{ \exp_not:n { #1 0 } } { }
{ \@@_exponent_engineering_uncert:nn {#3} { 0 } }
}
{
{ \exp_not:n {#1} \exp_not:o { \tl_head:w #2 \q_stop } }
{ \tl_tail:n {#2} }
{ \exp_not:n {#3} }
}
\@@_exponent_finalise:n { #4 - 1 }
}
\cs_new:cpn { @@_exponent_engineering_2:nnnn } #1#2#3#4
{
\tl_if_blank:nTF {#2}
{
{ \exp_not:n { #1 00 } } { }
{ \@@_exponent_engineering_uncert:nn {#3} { 00 } }
}
{ \@@_exponent_engineering:nnNw {#1} {#3} #2 \q_stop }
\@@_exponent_finalise:n { #4 - 2 }
}
\cs_new:Npn \@@_exponent_engineering:nnNw #1#2#3#4 \q_stop
{
\tl_if_blank:nTF {#4}
{
{ \exp_not:n { #1#3 0 } } { }
{ \@@_exponent_engineering_uncert:nn {#2} { 0 } }
}
{
{ \exp_not:n {#1#3} \exp_not:o { \tl_head:w #4 \q_stop } }
{ \tl_tail:n {#4} }
{ \exp_not:n {#2} }
}
}
\cs_new:Npn \@@_exponent_engineering_uncert:nn #1#2
{
\tl_if_blank:nF {#1}
{
\use:c { @@_exponent_engineering_uncert_ \use_i:nn #1 :nnn }
#1 {#2}
}
}
\cs_new:Npn \@@_exponent_engineering_uncert_S:nnn #1#2#3
{
{ S }
{
\exp_not:n {#2}
\str_if_eq:nnF {#2} { 0 } {#3}
}
}
% \end{macrocode}
% To branch here we need to work out the scientific notation form.
% \begin{macrocode}
\cs_new:Npn \@@_exponent_threshold:nnnnnnn #1#2#3#4#5#6#7
{
\@@_exponent_threshold:en
{
\@@_exponent_scientific:nnnnnnn
{#1} {#2} {#3} {#4} {#5} {#6} {#7}
}
{ {#1} {#2} {#3} {#4} {#5} {#6} {#7} }
}
\cs_new:Npn \@@_exponent_threshold:nn #1#2
{ \@@_exponent_threshold:nnnnnnnn #1 {#2} }
\cs_generate_variant:Nn \@@_exponent_threshold:nn { e }
\cs_new:Npn \@@_exponent_threshold:nnnnnnnn #1#2#3#4#5#6#7#8
{
\bool_lazy_and:nnTF
{ \int_compare_p:nNn {#6#7} > \l_@@_lower_threshold_int }
{ \int_compare_p:nNn {#6#7} < \l_@@_upper_threshold_int }
{ \exp_not:n {#8} }
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_digits:NN}
% \begin{macro}[EXP]{\@@_digits:nnnnnnn}
% \begin{macro}[EXP]{\@@_digits:nn}
% \begin{macro}[EXP]{\@@_digits_uncert:nnw}
% \begin{macro}[EXP]
% {\@@_digits_uncert_A:nn, \@@_digits_uncert_S:nn, \@@_digits_uncert_aux:nn}
% \begin{macro}[EXP]{\@@_digits_uncert_A:nnn}
% \begin{macro}[EXP]{\@@_digits_uncert:nN}
% \begin{macro}[EXP]{\@@_digits_uncert:nNw}
% Forcing a minimum number of digits in each part is quite easy. As
% the common case is that we don't do anything here, there is no real need
% to optimise the calculation (normally also numbers have only a few digits).
% \begin{macrocode}
\cs_new_protected:Npn \@@_digits:NN #1#2
{
\tl_set:Nx #2
{ \exp_after:wN \@@_digits:nnnnnnn #1 }
}
\cs_new:Npn \@@_digits:nnnnnnn #1#2#3#4#5#6#7
{
\exp_not:n { {#1} {#2} }
{
\@@_digits:nn \l_@@_min_integer_int {#3}
\exp_not:n {#3}
}
{
\exp_not:n {#4}
\@@_digits:nn \l_@@_min_decimal_int {#4}
}
{
\tl_if_blank:nF {#5}
{ \@@_digits_uncert:nnw {#4} #5 \q_stop }
}
\exp_not:n { {#6} {#7} }
}
\cs_new:Npn \@@_digits:nn #1#2
{
\int_compare:nNnT
{ #1 - \tl_count:n {#2} } > 0
{ \prg_replicate:nn { #1 - \tl_count:n {#2} } { 0 } }
}
\cs_new:Npn \@@_digits_uncert:nnw #1#2#3 \q_stop
{
{ #2 }
\cs_if_exist:cTF { @@_digits_uncert_ #2 :nn }
{ { \use:c { @@_digits_uncert_ #2 :nn } {#1} {#3} } }
{
\@@_digits_uncert:nN {#1} #2 \q_recursion_tail
#3 \q_recursion_stop
}
}
\cs_new:Npn \@@_digits_uncert_A:nn #1#2
{ \@@_digits_uncert_A:nnn {#1} #2 }
\cs_new:Npn \@@_digits_uncert_A:nnn #1#2#3
{
{ \@@_digits_uncert_aux:nn {#1} {#2} }
{ \@@_digits_uncert_aux:nn {#1} {#3} }
}
\cs_new:Npn \@@_digits_uncert_S:nn #1#2
{ \@@_digits_uncert_aux:nn {#1} {#2} }
\cs_new:Npn \@@_digits_uncert_aux:nn #1#2
{
\exp_not:n {#2}
\@@_digits:nn
{
\int_max:nn
{ 0 }
{ \l_@@_min_decimal_int - \tl_count:n {#1} + 1 }
}
{#2}
}
\cs_new:Npn \@@_digits_uncert:nN #1#2
{
\quark_if_recursion_tail_stop:N #2
\@@_digits_uncert:nNw {#1} #2
}
\cs_new:Npn \@@_digits_uncert:nNw #1#2#3 \q_recursion_tail #4
{
{ \use:c { @@_digits_uncert_ #2 :nn } {#1} {#4} }
\@@_digits_uncert:nN {#1} #3 \q_recursion_tail
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_drop_exponent:NN}
% \begin{macro}[EXP]{\@@_drop_exponent:nnnnnnn}
% Simple stripping of the exponent.
% \begin{macrocode}
\cs_new_protected:Npn \@@_drop_exponent:NN #1#2
{
\bool_if:NT \l_@@_drop_exponent_bool
{
\str_if_eq:VnT \l_@@_exponent_mode_tl { input }
{ \msg_warning:nn { siunitx } { ambiguous-dropped-exponent } }
\tl_set:Nx #2
{ \exp_after:wN \@@_drop_exponent:nnnnnnn #1 }
}
}
\cs_new:Npn \@@_drop_exponent:nnnnnnn #1#2#3#4#5#6#7
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} { } { 0 } } }
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_drop_uncertainty:NN}
% \begin{macro}[EXP]{\@@_drop_uncertainty:nnnnnnn}
% Simple stripping of the uncertainty.
% \begin{macrocode}
\cs_new_protected:Npn \@@_drop_uncertainty:NN #1#2
{
\bool_if:NTF \l_@@_drop_uncertainty_bool
{
\tl_set:Nx #2
{ \exp_after:wN \@@_drop_uncertainty:nnnnnnn #1 }
}
{ \tl_set_eq:NN #2 #1 }
}
\cs_new:Npn \@@_drop_uncertainty:nnnnnnn #1#2#3#4#5#6#7
{ \exp_not:n { {#1} {#2} {#3} {#4} { } {#6} {#7} } }
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_round:NN}
% \begin{macro}[EXP]{\@@_round:nnnnnnn}
% Rounding is at the top level simple enough: fire off the expandable
% set up which does the work.
% \begin{macrocode}
\cs_new_protected:Npn \@@_round:NN #1#2
{
\tl_set:Nx #2
{
\str_if_eq:VnTF \l_@@_round_mode_tl { none }
{ \exp_not:V #1 }
{ \exp_after:wN \@@_round:nnnnnnn #1 }
}
}
\cs_new:Npn \@@_round:nnnnnnn #1#2#3#4#5#6#7
{
\str_if_eq:nnTF {#4} { \empty }
{ \use:c { @@_round_ \l_@@_round_mode_tl :nnnnnnn } {#1} {#2} {#3} { } }
{ \use:c { @@_round_ \l_@@_round_mode_tl :nnnnnnn } {#1} {#2} {#3} {#4} }
{#5} {#6} {#7}
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round:nnn, \@@_round:enn}
% \begin{macro}[EXP]{\@@_round:nnnn, \@@_round:Vnnn}
% \begin{macro}[EXP]
% {
% \@@_round_auxi:nnnnN ,
% \@@_round_auxii:nnnnN ,
% \@@_round_auxiii:nnnnN ,
% \@@_round_auxiii:ennnN ,
% \@@_round_auxiv:nnnnN ,
% \@@_round_auxiv:ennnN
% }
% \begin{macro}[EXP]{\@@_round_auxv:nnnN, \@@_round_auxvi:nnnN}
% \begin{macro}[EXP]{\@@_round_auxvii:nnnTF}
% \begin{macro}[EXP]{\@@_round_auxviii:nnN, \@@_round_auxix:nnN}
% \begin{macro}[EXP]{\@@_round_final_integer:nnw, \@@_round_final_decimal:nnw}
% \begin{macro}[EXP]
% {\@@_round_final_significant:n, \@@_round_final_significant:e}
% \begin{macro}[EXP]{\@@_round_final_significant:N}
% \begin{macro}[EXP]{\@@_round_final_significant:w}
% \begin{macro}[EXP]
% {
% \@@_round_final_output:nn ,
% \@@_round_final_output:ne ,
% \@@_round_final_output:en ,
% \@@_round_final_output:ee
% }
% \begin{macro}[EXP]{\@@_round_final:nn, \@@_round_final:en}
% \begin{macro}[EXP]
% {
% \@@_round_final_shift:nn ,
% \@@_round_final_shift:en ,
% \@@_round_final_shift:ee
% }
% \begin{macro}[EXP]{\@@_round_final_shift:Nw}
% \begin{macro}[EXP]
% {
% \@@_round_engineering:nn ,
% \@@_round_fixed:nn ,
% \@@_round_input:nn ,
% \@@_round_scientific:nn
% }
% \begin{macro}[EXP]{\@@_round_engineering:NNNNn}
% \begin{macro}[EXP]{\@@_round_engineering:nnN, \@@_round_engineering:VnN}
% \begin{macro}[EXP]{\@@_round_truncate:n, \@@_round_truncate_direct:n}
% \begin{macro}[EXP]{\@@_round_truncate:nnN}
% Actually doing the rounding needs us to work from the least significant
% digit, so we start by reversing the input. We \emph{could} also drop
% digits in this phase, but tracking everything would be horrible, so
% we go slightly slower but clearer and split the steps. First we reverse
% the decimal part, then the integer.
% \begin{macrocode}
\cs_new:Npn \@@_round:nnn #1#2#3
{
\@@_round:Vnnn \l_@@_round_dir_tl
{#1} {#2} {#3}
}
\cs_generate_variant:Nn \@@_round:nnn { e }
\cs_new:Npn \@@_round:nnnn #1#2#3#4
{
\@@_round_auxi:nnnnN {#1} {#2} {#3} { }
#4 \q_recursion_tail \q_recursion_stop
}
\cs_generate_variant:Nn \@@_round:nnnn { V }
\cs_new:Npn \@@_round_auxi:nnnnN #1#2#3#4#5
{
\quark_if_recursion_tail_stop_do:Nn #5
{
\@@_round_auxii:nnnnN {#1} {#2} {#4} { } #3
\q_recursion_tail \q_recursion_stop
}
\@@_round_auxi:nnnnN {#1} {#2} {#3} {#5#4}
}
\cs_new:Npn \@@_round_auxii:nnnnN #1#2#3#4#5
{
\quark_if_recursion_tail_stop_do:Nn #5
{
\tl_if_blank:nTF {#3}
{
\@@_round_auxiv:nnnnN {#2} {#1} { } { } #4
\q_recursion_tail \q_recursion_stop
}
{
\@@_round_auxiii:nnnnN {#2} {#1} {#4} { } #3
\q_recursion_tail \q_recursion_stop
}
}
\@@_round_auxii:nnnnN {#1} {#2} {#3} {#5#4}
}
% \end{macrocode}
% We now have the input reversed plus how many digits we need to discard
% (|#1|). We have two functions, one which deals with the decimal part,
% one of which deals with the integer. In the latter, we should never hit
% the end before we've dropped all the digits: the fixed-zero is a
% fall-back in case something weird happens. For the integer case, we need
% to collect up zeros to pad the length back out correctly later. We also
% have to cover the case where we round to exactly place above the length
% of the integer: that may product a value of $1\dots$: we tidy up the
% case where it comes out as $0$ later.
% \begin{macrocode}
\cs_new:Npn \@@_round_auxiii:nnnnN #1#2#3#4#5
{
\quark_if_recursion_tail_stop_do:Nn #5
{
\@@_round_auxiv:nnnnN {#1} {#2} { } {#4} #3
\q_recursion_tail \q_recursion_stop
}
\int_compare:nNnTF {#1} > 0
{
\@@_round_auxiii:ennnN
{ \int_eval:n { #1 - 1 } } {#2} {#3} { #5#4 }
}
{ \@@_round_auxv:nnnN {#2} {#4} {#3} #5 }
}
\cs_generate_variant:Nn \@@_round_auxiii:nnnnN { e }
\cs_new:Npn \@@_round_auxiv:nnnnN #1#2#3#4#5
{
\quark_if_recursion_tail_stop_do:Nn #5
{
\int_compare:nNnTF {#1} = 0
{
\@@_round_auxvi:nnnN {#2} {#4} {#3}
0 \q_recursion_tail \q_recursion_stop
}
{ { 0 } { } }
}
\int_compare:nNnTF {#1} > 0
{
\@@_round_auxiv:ennnN
{ \int_eval:n { #1 - 1 } } {#2} { #3 0 } { #5#4 }
}
{ \@@_round_auxvi:nnnN {#2} {#4} {#3} #5 }
}
\cs_generate_variant:Nn \@@_round_auxiv:nnnnN { e }
% \end{macrocode}
% We now have the discarded digits, the matching filler and the
% next digit. So we can make the decision on rounding: that
% is handled by a common auxiliary.
% \begin{macrocode}
\cs_new:Npn \@@_round_auxv:nnnN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4
{
\@@_round_auxvi:nnnN
{#1} {#2} { } #3 \q_recursion_tail \q_recursion_stop
}
\@@_round_auxvii:nnnTF {#1} {#2} {#4}
{ \@@_round_final_decimal:nnw }
{ \@@_round_auxviii:nnN }
{#3} { } #4
}
\cs_new:Npn \@@_round_auxvi:nnnN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4
{ { 0 } { } }
\@@_round_auxvii:nnnTF {#1} {#2} {#4}
{ \@@_round_final_integer:nnw }
{ \@@_round_auxix:nnN }
{ } {#3} #4
}
% \end{macrocode}
% For rounding up or down, the decision here is easy: pick the appropriate
% branch. For rounding to nearest, we need to deal with the half-even rule:
% it can only apply at this stage, when the \emph{discarded} value can
% be exactly half.
% \begin{macrocode}
\cs_new:Npn \@@_round_auxvii:nnnTF #1#2#3
{
\str_case:nnF {#1}
{
{ down } { \use_i:nn }
{ up } { \use_ii:nn }
}
{
\bool_lazy_or:nnTF
{ \int_compare_p:nNn { 0 \tl_head:n {#2} } < 5 }
{
\bool_lazy_all_p:n
{
{ \l_@@_round_half_even_bool }
{ ! \int_if_odd_p:n {#3} }
{ \@@_round_if_half_p:n {#2} }
}
}
}
}
% \end{macrocode}
% The main rounding routines. These are only every called when there is
% rounding to do, so there is no need to carry a flag forward. Thus the
% question to ask is simple: is the next value a $9$ or not (as that
% continues the sequence). There is a general need to handle the case
% where a zero is rounded up: that automatically means a need to trim
% the other end.
% \begin{macrocode}
\cs_new:Npn \@@_round_auxviii:nnN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3
{
\str_if_eq:nnTF {#1} { 0 }
{
\@@_round_final_output:ne
{ 1 }
{ \@@_round_truncate:n {#2} }
}
{
\@@_round_auxix:nnN {#2} { } #1
\q_recursion_tail \q_recursion_stop
}
}
\int_compare:nNnTF {#3} = 9
{ \@@_round_auxviii:nnN {#1} { 0 #2 } }
{
\int_compare:nNnTF {#3} = 0
{
\bool_lazy_or:nnTF
{ \tl_if_blank_p:n {#1} }
{ \int_compare_p:nNn {#1} = { 0 } }
{
\@@_round_final_decimal:nnw
{#1} { 1 \@@_round_truncate:n {#2} }
}
{
\@@_round_final_decimal:nnw
{#1} { 1 #2 }
}
}
{
\@@_round_final:en
{ \int_eval:n { #3 + 1 } }
{ \@@_round_final_decimal:nnw {#1} {#2} }
}
}
}
\cs_new:Npn \@@_round_auxix:nnN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3
{
\tl_if_blank:nTF {#1}
{
\@@_round_final_shift:en
{ 1 \@@_round_truncate_direct:n {#2} 0 }
{ }
}
{
\@@_round_final_shift:ee
{ 1 #2 }
{ \@@_round_truncate:n {#1} }
}
}
\int_compare:nNnTF {#3} = 9
{ \@@_round_auxix:nnN {#1} { 0 #2 } }
{
\@@_round_final:en
{ \int_eval:n { #3 + 1 } }
{ \@@_round_final_integer:nnw {#1} {#2} }
}
}
% \end{macrocode}
% Tidying up means grabbing the remaining digits and undoing the reversal.
% \begin{macrocode}
\cs_new:Npn \@@_round_final_decimal:nnw
#1#2#3 \q_recursion_tail \q_recursion_stop
{
\@@_round_final_output:ee
{ \tl_reverse:n {#1} }
{ \tl_reverse:n {#3} #2 }
}
\cs_new:Npn \@@_round_final_integer:nnw
#1#2#3 \q_recursion_tail \q_recursion_stop
{
\@@_round_final_output:en
{ \@@_round_final_significant:e { \tl_reverse:n {#3} #2 } }
{#1}
}
\cs_new:Npn \@@_round_final_significant:n #1
{
\@@_round_final_significant:N #1
\q_recursion_tail \q_recursion_stop
}
\cs_generate_variant:Nn \@@_round_final_significant:n { e }
\cs_new:Npn \@@_round_final_significant:N #1
{
\quark_if_recursion_tail_stop_do:Nn #1 { 0 }
\int_compare:nNnTF {#1} = 0
{ \@@_round_final_significant:N }
{
#1
\@@_round_final_significant:w
}
}
\cs_new:Npn \@@_round_final_significant:w
#1 \q_recursion_tail \q_recursion_stop
{#1}
\cs_new:Npn \@@_round_final_output:nn #1#2 { {#1} {#2} }
\cs_generate_variant:Nn \@@_round_final_output:nn { ne , e , ee }
\cs_new:Npn \@@_round_final:nn #1#2
{ #2 #1 }
\cs_generate_variant:Nn \@@_round_final:nn { e }
% \end{macrocode}
% Here we deal with the case where rounding applies along with an
% exponent set based on number of places. We can only get here if an
% additional integer digit has been added, so there is no need to test for
% that. There are two cases for action: when using |scientific| mode, where
% we always need to shift by one, and when using |engineering| mode if
% we now have four digits. The latter is a bit more work: we need to trim
% digits off as required.
% \begin{macrocode}
\cs_new:Npn \@@_round_final_shift:nn #1#2
{
\bool_lazy_or:nnTF
{ \str_if_eq_p:Vn \l_@@_round_mode_tl { figures } }
{ \str_if_eq_p:Vn \l_@@_round_mode_tl { places } }
{
\use:c
{ @@_round_ \l_@@_exponent_mode_tl :nn }
{#1} {#2}
}
{ {#1} {#2} }
}
\cs_generate_variant:Nn \@@_round_final_shift:nn { en , ee }
\cs_new:Npn \@@_round_engineering:nn #1#2
{
\int_compare:nNnTF { \tl_count:n {#1} } = 4
{
\bool_lazy_and:nnTF
{ \int_compare_p:nNn \l_@@_round_precision_int = 1 }
{ \str_if_eq_p:Vn \l_@@_round_mode_tl { figures } }
{ { 1 } { } }
{ \@@_round_engineering:NNNNn #1 {#2} }
\@@_round_final_shift:Nw 3
}
{ {#1} {#2} }
}
\cs_new:Npn \@@_round_engineering:NNNNn #1#2#3#4#5
{
{#1}
\@@_round_engineering:VnN
\l_@@_round_precision_int { }
#2#3#4#5 \q_recursion_tail \q_recursion_stop
}
\cs_new:Npn \@@_round_engineering:nnN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3 { {#2} }
\int_compare:nNnTF {#1} = { 0 }
{ \use_i_delimit_by_q_recursion_stop:nw { {#2} } }
{ \@@_round_engineering:nnN { #1 - 1 } { #2#3 } }
}
\cs_generate_variant:Nn \@@_round_engineering:nnN { V }
\cs_new:Npn \@@_round_fixed:nn #1#2 { {#1} {#2} }
\cs_new:Npn \@@_round_input:nn #1#2 { {#1} {#2} }
\cs_new:Npn \@@_round_scientific:nn #1#2
{
\bool_lazy_and:nnTF
{ \int_compare_p:nNn \l_@@_round_precision_int = 1 }
{ \str_if_eq_p:Vn \l_@@_round_mode_tl { figures } }
{ { 1 } { } }
{
\@@_exponent_shift:nne
{ 1 } {#1} { \@@_round_truncate_direct:n {#2} }
}
\@@_round_final_shift:Nw 1
}
\cs_new:Npn \@@_round_final_shift:Nw #1#2 \@@_round_end:nnn #3#4#5
{
\exp_not:n { {#3} }
\@@_exponent_finalise:n { #4#5 + #1 }
}
% \end{macrocode}
% When we have rounded up to the next power of ten, we need to go back and
% remove one more digit. That only happens when rounding to a number of
% figures or when dealing with an integer part.
% \begin{macrocode}
\cs_new:Npn \@@_round_truncate:n #1
{
\str_if_eq:VnTF \l_@@_round_mode_tl { figures }
{ \@@_round_truncate_direct:n {#1} }
{#1}
}
\cs_new:Npn \@@_round_truncate_direct:n #1
{
\@@_round_truncate:nnN { } { }
#1 \q_recursion_tail \q_recursion_stop
}
\cs_new:Npn \@@_round_truncate:nnN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3 { #1 }
\@@_round_truncate:nnN {#1#2} {#3}
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_if_half_p:n}
% \begin{macro}[EXP]{\@@_round_if_half:N}
% A simple test for a valuing being exactly half: we can only test
% digit-by-digit as there is no limit on the size of the value given.
% \begin{macrocode}
\prg_new_conditional:Npnn \@@_round_if_half:n #1 { p }
{
\int_compare:nNnTF { \tl_head:n { #1 0 } } = 5
{
\exp_after:wN \@@_round_if_half:N \use_none:n #1 0
\q_recursion_tail \q_recursion_stop
}
{ \prg_return_false: }
}
\cs_new:Npn \@@_round_if_half:N #1
{
\quark_if_recursion_tail_stop_do:Nn #1
{ \prg_return_true: }
\int_compare:nNnTF {#1} = 0
{ \@@_round_if_half:N }
{ \use_i_delimit_by_q_recursion_stop:nw { \prg_return_false: } }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_pad:nnn}
% The case where we are short of digits is easy enough to handle:
% generate zeros to pad it out.
% \begin{macrocode}
\cs_new:Npn \@@_round_pad:nnn #1#2#3
{
{#2}
{
#3
\bool_if:NT \l_@@_round_pad_bool
{ \prg_replicate:nn {#1} { 0 } }
}
}
% \end{macrocode}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_end:nnn}
% Used as a marker to allow adjustment when we pass a power of ten.
% \begin{macrocode}
\cs_new:Npn \@@_round_end:nnn #1#2#3 { \exp_not:n { {#1} {#2} {#3} } }
% \end{macrocode}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_figures:nnnnnnn, \@@_round_figures_aux:nnnnnnn}
% \begin{macro}[EXP]{\@@_round_figures_count:nnN}
% \begin{macro}[EXP]
% {\@@_round_figures_count:nnnN, \@@_round_figures_count:ennN}
% Rounding to figures only makes sense if the number is not $0$, so we start
% by filtering out that case. We then check that
% there is no uncertainty, and that the number of figures requested is
% positive: if not, the result is always fixed at zero.
% \begin{macrocode}
\cs_new:Npn \@@_round_figures:nnnnnnn #1#2#3#4#5#6#7
{
\bool_lazy_and:nnTF
{ \str_if_eq_p:nn {#3} { 0 } }
{
\str_if_eq_p:ee
{ \exp_not:n {#4} } { \prg_replicate:nn { \tl_count:n {#4} } { 0 } }
}
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
{ \@@_round_figures_aux:nnnnnnn {#1} {#2} {#3} {#4} {#5} {#6} {#7} }
}
\cs_new:Npn \@@_round_figures_aux:nnnnnnn #1#2#3#4#5#6#7
{
\tl_if_blank:nTF {#5}
{
\int_compare:nNnTF \l_@@_round_precision_int > 0
{
\exp_not:n { {#1} {#2} }
\@@_round_figures_count:nnN {#3} {#4} #3#4
\q_recursion_tail \q_recursion_stop
\@@_round_end:nnn { } {#6} {#7}
}
{ { } { } { 0 } { } { } { } { 0 } }
}
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
}
% \end{macrocode}
% The first real step is to count up the number of significant figures.
% The only tricky issue here is dealing with leading zeros.
% \begin{macrocode}
\cs_new:Npn \@@_round_figures_count:nnN #1#2#3
{
\quark_if_recursion_tail_stop_do:Nn #3
{ { } { } { 0 } { } { } { } { 0 } }
\int_compare:nNnTF {#3} = 0
{ \@@_round_figures_count:nnN {#1} {#2} }
{ \@@_round_figures_count:nnnN { 1 } {#1} {#2} }
}
\cs_new:Npn \@@_round_figures_count:nnnN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4
{
\int_compare:nNnTF {#1} > \l_@@_round_precision_int
{
\@@_round:enn
{ \int_eval:n { #1 - \l_@@_round_precision_int } }
{#2} {#3}
}
{
\@@_round_pad:nnn
{ \l_@@_round_precision_int - (#1) } {#2} {#3}
}
}
\@@_round_figures_count:ennN
{ \int_eval:n { #1 + 1 } } {#2} {#3}
}
\cs_generate_variant:Nn \@@_round_figures_count:nnnN { e }
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_places:nnnnnnn}
% \begin{macro}[EXP]{\@@_round_places_decimal:nn, \@@_round_places_integer:nn}
% \begin{macro}[EXP]{\@@_round_places_finalise:n, \@@_round_places_finalise:e}
% \begin{macro}[EXP]{\@@_round_places_finalise:nnnnnnn}
% \begin{macro}[EXP]{\@@_round_places_finalise:nnnnn}
% The first step when rounding to a fixed number of places is to establish
% if this is in the decimal or integer parts. The two require different
% calculations for how many digits to drop from the input. The no-op end
% function here is to allow tidying up in some cases: see the finalisation
% of rounding.
% \begin{macrocode}
\cs_new:Npn \@@_round_places:nnnnnnn #1#2#3#4#5#6#7
{
\tl_if_blank:nTF {#5}
{
\@@_round_places_finalise:e
{
\exp_not:n { {#1} {#2} }
\int_compare:nNnTF \l_@@_round_precision_int > 0
{ \@@_round_places_decimal:nn }
{ \@@_round_places_integer:nn }
{#3} {#4}
\@@_round_end:nnn { } {#6} {#7}
}
}
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
}
\cs_new:Npn \@@_round_places_decimal:nn #1#2
{
\int_compare:nNnTF
{ \l_@@_round_precision_int - 0 \tl_count:n {#2} } > 0
{
\@@_round_pad:nnn
{ \l_@@_round_precision_int - 0 \tl_count:n {#2} }
{#1} {#2}
}
{
\@@_round:enn
{
\int_eval:n
{ 0 \tl_count:n {#2} - \l_@@_round_precision_int }
}
{#1} {#2}
}
}
\cs_new:Npn \@@_round_places_integer:nn #1#2
{
\@@_round:enn
{
\int_eval:n
{ 0 \tl_count:n {#2} - \l_@@_round_precision_int }
}
{#1} {#2}
}
% \end{macrocode}
% To finalise rounding to places, we have to worry about a minimum value:
% that is basically a case of looking for value of zero and rearranging. We
% also need to worry about a \enquote{negative zero} arising.
% \begin{macrocode}
\cs_new:Npn \@@_round_places_finalise:n #1
{ \@@_round_places_finalise:nnnnnnn #1 }
\cs_new:Npn \@@_round_places_finalise:nnnnnnn #1#2#3#4#5#6#7
{
\str_if_eq:eeTF
{ \exp_not:n {#3#4} }
{ \prg_replicate:nn { \tl_count:n {#3#4} } { 0 } }
{
\tl_if_empty:NTF \l_@@_round_min_tl
{
\exp_not:n { {#1} }
{
\bool_lazy_and:nnF
{ \l_@@_round_positive_bool }
{ \str_if_eq_p:nn {#2} { - } }
{ \exp_not:n {#2} }
}
\exp_not:n { {#3} {#4} {#5} {#6} {#7} }
}
{
\exp_after:wN \@@_round_places_finalise:nnnnn
\l_@@_round_min_tl {#2} {#6} {#7}
}
}
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
}
\cs_generate_variant:Nn \@@_round_places_finalise:n { e }
\cs_new:Npn \@@_round_places_finalise:nnnnn #1#2#3#4#5
{
{
\str_if_eq:nnTF {#3} { - }
{ > }
{ < }
}
\exp_not:n { {#3} {#1} {#2} { } {#4} {#5} }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}[EXP]{\@@_round_uncertainty:nnnnnnn}
% \begin{macro}[EXP]{\@@_round_uncertainty:nnn, \@@_round_uncertainty:nno}
% \begin{macro}[EXP]
% {\@@_round_uncertainty:nnnn, \@@_round_uncertainty:ennn}
% \begin{macro}[EXP]{\@@_round_uncertainty:nnnnnn}
% \begin{macro}[EXP]
% {
% \@@_round_uncertainty_auxi:nnnnn ,
% \@@_round_uncertainty_auxii:nnnnn
% }
% \begin{macro}[EXP]
% {
% \@@_round_uncertainty_auxiii:nnnnnnn ,
% \@@_round_uncertainty_auxiii:eennnnn
% }
% \begin{macro}[EXP]{\@@_round_uncertainty_zeros:nnnn}
% \begin{macro}[EXP]
% {
% \@@_round_uncertainty_auxiv:nnnnnnN ,
% \@@_round_uncertainty_auxiv:nennnnN ,
% \@@_round_uncertainty_auxiv:ennnnnN ,
% \@@_round_uncertainty_auxiv:eennnnN
% }
% \begin{macro}[EXP]{\@@_round_uncertainty_auxv:nnnN}
% \begin{macro}[EXP]{\@@_round_uncertainty_auxvi:nn}
% \begin{macro}[EXP]{\@@_round_uncertainty_auxvii:nnNnnn}
% \begin{macro}[EXP]
% {
% \@@_round_uncertainty_engineering:nnn ,
% \@@_round_uncertainty_fixed:nnn ,
% \@@_round_uncertainty_input:nnn ,
% \@@_round_uncertainty_scientific:nnn ,
% \@@_round_uncertainty_threshold:nnn
% }
% \begin{macro}[EXP]
% {
% \@@_round_uncertainty_engineering_2:n ,
% \@@_round_uncertainty_engineering_3:n ,
% \@@_round_uncertainty_engineering_4:n
% }
% Rounding to an uncertainty can only happen where the result will have some
% uncertainty left: otherwise we simply drop the uncertainty entirely. Only
% |S|-type uncertainties can be used for rounding.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty:nnnnnnn #1#2#3#4#5#6#7
{
\bool_lazy_or:nnTF
{ \tl_if_blank_p:n {#5} }
{ ! \int_compare_p:nNn \l_@@_round_precision_int > 0 }
{ \exp_not:n { {#1} {#2} {#3} {#4} { } {#6} {#7} } }
{
\str_if_eq:eeTF { \tl_head:n {#5} } { S }
{
\exp_not:n { {#1} {#2} }
\@@_round_uncertainty:nno
{#3} {#4} { \use_ii:nn #5 }
{#6} {#7}
}
{ \exp_not:n { {#1} {#2} {#3} {#4} {#5} {#6} {#7} } }
}
}
% \end{macrocode}
% Round the uncertainty first: this is needed to get the number of places
% correct. Once that is done, it's just a question of working out the digits
% in the main part.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty:nnn #1#2#3
{
\@@_round_uncertainty:ennn
{
\int_eval:n
{ \tl_count:n {#3} - \l_@@_round_precision_int }
}
{#1} {#2} {#3}
}
\cs_generate_variant:Nn \@@_round_uncertainty:nnn { nno }
\cs_new:Npn \@@_round_uncertainty:nnnn #1#2#3#4
{
\use:e
{
\exp_not:N \@@_round_uncertainty:nnnnnn
\@@_round:Vnnn
\l_@@_round_uncert_dir_tl {#1} { } {#4}
{#2} {#3} {#1} {#4}
}
}
\cs_generate_variant:Nn \@@_round_uncertainty:nnnn { e }
% \end{macrocode}
% The number of digits to remove from the main part and the detail of
% zero filling depends on whether we rounded up the uncertainty. So there
% is a split here.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty:nnnnnn #1#2#3#4#5#6
{
\tl_if_blank:nTF {#1}
{ \@@_round_uncertainty_auxi:nnnnn }
{ \@@_round_uncertainty_auxii:nnnnn }
{#2} {#3} {#4} {#5} {#6}
}
% \end{macrocode}
% The simple case: just round to the same number of digits and do zero
% filling.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty_auxi:nnnnn #1#2#3#4#5
{
\@@_round_uncertainty_auxiv:ennnnnN
{ \@@_round_uncertainty_zeros:nnnn {#1} {#3} {#4} {#5} }
{#4}
{#2} {#3} {#1} { }
\@@_round_uncertainty_auxvi:nn
}
% \end{macrocode}
% When the uncertainty rounds up, zero filling is dependent on whether we
% cross the boundary for the integer part.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty_auxii:nnnnn #1#2#3#4#5
{
\@@_round_uncertainty_auxiii:eennnnn
{ \tl_count:n {#5} }
{ \tl_count:n {#3} }
{#1} {#2} {#3} {#4} {#5}
}
\cs_new:Npn \@@_round_uncertainty_auxiii:nnnnnnn #1#2#3#4#5#6#7
{
\int_compare:nNnTF {#1} < { #2 + 1 }
{
\bool_lazy_and:nnTF
{ \int_compare_p:nNn \l_@@_round_precision_int = 2 }
{ \int_compare_p:nNn {#1} = {#2} }
{ \@@_round_uncertainty_auxiv:nennnnN { 0 } }
{ \@@_round_uncertainty_auxiv:nennnnN { } }
{ \int_eval:n { #6 + 1 } }
{#4} {#5} { 1 } { }
\@@_round_uncertainty_auxvii:nnNnnn
}
{
\@@_round_uncertainty_auxiv:eennnnN
{ \@@_round_uncertainty_zeros:nnnn {#3} {#5} {#6} {#7} }
{ \int_eval:n { #6 + 1 } }
{#4} {#5} { 1 } {#3}
\@@_round_uncertainty_auxvii:nnNnnn
}
}
\cs_generate_variant:Nn \@@_round_uncertainty_auxiii:nnnnnnn { ee }
\cs_new:Npn \@@_round_uncertainty_zeros:nnnn #1#2#3#4
{
\prg_replicate:nn
{
\int_max:nn
{
\tl_if_blank:nTF {#2}
{ #3 }
{
( \tl_count:n {#4} - \tl_count:n {#2} )
- \tl_count:n {#1}
}
}
{ 0 }
}
{ 0 }
}
% \end{macrocode}
% Back together for the business end. If there has been a shift, we may need
% to tidy up.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty_auxiv:nnnnnnN #1#2#3#4#5#6#7
{
\use:e
{
\exp_not:N \@@_round_uncertainty_auxv:nnnN
\@@_round:nnn {#2} {#3} {#4}
}
{#3} #7
\@@_round_end:nnn { { S } { #5#6 #1 } }
}
\cs_generate_variant:Nn \@@_round_uncertainty_auxiv:nnnnnnN { ne , e , ee }
\cs_new:Npn \@@_round_uncertainty_auxv:nnnN #1#2#3#4
{
\int_compare:nNnT { \tl_count:n {#1} } > { \tl_count:n {#3} }
{ #4 }
{#1} {#2}
}
\cs_new:Npn \@@_round_uncertainty_auxvi:nn #1#2
{ \use:c { @@_round_ \l_@@_exponent_mode_tl :nn } {#1} {#2} }
% \end{macrocode}
% If there was a rounding up in the uncertainty, there is a bit more to do.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty_auxvii:nnNnnn #1#2#3#4#5#6
{
\bool_lazy_any:nTF
{
{ \str_if_eq_p:Vn \l_@@_exponent_mode_tl { engineering } }
{ \str_if_eq_p:Vn \l_@@_exponent_mode_tl { scientific } }
{
\bool_lazy_and_p:nn
{ \str_if_eq_p:Vn \l_@@_exponent_mode_tl { threshold } }
{
! \bool_lazy_or_p:nn
{
\int_compare_p:nNn {#5#6} >
\l_@@_lower_threshold_int
}
{
\int_compare_p:nNn {#5#6} <
\l_@@_upper_threshold_int
}
}
}
}
{
\use:c
{ @@_round_uncertainty_ \l_@@_exponent_mode_tl :nnn }
{#1}
}
{
\@@_round_uncertainty_auxvi:nn {#1} {#2}
\@@_round_end:nnn {#4}
}
{#5} {#6}
}
\cs_new:Npn \@@_round_uncertainty_engineering:nnn #1#2#3
{
\use:c
{
@@_round_uncertainty_
\l_@@_exponent_mode_tl _
\tl_count:n {#1}
:n
}
{#2#3}
}
\cs_new:cpn { @@_round_uncertainty_engineering_2:n } #1
{
{ 10 } { } { { S } { 10 } }
\@@_exponent_finalise:n {#1}
}
\cs_new:cpn { @@_round_uncertainty_engineering_3:n } #1
{
{ 100 } { } { { S } { 100 } }
\@@_exponent_finalise:n {#1}
}
\cs_new:cpn { @@_round_uncertainty_engineering_4:n } #1
{
{ 1 } { } { { S } { 1 } }
\@@_exponent_finalise:n { #1 + 3 }
}
\cs_new:Npn \@@_round_uncertainty_fixed:nnn #1#2#3
{
{#1} { }
{ { S } { 1 \prg_replicate:nn { \tl_count:n {#1} - 1 } { 0 } } }
{#2} {#3}
}
\cs_new_eq:NN \@@_round_uncertainty_input:nnn
\@@_round_uncertainty_fixed:nnn
\cs_new:Npn \@@_round_uncertainty_scientific:nnn #1#2#3
{
{ 1 } { } { { S } { 1 } }
\@@_exponent_finalise:n { #2#3 + \tl_count:n {#1} - 1 }
}
% \end{macrocode}
% We need to branch here based on the order of magnitude.
% \begin{macrocode}
\cs_new:Npn \@@_round_uncertainty_threshold:nnn #1#2#3
{
\bool_lazy_and:nnTF
{ \int_compare_p:nNn {#2#3} > \l_@@_lower_threshold_int }
{ \int_compare_p:nNn {#2#3} < \l_@@_upper_threshold_int }
{ \@@_round_uncertainty_input:nnn }
{ \@@_round_uncertainty_scientific:nnn }
{#1} {#2} {#3}
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \begin{macro}{\@@_zero_decimal:NN}
% \begin{macro}[EXP]{\@@_zero_decimal:nnnnnnn}
% Simple stripping of the decimal part if zero.
% \begin{macrocode}
\cs_new_protected:Npn \@@_zero_decimal:NN #1#2
{
\bool_if:NT \l_@@_drop_zero_decimal_bool
{
\tl_set:Nx #2
{ \exp_after:wN \@@_zero_decimal:nnnnnnn #1 }
}
}
\cs_new:Npn \@@_zero_decimal:nnnnnnn #1#2#3#4#5#6#7
{
\exp_not:n { {#1} {#2} {#3} }
\str_if_eq:eeTF
{ \exp_not:n {#4} }
{ \prg_replicate:nn { \tl_count:n {#4} } { 0 } }
{ { } }
{ \exp_not:n { {#4} } }
\exp_not:n { {#5} {#6} {#7} }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \subsection{Number modification}
%
% \begin{macro}[EXP]
% {\siunitx_number_adjust_exponent:nn, \siunitx_number_adjust_exponent:Vn}
% \begin{macro}[EXP]{\siunitx_number_adjust_exponent:Nn}
% \begin{macro}[EXP]{\@@_adjust_exp:nnnnnnnn}
% \begin{macro}[EXP]{\@@_adjust_exp:nn, \@@_adjust_exp:en}
% \begin{macro}[EXP]{\@@_adjust_exp:nNw}
% A simply case of breaking down and rebuilding the number.
% \begin{macrocode}
\cs_new:Npn \siunitx_number_adjust_exponent:nn #1#2
{ \@@_adjust_exp:nnnnnnnn #1 {#2} }
\cs_generate_variant:Nn \siunitx_number_adjust_exponent:nn { V }
\cs_new:Npn \siunitx_number_adjust_exponent:Nn #1#2
{
\tl_if_empty:NF #1
{ \siunitx_number_adjust_exponent:Vn #1 {#2} }
}
\cs_new:Npn \@@_adjust_exp:nnnnnnnn #1#2#3#4#5#6#7#8
{
\exp_not:n { {#1} {#2} {#3} {#4} {#5} }
\@@_adjust_exp:en { \fp_eval:n { #6#7 + #8 } } {#6}
}
\cs_new:Npn \@@_adjust_exp:nn #1#2
{ \@@_adjust_exp:nNw {#2} #1 \q_stop }
\cs_generate_variant:Nn \@@_adjust_exp:nn { e }
\cs_new:Npn \@@_adjust_exp:nNw #1#2#3 \q_stop
{
\token_if_eq_meaning:NNTF #2 -
{ { - } { \exp_not:n {#3} } }
{ { \str_if_eq:nnT {#1} { + } { + } } { \exp_not:n {#2#3} } }
}
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \subsection{Outputting parsed numbers}
%
% \begin{variable}{\l_@@_bracket_close_tl, \l_@@_bracket_open_tl}
% Purely internal for the present.
% \begin{macrocode}
\tl_new:N \l_@@_bracket_close_tl
\tl_new:N \l_@@_bracket_open_tl
\tl_set:Nn \l_@@_bracket_open_tl { ( }
\tl_set:Nn \l_@@_bracket_close_tl { ) }
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_siunitx_number_bracket_ambiguous_bool}
% \begin{macrocode}
\bool_new:N \l_siunitx_number_bracket_ambiguous_bool
% \end{macrocode}
% \end{variable}
%
% \begin{variable}{\l_siunitx_number_output_decimal_tl}
% \begin{macrocode}
\tl_new:N \l_siunitx_number_output_decimal_tl
% \end{macrocode}
% \end{variable}
%
% \begin{variable}
% {
% \l_@@_bracket_negative_bool ,
% \l_@@_implicit_plus_mant_bool ,
% \l_@@_implicit_plus__exp_bool ,
% \l_@@_exponent_base_tl ,
% \l_@@_exponent_product_tl ,
% \l_@@_group_size_int ,
% \l_@@_group_first_int ,
% \l_@@_group_decimal_bool ,
% \l_@@_group_integer_bool ,
% \l_@@_group_minimum_int ,
% \l_@@_group_separator_tl ,
% \l_@@_negative_color_tl ,
% \l_@@_output_exp_marker_tl ,
% \l_@@_output_uncert_close_tl ,
% \l_@@_output_uncert_open_tl ,
% \l_@@_uncert_desc_mode_tl ,
% \l_@@_uncert_desc_separator_tl ,
% \l_@@_uncert_desc_clist ,
% \l_@@_uncert_mode_tl ,
% \l_@@_uncert_separator_tl ,
% \l_@@_tight_bool ,
% \l_@@_unity_mantissa_bool ,
% \l_@@_zero_exponent_bool ,
% \l_@@_zero_integer_bool
% }
% Keys producing tokens in the output.
% \begin{macrocode}
\keys_define:nn { siunitx }
{
bracket-ambiguous-numbers .bool_set:N =
\l_siunitx_number_bracket_ambiguous_bool ,
bracket-negative-numbers .bool_set:N =
\l_@@_bracket_negative_bool ,
exponent-base .tl_set:N =
\l_@@_exponent_base_tl ,
exponent-product .tl_set:N =
\l_@@_exponent_product_tl ,
digit-group-size .meta:n =
{
digit-group-first-size = {#1} ,
digit-group-other-size = {#1}
} ,
digit-group-first-size .int_set:N =
\l_@@_group_first_int ,
digit-group-other-size .int_set:N =
\l_@@_group_size_int ,
group-digits .choice: ,
group-digits / all .code:n =
{
\bool_set_true:N \l_@@_group_decimal_bool
\bool_set_true:N \l_@@_group_integer_bool
} ,
group-digits / decimal .code:n =
{
\bool_set_true:N \l_@@_group_decimal_bool
\bool_set_false:N \l_@@_group_integer_bool
} ,
group-digits / integer .code:n =
{
\bool_set_false:N \l_@@_group_decimal_bool
\bool_set_true:N \l_@@_group_integer_bool
} ,
group-digits / none .code:n =
{
\bool_set_false:N \l_@@_group_decimal_bool
\bool_set_false:N \l_@@_group_integer_bool
} ,
group-digits .default:n = all ,
group-minimum-digits .int_set:N =
\l_@@_group_minimum_int ,
group-separator .tl_set:N =
\l_@@_group_separator_tl ,
negative-color .tl_set:N =
\l_@@_negative_color_tl ,
output-close-uncertainty .tl_set:N =
\l_@@_output_uncert_close_tl ,
output-decimal-marker .tl_set:N =
\l_siunitx_number_output_decimal_tl ,
output-exponent-marker .tl_set:N =
\l_@@_output_exp_marker_tl ,
output-open-uncertainty .tl_set:N =
\l_@@_output_uncert_open_tl ,
print-implicit-plus .meta:n =
{
print-mantissa-implicit-plus = {#1} ,
print-exponent-implicit-plus = {#1}
} ,
print-implicit-plus .default:n = true ,
print-mantissa-implicit-plus .bool_set:N =
\l_@@_implicit_plus_mant_bool ,
print-exponent-implicit-plus .bool_set:N =
\l_@@_implicit_plus_exp_bool ,
print-unity-mantissa .bool_set:N =
\l_@@_unity_mantissa_bool ,
print-zero-exponent .bool_set:N =
\l_@@_zero_exponent_bool ,
print-zero-integer .bool_set:N =
\l_@@_zero_integer_bool ,
tight-spacing .bool_set:N =
\l_@@_tight_bool ,
uncertainty-descriptor-mode .choices:nn =
{ bracket , bracket-separator , separator , subscript }
{ \tl_set_eq:NN \l_@@_uncert_desc_mode_tl \l_keys_choice_tl } ,
uncertainty-descriptor-separator .tl_set:N =
\l_@@_uncert_desc_separator_tl ,
uncertainty-descriptors .clist_set:N =
\l_@@_uncert_desc_clist ,
uncertainty-mode .choices:nn =
{ compact , compact-marker , full , separate }
{ \tl_set_eq:NN \l_@@_uncert_mode_tl \l_keys_choice_tl } ,
uncertainty-separator .tl_set:N =
\l_@@_uncert_separator_tl ,
zero-decimal-as-symbol .bool_set:N =
\l_@@_zero_symbol_bool ,
zero-symbol .tl_set:N = \l_@@_zero_symbol_tl
}
\bool_new:N \l_@@_group_decimal_bool
\bool_new:N \l_@@_group_integer_bool
\tl_new:N \l_@@_uncert_desc_mode_tl
\tl_new:N \l_@@_uncert_mode_tl
% \end{macrocode}
% \end{variable}
%
% \begin{macro}[EXP]{\siunitx_number_output:N, \siunitx_number_output:c}
% \begin{macro}[EXP]{\siunitx_number_output:n}
% \begin{macro}[EXP]{\siunitx_number_output:NN, \siunitx_number_output:cN}
% \begin{macro}[EXP]{\siunitx_number_output:nN}
% \begin{macro}[EXP]{\@@_output:Nn}
% \begin{macro}[EXP]{\@@_output:nn}
% \begin{macro}[EXP]{\@@_output:nnnnnnn}
% \begin{macro}[EXP]{\@@_output_bracket:nn}
% \begin{macro}[EXP]{\@@_output_bracket:w}
% \begin{macro}[EXP]{\@@_output_comparator:nn}
% \begin{macro}[EXP]{\@@_output_sign:nnn}
% \begin{macro}[EXP]{\@@_output_sign:nN}
% \begin{macro}[EXP]
% {\@@_output_sign_color:w, \@@_output_sign_brackets:w}
% \begin{macro}[EXP]{\@@_output_integer:nnn}
% \begin{macro}[EXP]{\@@_output_decimal:nn, \@@_output_decimal:en}
% \begin{macro}[EXP]{\@@_output_digits:nn}
% \begin{macro}[EXP]{\@@_output_digit_separator:N}
% \begin{macro}[EXP]{\@@_output_integer_3_3:n}
% \begin{macro}[EXP]
% {
% \@@_output_integer_aux_0:n,
% \@@_output_integer_aux_1:n,
% \@@_output_integer_aux_2:n
% }
% \begin{macro}[EXP]{\@@_output_integer_first:nnNN}
% \begin{macro}[EXP]{\@@_output_integer_loop:NNNN}
% \begin{macro}[EXP]{\@@_output_integer_first:n}
% \begin{macro}[EXP]{\@@_output_integer_aux:n, \@@_output_integer_aux:e}
% \begin{macro}[EXP]{\@@_output_integer_loop:NnnN}
% \begin{macro}[EXP]{\@@_output_decimal_3_3:n}
% \begin{macro}[EXP]{\@@_output_decimal_loop:NNNN}
% \begin{macro}[EXP]{\@@_output_decimal_3_2:n}
% \begin{macro}[EXP]{\@@_output_decimal:NNNw}
% \begin{macro}[EXP]{\@@_output_decimal_loop:NN}
% \begin{macro}[EXP]{\@@_output_decimal_first:n}
% \begin{macro}[EXP]{\@@_output_decimal_loop:NnnN}
% \begin{macro}[EXP]{\@@_output_uncertainty:nnn}
% \begin{macro}[EXP]{\@@_output_uncertainty_unaligned:n}
% \begin{macro}[EXP]{\@@_output_uncert:nnnn}
% \begin{macro}[EXP]{\@@_output_uncert:nnnnn, \@@_output_uncert:Vnnnn}
% \begin{macro}[EXP]{\@@_output_uncert_loop:nnN}
% \begin{macro}[EXP]{\@@_output_uncert_loop:nnNw}
% \begin{macro}[EXP]
% {
% \@@_output_uncert_desc_bracket:n ,
% \@@_output_uncert_desc_bracket-separator:n ,
% \@@_output_uncert_desc_separator:n ,
% \@@_output_uncert_desc_subscript:n
% }
% \begin{macro}[EXP]{\@@_output_uncert_A_loop:nnn, \@@_output_uncert_S_loop:nnn}
% \begin{macro}[EXP]{\@@_output_uncert_S_loop:w}
% \begin{macro}[EXP]{\@@_output_uncert_A:nnnn, \@@_output_uncert_A_multi:nnnn}
% \begin{macro}[EXP]{\@@_output_uncert_A:nnnnn}
% \begin{macro}[EXP]
% {
% \@@_output_uncert_S:nnnn ,
% \@@_output_uncert_S_sep:nnnn ,
% \@@_output_uncert_S_multi:nnnn
% }
% \begin{macro}[EXP]
% {
% \@@_output_uncert_S_compact:nn ,
% \@@_output_uncert_S_compact-marker:nn ,
% \@@_output_uncert_S_full:nn
% }
% \begin{macro}[EXP]
% {\@@_output_uncert_augment:nnnn}
% \begin{macro}[EXP]
% {\@@_output_uncert_augment:nnn, \@@_output_uncert_augment:enn}
% \begin{macro}[EXP]
% {\@@_output_uncert_augment:nnnw, \@@_output_uncert_augment:ennw}
% \begin{macro}[EXP]{\@@_output_uncert_augment:nnw}
% \begin{macro}[EXP]
% {
% \@@_output_exponent:nnnnn ,
% \@@_output_exponent_auxi:nnnnn ,
% \@@_output_exponent_auxii:nnnnn ,
% \@@_output_exponent_auxiii:nnnnn
% }
% \begin{macro}[EXP]{\@@_output_exponent_auxiv:nn}
% \begin{macro}[EXP]{\@@_output_end:}
% The approach to formatting a single number is to split into
% the constituent parts. All of the parts are assembled including
% inserting tabular alignment markers (which may be empty) for each
% separate unit.
% \begin{macrocode}
\cs_new:Npn \siunitx_number_output:N #1
{ \@@_output:Nn #1 { } }
\cs_generate_variant:Nn \siunitx_number_output:N { c }
\cs_new:Npn \siunitx_number_output:n #1
{ \@@_output:nn #1 { } }
\cs_new:Npn \siunitx_number_output:NN #1#2
{ \@@_output:Nn #1 {#2} }
\cs_generate_variant:Nn \siunitx_number_output:NN { c }
\cs_new:Npn \siunitx_number_output:nN #1#2
{ \@@_output:nn #1 {#2} }
\cs_new:Npn \@@_output:Nn #1#2
{
\tl_if_empty:NF #1
{ \exp_after:wN \@@_output:nnnnnnn #1 {#2} }
}
\cs_new:Npn \@@_output:nn #1#2
{
\tl_if_empty:nF {#1}
{ \@@_output:nnnnnnn #1 {#2} }
}
\cs_new:Npn \@@_output:nnnnnnn #1#2#3#4#5#6#7#8
{
\@@_output_color:n {#2}
\@@_output_comparator:nn {#1} {#8}
\@@_output_bracket:nn {#5} {#7}
\@@_output_sign:nnn {#1} {#2} {#8}
\@@_output_integer:nnn {#3} {#4} {#7}
\@@_output_decimal:nn {#4} {#8}
\@@_output_uncertainty:nnn {#5} {#4} {#8}
\@@_output_exponent:nnnnn {#6} {#7} {#3} {#4} {#8}
\@@_output_end:
}
% \end{macrocode}
% Adding brackets for the combination of a separate uncertainty with an
% exponent may need brackets. This needs testing up-front, so has to come
% before the main formatting routines.
% \begin{macrocode}
\cs_new:Npn \@@_output_bracket:nn #1#2
{
\bool_lazy_all:nT
{
{ \str_if_eq_p:Vn \l_@@_uncert_mode_tl { separate } }
{ \l_siunitx_number_bracket_ambiguous_bool }
{ ! \tl_if_blank_p:n {#1} }
{
\bool_lazy_or_p:nn
{ \l_@@_zero_exponent_bool }
{
! \bool_lazy_or_p:nn
{ \tl_if_blank_p:n {#2} }
{ \str_if_eq_p:nn {#2} { 0 } }
}
}
}
\@@_output_bracket:w
}
\cs_new:Npn \@@_output_bracket:w #1 \@@_output_exponent:nnnnn
{
\exp_not:V \l_@@_bracket_open_tl
#1
\exp_not:V \l_@@_bracket_close_tl
\@@_output_exponent:nnnnn
}
% \end{macrocode}
% As color for negative values applies to the \emph{whole} output, we have
% to deal with it before anything else.
% \begin{macrocode}
\cs_new:Npn \@@_output_color:n #1
{
\bool_lazy_and:nnT
{ \str_if_eq_p:nn {#1} { - } }
{ ! \tl_if_empty_p:N \l_@@_negative_color_tl }
{ \exp_not:N \color { \exp_not:V \l_@@_negative_color_tl } }
}
% \end{macrocode}
% To get the spacing correct this needs to be an ordinary math character.
% \begin{macrocode}
\cs_new:Npn \@@_output_comparator:nn #1#2
{
\tl_if_blank:nF {#1}
{ \exp_not:n { \mathord {#1} } }
\exp_not:n {#2}
}
% \end{macrocode}
% Formatting signs has to deal with some additional formatting requirements
% for negative numbers. Making such numbers by bracketing them needs some
% rearrangement of the order of tokens, which is set up in the main
% formatting macro by the dedicated do-nothing end function. We also have
% the comparator passed here: if it is present, we need to deal with
% tighter spacing.
% \begin{macrocode}
\cs_new:Npn \@@_output_sign:nnn #1#2#3
{
\tl_if_blank:nTF {#2}
{
\bool_if:NT \l_@@_implicit_plus_mant_bool
{ \@@_output_sign:nN {#1} + }
}
{
\str_if_eq:nnTF {#2} { - }
{
\bool_if:NTF \l_@@_bracket_negative_bool
{ \@@_output_sign_brackets:w }
{ \@@_output_sign:nN {#1} - }
}
{ \@@_output_sign:nN {#1} #2 }
}
\exp_not:n {#3}
}
\cs_new:Npn \@@_output_sign:nN #1#2
{
\tl_if_blank:nTF {#1}
{ \use:n }
{ \mathord }
{ \exp_not:n {#2} }
}
\cs_new:Npn
\@@_output_sign_brackets:w #1 \@@_output_end:
{
\exp_not:V \l_@@_bracket_open_tl
#1
\exp_not:V \l_@@_bracket_close_tl
\@@_output_end:
}
% \end{macrocode}
% Digit formatting leads off with separate functions to allow for a few
% \enquote{up front} items before using a common set of tests for some common
% cases. The code then splits again as the two types of grouping need
% different strategies.
% \begin{macrocode}
\cs_new:Npn \@@_output_integer:nnn #1#2#3
{
\tl_if_blank:nTF {#1}
{
\bool_lazy_and:nnT
{ \str_if_eq_p:nn {#3} { 0 } }
{ ! \l_@@_zero_exponent_bool }
{ \@@_output_digits:nn { integer } { 1 } }
}
{
\bool_lazy_or:nnT
{ \l_@@_zero_integer_bool }
{ ! \str_if_eq_p:nn {#1} { 0 } }
{
\bool_lazy_any:nT
{
{ \l_@@_unity_mantissa_bool }
{ ! \str_if_eq_p:nn { #1 . #2 } { 1. } }
{
\bool_lazy_and_p:nn
{
\bool_lazy_or_p:nn
{ \tl_if_blank_p:n {#3} }
{ \str_if_eq_p:nn {#3} { 0 } }
}
{ ! \l_@@_zero_exponent_bool }
}
{
\bool_lazy_and_p:nn
{ \str_if_eq_p:nn {#1} { 0 } }
{ \l_@@_zero_integer_bool }
}
}
{ \@@_output_digits:nn { integer } {#1} }
}
}
}
\cs_new:Npn \@@_output_decimal:nn #1#2
{
\exp_not:n {#2}
\tl_if_blank:nF {#1}
{
\str_if_eq:VnTF \l_siunitx_number_output_decimal_tl { , }
{ \exp_not:N \mathord }
{ \use:n }
{ \exp_not:V \l_siunitx_number_output_decimal_tl }
}
\exp_not:n {#2}
\str_if_eq:nnF {#1} { \empty }
{
\bool_lazy_and:nnTF
{ \l_@@_zero_symbol_bool }
{
\str_if_eq_p:ee
{#1}
{ \prg_replicate:nn { \tl_count:n {#1} } { 0 } }
}
{ \exp_not:V \l_@@_zero_symbol_tl }
{ \@@_output_digits:nn { decimal } {#1} }
}
}
\cs_generate_variant:Nn \@@_output_decimal:nn { e }
\cs_new:Npn \@@_output_digits:nn #1#2
{
\bool_if:cTF { l_@@_group_ #1 _ bool }
{
\int_compare:nNnTF
{ \tl_count:n {#2} } < \l_@@_group_minimum_int
{ \exp_not:n {#2} }
{
\cs_if_exist_use:cF
{
@@_output_ #1 _
\int_use:N \l_@@_group_first_int
_
\int_use:N \l_@@_group_size_int
:n
}
{ \use:c { @@_output_ #1 _first:n } }
{#2}
}
}
{ \exp_not:n {#2} }
}
% \end{macrocode}
% An auxiliary to ensure spacing is correct.
% \begin{macrocode}
\cs_new:Npn \@@_output_digit_separator:N #1
{
\str_if_eq:VnTF #1 { , }
{ \exp_not:N \mathord }
{ \use:n }
{ \exp_not:V #1 }
}
% \end{macrocode}
% For standard grouping of integers, we need to know how many digits there
% are to allow for the correct insertion of separators. That is done using
% a two-part set up such that there is no separator on the first pass.
% \begin{macrocode}
\cs_new:cpn { @@_output_integer_3_3:n } #1
{
\use:c
{
@@_output_integer_aux_
\int_eval:n { \int_mod:nn { \tl_count:n {#1} } { 3 } }
:n
} {#1}
}
\cs_new:cpn { @@_output_integer_aux_0:n } #1
{ \@@_output_integer_first:nnNN #1 \q_nil }
\cs_new:cpn { @@_output_integer_aux_1:n } #1
{ \@@_output_integer_first:nnNN { } { } #1 \q_nil }
\cs_new:cpn { @@_output_integer_aux_2:n } #1
{ \@@_output_integer_first:nnNN { } #1 \q_nil }
\cs_new:Npn \@@_output_integer_first:nnNN #1#2#3#4
{
\exp_not:n {#1#2#3}
\quark_if_nil:NF #4
{ \@@_output_integer_loop:NNNN #4 }
}
\cs_new:Npn \@@_output_integer_loop:NNNN #1#2#3#4
{
\@@_output_digit_separator:N \l_@@_group_separator_tl
\exp_not:n {#1#2#3}
\quark_if_nil:NF #4
{ \@@_output_integer_loop:NNNN #4 }
}
% \end{macrocode}
% There is no clever way of doing an uneven integer grouping, so just provide
% a slow generic approach. This is more-or-less the same as the generic
% decimal code, but with the output reversed. The only wrinkle is we need to
% reverse the entire input again, so it has to be carried as an argument.
% \begin{macrocode}
\cs_new:Npn \@@_output_integer_first:n #1
{
\@@_output_integer_aux:e { \tl_reverse:n {#1} }
}
\cs_new:Npn \@@_output_integer_aux:n #1
{
\@@_output_integer_loop:NnnN \l_@@_group_first_int { 0 } { }
#1 \q_recursion_tail \q_recursion_stop
}
\cs_generate_variant:Nn \@@_output_integer_aux:n { e }
\cs_new:Npn \@@_output_integer_loop:NnnN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4 {#3}
\int_compare:nNnTF { #2 + 1 } > #1
{
\@@_output_integer_loop:NnnN
\l_@@_group_size_int { 1 }
{
\exp_not:n {#4}
\@@_output_digit_separator:N \l_@@_group_separator_tl
#3
}
}
{
\@@_output_integer_loop:NnnN #1 { #2 + 1 }
{ \exp_not:n {#4} #3 }
}
}
% \end{macrocode}
% For standard decimal grouping, no need to do any counting, just loop using
% enough markers to find the end of the list. By passing the decimal marker,
% it is possible not to have to use a check on the content of the rest of
% the number. The |\use_none:n(n)| mop up the remaining |\q_nil| tokens.
% \begin{macrocode}
\cs_new:cpn { @@_output_decimal_3_3:n } #1
{
\@@_output_decimal_loop:NNNN \c_empty_tl
#1 \q_nil \q_nil \q_nil
}
\cs_new:Npn \@@_output_decimal_loop:NNNN #1#2#3#4
{
\quark_if_nil:NF #2
{
\@@_output_digit_separator:N #1
\exp_not:n {#2}
\quark_if_nil:NTF #3
{ \use_none:n }
{
\exp_not:n {#3}
\quark_if_nil:NTF #4
{ \use_none:nn }
{
\exp_not:n {#4}
\@@_output_decimal_loop:NNNN
\l_@@_group_separator_tl
}
}
}
}
% \end{macrocode}
% The same trick for the group-of-two case, but as the first pass is already
% done, there is not need to worry about the separator.
% \begin{macrocode}
\cs_new:cpn { @@_output_decimal_3_2:n } #1
{
\int_compare:nNnTF { \tl_count:n {#1} } > 2
{ \@@_output_decimal:NNNw #1 \q_stop }
{ \exp_not:n {#1} }
}
\cs_new:Npn \@@_output_decimal:NNNw #1#2#3#4 \q_stop
{
\exp_not:n {#1#2#3}
\@@_output_decimal_loop:NN #4 \q_nil \q_nil
}
\cs_new:Npn \@@_output_decimal_loop:NN #1#2
{
\quark_if_nil:NF #1
{
\@@_output_digit_separator:N
\l_@@_group_separator_tl
\exp_not:n {#1}
\quark_if_nil:NTF #2
{ \use_none:n }
{
\exp_not:n {#2}
\@@_output_decimal_loop:NN
}
}
}
% \end{macrocode}
% The generic decimal separator: simply count the digits.
% \begin{macrocode}
\cs_new:Npn \@@_output_decimal_first:n #1
{
\@@_output_decimal_loop:NnnN \l_@@_group_first_int { 0 } { }
#1 \q_recursion_tail \q_recursion_stop
}
\cs_new:Npn \@@_output_decimal_loop:NnnN #1#2#3#4
{
\quark_if_recursion_tail_stop_do:Nn #4 { \exp_not:n {#3} }
\int_compare:nNnTF { #2 + 1 } > #1
{
\exp_not:n {#3}
\@@_output_digit_separator:N
\l_@@_group_separator_tl
\@@_output_decimal_loop:NnnN \l_@@_group_size_int { 1 } {#4}
}
{ \@@_output_decimal_loop:NnnN #1 { #2 + 1 } { #3 #4 } }
}
% \end{macrocode}
% The lead-off here is to deal with the common cases: no uncertainty at all
% or a single uncertainty. Otherwise we have to move to a mapping.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncertainty:nnn #1#2#3
{
\tl_if_blank:nTF {#1}
{ \@@_output_uncertainty_unaligned:n {#3} }
{
\cs_if_exist:cTF
{ @@_output_uncert_ \tl_head:n {#1} :nnnn }
{
\use:c { @@_output_uncert_ \tl_head:n {#1} :nnnn }
{#2} {#3} #1
}
{ \@@_output_uncert:nnnn {#2} {#3} #1 }
}
}
\cs_new:Npn \@@_output_uncertainty_unaligned:n #1
{ \exp_not:n { #1 #1 #1 #1 } }
% \end{macrocode}
% For handling a list of uncertainties, we also need the descriptors. There
% is no way to reasonably deal with alignment of an open-ended list, so
% the treatment is as-for no uncertainty at all.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert:nnnn #1#2#3#4
{
\@@_output_uncert:Vnnnn \l_@@_uncert_desc_clist
{#1} {#2} {#3} {#4}
}
\cs_new:Npn \@@_output_uncert:nnnnn #1#2#3#4#5
{
\@@_output_uncert_loop:nnN {#2} {#3}
#4 \q_recursion_tail #1 , \q_recursion_stop {#5}
}
\cs_generate_variant:Nn \@@_output_uncert:nnnnn { V }
\cs_new:Npn \@@_output_uncert_loop:nnN #1#2#3
{
\quark_if_recursion_tail_stop:N #3
\@@_output_uncert_loop:nnNw {#1} {#2} #3
}
\cs_new:Npn \@@_output_uncert_loop:nnNw
#1#2#3#4 \q_recursion_tail #5 , #6 \q_recursion_stop #7
{
\use:c { @@_output_uncert_ #3 _loop:nnn } {#1} {#2} {#7}
\tl_if_blank:nF {#5}
{ \use:c { @@_output_uncert_desc_ \l_@@_uncert_desc_mode_tl :n } {#5} }
\@@_output_uncert_loop:nnN {#1} {#2} #4
\q_recursion_tail #6 , \q_recursion_stop
}
\cs_new:Npn \@@_output_uncert_desc_bracket:n #1
{
\exp_not:V \l_@@_bracket_open_tl
\exp_not:V \l_siunitx_unit_font_tl
{ \exp_not:n {#1} }
\exp_not:V \l_@@_bracket_close_tl
}
\cs_new:cpn { @@_output_uncert_desc_bracket-separator:n } #1
{
\exp_not:V \l_@@_uncert_desc_separator_tl
\exp_not:V \l_@@_bracket_open_tl
\exp_not:V \l_siunitx_unit_font_tl
{ \exp_not:n {#1} }
\exp_not:V \l_@@_bracket_close_tl
}
\cs_new:Npn \@@_output_uncert_desc_separator:n #1
{
\exp_not:V \l_@@_uncert_desc_separator_tl
\exp_not:V \l_siunitx_unit_font_tl
{ \exp_not:n {#1} }
}
\cs_new:Npx \@@_output_uncert_desc_subscript:n #1
{
\char_generate:nn { `\_ } { 8 }
{
\exp_not:N \exp_not:V \exp_not:N \l_siunitx_unit_font_tl
{ \exp_not:N \exp_not:n {#1} }
}
}
% \end{macrocode}
% Here, we have to tidy up so the alignment point only applies to the first
% |S|-type uncertainty.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert_A_loop:nnn #1#2#3
{ \@@_output_uncert_A_multi:nnnn {#1} {#2} { A } {#3} }
\cs_new:Npn \@@_output_uncert_S_loop:nnn #1#2#3
{
\@@_output_uncert_S_multi:nnnn {#1} {#2} { S } {#3}
\@@_output_uncert_S_loop:w
}
\cs_new:Npn \@@_output_uncert_S_loop:w #1 \@@_output_uncert_loop:nnN #2#3
{
#1
\@@_output_uncert_loop:nnN {#2} { }
}
% \end{macrocode}
% Printing an asymmetrical uncertainty is more straight-forward as they are
% always given in a single format. The only issue is handling the catcode.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert_A:nnnn #1#2#3#4
{ \@@_output_uncert_A:nnnnn {#1} {#2} {#3} #4 }
\cs_new_eq:NN \@@_output_uncert_A_multi:nnnn
\@@_output_uncert_A:nnnn
\cs_new:Npx \@@_output_uncert_A:nnnnn #1#2#3#4#5
{
{ }
^
{
+
\exp_not:N \@@_output_uncert_augment:nnnn
{#4} {#1} {#4} { }
}
\char_generate:nn { `\_ } { 8 }
{
-
\exp_not:N \@@_output_uncert_augment:nnnn
{#5} {#1} {#5} { }
}
\exp_not:N \@@_output_uncertainty_unaligned:n {#2}
}
% \end{macrocode}
% Uncertainties which are directly attached are easy to deal with. For those
% that are separated, the first step is to find if they are entirely
% contained within the decimal part, and to pad if they are. For the case
% where the boundary is crossed to the integer part, the correct number of
% digit tokens need to be removed from the start of the uncertainty and
% the split result sent to the appropriate auxiliaries.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert_S:nnnn #1#2#3#4
{
\str_if_eq:VnTF \l_@@_uncert_mode_tl { separate }
{ \@@_output_uncert_S_sep:nnnn {#1} {#2} {#3} {#4} }
{
\exp_not:V \l_@@_uncert_separator_tl
\exp_not:V \l_@@_output_uncert_open_tl
\use:c { @@_output_uncert_S_ \l_@@_uncert_mode_tl :nn } {#1} {#4}
\exp_not:V \l_@@_output_uncert_close_tl
\@@_output_uncertainty_unaligned:n {#2}
}
}
\cs_new:Npn \@@_output_uncert_S_sep:nnnn #1#2#3#4
{
\exp_not:n {#2}
\bool_if:NTF \l_@@_tight_bool
{ \mathord }
{ \use:n }
{ \exp_not:n { \pm } }
\exp_not:n {#2}
\@@_output_uncert_augment:nnnn {#4} {#1} {#4} {#2}
}
\cs_new_eq:NN \@@_output_uncert_S_multi:nnnn
\@@_output_uncert_S_sep:nnnn
% \end{macrocode}
% Handle the content of brackets: the only complex case is the
% mixed situation.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert_S_compact:nn #1#2
{ \exp_not:n {#2} }
\cs_new:cpn { @@_output_uncert_S_compact-marker:nn } #1#2
{
\bool_lazy_or:nnTF
{ \tl_if_blank_p:n {#1} }
{ ! \int_compare_p:nNn { \tl_count:n {#2} } > { \tl_count:n {#1} } }
{ \@@_output_uncert_S_compact:nn }
{ \@@_output_uncert_S_full:nn }
{#1} {#2}
}
\cs_new:Npn \@@_output_uncert_S_full:nn #1#2
{
\@@_output_uncert_augment:nnnn {#2} {#1} {#2} { }
}
% \end{macrocode}
% Convert the internal (short) form of an uncertainty to the longer form.
% \begin{macrocode}
\cs_new:Npn \@@_output_uncert_augment:nnnn #1#2#3#4
{
\@@_output_uncert_augment:enn
{ \int_eval:n { \tl_count:n {#1} - \tl_count:n {#2} } }
{#3} {#4}
}
\cs_new:Npn \@@_output_uncert_augment:nnn #1#2#3
{
\int_compare:nNnTF {#1} > 0
{
\@@_output_uncert_augment:ennw
{ \int_eval:n { #1 - 1 } }
{#3}
{ }
#2 \q_nil
}
{
0
\@@_output_decimal:en
{
\prg_replicate:nn { \int_abs:n {#1} } { 0 }
#2
}
{#3}
}
}
\cs_generate_variant:Nn \@@_output_uncert_augment:nnn { e }
\cs_new:Npn \@@_output_uncert_augment:nnnw #1#2#3#4
{
\quark_if_nil:NF #4
{
\int_compare:nNnTF {#1} = 0
{ \@@_output_uncert_augment:nnw {#3#4} {#2} }
{
\@@_output_uncert_augment:ennw
{ \int_eval:n { #1 - 1 } }
{#2}
{#3#4}
}
}
}
\cs_generate_variant:Nn \@@_output_uncert_augment:nnnw { e }
\cs_new:Npn \@@_output_uncert_augment:nnw #1#2#3 \q_nil
{
\@@_output_digits:nn { integer } {#1}
\@@_output_decimal:nn {#3} {#2}
}
% \end{macrocode}
% Setting the exponent part requires some information about the mantissa:
% was it there or not. This means that whilst only the sign and value for
% the exponent are typeset here, there is a need to also have access to the
% combined mantissa part (with a decimal marker). The rest of the work is
% about picking up the various options and getting the combinations right.
% For signs, the auxiliary from the main sign routine can be used, but not
% the main function: negative exponents don't have special handling.
% \begin{macrocode}
\cs_new:Npn \@@_output_exponent:nnnnn #1#2#3#4#5
{
\exp_not:n {#5}
\str_if_empty:nTF {#2}
{
\bool_if:NTF \l_@@_zero_exponent_bool
{ \@@_output_exponent_auxi:nnnnn {#1} { 0 } {#3} {#4} {#5} }
{ \exp_not:n {#5} }
}
{ \@@_output_exponent_auxi:nnnnn {#1} {#2} {#3} {#4} {#5} }
}
\cs_new:Npn \@@_output_exponent_auxi:nnnnn #1#2#3#4#5
{
\bool_lazy_or:nnTF
{ \l_@@_zero_exponent_bool }
{ ! \str_if_eq_p:nn {#2} { 0 } }
{
\tl_if_empty:NTF \l_@@_output_exp_marker_tl
{ \@@_output_exponent_auxii:nnnnn }
{ \@@_output_exponent_auxiii:nnnnn }
{#1} {#2} {#3} {#4} {#5}
}
{ \exp_not:n {#5} }
}
\cs_new:Npn \@@_output_exponent_auxii:nnnnn #1#2#3#4#5
{
\bool_lazy_or:nnT
{
\bool_lazy_and_p:nn
{ \l_@@_unity_mantissa_bool }
{ \str_if_eq_p:nn { #3 . #4 } { 1. } }
}
{
! \bool_lazy_or_p:nn
{ \str_if_eq_p:nn { #3 . #4 } { 1. } }
{ \tl_if_blank_p:n {#3} }
}
{
\bool_if:NTF \l_@@_tight_bool
{ \exp_not:N \mathord }
{ \use:n }
{ \exp_not:V \l_@@_exponent_product_tl }
}
\exp_not:n {#5}
\exp_not:V \l_@@_exponent_base_tl
^
{ \@@_output_exponent_auxiv:nnn { } {#1} {#2} }
}
\cs_new:Npn \@@_output_exponent_auxiii:nnnnn #1#2#3#4#5
{
\exp_not:n {#5}
\exp_not:V \l_@@_output_exp_marker_tl
\@@_output_exponent_auxiv:nnn { \mathord } {#1} {#2}
}
\cs_new:Npn \@@_output_exponent_auxiv:nnn #1#2#3
{
\tl_if_blank:nTF {#2}
{
\bool_lazy_and:nnT
{ \l_@@_implicit_plus_exp_bool }
{ ! \str_if_eq_p:nn {#3} { 0 } }
{ #1 + }
}
{ \exp_not:n {#1#2} }
\@@_output_digits:nn { integer } {#3}
}
% \end{macrocode}
% A do-nothing marker used to allow shuffling of the output and so expandable
% operations for formatting.
% \begin{macrocode}
\cs_new:Npn \@@_output_end: { }
% \end{macrocode}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
% \end{macro}
%
% \subsection{Miscellaneous tools}
%
% \begin{variable}{\l_@@_valid_tl}
% The list of valid tokens.
% \begin{macrocode}
\tl_new:N \l_@@_valid_tl
% \end{macrocode}
% \end{variable}
%
% \begin{macro}[TF]{\siunitx_if_number:n}
% Test if an entire number is valid: this means parsing the number but not
% returning anything.
% \begin{macrocode}
\prg_new_protected_conditional:Npnn \siunitx_if_number:n #1
{ T , F , TF }
{
\group_begin:
\bool_set_true:N \l_@@_validate_bool
\bool_set_true:N \l_siunitx_number_parse_bool
\siunitx_number_parse:nN {#1} \l_@@_parsed_tl
\tl_if_empty:NTF \l_@@_parsed_tl
{
\group_end:
\prg_return_false:
}
{
\group_end:
\prg_return_true:
}
}
% \end{macrocode}
% \end{macro}
%
% \begin{macro}[pTF, EXP]{\siunitx_if_number_token:N}
% \begin{macro}[EXP]
% {
% \@@_if_token_auxi:NN ,
% \@@_if_token_auxii:NN ,
% \@@_if_token_auxiii:NN
% }
% A simple conditional to answer the question of whether a specific token is
% possibly valid in a number.
% \begin{macrocode}
\prg_new_conditional:Npnn \siunitx_if_number_token:N #1
{ p , T , F , TF }
{
\@@_token_auxi:NN #1
\l_siunitx_number_input_decimal_tl
\l_@@_input_uncert_close_tl
\l_siunitx_number_input_comparator_tl
\l_@@_input_digit_tl
\l_siunitx_number_input_exponent_tl
\l_@@_input_ignore_tl
\l_@@_input_uncert_open_tl
\l_siunitx_number_input_sign_tl
\l_@@_input_uncert_sign_tl
\l_@@_input_uncert_divide_tl
\q_recursion_tail
\q_recursion_stop
}
\cs_new:Npn \@@_token_auxi:NN #1#2
{
\quark_if_recursion_tail_stop_do:Nn #2 { \prg_return_false: }
\@@_token_auxii:NN #1 #2
\@@_token_auxi:NN #1
}
\cs_new:Npn \@@_token_auxii:NN #1#2
{
\exp_after:wN \@@_token_auxiii:NN \exp_after:wN #1
#2 \q_recursion_tail \q_recursion_stop
}
\cs_new:Npn \@@_token_auxiii:NN #1#2
{
\quark_if_recursion_tail_stop:N #2
\str_if_eq:nnT {#1} {#2}
{
\use_i_delimit_by_q_recursion_stop:nw
{
\use_i_delimit_by_q_recursion_stop:nw
{ \prg_return_true: }
}
}
\@@_token_auxiii:NN #1
}
% \end{macrocode}
% \end{macro}
% \end{macro}
%
% \subsection{Messages}
%
% \begin{macrocode}
\msg_new:nnnn { siunitx } { invalid-number }
{ Invalid~number~'#1'. }
{
The~input~'#1'~could~not~be~parsed~as~a~number~following~the~
format~defined~in~module~documentation.
}
\msg_new:nnnn { siunitx } { ambiguous-dropped-exponent }
{ Potentially~ambiguous~dropping~of~exponent. }
{
The~option~"drop-exponent"~is~active~but~values~do~not~have~an~
exponent~fixed~by~"exponent-mode".~The~result~could~be~misleading.
}
% \end{macrocode}
%
% \subsection{Standard settings for module options}
%
% Some of these follow naturally from the point of definition
% (\foreign{e.g.}~boolean variables are always |false| to begin with),
% but for clarity everything is set here.
% \begin{macrocode}
\keys_set:nn { siunitx }
{
bracket-ambiguous-numbers = true ,
bracket-negative-numbers = false ,
drop-exponent = false ,
drop-uncertainty = false ,
drop-zero-decimal = false ,
evaluate-expression = false ,
exponent-base = 10 ,
exponent-mode = input ,
exponent-product = \times ,
expression = #1 ,
fixed-exponent = 0 ,
digit-group-size = 3 ,
digit-group-first-size = 3 ,
digit-group-other-size = 3 ,
group-digits = all ,
group-minimum-digits = 5 ,
group-separator = \, , % (
input-close-uncertainty = ) ,
input-comparators = { <=>\approx\ge\geq\gg\le\leq\ll\sim } ,
input-decimal-markers = { ., } ,
input-digits = 0123456789 ,
input-exponent-markers = dDeE ,
input-ignore = \, ,
input-open-uncertainty = ( , % )
input-signs = +-\mp\pm ,
input-uncertainty-signs = \pm ,
minimum-decimal-digits = 0 ,
minimum-integer-digits = 0 ,
negative-color = , % (
output-close-uncertainty = ) ,
output-decimal-marker = . ,
output-open-uncertainty = ( , % )
parse-numbers = true ,
print-exponent-implicit-plus = false ,
print-implicit-plus = false ,
print-mantissa-implicit-plus = false ,
print-unity-mantissa = true ,
print-zero-exponent = false ,
print-zero-integer = true ,
retain-explicit-decimal-marker = false ,
retain-explicit-plus = false ,
retain-negative-zero = false ,
retain-zero-uncertainty = false ,
round-direction = nearest ,
round-half = up ,
round-minimum = 0 ,
round-mode = none ,
round-pad = true ,
round-precision = 2 ,
round-zero-positive = true ,
tight-spacing = false ,
uncertainty-descriptor-mode = bracket-separator ,
uncertainty-descriptor-separator = \ ,
uncertainty-descriptors = ,
uncertainty-mode = compact ,
uncertainty-round-direction = nearest ,
uncertainty-separator = ,
zero-decimal-as-symbol = false ,
zero-symbol = \mbox { --- }
}
% \end{macrocode}
% Two awkward settings.
% \begin{macrocode}
\keys_set:nx { siunitx }
{
exponent-thresholds = -3 \c_colon_str 3 ,
input-uncertainty-divider = \c_colon_str
}
% \end{macrocode}
%
% \begin{macrocode}
%</package>
% \end{macrocode}
%
% \end{implementation}
%
% \PrintIndex
|