1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
12673
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
13001
13002
13003
13004
13005
13006
13007
13008
13009
13010
13011
13012
13013
13014
13015
13016
13017
13018
13019
13020
13021
13022
13023
13024
13025
13026
13027
13028
13029
13030
13031
13032
13033
13034
13035
13036
13037
13038
13039
13040
13041
13042
13043
13044
13045
13046
13047
13048
13049
13050
13051
13052
13053
13054
13055
13056
13057
13058
13059
13060
13061
13062
13063
13064
13065
13066
13067
13068
13069
13070
13071
13072
13073
13074
13075
13076
13077
13078
13079
13080
13081
13082
13083
13084
13085
13086
13087
13088
13089
13090
13091
13092
13093
13094
13095
13096
13097
13098
13099
13100
13101
13102
13103
13104
13105
13106
13107
13108
13109
13110
13111
13112
13113
13114
13115
13116
13117
13118
13119
13120
13121
13122
13123
13124
13125
13126
13127
13128
13129
13130
13131
13132
13133
13134
13135
13136
13137
13138
13139
13140
13141
13142
13143
13144
13145
13146
13147
13148
13149
13150
13151
13152
13153
13154
13155
13156
13157
13158
13159
13160
13161
13162
13163
13164
13165
13166
13167
13168
13169
13170
13171
13172
13173
13174
13175
13176
13177
13178
13179
13180
13181
13182
13183
13184
13185
13186
13187
13188
13189
13190
13191
13192
13193
13194
13195
13196
13197
13198
13199
13200
13201
13202
13203
13204
13205
13206
13207
13208
13209
13210
13211
13212
13213
13214
13215
13216
13217
13218
13219
13220
13221
13222
13223
13224
13225
13226
13227
13228
13229
13230
13231
13232
13233
13234
13235
13236
13237
13238
13239
13240
13241
13242
13243
13244
13245
13246
13247
13248
13249
13250
13251
13252
13253
13254
13255
13256
13257
13258
13259
13260
13261
13262
13263
13264
13265
13266
13267
13268
13269
13270
13271
13272
13273
13274
13275
13276
13277
13278
13279
13280
13281
13282
13283
13284
13285
13286
13287
13288
13289
13290
13291
13292
13293
13294
13295
13296
13297
13298
13299
13300
13301
13302
13303
13304
13305
13306
13307
13308
13309
13310
13311
13312
13313
13314
13315
13316
13317
13318
13319
13320
13321
13322
13323
13324
13325
13326
13327
13328
13329
13330
13331
13332
13333
13334
13335
13336
13337
13338
13339
13340
13341
13342
13343
13344
13345
13346
13347
13348
13349
13350
13351
13352
13353
13354
13355
13356
13357
13358
13359
13360
13361
13362
13363
13364
13365
13366
13367
13368
13369
13370
13371
13372
13373
13374
13375
13376
13377
13378
13379
13380
13381
13382
13383
13384
13385
13386
13387
13388
13389
13390
13391
13392
13393
13394
13395
13396
13397
13398
13399
13400
13401
13402
13403
13404
13405
13406
13407
13408
13409
13410
13411
13412
13413
13414
13415
13416
13417
13418
13419
13420
13421
13422
13423
13424
13425
13426
13427
13428
13429
13430
13431
13432
13433
13434
13435
13436
13437
13438
13439
13440
13441
13442
13443
13444
13445
13446
13447
13448
13449
13450
13451
13452
13453
13454
13455
13456
13457
13458
13459
13460
13461
13462
13463
13464
13465
13466
13467
13468
13469
13470
13471
13472
13473
13474
13475
13476
13477
13478
13479
13480
13481
13482
13483
13484
13485
13486
13487
13488
13489
13490
13491
13492
13493
13494
13495
13496
13497
13498
13499
13500
13501
13502
13503
13504
13505
13506
13507
13508
13509
13510
13511
13512
13513
13514
13515
13516
13517
13518
13519
13520
13521
13522
13523
13524
13525
13526
13527
13528
13529
13530
13531
13532
13533
13534
13535
13536
13537
13538
13539
13540
13541
13542
13543
13544
13545
13546
13547
13548
13549
13550
13551
13552
13553
13554
13555
13556
13557
13558
13559
13560
13561
13562
13563
13564
13565
13566
13567
13568
13569
13570
13571
13572
13573
13574
13575
13576
13577
13578
13579
13580
13581
13582
13583
13584
13585
13586
13587
13588
13589
13590
13591
13592
13593
13594
13595
13596
13597
13598
13599
13600
13601
13602
13603
13604
13605
13606
13607
13608
13609
13610
13611
13612
13613
13614
13615
13616
13617
13618
13619
13620
13621
13622
13623
13624
13625
13626
13627
13628
13629
13630
13631
13632
13633
13634
13635
13636
13637
13638
13639
13640
13641
13642
13643
13644
13645
13646
13647
13648
13649
13650
13651
13652
13653
13654
13655
13656
13657
13658
13659
13660
13661
13662
13663
13664
13665
13666
13667
13668
13669
13670
13671
13672
13673
13674
13675
13676
13677
13678
13679
13680
13681
13682
13683
13684
13685
13686
13687
13688
13689
13690
13691
13692
13693
13694
13695
13696
13697
13698
13699
13700
13701
13702
13703
13704
13705
13706
13707
13708
13709
13710
13711
13712
13713
13714
13715
13716
13717
13718
13719
13720
13721
13722
13723
13724
13725
13726
13727
13728
13729
13730
13731
13732
13733
13734
13735
13736
13737
13738
13739
13740
13741
13742
13743
13744
13745
13746
13747
13748
13749
13750
13751
13752
13753
13754
13755
13756
13757
13758
13759
13760
13761
13762
13763
13764
13765
13766
13767
13768
13769
13770
13771
13772
13773
13774
13775
13776
13777
13778
13779
13780
13781
13782
13783
13784
13785
13786
13787
13788
13789
13790
13791
13792
13793
13794
13795
13796
13797
13798
13799
13800
13801
13802
13803
13804
13805
13806
13807
13808
13809
13810
13811
13812
13813
13814
13815
13816
13817
13818
13819
13820
13821
13822
13823
13824
13825
13826
13827
13828
13829
13830
13831
13832
13833
13834
13835
13836
13837
13838
13839
13840
13841
13842
13843
13844
13845
13846
13847
13848
13849
13850
13851
13852
13853
13854
13855
13856
13857
13858
13859
13860
13861
13862
13863
13864
13865
13866
13867
13868
13869
13870
13871
13872
13873
13874
13875
13876
13877
13878
13879
13880
13881
13882
13883
13884
13885
13886
13887
13888
13889
13890
13891
13892
13893
13894
13895
13896
13897
13898
13899
13900
13901
13902
13903
13904
13905
13906
13907
13908
13909
13910
13911
13912
13913
13914
13915
13916
13917
13918
13919
13920
13921
13922
13923
13924
13925
13926
13927
13928
13929
13930
13931
13932
13933
13934
13935
13936
13937
13938
13939
13940
13941
13942
13943
13944
13945
13946
13947
13948
13949
13950
13951
13952
13953
13954
13955
13956
13957
13958
13959
13960
13961
13962
13963
13964
13965
13966
13967
13968
13969
13970
13971
13972
13973
13974
13975
13976
13977
13978
13979
13980
13981
13982
13983
13984
13985
13986
13987
13988
13989
13990
13991
13992
13993
13994
13995
13996
13997
13998
13999
14000
14001
14002
14003
14004
14005
14006
14007
14008
14009
14010
14011
14012
14013
14014
14015
14016
14017
14018
14019
14020
14021
14022
14023
14024
14025
14026
14027
14028
14029
14030
14031
14032
14033
14034
14035
14036
14037
14038
14039
14040
14041
14042
14043
14044
14045
14046
14047
14048
14049
14050
14051
14052
14053
14054
14055
14056
14057
14058
14059
14060
14061
14062
14063
14064
14065
14066
14067
14068
14069
14070
14071
14072
14073
14074
14075
14076
14077
14078
14079
14080
14081
14082
14083
14084
14085
14086
14087
14088
14089
14090
14091
14092
14093
14094
14095
14096
14097
14098
14099
14100
14101
14102
14103
14104
14105
14106
14107
14108
14109
14110
14111
14112
14113
14114
14115
14116
14117
14118
14119
14120
14121
14122
14123
14124
14125
14126
14127
14128
14129
14130
14131
14132
14133
14134
14135
14136
14137
14138
14139
14140
14141
14142
14143
14144
14145
14146
14147
14148
14149
14150
14151
14152
14153
14154
14155
14156
14157
14158
14159
14160
14161
14162
14163
14164
14165
14166
14167
14168
14169
14170
14171
14172
14173
14174
14175
14176
14177
14178
14179
14180
14181
14182
14183
14184
14185
14186
14187
14188
14189
14190
14191
14192
14193
14194
14195
14196
14197
14198
14199
14200
14201
14202
14203
14204
14205
14206
14207
14208
14209
14210
14211
14212
14213
14214
14215
14216
14217
14218
14219
14220
14221
14222
14223
14224
14225
14226
14227
14228
14229
14230
14231
14232
14233
14234
14235
14236
14237
14238
14239
14240
14241
14242
14243
14244
14245
14246
14247
14248
14249
14250
14251
14252
14253
14254
14255
14256
14257
14258
14259
14260
14261
14262
14263
14264
14265
14266
14267
14268
14269
14270
14271
14272
14273
14274
14275
14276
14277
14278
14279
14280
14281
14282
14283
14284
14285
14286
14287
14288
14289
14290
14291
14292
14293
14294
14295
14296
14297
14298
14299
14300
14301
14302
14303
14304
14305
14306
14307
14308
14309
14310
14311
14312
14313
14314
14315
14316
14317
14318
14319
14320
14321
14322
14323
14324
14325
14326
14327
14328
14329
14330
14331
14332
14333
14334
14335
14336
14337
14338
14339
14340
14341
14342
14343
14344
14345
14346
14347
14348
14349
14350
14351
14352
14353
14354
14355
14356
14357
14358
14359
14360
14361
14362
14363
14364
14365
14366
14367
14368
14369
14370
14371
14372
14373
14374
14375
14376
14377
14378
14379
14380
14381
14382
14383
14384
14385
14386
14387
14388
14389
14390
14391
14392
14393
14394
14395
14396
14397
14398
14399
14400
14401
14402
14403
14404
14405
14406
14407
14408
14409
14410
14411
14412
14413
14414
14415
14416
14417
14418
14419
14420
14421
14422
14423
14424
14425
14426
14427
14428
14429
14430
14431
14432
14433
14434
14435
14436
14437
14438
14439
14440
14441
14442
14443
14444
14445
14446
14447
14448
14449
14450
14451
14452
14453
14454
14455
14456
14457
14458
14459
14460
14461
14462
14463
14464
14465
14466
14467
14468
14469
14470
14471
14472
14473
14474
14475
14476
14477
14478
14479
14480
14481
14482
14483
14484
14485
14486
14487
14488
14489
14490
14491
14492
14493
14494
14495
14496
14497
14498
14499
14500
14501
14502
14503
14504
14505
14506
14507
14508
14509
14510
14511
14512
14513
14514
14515
14516
14517
14518
14519
14520
14521
14522
14523
14524
14525
14526
14527
14528
14529
14530
14531
14532
14533
14534
14535
14536
14537
14538
14539
14540
14541
14542
14543
14544
14545
14546
14547
14548
14549
14550
14551
14552
14553
14554
14555
14556
14557
14558
14559
14560
14561
14562
14563
14564
14565
14566
14567
14568
14569
14570
14571
14572
14573
14574
14575
14576
14577
14578
14579
14580
14581
14582
14583
14584
14585
14586
14587
14588
14589
14590
14591
14592
14593
14594
14595
14596
14597
14598
14599
14600
14601
14602
14603
14604
14605
14606
14607
14608
14609
14610
14611
14612
14613
14614
14615
14616
14617
14618
14619
14620
14621
14622
14623
14624
14625
14626
14627
14628
14629
14630
14631
14632
14633
14634
14635
14636
14637
14638
14639
14640
14641
14642
14643
14644
14645
14646
14647
14648
14649
14650
14651
14652
14653
14654
14655
14656
14657
14658
14659
14660
14661
14662
14663
14664
14665
14666
14667
14668
14669
14670
14671
14672
14673
14674
14675
14676
14677
14678
14679
14680
14681
14682
14683
14684
14685
14686
14687
14688
14689
14690
14691
14692
14693
14694
14695
14696
14697
14698
14699
14700
14701
14702
14703
14704
14705
14706
14707
14708
14709
14710
14711
14712
14713
14714
14715
14716
14717
14718
14719
14720
14721
14722
14723
14724
14725
14726
14727
14728
14729
14730
14731
14732
14733
14734
14735
14736
14737
14738
14739
14740
14741
14742
14743
14744
14745
14746
14747
14748
14749
14750
14751
14752
14753
14754
14755
14756
14757
14758
14759
14760
14761
14762
14763
14764
14765
14766
14767
14768
14769
14770
14771
14772
14773
14774
14775
14776
14777
14778
14779
14780
14781
14782
14783
14784
14785
14786
14787
14788
14789
14790
14791
14792
14793
14794
14795
14796
14797
14798
14799
14800
14801
14802
14803
14804
14805
14806
14807
14808
14809
14810
14811
14812
14813
14814
14815
14816
14817
14818
14819
14820
14821
14822
14823
14824
14825
14826
14827
14828
14829
14830
14831
14832
14833
14834
14835
14836
14837
14838
14839
14840
14841
14842
14843
14844
14845
14846
14847
14848
14849
14850
14851
14852
14853
14854
14855
14856
14857
14858
14859
14860
14861
14862
14863
14864
14865
14866
14867
14868
14869
14870
14871
14872
14873
14874
14875
14876
14877
14878
14879
14880
14881
14882
14883
14884
14885
14886
14887
14888
14889
14890
14891
14892
14893
14894
14895
14896
14897
14898
14899
14900
14901
14902
14903
14904
14905
14906
14907
14908
14909
14910
14911
14912
14913
14914
14915
14916
14917
14918
14919
14920
14921
14922
14923
14924
14925
14926
14927
14928
14929
14930
14931
14932
14933
14934
14935
14936
14937
14938
14939
14940
14941
14942
14943
14944
14945
14946
14947
14948
14949
14950
14951
14952
14953
14954
14955
14956
14957
14958
14959
14960
14961
14962
14963
14964
14965
14966
14967
14968
14969
14970
14971
14972
14973
14974
14975
14976
14977
14978
14979
14980
14981
14982
14983
14984
14985
14986
14987
14988
14989
14990
14991
14992
14993
14994
14995
14996
14997
14998
14999
15000
15001
15002
15003
15004
15005
15006
15007
15008
15009
15010
15011
15012
15013
15014
15015
15016
15017
15018
15019
15020
15021
15022
15023
15024
15025
15026
15027
15028
15029
15030
15031
15032
15033
15034
15035
15036
15037
15038
15039
15040
15041
15042
15043
15044
15045
15046
15047
15048
15049
15050
15051
15052
15053
15054
15055
15056
15057
15058
15059
15060
15061
15062
15063
15064
15065
15066
15067
15068
15069
15070
15071
15072
15073
15074
15075
15076
15077
15078
15079
15080
15081
15082
15083
15084
15085
15086
15087
15088
15089
15090
15091
15092
15093
15094
15095
15096
15097
15098
15099
15100
15101
15102
15103
15104
15105
15106
15107
15108
15109
15110
15111
15112
15113
15114
15115
15116
15117
15118
15119
15120
15121
15122
15123
15124
15125
15126
15127
15128
15129
15130
15131
15132
15133
15134
15135
15136
15137
15138
15139
15140
15141
15142
15143
15144
15145
15146
15147
15148
15149
15150
15151
15152
15153
15154
15155
15156
15157
15158
15159
15160
15161
15162
15163
15164
15165
15166
15167
15168
15169
15170
15171
15172
15173
15174
15175
15176
15177
15178
15179
15180
15181
15182
15183
15184
15185
15186
15187
15188
15189
15190
15191
15192
15193
15194
15195
15196
15197
15198
15199
15200
15201
15202
15203
15204
15205
15206
15207
15208
15209
15210
15211
15212
15213
15214
15215
15216
15217
15218
15219
15220
15221
15222
15223
15224
15225
15226
15227
15228
15229
15230
15231
15232
15233
15234
15235
15236
15237
15238
15239
15240
15241
15242
15243
15244
15245
15246
15247
15248
15249
15250
15251
15252
15253
15254
15255
15256
15257
15258
15259
15260
15261
15262
15263
15264
15265
15266
15267
15268
15269
15270
15271
15272
15273
15274
15275
15276
15277
15278
15279
15280
15281
15282
15283
15284
15285
15286
15287
15288
15289
15290
15291
15292
15293
15294
15295
15296
15297
15298
15299
15300
15301
15302
15303
15304
15305
15306
15307
15308
15309
15310
15311
15312
15313
15314
15315
15316
15317
15318
15319
15320
15321
15322
15323
15324
15325
15326
15327
15328
15329
15330
15331
15332
15333
15334
15335
15336
15337
15338
15339
15340
15341
15342
15343
15344
15345
15346
15347
15348
15349
15350
15351
15352
15353
15354
15355
15356
15357
15358
15359
15360
15361
15362
15363
15364
15365
15366
15367
15368
15369
15370
15371
15372
15373
15374
15375
15376
15377
15378
15379
15380
15381
15382
15383
15384
15385
15386
15387
15388
15389
15390
15391
15392
15393
15394
15395
15396
15397
15398
15399
15400
15401
15402
15403
15404
15405
15406
15407
15408
15409
15410
15411
15412
15413
15414
15415
15416
15417
15418
15419
15420
15421
15422
15423
15424
15425
15426
15427
15428
15429
15430
15431
15432
15433
15434
15435
15436
15437
15438
15439
15440
15441
15442
15443
15444
15445
15446
15447
15448
15449
15450
15451
15452
15453
15454
15455
15456
15457
15458
15459
15460
15461
15462
15463
15464
15465
15466
15467
15468
15469
15470
15471
15472
15473
15474
15475
15476
15477
15478
15479
15480
15481
15482
15483
15484
15485
15486
15487
15488
15489
15490
15491
15492
15493
15494
15495
15496
15497
15498
15499
15500
15501
15502
15503
15504
15505
15506
15507
15508
15509
15510
15511
15512
15513
15514
15515
15516
15517
15518
15519
15520
15521
15522
15523
15524
15525
15526
15527
15528
15529
15530
15531
15532
15533
15534
15535
15536
15537
15538
15539
15540
15541
15542
15543
15544
15545
15546
15547
15548
15549
15550
15551
15552
15553
15554
15555
15556
15557
15558
15559
15560
15561
15562
15563
15564
15565
15566
15567
15568
15569
15570
15571
15572
15573
15574
15575
15576
15577
15578
15579
15580
15581
15582
15583
15584
15585
15586
15587
15588
15589
15590
15591
15592
15593
15594
15595
15596
15597
15598
15599
15600
15601
15602
15603
15604
15605
15606
15607
15608
15609
15610
15611
15612
15613
15614
15615
15616
15617
15618
15619
15620
15621
15622
15623
15624
15625
15626
15627
15628
15629
15630
15631
15632
15633
15634
15635
15636
15637
15638
15639
15640
15641
15642
15643
15644
15645
15646
15647
15648
15649
15650
15651
15652
15653
15654
15655
15656
15657
15658
15659
15660
15661
15662
15663
15664
15665
15666
15667
15668
15669
15670
15671
15672
15673
15674
15675
15676
15677
15678
15679
15680
15681
15682
15683
15684
15685
15686
15687
15688
15689
15690
15691
15692
15693
15694
15695
15696
15697
15698
15699
15700
15701
15702
15703
15704
15705
15706
15707
15708
15709
15710
15711
15712
15713
15714
15715
15716
15717
15718
15719
15720
15721
15722
15723
15724
15725
15726
15727
15728
15729
15730
15731
15732
15733
15734
15735
15736
15737
15738
15739
15740
15741
15742
15743
15744
15745
15746
15747
15748
15749
15750
15751
15752
15753
15754
15755
15756
15757
15758
15759
15760
15761
15762
15763
15764
15765
15766
15767
15768
15769
15770
15771
15772
15773
15774
15775
15776
15777
15778
15779
15780
15781
15782
15783
15784
15785
15786
15787
15788
15789
15790
15791
15792
15793
15794
15795
15796
15797
15798
15799
15800
15801
15802
15803
15804
15805
15806
15807
15808
15809
15810
15811
15812
15813
15814
15815
15816
15817
15818
15819
15820
15821
15822
15823
15824
15825
15826
15827
15828
15829
15830
15831
15832
15833
15834
15835
15836
15837
15838
15839
15840
15841
15842
15843
15844
15845
15846
15847
15848
15849
15850
15851
15852
15853
15854
15855
15856
15857
15858
15859
15860
15861
15862
15863
15864
15865
15866
15867
15868
15869
15870
15871
15872
15873
15874
15875
15876
15877
15878
15879
15880
15881
15882
15883
15884
15885
15886
15887
15888
15889
15890
15891
15892
15893
15894
15895
15896
15897
15898
15899
15900
15901
15902
15903
15904
15905
15906
15907
15908
15909
15910
15911
15912
15913
15914
15915
15916
15917
15918
15919
15920
15921
15922
15923
15924
15925
15926
15927
15928
15929
15930
15931
15932
15933
15934
15935
15936
15937
15938
15939
15940
15941
15942
15943
15944
15945
15946
15947
15948
15949
15950
15951
15952
15953
15954
15955
15956
15957
15958
15959
15960
15961
15962
15963
15964
15965
15966
15967
15968
15969
15970
15971
15972
15973
15974
15975
15976
15977
15978
15979
15980
15981
15982
15983
15984
15985
15986
15987
15988
15989
15990
15991
15992
15993
15994
15995
15996
15997
15998
15999
16000
16001
16002
16003
16004
16005
16006
16007
16008
16009
16010
16011
16012
16013
16014
16015
16016
16017
16018
16019
16020
16021
16022
16023
16024
16025
16026
16027
16028
16029
16030
16031
16032
16033
16034
16035
16036
16037
16038
16039
16040
16041
16042
16043
16044
16045
16046
16047
16048
16049
16050
16051
16052
16053
16054
16055
16056
16057
16058
16059
16060
16061
16062
16063
16064
16065
16066
16067
16068
16069
16070
16071
16072
16073
16074
16075
16076
16077
16078
16079
16080
16081
16082
16083
16084
16085
16086
16087
16088
16089
16090
16091
16092
16093
16094
16095
16096
16097
16098
16099
16100
16101
16102
16103
16104
16105
16106
16107
16108
16109
16110
16111
16112
16113
16114
16115
16116
16117
16118
16119
16120
16121
16122
16123
16124
16125
16126
16127
16128
16129
16130
16131
16132
16133
16134
16135
16136
16137
16138
16139
16140
16141
16142
16143
16144
16145
16146
16147
16148
16149
16150
16151
16152
16153
16154
16155
16156
16157
16158
16159
16160
16161
16162
16163
16164
16165
16166
16167
16168
16169
16170
16171
16172
16173
16174
16175
16176
16177
16178
16179
16180
16181
16182
16183
16184
16185
16186
16187
16188
16189
16190
16191
16192
16193
16194
16195
16196
16197
16198
16199
16200
16201
16202
16203
16204
16205
16206
16207
16208
16209
16210
16211
16212
16213
16214
16215
16216
16217
16218
16219
16220
16221
16222
16223
16224
16225
16226
16227
16228
16229
16230
16231
16232
16233
16234
16235
16236
16237
16238
16239
16240
16241
16242
16243
16244
16245
16246
16247
16248
16249
16250
16251
16252
16253
16254
16255
16256
16257
16258
16259
16260
16261
16262
16263
16264
16265
16266
16267
16268
16269
16270
16271
16272
16273
16274
16275
16276
16277
16278
16279
16280
16281
16282
16283
16284
16285
16286
16287
16288
16289
16290
16291
16292
16293
16294
16295
16296
16297
16298
16299
16300
16301
16302
16303
16304
16305
16306
16307
16308
16309
16310
16311
16312
16313
16314
16315
16316
16317
16318
16319
16320
16321
16322
16323
16324
16325
16326
16327
16328
16329
16330
16331
16332
16333
16334
16335
16336
16337
16338
16339
16340
16341
16342
16343
16344
16345
16346
16347
16348
16349
16350
16351
16352
16353
16354
16355
16356
16357
16358
16359
16360
16361
16362
16363
16364
16365
16366
16367
16368
16369
16370
16371
16372
16373
16374
16375
16376
16377
16378
16379
16380
16381
16382
16383
16384
16385
16386
16387
16388
16389
16390
16391
16392
16393
16394
16395
16396
16397
16398
16399
16400
16401
16402
16403
16404
16405
16406
16407
16408
16409
16410
16411
16412
16413
16414
16415
16416
16417
16418
16419
16420
16421
16422
16423
16424
16425
16426
16427
16428
16429
16430
16431
16432
16433
16434
16435
16436
16437
16438
16439
16440
16441
16442
16443
16444
16445
16446
16447
16448
16449
16450
16451
16452
16453
16454
16455
16456
16457
16458
16459
16460
16461
16462
16463
16464
16465
16466
16467
16468
16469
16470
16471
16472
16473
16474
16475
16476
16477
16478
16479
16480
16481
16482
16483
16484
16485
16486
16487
16488
16489
16490
16491
16492
16493
16494
16495
16496
16497
16498
16499
16500
16501
16502
16503
16504
16505
16506
16507
16508
16509
16510
16511
16512
16513
16514
16515
16516
16517
16518
16519
16520
16521
16522
16523
16524
16525
16526
16527
16528
16529
16530
16531
16532
16533
16534
16535
16536
16537
16538
16539
16540
16541
16542
16543
16544
16545
16546
16547
16548
16549
16550
16551
16552
16553
16554
16555
16556
16557
16558
16559
16560
16561
16562
16563
16564
16565
16566
16567
16568
16569
16570
16571
16572
16573
16574
16575
16576
16577
16578
16579
16580
16581
16582
16583
16584
16585
16586
16587
16588
16589
16590
16591
16592
16593
16594
16595
16596
16597
16598
16599
16600
16601
16602
16603
16604
16605
16606
16607
16608
16609
16610
16611
16612
16613
16614
16615
16616
16617
16618
16619
16620
16621
16622
16623
16624
16625
16626
16627
16628
16629
16630
16631
16632
16633
16634
16635
16636
16637
16638
16639
16640
16641
16642
16643
16644
16645
16646
16647
16648
16649
16650
16651
16652
16653
16654
16655
16656
16657
16658
16659
16660
16661
16662
16663
16664
16665
16666
16667
16668
16669
16670
16671
16672
16673
16674
16675
16676
16677
16678
16679
16680
16681
16682
16683
16684
16685
16686
16687
16688
16689
16690
16691
16692
16693
16694
16695
16696
16697
16698
16699
16700
16701
16702
16703
16704
16705
16706
16707
16708
16709
16710
16711
16712
16713
16714
16715
16716
16717
16718
16719
16720
16721
16722
16723
16724
16725
16726
16727
16728
16729
16730
16731
16732
16733
16734
16735
16736
16737
16738
16739
16740
16741
16742
16743
16744
16745
16746
16747
16748
16749
16750
16751
16752
16753
16754
16755
16756
16757
16758
16759
16760
16761
16762
16763
16764
16765
16766
16767
16768
16769
16770
16771
16772
16773
16774
16775
16776
16777
16778
16779
16780
|
//! The pardes core: a text environment as a library, the way ghostty-vt is a
//! library. The platform shell owns the event loop and process-facing IO; it
//! feeds this core events (input, pty bytes, resizes) and reads back two plain values:
//! a Surface — the canonical cell-grid interface, which the tty shell hands to
//! vaxis nearly verbatim and the SDL shells rasterize — and a queue of Effects,
//! the IO the core wants performed (spawn a shell, write a pty, open a link).
//! Path-backed document and search operations may read synchronously; work
//! which needs a host or event loop is emitted as an Effect.
//!
//! Platform divergence inside the core is the `platform` comptime tag, used
//! the way the stdlib uses os.tag. Click-on-text semantics live in look.zig.
//!
//! src/ layout: the core lies flat at src/, and every SUBDIRECTORY is one
//! backend (tty/ gui/ lsp/) — so a file being in no directory at all is what
//! says it is core, and nothing needs a header to claim it.
//!
//! Not one key, button or piece of Look syntax is spelled in this file: every
//! one of them is a named binding in config.zig, and `hit`/`isPrefix` below are
//! the only two matchers. That is so retargeting anything is an edit in one
//! file, and so a later builtin can enumerate the bindings the way Help already
//! enumerates the leader.
const std = @import("std");
pub const animation = @import("animation.zig");
pub const panel_animation = @import("panel_animation.zig");
const uucode = @import("uucode");
const vaxis = @import("vaxis");
const mvzr = @import("mvzr");
const modal = @import("modal.zig");
const normal_input = @import("normal_input.zig");
const look = @import("look.zig");
pub const syntax = @import("syntax.zig");
const tracy = @import("tracy.zig");
const term_pane = @import("term_pane.zig");
const file_pane = @import("file_pane.zig");
const image_pane = @import("image_pane.zig");
pub const pdf_pane = @import("pdf_pane.zig");
const output_pane = @import("output_pane.zig");
const builtins = @import("builtins.zig");
const runtime_cfg = @import("runtime_config.zig");
/// Every board-shaped capacity, in one table keyed on a profile rather than on
/// the platform. See src/limits.zig.
const limits = @import("limits.zig");
const selection_pipe = @import("selection_pipe.zig");
/// acme's control filesystem, as a pure transaction over this core: the FILES
/// a script opens (`body`, `ctl`, `event`, ...) and what they mean. The
/// transport that carries requests in is a host's business (src/fuse.zig).
pub const acmefs = @import("acmefs.zig");
pub const config = @import("config.zig");
pub const pdf_enabled = pdf_pane.enabled;
pub const pdf = pdf_pane.pdf;
pub const allocators = @import("allocators.zig");
pub const image = @import("image.zig");
pub const dump = @import("dump.zig");
pub const lsp = @import("lsp/lsp.zig");
/// The host seam: one struct of optional function pointers, with in-core
/// defaults for every method a host leaves null. See src/host.zig.
const host_mod = @import("host.zig");
pub const Host = host_mod.Host;
pub const Fanout = host_mod.Fanout;
pub const Fallback = host_mod.Fallback;
pub const fallback_dump_path = host_mod.fallback_dump_path;
/// Tracy's frame boundary, re-exported so a host that is not a shell — the
/// fling benchmark — can delimit the same frames the tty loop delimits without
/// reaching around the core for src/tracy.zig and its build options. A no-op
/// unless -Dtracy names a Tracy checkout.
pub const frameMark = tracy.frameMark;
/// `p4` is ESP32-P4 firmware: a riscv32-freestanding core whose whole host is
/// a serial line. It joins `web` in having no filesystem, no ptys and no
/// config directory, which is what `hosted` below is for.
pub const Platform = enum { tty, gui, web, macos, esp32p4 };
pub const platform: Platform = @field(Platform, @tagName(@import("pardes_config").platform));
/// Whether a theme change FADES the anchored chrome palette or replaces it. Ten display frames
/// either way (`animation.transition_steps`), and on every screen but one that is a short legible
/// transition rather than a glitch.
///
/// The exception is a screen reached through a UART. Each of the ten steps recolors every anchored
/// cell, so the diff finds the whole chrome dirty and spends a frame's worth of wire on it, ten times
/// over, for a fade nobody can see arrive gradually anyway. Off by default for `esp32p4` and settable
/// either way from the build, because the thing that makes it wrong is the transport rather than the
/// target - see `build.zig`.
pub const theme_animation = @import("pardes_config").theme_animation;
/// WHICH BUILD THIS IS, for `--version` and for any bug report that follows it.
///
/// `version` is `build.zig.zon`'s `.version`, read from the manifest by
/// `build.zig` rather than copied beside it, so there is exactly one place to
/// bump. `commit` is the git revision it was built from, and it is OPTIONAL
/// because a source drop is not a repository: a tarball, a container with no
/// `git`, or any checkout outside version control all yield null, and a
/// frontend must say the version happily without one.
///
/// Both are strings the build baked in, never questions asked at runtime. A
/// binary that shelled out to `git` would describe whatever tree it was
/// standing in rather than the one it came from — and on the board there is
/// neither a `git` nor a process to run it with.
pub const version = @import("pardes_config").version;
pub const commit: ?[]const u8 = @import("pardes_config").commit;
/// A build with no host but its display: the embedded source filesystem, the
/// in-process clipboard, silent ptys. Comptime, and its own option module
/// rather than a `pardes_config` field, because it is the one setting that
/// produces a SECOND executable from the same graph — see `run-isolated`.
pub const isolated = @import("pardes_isolation").isolated;
/// Frontends that draw their own text, and can therefore be told which face to
/// wear. On the tty the font belongs to the terminal emulator and in the
/// browser it belongs to the page, so there the Font builtins are not
/// disabled so much as meaningless — see builtins.zig.
pub const font_picker = platform == .gui or platform == .macos;
/// Platforms whose host is a real operating system: a filesystem to open, a
/// pty to fork, a config directory to watch. The browser and the P4 firmware
/// have none of the three, and every gate that used to read `platform != .web`
/// reads this instead so a third such platform cannot forget one of them.
pub const hosted = platform == .tty or platform == .gui or platform == .macos;
/// Builds whose frontend can hand its screen to a detached core — which is
/// narrower than `hosted`, and the gap is a bug this predicate exists to close.
///
/// macOS is hosted, has a unix socket, and compiles `detached/`; what it does
/// not do is POLL. `takeAttach` is a poll rather than a host method precisely
/// because attaching replaces the core the call is running inside (see
/// `Effect.attach`), and `src/macos.zig` never calls it. Gated on `hosted`, the
/// `Attach` word therefore parsed, queued an effect, stored a request in
/// `attach_buf` — and did nothing at all, for ever, silently. That is the
/// failure this codebase refuses everywhere else, so the word does not exist
/// on a frontend that cannot serve it.
///
/// The two here are exactly the two `main.zig` accepts `--attach` for, which is
/// the same question asked at the command line instead of in a tag.
pub const can_attach = platform == .tty or platform == .gui;
/// Builds that HAVE terminal panes: a pane whose content is a live ghostty-vt
/// emulator being fed pty bytes. The P4 firmware has no processes, no ptys and
/// nothing that could produce a VT byte, so there the emulator is ~400 KiB of
/// flash and a PageList of RAM spent parsing input that cannot arrive — and it
/// drags a pile of freestanding root hooks in behind it (os.PATH_MAX,
/// os.heap.page_allocator, a cwd handle), none of which the core itself wants.
/// False means ghostty-vt is not in the module graph at all: build.zig never
/// even asks for the dependency.
///
/// A PLATFORM gate and deliberately NOT one derived from the target: `web` is
/// freestanding too and KEEPS the emulator, because the browser shell renders
/// terminal panes back out of a replayed dump. Every gate in the core keys off
/// this one name, and src/term_pane.zig re-exports it as `enabled` and owns
/// the whole seam — the two Pane slots included — so ghostty-vt ends up
/// imported by exactly one file.
pub const terminal_panes = platform != .esp32p4;
/// ...and the one fact about that face the core keeps: the name `Font` last
/// resolved, which the Debug overlay prints. Behind the same comptime shim
/// builtins.zig and macos.zig import this file with, so a tty or web binary
/// never analyses a font-directory walk it cannot use.
const fonts = if (font_picker) @import("fonts.zig") else struct {};
/// Native PDF quality is a shell property, but the core owns MuPDF and the
/// RGBA cache. Kitty favors wire bandwidth; SDL favors physical-pixel text
/// quality and asks the renderer to cover either fit axis without upscaling.
pub const PdfRasterPolicy = pdf_pane.RasterPolicy;
pub const kitty_pdf_raster_policy: PdfRasterPolicy = .{
.dpi = 96,
.max_dimension = 1200,
.match_viewport = false,
};
pub const sdl_pdf_raster_policy: PdfRasterPolicy = .{
.dpi = 192,
.max_dimension = 4096,
.match_viewport = true,
};
pub const pdf_raster_policy: PdfRasterPolicy = switch (platform) {
.tty => kitty_pdf_raster_policy,
// Both pixel shells rasterize for a real display and can afford it; the
// wire-bandwidth argument that shapes the Kitty policy does not apply.
.gui, .macos => sdl_pdf_raster_policy,
// Neither hostless platform rasterizes a PDF at all (mupdf is compiled
// out), so the cheaper policy is the honest placeholder.
.web, .esp32p4 => kitty_pdf_raster_policy,
};
// The capacities and the two heights that are STRUCTURE, not taste: the
// fixed-size pane/column arrays, and the fact that the topbar and a tag are
// one row each (nothing here works at any other value). The layout numbers
// that ARE taste — the gutter, the line-number prefix, scrolloff, the pane
// minimums — live in config.zig with everything else a user retargets.
pub const MAX_PANES = 16;
pub const PDF_PAGE_GAP_PX = pdf_pane.page_gap_px;
pub const MAX_COLS = 6;
/// 32 fractional bits leave ample precision for resize/restored ratios while
/// allowing every possible column split to divide an initial weight exactly.
const column_weight_unit: u64 = 1 << 32;
const max_column_weight: u64 = std.math.maxInt(u64) / MAX_COLS;
/// how far back the jump stack remembers. Vim keeps 100; this is a session of
/// at most sixteen panes, so the depth that matters is "more visits than you
/// can hold in your head" and the oldest entry falls off the bottom.
pub const MAX_JUMPS = 64;
pub const TOPBAR_H: u16 = 1;
pub const BOX_H: u16 = 1;
/// A place the keyboard has been: a pane AND a spot in it, which is the whole
/// upgrade over the stack of bare pane ids this replaces — Ctrl-o can now
/// rewind WITHIN a pane, and a Jumplist row can name a line.
///
/// It is SAFE against the pane it names dying: `serial` is the pane's own
/// identity, so an entry whose slot has since been handed to a different pane
/// reads as dead rather than silently retargeting itself at the newcomer, and
/// sync() drops it. What it does not do is outlive the pane — ponytail: a
/// location is a place in the SESSION, not on disk, so closing a file forgets
/// the entries pointing into it. To make Ctrl-o RE-OPEN a closed file, this
/// grows a path field and jumpBy looks it when the pane is gone.
pub const Loc = struct {
pane: u16,
serial: u32,
/// 1-based, both — this is the `path:LINE:COL` a look word spells, and
/// focusPaneLine takes exactly these. 0 = no spot, just the pane (see
/// trackJump: a shell whose cursor is still the program's).
line: u32,
col: u32,
};
test {
_ = @import("pdf_pane_integration_test.zig");
_ = @import("output_pane_integration_test.zig");
}
const pane_tail = " " ++ config.pane_builtins_str;
const file_pane_tail = " " ++ config.file_pane_builtins_str;
const terminal_pane_tail = " " ++ config.terminal_pane_builtins_str;
// Kept separate from the path so a click still expands to the exact filename.
// It belongs to the live, read-only prefix rather than the editable command
// tail: saving removes it without rewriting anything the user typed there.
const dirty_marker = " *";
// Version-1 dumps originally persisted only the whole rendered tag. These were
// the two canonical tails before New joined every pane; the compatibility
// parser recognizes them as defaults while new dumps carry an explicit tail.
const legacy_pane_tail = " Del";
const legacy_file_pane_tail = " Save Del";
// The defaults from the release before Newtty joined every tagline. Recognized
// so a dump written then upgrades instead of keeping the old word as a tail.
const prev_pane_tail = " New Del";
const prev_file_pane_tail = " Save New Del";
const legacy_terminal_pane_tail = " New Del Filter";
// ...and the terminal default from the release before Save reached it, when a
// scrollback was not yet something you could write to a path.
const prev_terminal_pane_tail = " New Newtty Del Filter";
// Builtins: executing the name (middle-click / Tab) runs it through the ONE
// dispatcher (runBuiltin, reached from execute), no matter where the name
// appears — and Look and Exec are two of them, so the click itself is a
// builtin. One STRUCT per builtin in builtins.zig — name, comment and
// body in one place — and this enum is folded out of THAT FILE'S declarations
// at comptime, so the enum FIELD NAME is still the user-visible word (the one
// in the topbar, the one sitting in a tag, the one Help prints, the one you
// execute) and `std.meta.stringToEnum` is still the lookup with no name table
// to keep in sync. It lands here rather than in builtins.zig because a
// container cannot hold a decl folded out of its own decl list, and here it
// sits with the other two comptime folds (builtin_rows, the topbar check).
const Builtin = builtins.registry.Builtin();
/// The PDF integration suite lives beside the PDF implementation instead of
/// making the core's first sixteen hundred lines pane-specific. These direct
/// test-only calls reach the few intentionally private core transactions that
/// the suite must observe; the declaration is empty in every non-test build.
pub const pdf_test = if (@import("builtin").is_test) struct {
pub fn tagText(p: *Pardes, arena: std.mem.Allocator, pane: *Pane) ![]u8 {
return p.tagText(arena, pane);
}
pub fn runBuiltin(
p: *Pardes,
name: []const u8,
id: usize,
txt: []const u8,
arg: ?[]const u8,
) bool {
const command = std.meta.stringToEnum(Builtin, name) orelse return false;
p.runBuiltin(command, id, txt, arg);
return true;
}
pub fn sync(p: *Pardes) void {
p.sync();
}
pub fn searchStep(p: *Pardes, id: usize, delta: i32) bool {
return p.searchStep(id, delta);
}
pub fn heldSelection(p: *Pardes, first: usize) ?[]const u8 {
return p.heldSelection(first);
}
} else struct {};
fn nextPipeEffect(p: *Pardes) ?u32 {
while (p.nextEffect()) |effect| switch (effect) {
.pipe => |request| return request.id,
else => {},
};
return null;
}
/// Perform every queued effect through the in-process host — what a real shell
/// does with the drain — and report the path the last `.save_text` among them
/// asked for, copied out of the effect into `buf`.
fn drainForSavePath(p: *Pardes, buf: []u8) ?[]const u8 {
var len: ?usize = null;
while (p.nextEffect()) |effect| {
switch (effect) {
.save_text => |st| {
const path = st.path.slice();
@memcpy(buf[0..path.len], path);
len = path.len;
},
else => {},
}
p.perform(effect);
}
return if (len) |n| buf[0..n] else null;
}
/// Drain the queue through the in-process host — what a shell's pump does with
/// it — and report the Attach among those effects. Going through `perform` is
/// the point: what a frontend acts on is what `takeAttach` hands back AFTER the
/// drain, not the effect value, which dies in the loop that read it.
fn drainForAttach(p: *Pardes) ?AttachRequest {
while (p.nextEffect()) |effect| p.perform(effect);
return p.takeAttach();
}
test "Attach asks for a session and tears nothing down" {
if (comptime !hosted) return; // no unix socket on this platform, so no word
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
// Bare means whichever session is there, and that is an EMPTY name rather
// than an absent request: the frontend still has to go and look.
try std.testing.expect(p.executeBuiltinLine(0, "Attach"));
const bare = drainForAttach(p) orelse return error.NoAttachAsked;
try std.testing.expectEqualStrings("", bare.name);
try std.testing.expectEqual(@as(u8, 0), bare.pane);
// ...and the named form carries its tail, the way `Theme <name>` does.
try std.testing.expect(p.executeBuiltinLine(0, "Attach work"));
const named = drainForAttach(p) orelse return error.NoAttachAsked;
try std.testing.expectEqualStrings("work", named.name);
try std.testing.expect(p.takeAttach() == null); // taken once, then gone
// The word only ASKS. A core that tore itself down here could not be handed
// back intact when the connect fails, and that is the entire guarantee.
try std.testing.expect(!p.quit);
try std.testing.expect(p.panes[0] != null);
}
test "Detach asks the frontend to leave, and says so when there is nothing to leave" {
if (comptime !hosted) return; // no unix socket on this platform, so no word
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
// Whole-word only, like Kill: the effect names the pane that ran it and
// carries nothing else, because the daemon that serves it already knows
// which frontend's keystroke arrived.
try std.testing.expect(p.executeBuiltinLine(0, "Detach"));
const asked = while (p.nextEffect()) |effect| switch (effect) {
.detach => |d| break d,
else => {},
} else return error.NoDetachAsked;
try std.testing.expectEqual(@as(u8, 0), asked.pane);
// ...and this core is a LOCAL shell — a bare `Host{}` fills in no
// `push_detach` — so performing it reports on that pane instead of
// dismissing a session this process is not part of.
p.perform(.{ .detach = asked });
const pane = p.panes[0].?;
try std.testing.expectEqualStrings("detach: NotAttached", pane.msg[0..pane.msg_len]);
try std.testing.expect(!p.quit);
}
test "selection pipe prompt submits exact request and Escape cancels" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("one\ntwo\n");
pane.cur_row = 0;
pane.cur_col = 2;
pane.vsel = .{ .active = true, .row = 0, .col = 0, .explicit = true };
p.update(.{ .key = .{ .cp = '|' } });
try std.testing.expect(pane.tag_edit and pane.hasPipePrompt());
try std.testing.expect(std.mem.endsWith(u8, pane.tagSlice(), config.pipe_marker));
try std.testing.expect(nextPipeEffect(p) == null);
p.update(.{ .key = .{ .cp = 't', .text = "tr a-z A-Z" } });
p.update(.{ .key = .{ .cp = Key.enter } });
try std.testing.expect(!pane.tag_edit and !pane.hasPipePrompt());
const id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
const request = p.pipeRequest(id) orelse return error.MissingPipeRequest;
try std.testing.expectEqualStrings("tr a-z A-Z", request.command);
try std.testing.expectEqualStrings("/", request.cwd);
try std.testing.expectEqual(@as(usize, 1), request.inputs.len);
try std.testing.expectEqualSlices(u8, "one", request.inputs[0].bytes);
const before = pane.file.?.content;
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.escape } });
try std.testing.expect(!pane.tag_edit and !pane.hasPipePrompt());
try std.testing.expectEqualSlices(u8, before, pane.file.?.content);
try std.testing.expect(nextPipeEffect(p) == null);
}
test "gj/gk step the wrapped rows a body draws while j/k keep the file's lines" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const long = "a" ** 400;
const pane = try p.hxOpenFileContent(long ++ "\nsecond\n");
p.settings.wrap = true;
const width = file_pane.wrapWidth(pane, true);
try std.testing.expect(width > 4 and long.len > width * 3);
// gj holds the column INSIDE the row and lands on the next break; the line
// is one line the whole way down, which is the whole point.
pane.cur_row = 0;
pane.cur_col = 3;
pane.sticky_col = -1;
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, 0), pane.cur_row);
try std.testing.expectEqual(@as(i32, @intCast(width + 3)), pane.cur_col);
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, @intCast(width * 2 + 3)), pane.cur_col);
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'k' } });
try std.testing.expectEqual(@as(i32, @intCast(width + 3)), pane.cur_col);
// A count is counted in rows, not lines.
p.update(.{ .key = .{ .cp = '2' } });
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, 0), pane.cur_row);
try std.testing.expectEqual(@as(i32, @intCast(width * 3 + 3)), pane.cur_col);
// Plain j/k are untouched: one FILE line each, whatever the body drew.
pane.cur_col = 3;
pane.sticky_col = -1;
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, 1), pane.cur_row);
p.update(.{ .key = .{ .cp = 'k' } });
try std.testing.expectEqual(@as(i32, 0), pane.cur_row);
// The last row of a line steps into the next line's first row, and the
// first row steps back onto the previous line's LAST row.
pane.cur_row = 0;
pane.cur_col = @intCast(long.len - 1);
pane.sticky_col = -1;
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, 1), pane.cur_row);
pane.cur_col = 0;
pane.sticky_col = -1;
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'k' } });
try std.testing.expectEqual(@as(i32, 0), pane.cur_row);
try std.testing.expect(pane.cur_col >= @as(i32, @intCast(long.len - long.len % width)));
// Wrap OFF: a line is one visual row, so gj/gk ARE j/k again.
p.settings.wrap = false;
pane.cur_row = 0;
pane.cur_col = 3;
pane.sticky_col = -1;
p.update(.{ .key = .{ .cp = 'g' } });
p.update(.{ .key = .{ .cp = 'j' } });
try std.testing.expectEqual(@as(i32, 1), pane.cur_row);
}
test "selection pipe replaces all ranges atomically and undo restores them" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("aa bb cc\n");
const pl = try p.paneCursorLines(pane);
const ranges = [_]modal.HxRange{
.{ .anchor = 0, .head = 2 },
.{ .anchor = 6, .head = 8 },
};
Pardes.setPaneRanges(pane, pl, pane.file.?.content, &ranges, &.{}, 0, true);
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
const request = p.pipeRequest(id) orelse return error.MissingPipeRequest;
try std.testing.expectEqual(@as(usize, 2), request.inputs.len);
try std.testing.expectEqualSlices(u8, "aa", request.inputs[0].bytes);
try std.testing.expectEqualSlices(u8, "cc", request.inputs[1].bytes);
const outputs: []const []const u8 = &.{ "AA\n", "" };
p.update(.{ .pipe_resp = .{ .id = id, .success = true, .outputs = outputs } });
try std.testing.expectEqualSlices(u8, "AA\n bb \n", pane.file.?.content);
try std.testing.expectEqual(@as(usize, 1), pane.file.?.undo_len);
try std.testing.expectEqual(@as(u8, 1), pane.nsel);
p.update(.{ .key = .{ .cp = 'u' } });
try std.testing.expectEqualSlices(u8, "aa bb cc\n", pane.file.?.content);
}
test "selection pipe failure and stale completion never mutate the file" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("abc\n");
pane.cur_col = 2;
pane.vsel = .{ .active = true, .row = 0, .col = 0, .explicit = true };
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const failed_id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
p.update(.{ .pipe_resp = .{ .id = failed_id, .success = false, .outputs = &.{} } });
try std.testing.expectEqualSlices(u8, "abc\n", pane.file.?.content);
try std.testing.expectEqual(@as(usize, 0), pane.file.?.undo_len);
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const stale_id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "changed\n"));
p.update(.{ .pipe_resp = .{ .id = stale_id, .success = true, .outputs = &.{"ABC"} } });
try std.testing.expectEqualSlices(u8, "changed\n", pane.file.?.content);
try std.testing.expectEqual(@as(usize, 0), pane.file.?.undo_len);
}
test "selection pipe rejects a reused pane slot and a superseded request" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
var pane = try p.hxOpenFileContent("old\n");
pane.cur_col = 2;
pane.vsel = .{ .active = true, .row = 0, .col = 0, .explicit = true };
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const replaced_id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
pane = try p.hxOpenFileContent("new\n"); // same slot, different serial
p.update(.{ .pipe_resp = .{ .id = replaced_id, .success = true, .outputs = &.{"OLD"} } });
try std.testing.expectEqualSlices(u8, "new\n", pane.file.?.content);
try std.testing.expectEqual(@as(usize, 0), pane.file.?.undo_len);
pane.cur_col = 2;
pane.vsel = .{ .active = true, .row = 0, .col = 0, .explicit = true };
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "cat" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const first_id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
p.update(.{ .key = .{ .cp = '|' } });
p.update(.{ .key = .{ .cp = 'c', .text = "tr a-z A-Z" } });
p.update(.{ .key = .{ .cp = Key.enter } });
const latest_id = nextPipeEffect(p) orelse return error.MissingPipeEffect;
try std.testing.expect(first_id != latest_id);
p.update(.{ .pipe_resp = .{ .id = first_id, .success = true, .outputs = &.{"BAD"} } });
try std.testing.expectEqualSlices(u8, "new\n", pane.file.?.content);
p.update(.{ .pipe_resp = .{ .id = latest_id, .success = true, .outputs = &.{"NEW"} } });
try std.testing.expectEqualSlices(u8, "NEW\n", pane.file.?.content);
try std.testing.expectEqual(@as(usize, 1), pane.file.?.undo_len);
}
test "selection pipe binding is file-normal-only" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("x");
pane.file.?.output = .{ .from = .search };
p.update(.{ .key = .{ .cp = '|' } });
try std.testing.expect(!pane.hasPipePrompt());
pane.file.?.output = null;
pane.mode = .insert;
p.update(.{ .key = .{ .cp = '|', .text = "|" } });
try std.testing.expect(!pane.hasPipePrompt());
try std.testing.expectEqualSlices(u8, "|x", pane.file.?.content);
}
test "insert newline adds one indent level after a closing call" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent(" callback({})\n");
pane.mode = .insert;
pane.cur_col = 16;
p.update(.{ .key = .{ .cp = Key.enter } });
try std.testing.expectEqualSlices(u8, " callback({})\n \n", pane.file.?.content);
try std.testing.expectEqual(@as(i32, 1), pane.cur_row);
try std.testing.expectEqual(@as(i32, 8), pane.cur_col);
}
test "startup config runs builtin lines in order and isolates bad lines" {
const p = try Pardes.init(std.testing.allocator, .{
.startup_config =
\\Theme dark
\\DefinitelyNotABuiltin
\\Kill trailing-garbage
\\Theme no-such-theme
\\Theme acme
,
});
defer p.deinit();
// The last valid command wins even after unknown, malformed, and
// well-formed-but-failing lines. `Kill trailing-garbage` must not be
// accepted as Kill, nor fall through to the shell from config.
try std.testing.expectEqualStrings("acme", p.theme().name);
try std.testing.expect(!p.animationActive());
try std.testing.expectEqual(ChromeTheme.fromTheme(p.theme()), p.chromeTheme().*);
try std.testing.expect(!p.quit);
for (0..p.effects_len) |i| switch (p.effects[(p.effects_head + i) % p.effects.len]) {
.write => |w| {
try std.testing.expect(std.mem.indexOf(u8, w.bytes.slice(), "DefinitelyNotABuiltin") == null);
try std.testing.expect(std.mem.indexOf(u8, w.bytes.slice(), "Kill") == null);
},
else => {},
};
}
test "ThemeFile parses ZON atomically and Theme returns to the compiled ring" {
if (platform == .web) return;
const p = try Pardes.init(std.testing.allocator, .{
.tty_only = true,
.config_dir = "/tmp/pardes-config",
});
defer p.deinit();
while (p.nextEffect()) |_| {}
p.requestThemeFile(0, "themes/mine.zon");
const request_effect = while (p.nextEffect()) |effect| switch (effect) {
.theme_file => |request| break request,
else => {},
} else return error.MissingThemeFileEffect;
try std.testing.expect(request_effect.on);
const request = p.themeFileRequest(request_effect.generation) orelse
return error.MissingThemeFileRequest;
try std.testing.expectEqualStrings("/tmp/pardes-config/themes/mine.zon", request.path);
var custom = themes[0];
custom.name = "mine";
custom.bg = .{ 1, 2, 3 };
custom.tag_bg = .{ 4, 5, 6 };
var encoded: std.Io.Writer.Allocating = .init(std.testing.allocator);
defer encoded.deinit();
try std.zon.stringify.serialize(custom, .{ .whitespace = true }, &encoded.writer);
try std.testing.expect(p.loadThemeFile(request_effect.generation, encoded.written(), false));
try std.testing.expectEqualStrings("mine", p.theme().name);
try std.testing.expectEqual(@as(?[3]u8, .{ 1, 2, 3 }), p.theme().bg);
try std.testing.expectEqual(ChromeTheme.fromTheme(p.theme()), p.chromeTheme().*);
// A half-written save is rejected without disturbing the last good value.
try std.testing.expect(!p.loadThemeFile(request_effect.generation, ".{ .name = ", true));
try std.testing.expectEqualStrings("mine", p.theme().name);
try std.testing.expectEqual(@as(?[3]u8, .{ 1, 2, 3 }), p.theme().bg);
p.setThemeIndex(0);
try std.testing.expectEqualStrings(themes[0].name, p.theme().name);
try std.testing.expect(p.themeFileRequest(request_effect.generation) == null);
const stop = while (p.nextEffect()) |effect| switch (effect) {
.theme_file => |theme_file| break theme_file,
else => {},
} else return error.MissingThemeFileStop;
try std.testing.expect(!stop.on);
}
test "scene effects keep the idle frontend animation clock active" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true });
defer p.deinit();
try std.testing.expect(!p.animationActive());
p.settings.scene_effects.crt = true;
try std.testing.expect(p.animationActive());
p.settings.scene_effects = .{ .ripple = true };
try std.testing.expect(p.animationActive());
p.settings.scene_effects = .{ .glitch = true };
try std.testing.expect(p.animationActive());
p.settings.scene_effects = .{};
try std.testing.expect(!p.animationActive());
}
test "runtime theme changes animate chrome and retarget without a jump" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true });
defer p.deinit();
const first = p.chromeTheme().*;
try std.testing.expect(!p.animationActive());
const dark_index = for (themes, 0..) |th, i| {
if (std.mem.eql(u8, th.name, "dark")) break i;
} else return error.MissingDarkTheme;
const acme_index = for (themes, 0..) |th, i| {
if (std.mem.eql(u8, th.name, "acme")) break i;
} else return error.MissingAcmeTheme;
p.setThemeIndex(dark_index);
// Target semantics are immediate, while the displayed chrome begins at
// the exact previous frame.
try std.testing.expectEqualStrings("dark", p.theme().name);
try std.testing.expectEqual(first, p.chromeTheme().*);
try std.testing.expect(p.animationActive());
p.update(.tick);
p.update(.tick);
p.update(.tick);
const midflight = p.chromeTheme().*;
try std.testing.expect(!std.meta.eql(first, midflight));
p.setThemeIndex(acme_index);
try std.testing.expectEqualStrings("acme", p.theme().name);
try std.testing.expectEqual(midflight, p.chromeTheme().*);
try std.testing.expect(p.animationActive());
for (0..animation.transition_steps) |_| p.update(.tick);
try std.testing.expect(!p.animationActive());
try std.testing.expectEqual(ChromeTheme.fromTheme(p.theme()), p.chromeTheme().*);
// Extra ticks are inert at the exact endpoint.
p.update(.tick);
try std.testing.expectEqual(ChromeTheme.fromTheme(p.theme()), p.chromeTheme().*);
}
test "render uses target content colors while chrome is in flight" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true, .cols = 40, .rows = 12 });
defer p.deinit();
const source_chrome = p.chromeTheme().*;
const acme_index = for (themes, 0..) |th, i| {
if (std.mem.eql(u8, th.name, "acme")) break i;
} else return error.MissingAcmeTheme;
p.setThemeIndex(acme_index);
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const surface = try p.render(frame.allocator());
// The anchored topbar has not advanced from its source frame.
try std.testing.expectEqual(
Color{ .rgb = source_chrome.tag_bg },
surface.at(0, 0).style.bg,
);
const topbar_cell = surface.at(0, 0);
try std.testing.expect(!std.mem.eql(u8, topbar_cell.grapheme(), " "));
try std.testing.expectEqual(FontRole.tagline, topbar_cell.style.font_role);
const r = p.rects[0];
const tag_cell = find_tag_cell: {
var x = r.x + config.GUTTER;
while (x < r.x + r.w) : (x += 1) {
const cell = surface.at(x, r.y);
if (!std.mem.eql(u8, cell.grapheme(), " ")) break :find_tag_cell cell;
}
return error.MissingTagText;
};
try std.testing.expectEqual(FontRole.tagline, tag_cell.style.font_role);
try std.testing.expectEqual(FontRole.tagline, surface.at(r.x, r.y).style.font_role);
try std.testing.expectEqual(FontRole.tagline, surface.at(r.x + r.w - 1, r.y).style.font_role);
// The document/terminal page does not ride the chrome animation: acme's
// target background is already present in the same render.
const body = surface.at(r.x + r.w - 1, r.y + r.h - 1);
try std.testing.expectEqual(FontRole.body, body.style.font_role);
try std.testing.expectEqual(
Color{ .rgb = p.theme().bg.? },
body.style.bg,
);
try std.testing.expect(p.animationActive());
}
test "topbar hover highlights exactly the executable word" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true, .cols = 40, .rows = 12 });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
_ = try p.render(frame.allocator());
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = 1, .row = 0 } });
_ = frame.reset(.retain_capacity);
const hovered = try p.render(frame.allocator());
for (0.."New".len) |col| {
const cell = hovered.at(@intCast(col), 0);
try std.testing.expectEqual(Color{ .rgb = p.theme().sel_bg }, cell.style.bg);
try std.testing.expectEqual(Color{ .rgb = p.theme().sel_fg }, cell.style.fg);
}
try std.testing.expectEqual(Color{ .rgb = p.chromeTheme().tag_bg }, hovered.at(3, 0).style.bg);
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = 3, .row = 0 } });
_ = frame.reset(.retain_capacity);
const whitespace = try p.render(frame.allocator());
try std.testing.expectEqual(Color{ .rgb = p.chromeTheme().tag_bg }, whitespace.at(1, 0).style.bg);
p.update(.pointer_leave);
_ = frame.reset(.retain_capacity);
const left = try p.render(frame.allocator());
try std.testing.expectEqual(Color{ .rgb = p.chromeTheme().tag_bg }, left.at(1, 0).style.bg);
}
test "pane-tag Exec prefers New and argument builtins before shell fallback" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {} // initial shell spawn/geometry
p.acknowledgeShell(0, "/bin/sh", false);
const pane = p.panes[0].?;
try std.testing.expectEqualStrings(" Save New Newtty Del Filter", Pardes.curTail(pane));
const tag_x = p.rects[0].x + config.GUTTER;
const tag_y = p.rects[0].y;
// A real middle-click on the canonical pane-tag word reaches Exec, which
// must consume New as a builtin before any write can reach the shell.
// The builtins are right-aligned (see tagGap), so the column is found in
// the rendered tag rather than assumed to be at its left edge.
const rendered = try p.tagText(p.scratch.allocator(), pane);
const new_x = tag_x + @as(u16, @intCast(std.mem.indexOf(u8, rendered, "New").?)) + 1;
var panes_before: usize = 0;
for (p.panes) |s| if (s != null) {
panes_before += 1;
};
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .press, .col = new_x, .row = tag_y } });
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .release, .col = new_x, .row = tag_y } });
while (p.nextEffect()) |effect| switch (effect) {
.write => return error.NewFellThroughToPty,
else => {},
};
var panes_after: usize = 0;
for (p.panes) |s| if (s != null) {
panes_after += 1;
};
try std.testing.expectEqual(panes_before + 1, panes_after);
try std.testing.expect(p.panes[p.active].?.file.?.output != null); // the scratch
// Argument-taking builtins use the same gesture path: a tag sweep is the
// complete command line, and Theme consumes its tail without a PTY write.
pane.tag_tail_len = 0;
try std.testing.expect(pane.appendTag(" Theme dark"));
pane.tag_init = true;
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .press, .col = tag_x + 1, .row = tag_y } });
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .drag, .col = tag_x + 10, .row = tag_y } });
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .release, .col = tag_x + 10, .row = tag_y } });
try std.testing.expectEqualStrings("dark", p.theme().name);
while (p.nextEffect()) |effect| switch (effect) {
.write => return error.ArgumentBuiltinFellThroughToPty,
else => {},
};
// Fixed-name builtins remain exact: a tail does not turn New or Kill into
// a match (especially important for the destructive one).
try std.testing.expect(!p.executeBuiltinLine(0, "New argument"));
try std.testing.expect(!p.executeBuiltinLine(0, "Kill trailing-garbage"));
try std.testing.expect(!p.quit);
// A word absent from the builtin vocabulary takes the fallback, including
// the terminating carriage return expected by the shell prompt.
pane.tag_tail_len = 0;
try std.testing.expect(pane.appendTag(" DefinitelyNotABuiltin"));
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .press, .col = tag_x + 1, .row = tag_y } });
p.update(.{ .mouse = .{ .button = config.exec_button, .kind = .release, .col = tag_x + 1, .row = tag_y } });
var sent: [256]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, 0), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
else => {},
};
try std.testing.expectEqualStrings("DefinitelyNotABuiltin\r", sent[0..sent_len]);
}
test "Filter is ordered after Del and toggles only its terminal pane" {
const testing = std.testing;
const del = std.meta.stringToEnum(Builtin, "Del") orelse return error.MissingDelBuiltin;
const filter = std.meta.stringToEnum(Builtin, "Filter") orelse return error.MissingFilterBuiltin;
try testing.expectEqual(@intFromEnum(del) + 1, @intFromEnum(filter));
const p = try Pardes.init(testing.allocator, .{ .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const first = p.panes[0].?;
const palette_before = first.vt.colorForXterm(.{ .palette = 1 }).?;
try testing.expect(first.tty_filter);
try testing.expect(p.executeBuiltinLine(0, "Filter"));
try testing.expect(!first.tty_filter);
try testing.expect(palette_before.eql(first.vt.colorForXterm(.{ .palette = 1 }).?));
const second_id = p.freeSlot().?;
const second = try p.newShell(second_id, "");
try testing.expect(second.tty_filter);
try testing.expect(p.executeBuiltinLine(second_id, "Filter"));
try testing.expect(!second.tty_filter);
try testing.expect(!first.tty_filter);
const doc_id = p.freeSlot().?;
const doc = try image_pane.create(p, doc_id, "/tmp/filter-inert.ppm", &.{});
try testing.expect(!doc.tty_filter);
try testing.expect(p.executeBuiltinLine(doc_id, "Filter"));
try testing.expect(!doc.tty_filter);
try testing.expect(!first.tty_filter);
try testing.expect(p.executeBuiltinLine(0, "Filter"));
try testing.expect(first.tty_filter);
try testing.expect(!second.tty_filter);
}
test "an untouched tagline ends where its layout column's widest one does" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {} // initial shell spawn/geometry
// a second shell BELOW the first — what Alt-n does — sitting in a
// directory too long to leave tag_right_pad columns free
const below_id = p.freeSlot().?;
const below = try p.newShell(below_id, "");
const f = p.layoutFindTerm(p.active).?;
p.layoutInsert(f.col, f.idx + 1, below_id);
p.splitBelow(p.active, below);
p.setCwd(below_id, "/a/deep/dir/whose/name/eats/the/right/pad/the/end/of/its/own/tagline");
p.sync();
while (p.nextEffect()) |_| {}
const above = p.panes[0].?;
try std.testing.expectEqual(p.rects[0].x, p.rects[below_id].x);
const above_tag = try p.tagText(p.scratch.allocator(), above);
const below_tag = try p.tagText(p.scratch.allocator(), below);
// one column, so the tails end together — and past the pad, at the long
// path, which is the whole point (equal at tw - tag_right_pad would prove
// nothing: that is where both sat before)
try std.testing.expectEqual(below_tag.len, above_tag.len);
const tail = " Save New Newtty Del Filter";
try std.testing.expectEqualStrings(tail, above_tag[above_tag.len - tail.len ..]);
try std.testing.expect(above_tag.len > @as(usize, p.rects[0].w) - config.GUTTER - config.tag_right_pad);
try std.testing.expect(above_tag.len <= @as(usize, p.rects[0].w) - config.GUTTER);
// A voter too wide for the pane is counted AT the pane's edge, not
// dropped: dropping it is a threshold, and one column of resize either
// side of the fit would move every tagline in the column by the whole pad
// while you drag the window edge. One column in, one column out.
p.update(.{ .resize = .{ .cols = 88, .rows = 30 } });
while (p.nextEffect()) |_| {}
const fits = (try p.tagText(p.scratch.allocator(), above)).len;
p.update(.{ .resize = .{ .cols = 87, .rows = 30 } });
while (p.nextEffect()) |_| {}
try std.testing.expectEqual(fits - 1, (try p.tagText(p.scratch.allocator(), above)).len);
p.update(.{ .resize = .{ .cols = 100, .rows = 30 } });
while (p.nextEffect()) |_| {}
// Touching the widest tag freezes ITS gap and must move nobody: it goes on
// voting with the end it was frozen at, however much is typed after the
// builtins. (A plain click seeds the tail, so the alternative is every
// other tagline in the column snapping left the moment you click one.)
p.seedTail(below);
try std.testing.expect(below.appendTag(" lots and lots of typing out here"));
try std.testing.expectEqual(above_tag.len, (try p.tagText(p.scratch.allocator(), above)).len);
// A pane squeezed off the bottom is not drawn, so it stops voting and the
// column falls back to the pad — 2 rows is one tagline and no room for the
// second pane at all.
p.update(.{ .resize = .{ .cols = 100, .rows = 2 } });
while (p.nextEffect()) |_| {}
try std.testing.expectEqual(@as(u16, 0), p.rects[below_id].h);
try std.testing.expectEqual(
@as(usize, p.rects[0].w) - config.GUTTER - config.tag_right_pad,
(try p.tagText(p.scratch.allocator(), above)).len,
);
}
test "legacy default tag tails upgrade while custom tails remain owned" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{});
defer p.deinit();
const terminal = p.panes[0].?;
const terminal_old = try std.fmt.allocPrint(p.scratch.allocator(), "{s}{s}", .{
try p.tagPrefix(terminal),
legacy_pane_tail,
});
p.restoreTail(terminal, terminal_old);
try std.testing.expect(!terminal.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del Filter", Pardes.curTail(terminal));
// The two preceding releases used the generic current default and then the
// Filter tail without Save. Both upgrade, including any saved layout
// padding.
const terminal_previous = try std.fmt.allocPrint(p.scratch.allocator(), "{s} New Del", .{
try p.tagPrefix(terminal),
});
p.restoreTail(terminal, terminal_previous);
try std.testing.expect(!terminal.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del Filter", Pardes.curTail(terminal));
const terminal_prefilter = try std.fmt.allocPrint(p.scratch.allocator(), "{s}{s}", .{
try p.tagPrefix(terminal),
prev_terminal_pane_tail,
});
p.restoreTail(terminal, terminal_prefilter);
try std.testing.expect(!terminal.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del Filter", Pardes.curTail(terminal));
const terminal_custom = try std.fmt.allocPrint(p.scratch.allocator(), "{s} Keep Del", .{
try p.tagPrefix(terminal),
});
p.restoreTail(terminal, terminal_custom);
try std.testing.expect(terminal.tag_init);
try std.testing.expectEqualStrings(" Keep Del", Pardes.curTail(terminal));
// The first dump format included tty mode in the live prefix. Its stored
// cwd still identifies where the editable bytes begin after the mode word
// disappeared from today's tag, so a custom tail must survive that move.
terminal.tag_tail_len = 0;
terminal.tag_init = false;
p.restoreDumpTail(terminal, .{
.kind = .terminal,
.tag = "TTY /historical/cwd Keep Del",
.body = "",
.terminal = .{ .cwd = "/historical/cwd" },
});
try std.testing.expect(terminal.tag_init);
try std.testing.expectEqualStrings(" Keep Del", Pardes.curTail(terminal));
terminal.tag_tail_len = 0;
terminal.tag_init = false;
p.restoreDumpTail(terminal, .{
.kind = .terminal,
.tag = "TTY /historical/cwd New Del",
.body = "",
.terminal = .{ .cwd = "/historical/cwd" },
});
try std.testing.expect(!terminal.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del Filter", Pardes.curTail(terminal));
// This happens to be the historical FILE default, but on a terminal it is
// user-owned text and must not be swallowed by migration.
terminal.tag_tail_len = 0;
terminal.tag_init = false;
const terminal_fileish = try std.fmt.allocPrint(p.scratch.allocator(), "{s} Save Del", .{
try p.tagPrefix(terminal),
});
p.restoreTail(terminal, terminal_fileish);
try std.testing.expect(terminal.tag_init);
try std.testing.expectEqualStrings(" Save Del", Pardes.curTail(terminal));
// A savable file has a distinct old default. Save remains first after the
// migration so the tag's established `:w<Tab>` route is unchanged.
const file = try p.hxOpenFileContent("");
const file_old = try std.fmt.allocPrint(p.scratch.allocator(), "{s}{s}", .{
try p.tagPrefix(file),
legacy_file_pane_tail,
});
p.restoreTail(file, file_old);
try std.testing.expect(!file.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del", Pardes.curTail(file));
const file_custom = try std.fmt.allocPrint(p.scratch.allocator(), "{s} Save Mine Del", .{
try p.tagPrefix(file),
});
p.restoreTail(file, file_custom);
try std.testing.expect(file.tag_init);
try std.testing.expectEqualStrings(" Save Mine Del", Pardes.curTail(file));
// Conversely the generic pane's current default is a custom edit on a
// savable file. Legacy recognition is scoped to the source pane class.
file.tag_tail_len = 0;
file.tag_init = false;
const file_generic = try std.fmt.allocPrint(p.scratch.allocator(), "{s} New Del", .{
try p.tagPrefix(file),
});
p.restoreTail(file, file_generic);
try std.testing.expect(file.tag_init);
try std.testing.expectEqualStrings(" New Del", Pardes.curTail(file));
// Before renderer choices appeared in the live prefix, image dumps began
// with only `img PATH`. Their custom tails still migrate through the
// pane-specific legacy-prefix recognizer.
const image_doc = try image_pane.create(p, 1, "/tmp/legacy image.ppm", &.{});
try std.testing.expectEqualStrings(" New Newtty Del", Pardes.curTail(image_doc));
p.restoreDumpTail(image_doc, .{
.kind = .image,
.tag = "img /tmp/legacy image.ppm Keep Del",
.body = "",
.image = .{ .path = "/tmp/legacy image.ppm" },
});
try std.testing.expect(image_doc.tag_init);
try std.testing.expectEqualStrings(" Keep Del", image_doc.tagSlice());
}
test "Joincol folds the active column into its right neighbor, keeping its panes" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const right = p.freeSlot().?;
_ = try p.newShell(right, "");
try std.testing.expect(p.layoutSplitColumn(0, right, false));
while (p.nextEffect()) |_| {}
try std.testing.expectEqual(@as(usize, 2), p.ncol);
p.active = 0; // the left column is current
p.joinCol();
try std.testing.expectEqual(@as(usize, 1), p.ncol);
const lf = p.layoutFindTerm(0) orelse return error.LostLeftPane;
const rf = p.layoutFindTerm(right) orelse return error.LostRightPane;
try std.testing.expectEqual(lf.col, rf.col);
p.joinCol(); // no right neighbor left: inert
try std.testing.expectEqual(@as(usize, 1), p.ncol);
}
test "Newtty spawns a raw shell in the caller's directory" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
p.setCwd(0, "/tmp/newtty-dir");
p.spawnTty(0);
const free = p.active;
try std.testing.expect(free != 0);
const nt = p.panes[free] orelse return error.NoNewPane;
try std.testing.expect(nt.isTerminal());
try std.testing.expect(nt.mode == .tty);
var found = false;
while (p.nextEffect()) |effect| switch (effect) {
.spawn => |s| if (@as(usize, s.pane) == free) {
try std.testing.expectEqualStrings("/tmp/newtty-dir", s.cwd.slice());
found = true;
},
else => {},
};
try std.testing.expect(found);
}
test "an unsaved file marker sits between its path and builtins until Save" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("before\n");
const clean = try p.tagText(p.scratch.allocator(), pane);
try std.testing.expect(std.mem.indexOf(u8, clean, "/hxcase.txt *") == null);
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "after\n"));
const dirty = try p.tagText(p.scratch.allocator(), pane);
const marker_at = std.mem.indexOf(u8, dirty, "/hxcase.txt *") orelse return error.MissingDirtyMarker;
const save_at = std.mem.indexOf(u8, dirty, "Save") orelse return error.MissingSaveBuiltin;
try std.testing.expect(marker_at < save_at);
try std.testing.expect(p.executeBuiltinLine(0, "Save"));
const saved = try p.tagText(p.scratch.allocator(), pane);
try std.testing.expect(std.mem.indexOf(u8, saved, "/hxcase.txt *") == null);
file_pane.changed(p, 0, "external\n");
const reloaded = try p.tagText(p.scratch.allocator(), pane);
try std.testing.expect(std.mem.indexOf(u8, reloaded, "/hxcase.txt *") == null);
// A generated output is file-shaped and Save can write it to a path, but
// there is no file of its own for it to be dirty against.
pane.file.?.output = .{ .from = .search };
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "result\n"));
const output = try p.tagText(p.scratch.allocator(), pane);
try std.testing.expect(std.mem.indexOf(u8, output, "/hxcase.txt *") == null);
}
test "unknown Exec from an image writes to a terminal in the image directory" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{});
defer p.deinit();
while (p.nextEffect()) |_| {}
p.acknowledgeShell(0, "/bin/sh", false);
p.setCwd(0, "/tmp/pardes-image-dir");
const image_doc = try p.newDocPane(1);
image_doc.image = .{ .path = try gpa.dupe(u8, "/tmp/pardes-image-dir/pic.ppm") };
try std.testing.expectEqualStrings("/tmp/pardes-image-dir", Pardes.paneDir(image_doc));
try std.testing.expectEqual(@as(?usize, 0), p.execute(1, "echo image-fallback"));
var sent: [256]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, 0), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
.spawn => return error.ImageExecSpawnedDespiteMatchingTerminal,
else => {},
};
try std.testing.expectEqualStrings("echo image-fallback\r", sent[0..sent_len]);
}
/// The host's tty query, as a test double: which panes a program is holding,
/// and how many times the core actually bothered to ask. The count is the
/// laziness contract — nothing but a command line about to be typed may ask.
const FakeTtyQuery = struct {
taken: [MAX_PANES]bool = @splat(false),
asked: usize = 0,
const vtable: Host.VTable = .{ .pull_tty_taken = answer };
fn install(f: *FakeTtyQuery, p: *Pardes) void {
p.host = .{ .ctx = f, .vtable = &vtable };
}
fn answer(ctx: ?*anyopaque, pane: u8) bool {
const f: *FakeTtyQuery = @ptrCast(@alignCast(ctx.?));
f.asked += 1;
return f.taken[pane];
}
};
test "Exec in a terminal whose tty is taken spawns a shell instead of typing at the program" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{});
defer p.deinit();
while (p.nextEffect()) |_| {}
p.setCwd(0, "/tmp/pardes-taken");
// vim, a pager, an agent: the host answers that this pane's tty is no
// longer the prompt pardes forked
var host: FakeTtyQuery = .{};
host.install(p);
host.taken[0] = true;
const dst = p.execute(0, "echo taken-fallback") orelse return error.ExecFoundNowhereToRun;
// somewhere ELSE — and still without moving focus, which is execute's
// contract and the whole difference between it and a look
try std.testing.expect(dst != 0);
try std.testing.expectEqual(@as(usize, 0), p.active);
var spawned: ?Effect = null;
var sent: [256]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
if (w.pane == 0) return error.WroteACommandLineIntoTheProgramOnTheTty;
try std.testing.expectEqual(@as(u8, @intCast(dst)), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
.spawn => spawned = effect,
else => {},
};
const sp = (spawned orelse return error.NoShellForTheOccupiedTerminal).spawn;
try std.testing.expectEqual(@as(u8, @intCast(dst)), sp.pane);
// ...in the directory the command was about, which is the taken pane's own
try std.testing.expectEqualStrings("/tmp/pardes-taken", sp.cwd.slice());
// A plain/unsupported shell has no OSC 133 B to wait for. Successful
// fork acknowledgement opens the gate and the pty itself buffers input
// until that child reads it.
try std.testing.expectEqual(@as(usize, 0), sent_len);
p.acknowledgeShell(dst, "/bin/sh", false);
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, @intCast(dst)), w.pane);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
else => {},
};
try std.testing.expectEqualStrings("echo taken-fallback\r", sent[0..sent_len]);
}
test "image dump restores source bytes renderer choices and exact custom tail" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true });
defer p.deinit();
p.deinitPane(p.panes[0].?);
p.panes[0] = null;
const source = "\x00embedded image bytes\xff";
const raw = try p.image_gpa.dupe(u8, source);
const pane = image_pane.create(p, 0, "/missing/restored-image.ppm", raw) catch |err| {
p.image_gpa.free(raw);
return err;
};
pane.image.?.petscii = true;
pane.image.?.pmode = .terminal;
pane.image.?.ascii = false;
try std.testing.expect(pane.appendTag(" Keep Del"));
pane.tag_init = true;
try p.dumpState();
const first = try dump.readZon(gpa, p.dump_out.?, "image-first-dump");
defer dump.free(gpa, first);
try std.testing.expect(first.panes[0].image.?.petscii);
try std.testing.expectEqual(dump.ImagePalette.terminal, first.panes[0].image.?.palette);
try std.testing.expect(!first.panes[0].image.?.ascii);
try std.testing.expectEqualStrings(" Keep Del", first.panes[0].tag_tail.?);
const restored = try Pardes.initFromDump(gpa, .{ .tty_only = true }, p.dump_out.?);
defer restored.deinit();
const restored_pane = restored.panes[0].?;
try std.testing.expect(restored_pane.image.?.petscii);
try std.testing.expectEqual(image.PaletteMode.terminal, restored_pane.image.?.pmode);
try std.testing.expect(!restored_pane.image.?.ascii);
try std.testing.expect(restored_pane.tag_init);
try std.testing.expectEqualStrings(" Keep Del", restored_pane.tagSlice());
try std.testing.expectEqualSlices(u8, source, restored_pane.image.?.raw);
try restored.dumpState();
const redump = try dump.readZon(gpa, restored.dump_out.?, "image-redump");
defer dump.free(gpa, redump);
const encoded = redump.panes[0].image.?.bytes_b64;
const decoded = try dump.decodeBytes(gpa, encoded);
defer gpa.free(decoded);
try std.testing.expectEqualSlices(u8, source, decoded);
try std.testing.expect(redump.panes[0].image.?.petscii);
try std.testing.expectEqual(dump.ImagePalette.terminal, redump.panes[0].image.?.palette);
try std.testing.expect(!redump.panes[0].image.?.ascii);
try std.testing.expectEqualStrings(" Keep Del", redump.panes[0].tag_tail.?);
}
test "Exec from a document pane skips an occupied terminal in its directory and spawns" {
// The test above this pair ("unknown Exec from an image...") is the same
// setup with the terminal at its prompt, and it reuses pane 0. The single
// difference here is the verdict.
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{});
defer p.deinit();
while (p.nextEffect()) |_| {}
p.setCwd(0, "/tmp/pardes-image-dir");
const image_doc = try p.newDocPane(1);
image_doc.image = .{ .path = try gpa.dupe(u8, "/tmp/pardes-image-dir/pic.ppm") };
var host: FakeTtyQuery = .{};
host.install(p);
host.taken[0] = true;
const dst = p.execute(1, "echo image-fallback") orelse return error.ExecFoundNowhereToRun;
try std.testing.expect(dst != 0 and dst != 1);
var spawned: ?Effect = null;
var sent: [256]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
if (w.pane == 0) return error.WroteACommandLineIntoTheProgramOnTheTty;
try std.testing.expectEqual(@as(u8, @intCast(dst)), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
.spawn => spawned = effect,
else => {},
};
const sp = (spawned orelse return error.NoShellForTheOccupiedTerminal).spawn;
try std.testing.expectEqualStrings("/tmp/pardes-image-dir", sp.cwd.slice());
try std.testing.expectEqual(@as(usize, 0), sent_len);
p.acknowledgeShell(dst, "/bin/sh", false);
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, @intCast(dst)), w.pane);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
else => {},
};
try std.testing.expectEqualStrings("echo image-fallback\r", sent[0..sent_len]);
}
test "a Look on a directory does not type ls into an occupied terminal" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
// /tmp rather than a made-up name: the look resolves against the real
// filesystem, so the directory has to exist for this arm to be reached
p.setCwd(0, "/tmp");
var host: FakeTtyQuery = .{};
host.install(p);
host.taken[0] = true;
p.lookAt(0, "/tmp");
var spawned = false;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| if (w.pane == 0) return error.TypedLsIntoTheProgramOnTheTty,
.spawn => spawned = true,
else => {},
};
try std.testing.expect(spawned);
// ...and the same look reuses that very pane once its program is gone: the
// core keeps no state of its own about it, so recovery needs nothing reset
host.taken[0] = false;
p.lookAt(0, "/tmp");
var sent: [64]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, 0), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
.spawn => return error.SpawnedDespiteAFreeTerminalOnTheDirectory,
else => {},
};
try std.testing.expectEqualStrings("ls\r", sent[0..sent_len]);
try std.testing.expectEqual(@as(usize, 0), p.active);
}
test "a terminal its program gave back takes command lines again" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{});
defer p.deinit();
while (p.nextEffect()) |_| {}
p.acknowledgeShell(0, "/bin/sh", false);
p.setCwd(0, "/tmp/pardes-taken-flip");
var host: FakeTtyQuery = .{};
host.install(p);
host.taken[0] = true;
try std.testing.expect(p.execute(0, "echo while-taken") != 0);
while (p.nextEffect()) |_| {}
// the program exited, so the host's answer changes — and the core asks
// again, because it never cached the old one
host.taken[0] = false;
try std.testing.expectEqual(@as(?usize, 0), p.execute(0, "echo after"));
var sent: [64]u8 = undefined;
var sent_len: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
try std.testing.expectEqual(@as(u8, 0), w.pane);
try std.testing.expect(w.bytes.slice().len <= sent.len - sent_len);
@memcpy(sent[sent_len..][0..w.bytes.slice().len], w.bytes.slice());
sent_len += w.bytes.slice().len;
},
.spawn => return error.SpawnedDespiteAPromptOfItsOwn,
else => {},
};
try std.testing.expectEqualStrings("echo after\r", sent[0..sent_len]);
}
test "the host is asked about a tty only where a command line is about to go" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
var host: FakeTtyQuery = .{};
host.install(p);
p.setCwd(0, "/tmp/pardes-lazy-a");
p.setCwd(1, "/tmp/pardes-lazy-b");
p.setCwd(2, "/tmp/pardes-lazy-c");
// A frame is a frame: rendering, typing, moving the mouse and resizing ask
// nobody anything. This is the whole point of the query being a pull — the
// probe it runs walks /proc, and it used to run for every pane of every
// frame to answer a question only Exec and Look ever ask.
_ = try p.render(frame.allocator());
p.update(.{ .key = .{ .cp = 'x' } });
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = 4, .row = 4 } });
p.update(.{ .resize = .{ .cols = 90, .rows = 28 } });
while (p.nextEffect()) |_| {}
_ = try p.render(frame.allocator());
try std.testing.expectEqual(@as(usize, 0), host.asked);
// The pane an Exec is typed into is one question, asked once...
_ = p.execute(0, "echo lazy");
while (p.nextEffect()) |_| {}
try std.testing.expectEqual(@as(usize, 1), host.asked);
// ...and the fallback scan asks only about the panes that could possibly
// answer yes: the cwd comparison is free and comes first, so the two shells
// sitting in other directories cost nothing. Pane 0 is asked a second time
// because it IS on the directory the command was about.
host.taken[0] = true;
host.asked = 0;
_ = p.execute(0, "echo lazy-again");
while (p.nextEffect()) |_| {}
try std.testing.expectEqual(@as(usize, 2), host.asked);
}
test "New opens an empty scratch below the caller, inheriting its directory" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const source: usize = 2; // the right column; active starts in the left
p.setCwd(source, "/tmp/pardes-scratch-dir");
const source_col = p.layoutFindTerm(source).?.col;
try std.testing.expect(p.executeBuiltinLine(source, "New"));
// no shell IO: the scratch is created in-core, focused, below the caller
while (p.nextEffect()) |_| {}
const id = p.active;
try std.testing.expect(id != source);
try std.testing.expectEqual(source_col, p.layoutFindTerm(id).?.col);
const np = p.panes[id].?;
try std.testing.expect(np.file.?.output != null); // an output buffer, empty
try std.testing.expectEqual(@as(usize, 0), np.file.?.content.len);
// its directory is a LIVE link to the opener, not a snapshot taken at New
try std.testing.expectEqualStrings("/tmp/pardes-scratch-dir", Pardes.paneDir(np));
p.setCwd(source, "/tmp/pardes-moved");
try std.testing.expectEqualStrings("/tmp/pardes-moved", Pardes.paneDir(np));
}
test "Save on a scratch asks for a path in its inherited dir and makes it a file" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const source: usize = 2;
p.setCwd(source, "/tmp/pardes-save-dir");
try std.testing.expect(p.executeBuiltinLine(source, "New"));
const id = p.active;
const np = p.panes[id].?;
p.sync(); // the frame boundary that gives the new pane its geometry
while (p.nextEffect()) |_| {}
// Save on a scratch arms a PATH input, prefilled with the inherited dir
try std.testing.expect(p.executeBuiltinLine(id, "Save"));
try std.testing.expect(np.hasSavePrompt());
try std.testing.expect(std.mem.endsWith(u8, np.tagSlice(), " Save /tmp/pardes-save-dir/"));
// typing the filename and submitting converts it into an ordinary file
try std.testing.expect(np.appendTag("note.txt"));
p.submitSave(id);
try std.testing.expect(np.file.?.output == null);
try std.testing.expectEqualStrings("/tmp/pardes-save-dir/note.txt", np.file.?.path);
var saved = false;
while (p.nextEffect()) |effect| switch (effect) {
.save_file => |sf| if (@as(usize, sf.pane) == id) {
saved = true;
},
else => {},
};
try std.testing.expect(saved);
}
test "Save on a terminal writes its plaintext scrollback and stays a terminal" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true, .cols = 40, .rows = 8 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = p.panes[0].?;
p.setCwd(0, "/tmp/pardes-tty-save");
p.update(.{ .output = .{ .pane = 0, .bytes = "hello scrollback\r\n" } });
while (p.nextEffect()) |_| {}
try std.testing.expect(p.executeBuiltinLine(0, "Save"));
try std.testing.expect(pane.hasSavePrompt());
try std.testing.expect(pane.appendTag("log.txt"));
p.submitSave(0);
// the pane is untouched: still a terminal, no file behind it
try std.testing.expect(pane.isTerminal());
try std.testing.expect(pane.file == null);
// the host performs it, reading the scrollback off the pane as it goes
var buf: [256]u8 = undefined;
try std.testing.expectEqualStrings(
"/tmp/pardes-tty-save/log.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
const written = p.fallback.get("/tmp/pardes-tty-save/log.txt") orelse return error.NothingWritten;
try std.testing.expect(std.mem.indexOf(u8, written, "hello scrollback") != null);
}
test "Save on an output buffer writes its rows out and leaves the buffer alone" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const source: usize = 2;
p.setCwd(source, "/tmp/pardes-output-save");
try std.testing.expect(p.executeBuiltinLine(source, "Help"));
p.sync(); // the frame boundary that gives the new pane its geometry
while (p.nextEffect()) |_| {}
const help: output_pane.Origin = .{ .cmd = .Help };
const id = blk: {
for (p.panes, 0..) |slot, i| {
const pane = slot orelse continue;
const f = pane.file orelse continue;
const o = f.output orelse continue;
if (std.meta.eql(o.from, help)) break :blk i;
}
return error.MissingHelpBuffer;
};
const out = p.panes[id].?;
const path = try gpa.dupe(u8, out.file.?.path);
defer gpa.free(path);
const rows = try gpa.dupe(u8, out.file.?.content);
defer gpa.free(rows);
// Save leads its tagline now, and the path is REQUIRED: a bare Save asks
try std.testing.expectEqualStrings(" Save New Newtty Del", Pardes.curTail(out));
try std.testing.expect(p.executeBuiltinLine(id, "Save"));
try std.testing.expect(out.hasSavePrompt());
try std.testing.expect(out.appendTag("help.txt"));
p.submitSave(id);
// the buffer itself is untouched: same origin, same name, still refillable
// and still walked by n/N, because a saved copy of a list is only a copy
try std.testing.expect(out.file.?.output != null);
try std.testing.expectEqual(help, out.file.?.output.?.from);
try std.testing.expectEqualStrings(path, out.file.?.path);
var buf: [256]u8 = undefined;
try std.testing.expectEqualStrings(
"/tmp/pardes-output-save/help.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
try std.testing.expectEqualStrings(
rows,
p.fallback.get("/tmp/pardes-output-save/help.txt") orelse return error.NothingWritten,
);
}
test "Save takes the path as an argument, relative to the pane's own directory" {
const p = try Pardes.init(std.testing.allocator, .{ .tty_only = true, .cols = 40, .rows = 8 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = p.panes[0].?;
p.setCwd(0, "/tmp/pardes-arg-save");
p.update(.{ .output = .{ .pane = 0, .bytes = "typed and gone\r\n" } });
while (p.nextEffect()) |_| {}
// an argument answers the question the prompt would have asked, so no
// prompt arms — and a bare name lands under the pane's directory, the way
// a relative word in a look resolves, not under the process's cwd
var buf: [256]u8 = undefined;
try std.testing.expect(p.executeBuiltinLine(0, "Save session.txt"));
try std.testing.expect(!pane.hasSavePrompt());
try std.testing.expectEqualStrings(
"/tmp/pardes-arg-save/session.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
const written = p.fallback.get("/tmp/pardes-arg-save/session.txt") orelse return error.NothingWritten;
try std.testing.expect(std.mem.indexOf(u8, written, "typed and gone") != null);
// `.` and `..` normalize with it, so this is that same file and not a
// second one spelled differently
try std.testing.expect(p.executeBuiltinLine(0, "Save ./sub/../session.txt"));
try std.testing.expectEqualStrings(
"/tmp/pardes-arg-save/session.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
try std.testing.expect(p.executeBuiltinLine(0, "Save /tmp/pardes-elsewhere/abs.txt"));
try std.testing.expectEqualStrings(
"/tmp/pardes-elsewhere/abs.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
try std.testing.expect(pane.isTerminal());
// ...and a path that cannot be made absolute is refused outright: a shell
// that has not reported a directory has nothing to resolve against, and
// the directory pardes was started in is not a guess worth making
p.panes[0].?.cwd = .none;
try std.testing.expect(p.executeBuiltinLine(0, "Save nowhere.txt"));
try std.testing.expect(drainForSavePath(p, &buf) == null);
}
test "Save elsewhere copies a file's bytes and keeps the pane on its own file" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("before\n");
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "after\n"));
try std.testing.expect(pane.file.?.revision != pane.file.?.saved_revision);
var buf: [256]u8 = undefined;
try std.testing.expect(p.executeBuiltinLine(0, "Save /tmp/pardes-copy/other.txt"));
// a copy, never a rename: the pane keeps its file, and that file is still
// unsaved, so the marker stays where it was
try std.testing.expectEqualStrings("/hxcase.txt", pane.file.?.path);
try std.testing.expect(pane.file.?.revision != pane.file.?.saved_revision);
try std.testing.expectEqualStrings(
"/tmp/pardes-copy/other.txt",
drainForSavePath(p, &buf) orelse return error.NoSaveAsked,
);
try std.testing.expectEqualStrings(
"after\n",
p.fallback.get("/tmp/pardes-copy/other.txt") orelse return error.NothingWritten,
);
// its own path, spelled out, is the in-place write — nothing is asked of
// the host but save_file, and the pane comes clean
try std.testing.expect(p.executeBuiltinLine(0, "Save /hxcase.txt"));
try std.testing.expect(drainForSavePath(p, &buf) == null);
try std.testing.expectEqual(pane.file.?.revision, pane.file.?.saved_revision);
}
test "saves armed in one batch stay with their own panes" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const tty_id = p.freeSlot() orelse return error.NoPaneSlots;
const shell = try p.newShell(tty_id, "/tmp/pardes-batch");
p.setCwd(tty_id, "/tmp/pardes-batch");
p.update(.{ .output = .{ .pane = @intCast(tty_id), .bytes = "shell text\r\n" } });
const file = try p.hxOpenFileContent("file text\n");
const file_id = p.paneIdOf(file) orelse return error.MissingFilePane;
try std.testing.expect(shell.isTerminal());
try std.testing.expect(tty_id != file_id);
while (p.nextEffect()) |_| {}
// both armed before the host drains anything — the path rides inside its
// own effect, so neither can be written with the other pane's text
try std.testing.expect(p.executeBuiltinLine(tty_id, "Save tty.txt"));
try std.testing.expect(p.executeBuiltinLine(file_id, "Save /tmp/pardes-batch/file.txt"));
while (p.nextEffect()) |effect| p.perform(effect);
const tty_bytes = p.fallback.get("/tmp/pardes-batch/tty.txt") orelse return error.NothingWritten;
try std.testing.expect(std.mem.indexOf(u8, tty_bytes, "shell text") != null);
try std.testing.expectEqualStrings(
"file text\n",
p.fallback.get("/tmp/pardes-batch/file.txt") orelse return error.NothingWritten,
);
}
test "a save whose pane is gone before the drain writes nothing" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const doomed = p.freeSlot() orelse return error.NoPaneSlots;
const shell = try p.newShell(doomed, "/tmp/pardes-gone");
p.update(.{ .output = .{ .pane = @intCast(doomed), .bytes = "doomed text\r\n" } });
while (p.nextEffect()) |_| {}
try std.testing.expect(shell.isTerminal());
// Save, then close the pane, then let the host drain: the bytes are read
// off the pane at drain time, so there are none to read...
try std.testing.expect(p.executeBuiltinLine(doomed, "Save /tmp/pardes-gone/log.txt"));
try std.testing.expect(p.executeBuiltinLine(doomed, "Del"));
while (p.nextEffect()) |effect| p.perform(effect);
try std.testing.expect(p.fallback.get("/tmp/pardes-gone/log.txt") == null);
// ...and a pane that took the freed slot in the meantime is NOT the pane
// that asked, which is what the serial in the effect is for
try std.testing.expect(p.executeBuiltinLine(0, "Save /tmp/pardes-gone/recycled.txt"));
try std.testing.expect(p.executeBuiltinLine(0, "Del"));
const reused = p.freeSlot() orelse return error.NoPaneSlots;
_ = try p.newShell(reused, "/tmp/pardes-gone");
while (p.nextEffect()) |effect| p.perform(effect);
try std.testing.expect(p.fallback.get("/tmp/pardes-gone/recycled.txt") == null);
}
test "Save reaches every tagline with text behind it and no other" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const out = try p.hxOpenFileContent("build.zig:1:1 pub fn main\n");
out.file.?.output = .{ .from = .search };
try std.testing.expectEqualStrings(" Save New Newtty Del", Pardes.curTail(out));
// A dump written before Save reached output buffers carries the generic
// tail. That is a DEFAULT and not something typed, so it upgrades.
const dumped = try std.fmt.allocPrint(p.scratch.allocator(), "{s}{s}", .{
try p.tagPrefix(out),
pane_tail,
});
p.restoreTail(out, dumped);
try std.testing.expect(!out.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del", Pardes.curTail(out));
// A scratch is an output buffer that has worn the FILE tails all along,
// so its own older default upgrades from that family too.
out.file.?.output = .{ .from = .{ .cmd = std.meta.stringToEnum(Builtin, "New").? } };
out.tag_tail_len = 0;
out.tag_init = false;
const scratch_dumped = try std.fmt.allocPrint(p.scratch.allocator(), "{s}{s}", .{
try p.tagPrefix(out),
prev_file_pane_tail,
});
p.restoreTail(out, scratch_dumped);
try std.testing.expect(!out.tag_init);
try std.testing.expectEqualStrings(" Save New Newtty Del", Pardes.curTail(out));
// An image's bytes on disk already are what they are: nothing of the
// pane's own is unwritten, so the word is absent and inert.
const img_id = p.freeSlot().?;
const img = try image_pane.create(p, img_id, "/tmp/pardes-tag.ppm", &.{});
try std.testing.expectEqualStrings(" New Newtty Del", Pardes.curTail(img));
try std.testing.expect(p.executeBuiltinLine(img_id, "Save"));
try std.testing.expect(!img.hasSavePrompt());
var buf: [256]u8 = undefined;
try std.testing.expect(drainForSavePath(p, &buf) == null);
}
test "a save path that names no file is refused before anything is rewritten" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const source: usize = 2;
p.setCwd(source, "/tmp/pardes-refuse");
try std.testing.expect(p.executeBuiltinLine(source, "New"));
const id = p.active;
const scratch = p.panes[id].?;
p.sync();
while (p.nextEffect()) |_| {}
// Enter on the bare prefill: a directory is not a file to become, and the
// scratch must still be a scratch afterwards — the alternative is a buffer
// renamed onto a path whose write silently failed
try std.testing.expect(p.executeBuiltinLine(id, "Save"));
try std.testing.expect(scratch.hasSavePrompt());
p.submitSave(id);
var buf: [256]u8 = undefined;
try std.testing.expect(drainForSavePath(p, &buf) == null);
try std.testing.expect(scratch.file.?.output != null);
try std.testing.expectEqualStrings("/tmp/pardes-refuse/+New", scratch.file.?.path);
// ...and neither is a multi-line selection chorded onto the word
try std.testing.expect(p.executeBuiltinLine(id, "Save one\ntwo"));
try std.testing.expect(drainForSavePath(p, &buf) == null);
try std.testing.expect(scratch.file.?.output != null);
}
test "a host with no methods at all is a complete in-process pardes" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 40, .rows = 10 });
defer p.deinit();
while (p.nextEffect()) |_| {}
// A pump against the empty host renders a frame and blocks on nothing.
try p.pump(.{});
try std.testing.expect(!p.quit);
// the absent child is SILENT: the bytes are dropped, and nothing appears
// on the pane's screen to suggest a program answered
const before = p.panes[0].?.vt.screens.active.cursor.y;
p.perform(.{ .write = .{ .pane = 0, .bytes = .from("ls\r") } });
try std.testing.expectEqual(before, p.panes[0].?.vt.screens.active.cursor.y);
// the clipboard round-trips through the in-process one
p.yank = try gpa.dupe(u8, "copied");
p.perform(.set_clipboard);
try std.testing.expectEqualStrings("copied", p.fallback.clipboard.items);
// ...and a save with no filesystem lands in the virtual one
const doc = try p.hxOpenFileContent("body\n");
var doc_id: u8 = 0;
for (p.panes, 0..) |slot, i| if (slot == doc) {
doc_id = @intCast(i);
};
p.perform(.{ .save_file = .{ .pane = doc_id } });
try std.testing.expectEqualStrings("body\n", p.fallback.files.get(doc.file.?.path).?);
// a language backend nobody supplied answers nothing rather than hanging
p.perform(.{ .lsp = .{ .id = 7, .kind = .hover, .pane = doc_id, .offset = 0, .arg = .{} } });
p.perform(.quit);
try std.testing.expect(p.quit);
}
const RecordHost = struct {
gpa: std.mem.Allocator,
writes: std.ArrayListUnmanaged(u8) = .empty,
/// What this host would answer a clipboard read with, and whether it was
/// ever asked — a pull must reach exactly one host.
clipboard: []const u8 = "",
asked: usize = 0,
core: ?*Pardes = null,
const vt: Host.VTable = .{ .push_pty_write = ptyWrite, .pull_read_clipboard = readClipboard };
fn ptyWrite(ctx: ?*anyopaque, pane: u8, bytes: []const u8) void {
_ = pane;
const self: *RecordHost = @ptrCast(@alignCast(ctx.?));
self.writes.appendSlice(self.gpa, bytes) catch {};
}
fn readClipboard(ctx: ?*anyopaque) void {
const self: *RecordHost = @ptrCast(@alignCast(ctx.?));
self.asked += 1;
self.core.?.update(.{ .paste = self.clipboard });
}
fn host(self: *RecordHost) Host {
return .{ .ctx = self, .vtable = &vt };
}
};
test "a fan-out host reaches every wrapped host, each with its own state" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 40, .rows = 10 });
defer p.deinit();
var a: RecordHost = .{ .gpa = gpa };
defer a.writes.deinit(gpa);
var b: RecordHost = .{ .gpa = gpa };
defer b.writes.deinit(gpa);
const wrapped = [_]Host{ a.host(), b.host() };
var fan: Fanout = .init(&wrapped);
p.host = fan.host();
p.perform(.{ .write = .{ .pane = 0, .bytes = .from("echo hi\r") } });
try std.testing.expectEqualStrings("echo hi\r", a.writes.items);
try std.testing.expectEqualStrings("echo hi\r", b.writes.items);
// A PULL reaches ONE host, and the name is what says so. Fanned out, both
// would answer and the core would paste the clipboard twice for one Ctrl-V.
a.core = p;
b.core = p;
a.clipboard = "from-a";
b.clipboard = "from-b";
const doc = p.panes[p.active].?;
doc.mode = .normal;
p.perform(.read_clipboard);
try std.testing.expectEqual(@as(usize, 1), a.asked);
try std.testing.expectEqual(@as(usize, 0), b.asked);
// a method NO wrapped host implements still falls back per-method
p.perform(.{ .open_link = .from("https://example.invalid") });
try std.testing.expectEqualStrings("https://example.invalid", p.fallback.link.items);
}
test "a builtin that needs a pane reports capacity failure when every slot is full" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
for (0..MAX_PANES) |id| if (p.panes[id] == null) {
_ = try p.newDocPane(id);
};
const help = std.meta.stringToEnum(Builtin, "Help") orelse return error.MissingHelpBuiltin;
p.runBuiltin(help, 0, "", null);
try std.testing.expect(std.mem.indexOf(u8, p.panes[0].?.msg[0..p.panes[0].?.msg_len], "help: NoPaneSlots") != null);
}
test "Msg writes the transient row by hand, bare or with text, and input ends it" {
const p = try Pardes.init(std.testing.allocator, .{ .shells = 3, .cols = 100, .rows = 30 });
defer p.deinit();
while (p.nextEffect()) |_| {}
const row = struct {
fn of(pp: *Pardes, i: usize) []const u8 {
const pane = pp.panes[i].?;
return pane.msg[0..pane.msg_len];
}
}.of;
// the whole tail, spaces and all: the row is a sentence, not a word
try std.testing.expect(p.executeBuiltinLine(2, "Msg saved /etc/hosts"));
try std.testing.expectEqualStrings("saved /etc/hosts", row(p, 2));
// ...on the pane that ran it, and nowhere else
try std.testing.expectEqualStrings("", row(p, 0));
// Bare, it reports ITSELF through reportError — the `<operation>: <Error>`
// every failed save and refused Look arrives in.
try std.testing.expect(p.executeBuiltinLine(2, "Msg"));
try std.testing.expectEqualStrings("Msg: NoMessage", row(p, 2));
// A message is exactly as old as your last input.
p.update(.{ .key = .{ .cp = Key.escape } });
try std.testing.expectEqualStrings("", row(p, 2));
// Longer than the row's buffer is CUT, never refused and never overrun:
// this word is the only way to reach that boundary without a 300-byte path.
var long: [600]u8 = @splat('x');
var line: [608]u8 = undefined;
const cmd = try std.fmt.bufPrint(&line, "Msg {s}", .{&long});
try std.testing.expect(p.executeBuiltinLine(2, cmd));
try std.testing.expectEqual(p.panes[2].?.msg.len, row(p, 2).len);
}
test "Font keeps requested and acknowledged faces as separate plain state" {
if (comptime !font_picker) return; // there is no Font builtin on tty or web
const p = try Pardes.init(std.testing.allocator, .{ .cols = 80, .rows = 24 });
defer p.deinit();
var arena: std.heap.ArenaAllocator = .init(std.testing.allocator);
defer arena.deinit();
const installed = fonts.list(arena.allocator(), null);
if (installed.len == 0) return; // a machine with no monospace face at all
var line: [512]u8 = undefined;
const cmd = try std.fmt.bufPrint(&line, "Font {s}", .{installed[0].name});
try std.testing.expect(p.executeBuiltinLine(p.active, cmd));
try std.testing.expect(p.settings.font.pending);
try std.testing.expectEqualStrings(installed[0].name, p.settings.font.requested_name.get());
try std.testing.expectEqualStrings(installed[0].path, p.settings.font.requested_path.get());
try std.testing.expectEqualStrings("", p.settings.font.effective_name.get());
// Boot/zoom/display-scale reports describe the face already being drawn;
// they must neither answer nor reject the new request waiting beside it.
try std.testing.expect(p.observeFont("Embedded Mono", 1200, .pixels));
try std.testing.expectEqualStrings("Embedded Mono", p.settings.font.effective_name.get());
try std.testing.expect(p.settings.font.pending);
try std.testing.expect(!p.acknowledgeFont("Stray Ack", 1250, .pixels));
p.rejectFont();
try std.testing.expect(p.settings.font.pending);
const request = p.takeFontRequest() orelse return error.MissingFontRequest;
try std.testing.expectEqualStrings(installed[0].path, request);
try std.testing.expect(p.settings.font.pending);
try std.testing.expect(p.takeFontRequest() == null);
const fake_track: panel_animation.Track = .{
.serial = p.panes[p.active].?.serial,
.pane = @intCast(p.active),
.effect = .slide,
.from = .{ .w = 20, .h = 10 },
.to = .{ .x = 10, .w = 20, .h = 10 },
};
p.panel_tracks[p.active] = fake_track;
p.presented_panel_tracks[p.active] = fake_track;
p.panel_presentation_ready = true;
try std.testing.expect(p.acknowledgeFont(installed[0].name, 1375, .pixels));
try std.testing.expect(!p.settings.font.pending);
try std.testing.expectEqualStrings(installed[0].name, p.settings.font.effective_name.get());
try std.testing.expectEqual(@as(u16, 1375), p.settings.font.effective_size_hundredths);
try std.testing.expectEqual(FontSizeUnit.pixels, p.settings.font.effective_size_unit);
try std.testing.expect(p.panel_tracks[p.active] == null);
try std.testing.expect(p.panel_presentation_pending);
try std.testing.expect(!p.acknowledgeFont("Duplicate Ack", 1400, .pixels));
// Asking for the face already on screen is still a real host round trip,
// but it does not invalidate the frozen layer: its effective tuple did
// not change. A rejected request likewise never reaches acknowledgeFont.
p.acknowledgePanelPresentation(&.{});
try std.testing.expect(p.executeBuiltinLine(p.active, cmd));
_ = p.takeFontRequest() orelse return error.MissingRepeatedFontRequest;
p.panel_tracks[p.active] = fake_track;
try std.testing.expect(p.acknowledgeFont(installed[0].name, 1375, .pixels));
try std.testing.expect(p.panel_tracks[p.active] != null);
try std.testing.expect(!p.panel_presentation_pending);
// A name nothing answers to changes neither request nor effective state.
try std.testing.expect(p.executeBuiltinLine(p.active, "Font zzz-no-such-face"));
try std.testing.expectEqualStrings(installed[0].name, p.settings.font.requested_name.get());
try std.testing.expectEqualStrings(installed[0].name, p.settings.font.effective_name.get());
}
test "startup config overrides restored styling before initFromDump returns" {
const source = try Pardes.init(std.testing.allocator, .{ .startup_config = "Theme dark\n" });
defer source.deinit();
try std.testing.expectEqualStrings("dark", source.theme().name);
try source.dumpState();
const restored = try Pardes.initFromDump(
std.testing.allocator,
.{ .startup_config = "Theme acme\n" },
source.dump_out.?,
);
defer restored.deinit();
try std.testing.expectEqualStrings("acme", restored.theme().name);
try std.testing.expect(!source.animationActive());
try std.testing.expect(!restored.animationActive());
try std.testing.expectEqual(ChromeTheme.fromTheme(source.theme()), source.chromeTheme().*);
try std.testing.expectEqual(ChromeTheme.fromTheme(restored.theme()), restored.chromeTheme().*);
}
test "restored sessions animate layout changes after bootstrap" {
if (platform == .web) return;
const source = try Pardes.init(std.testing.allocator, .{ .tty_only = true, .cols = 80, .rows = 16 });
defer source.deinit();
try source.dumpState();
const restored = try Pardes.initFromDump(
std.testing.allocator,
.{ .tty_only = true, .cols = 80, .rows = 16, .startup_config = "PanelSlide\n" },
source.dump_out.?,
);
defer restored.deinit();
try std.testing.expectEqual(panel_animation.Transition.slide, restored.settings.panel_transition);
try std.testing.expect(!restored.animationActive());
var frame: std.heap.ArenaAllocator = .init(std.testing.allocator);
defer frame.deinit();
const initial = try restored.render(frame.allocator());
restored.acknowledgePanelPresentation(initial.panelTracks());
_ = try restored.newShell(1, "");
try std.testing.expect(restored.layoutSplitColumn(0, 1, false));
restored.sync();
try std.testing.expect(restored.panel_tracks[0] != null);
try std.testing.expect(restored.panel_tracks[1] != null);
try std.testing.expect(restored.animationActive());
}
test "restored terminals keep monotonic nonzero pane identities" {
const gpa = std.testing.allocator;
const source = try Pardes.init(gpa, .{ .shells = 3 });
defer source.deinit();
// Filter is a fresh presentation default, not emulator/dump state. Even a
// pane toggled off in the source session comes back with the default on.
source.panes[1].?.tty_filter = false;
try source.dumpState();
const restored = try Pardes.initFromDump(gpa, .{}, source.dump_out.?);
defer restored.deinit();
var ids: [MAX_PANES]usize = undefined;
var serials: [MAX_PANES]u32 = undefined;
var n: usize = 0;
for (restored.panes, 0..) |slot, id| {
const pane = slot orelse continue;
if (!pane.isTerminal()) continue;
try std.testing.expect(pane.tty_filter);
try std.testing.expect(pane.serial != 0);
for (serials[0..n]) |seen| try std.testing.expect(pane.serial != seen);
ids[n] = id;
serials[n] = pane.serial;
n += 1;
}
try std.testing.expectEqual(@as(usize, 3), n);
for (ids[0..n], serials[0..n]) |id, serial|
try std.testing.expectEqual(id, restored.paneBySerial(serial).?);
const before = restored.next_serial;
const free = restored.freeSlot() orelse return error.NoFreePane;
const fresh = try restored.newShell(free, "");
try std.testing.expect(fresh.tty_filter);
try std.testing.expectEqual(before + 1, fresh.serial);
try std.testing.expectEqual(fresh.serial, restored.next_serial);
}
/// How a `Chord` is SPELLED in the index. The named keys come from Key's OWN
/// declarations rather than a table beside them — a new special key names
/// itself here, and a wrong name is impossible because there is only one. The
/// rest is the printable character; anything else is a compile error, because
/// a private-use codepoint cast to a byte would render as silent garbage in a
/// listing nobody diffs.
fn chordName(comptime c: config.Chord) []const u8 {
comptime {
const mods = (if (c.ctrl) "C-" else "") ++ (if (c.alt) "A-" else "") ++ (if (c.shift) "S-" else "");
for (@typeInfo(Key).@"struct".decls) |d| {
if (@TypeOf(@field(Key, d.name)) != u21) continue;
if (@field(Key, d.name) == c.cp) return mods ++ d.name;
}
if (c.cp < 0x20 or c.cp > 0x7e) @compileError("chord has no name for the index");
return mods ++ &[_]u8{@as(u8, @intCast(c.cp))};
}
}
/// Every way to run `b` that is NOT its leader path: the chords and buttons
/// config binds to it, plus the topbar if it has a word up there (row 0 is a
/// click target, and the only shortcut that works in tty mode where SPC
/// belongs to the shell). Walked from config's own tables — window_keys' and
/// jump_keys' `cmd` columns, look_cmd/exec_cmd, topbar_str — so retargeting a
/// binding there re-renders here with nothing to keep in step.
///
/// What is NOT here, and cannot be: a chord that reaches no builtin. Alt-n,
/// Alt-c, the tty toggle and the 1-2/1-3 cut/paste chords are inline handlers
/// with no word to index by. The day one of them becomes a builtin — a struct
/// in builtins.zig and a `cmd` column beside its binding — it appears here for
/// free, which is the upgrade path rather than a special case here.
fn shortcutCount(comptime b: Builtin) comptime_int {
var count = 0;
for (config.window_keys) |wk| if (wk.cmd == b) {
count += 2;
};
for (config.jump_keys) |jk| if (jk.cmd == b) {
count += 1;
};
if (config.look_cmd == b) count += config.look_key.len + 1;
if (config.exec_cmd == b) count += config.exec_key.len + 1;
var it = std.mem.tokenizeScalar(u8, config.topbar_str, ' ');
while (it.next()) |w| if (std.mem.eql(u8, w, @tagName(b))) {
count += 1;
};
return count;
}
fn shortcuts(comptime b: Builtin) []const u8 {
comptime {
@setEvalBranchQuota(20000);
var parts: [shortcutCount(b)][]const u8 = undefined;
var part: usize = 0;
// both spellings of the four directional moves: the arrow is a real
// key someone presses, and the table carries it precisely so it is
// discoverable from the builtin as well as the other way round
for (config.window_keys) |wk| {
if (wk.cmd != b) continue;
// the prefix has one spelling and this is it
const pfx = chordName(config.window_prefix[0]) ++ " ";
parts[part] = pfx ++ chordName(wk.letter);
parts[part + 1] = pfx ++ chordName(wk.arrow);
part += 2;
}
for (config.jump_keys) |jk| {
if (jk.cmd == b) {
parts[part] = chordName(jk.chord);
part += 1;
}
}
// the two acme verbs, a key and a mouse button each. Asked of the
// BINDING (look_cmd/exec_cmd point at a builtin) rather than of Look
// and Exec by name, so pointing look_cmd at Grep moves the row.
if (config.look_cmd == b) {
for (config.look_key) |k| {
parts[part] = chordName(k);
part += 1;
}
parts[part] = @tagName(config.look_button) ++ "-click";
part += 1;
}
if (config.exec_cmd == b) {
for (config.exec_key) |k| {
parts[part] = chordName(k);
part += 1;
}
parts[part] = @tagName(config.exec_button) ++ "-click";
part += 1;
}
var it = std.mem.tokenizeScalar(u8, config.topbar_str, ' ');
while (it.next()) |w| {
if (std.mem.eql(u8, w, @tagName(b))) {
parts[part] = "topbar";
part += 1;
}
}
var len: usize = if (parts.len == 0) 0 else 2 * (parts.len - 1);
for (parts) |text| len += text.len;
var out: [len]u8 = undefined;
var at: usize = 0;
for (parts, 0..) |text, i| {
if (i > 0) {
@memcpy(out[at..][0..2], ", ");
at += 2;
}
@memcpy(out[at..][0..text.len], text);
at += text.len;
}
return &out;
}
}
fn leaderKeys(comptime path: []const u8) []const u8 {
comptime {
var out: [4 + 2 * path.len - 1]u8 = undefined;
@memcpy(out[0..4], "SPC ");
var at: usize = 4;
for (path, 0..) |c, i| {
if (i > 0) {
out[at] = ' ';
at += 1;
}
out[at] = c;
at += 1;
}
return &out;
}
}
/// THE BUILTIN INDEX, flattened: one row per builtin — the leader path that
/// runs it (null: SPC does not reach it), every other way to run it, and the
/// Help line those are rendered into. SORTED BY PATH, so every prefix's
/// subtree is a contiguous run, which is all the two runtime readers need. The
/// matcher asks "exact hit? still a prefix of something?" and Help filters the
/// same rows by the same prefix. A node-and-pointer trie for forty
/// two-character paths would be ceremony.
///
/// A row per BUILTIN and no longer a row per leader PATH, which is what makes
/// Help the complete index instead of a second builtin listing a superset of
/// what Help lists. A path-less builtin (Look, Exec, Theme) is a row like any
/// other and its empty key column is the information: SPC does not reach this
/// one, the last column does — or nothing does, which is also worth knowing.
/// The mid-chord filter is the SAME array read with a non-empty prefix, and it
/// drops those rows by itself because an empty path starts with nothing.
const Row = struct { path: ?[]const u8, cmd: Builtin, line: []const u8 };
pub const builtin_rows: [std.enums.values(Builtin).len]Row = blk: {
// one pass per builtin per config table, and the insertion sort below is
// O(n²) comptime branches on top of it
@setEvalBranchQuota(200000);
var rows: [std.enums.values(Builtin).len]Row = undefined;
// the widest spaced-out path ("l D" = 3) and the widest name, so the three
// columns line up
var keyw: usize = 0;
var namew: usize = 0;
for (std.enums.values(Builtin)) |b| {
if (config.leader_path.get(b)) |p| keyw = @max(keyw, 2 * p.len - 1);
namew = @max(namew, @tagName(b).len);
}
for (std.enums.values(Builtin), 0..) |b, i| {
const keys = if (config.leader_path.get(b)) |path| leaderKeys(path) else "";
// the name column is only padded when something follows it: a row
// whose builtin has no other shortcut ends at the name, so the listing
// carries no trailing whitespace
const rest = shortcuts(b);
const named = @tagName(b) ++ (if (rest.len == 0) "" else (" " ** (namew - @tagName(b).len)) ++ " " ++ rest);
rows[i] = .{
.path = config.leader_path.get(b),
.cmd = b,
.line = keys ++ (" " ** (4 + keyw - keys.len)) ++ " " ++ named,
};
}
// insertion sort by path: a group sorts right before what extends it, and
// a path-less builtin sorts after every path — DEL is not a path because
// leaderKey only ever stores a printable key
const last = "\x7f";
for (1..rows.len) |i| {
var j = i;
while (j > 0 and std.mem.lessThan(u8, rows[j].path orelse last, rows[j - 1].path orelse last)) : (j -= 1) {
const t = rows[j];
rows[j] = rows[j - 1];
rows[j - 1] = t;
}
}
break :blk rows;
};
// config.topbar_str is a HAND-PICKED subset of the builtins in a fixed order,
// not a derivation — see it there for why each word is in or out. This is the
// check that a rename cannot silently rot it.
comptime {
@setEvalBranchQuota(20000); // one branch per string byte, behind the decl walk that folds Builtin
var it = std.mem.tokenizeScalar(u8, config.topbar_str, ' ');
words: while (it.next()) |w| {
for (@typeInfo(Builtin).@"enum".fields) |f|
if (std.mem.eql(u8, f.name, w)) continue :words;
@compileError("topbar word is not a builtin: " ++ w);
}
}
const WordBounds = struct { lo: usize, hi: usize };
/// The whitespace-delimited word covering `col` in `str`. The topbar uses the
/// same bounds for pointer feedback and dispatch, so the word that lights up
/// is necessarily the word a middle click will execute.
fn wordBoundsAtCol(str: []const u8, col: usize) ?WordBounds {
if (col >= str.len or str[col] == ' ') return null;
var lo: usize = col;
while (lo > 0 and str[lo - 1] != ' ') lo -= 1;
var hi: usize = col;
while (hi < str.len and str[hi] != ' ') hi += 1;
return .{ .lo = lo, .hi = hi };
}
/// the whitespace-delimited word covering `col` in `str` (topbar dispatch)
fn wordAtCol(str: []const u8, col: usize) []const u8 {
const bounds = wordBoundsAtCol(str, col) orelse return "";
return str[bounds.lo..bounds.hi];
}
/// `a` IS `b` or lives under it — how Grep drops a pane's directory when
/// another pane's directory already covers it
fn pathUnder(a: []const u8, b: []const u8) bool {
const root = std.mem.trimEnd(u8, b, "/");
if (!std.mem.startsWith(u8, a, root)) return false;
return a.len == root.len or a[root.len] == '/';
}
const tutor_text = @embedFile("tutor.txt");
// ---- theme ----
/// Halfway between two colors, channel by channel. Every selection tint pardes
/// paints is a mix of theme colors — the per-mouse-button ones pull the theme's
/// selection toward one of its own accents, a quarter of the way and so a mix
/// of a mix; the extra cursors' pulls it back toward the page — and renderPane
/// makes seven of those, which is six more than spelling the same three-channel
/// loop out at the call site is worth.
fn mix(a: [3]u8, b: [3]u8) [3]u8 {
var out: [3]u8 = undefined;
for (&out, a, b) |*c, x, y| c.* = @intCast((@as(u16, x) + y) / 2);
return out;
}
const TAG_TAIL_CAP = limits.max_tag_tail; // one editable command line; extra input is refused
const TTY_REPLAY_CAP = 1024 * 1024; // oldest bytes are evicted from the dump/replay record
/// Everything a theme repaints. `bg`/`fg` null = leave the host terminal's own
/// default cell showing (the native-dark shape); `palette` null = let a child's
/// ANSI indices reach the host untranslated until that terminal enables its
/// theme-keyed Filter. The gutter's move box lives here too: it used to be a
/// pair of module constants, but a theme that wants to be
/// restrained has to be able to turn the accent DOWN, and the box is the one
/// piece of loud chrome on screen. The overlay/drag greys that were also
/// hardcoded turned out to be the dark theme's own scroll_track/lineno/tag_fg
/// spelled a second time, so they read those fields now instead.
///
/// Selection is ONE pair, `sel_bg`/`sel_fg`, and the rest is arithmetic: the
/// three per-mouse-button tints and the dimmed extra cursors are mixed off it in
/// renderPane rather than named here. A theme author gets their selection colour
/// right and would get four more by accident — and every source gen_themes reads
/// names exactly one selection anyway.
pub const Theme = struct {
name: []const u8,
bg: ?[3]u8,
fg: ?[3]u8,
sel_bg: [3]u8,
sel_fg: [3]u8,
tag_bg: [3]u8,
tag_fg: [3]u8,
box: [3]u8, // move box, focused pane
box_dim: [3]u8, // move box, everything else
kw: [3]u8,
str: [3]u8,
num: [3]u8,
comment: [3]u8,
lineno: [3]u8,
scroll_track: [3]u8,
scroll_thumb: [3]u8,
palette: ?[16][3]u8,
};
/// The three themes pardes ships with, in RING ORDER, which is the one thing
/// the files themselves cannot say: `helix` is index 0 and so what boots, and
/// NextColor walks from here out into the generated ones. Written here rather
/// than in a fourth file because the order IS the information — and it is
/// load-bearing, since test/snapshots/theme.snap captures the first three
/// steps of the ring by their colors.
const curated = struct {
pub const helix = @import("themes/helix.zig");
pub const dark = @import("themes/dark.zig");
pub const acme = @import("themes/acme.zig");
};
/// A zig file IS a struct, so the FILES are the list: this walks a container's
/// declarations — each one an imported theme file — and copies its `theme`
/// value into a real Theme. FIELD BY FIELD rather than by plain coercion,
/// because a theme file deliberately imports nothing (it is data, not code) and
/// zig will not coerce a whole anonymous struct into a named one; assigning one
/// field at a time puts each value in a result location that knows the type,
/// which is also what makes a missing field a compile error naming it.
///
/// A FUNCTION and not a const for the same reason builtins.all is one: it is
/// only ever a signature to whoever walks it, never a value in its own way.
fn fold(comptime C: type) [@typeInfo(C).@"struct".decls.len]Theme {
comptime {
@setEvalBranchQuota(400000);
var out: [@typeInfo(C).@"struct".decls.len]Theme = undefined;
for (@typeInfo(C).@"struct".decls, 0..) |d, i| {
var t: Theme = undefined;
for (@typeInfo(Theme).@"struct".fields) |f|
@field(t, f.name) = @field(@field(C, d.name).theme, f.name);
out[i] = t;
}
return out;
}
}
/// The ring: ours, then every theme tools/gen_themes.zig exported out of the
/// helix and zed sources in vendor/themes (build.zig runs it and hands the
/// result over as a module). Adding one is dropping a file in there — there is
/// no list here to append to, which is the whole point of folding the files.
/// 228 of them: everything helix and zed ship, because "which of these is worth
/// having" is the user's call and not the build's. That length is why ThemeSel
/// exists — NextColor is a browse, not a way to arrive anywhere in particular.
pub const themes = fold(curated) ++ fold(@import("generated_themes"));
comptime {
if (themes.len > std.math.maxInt(u16) + 1)
@compileError("runtime config theme index no longer fits u16");
}
// Two themes answering to one name is a bug: `Theme <name>` resolves by name
// and would silently pick whichever came first, and ThemeSel would list the
// loser as a row that does nothing. The generated half cannot collide with
// ITSELF — one file per theme, all imported into one struct, so zig's own
// redeclaration error already catches that — which leaves exactly the cross
// pair to check here, three times 225 rather than 228 squared. This is the
// check that makes helix's `acme.toml` vendored as `acme_helix.toml`.
comptime {
@setEvalBranchQuota(20000);
const ours = fold(curated).len;
for (themes[0..ours]) |c| for (themes[ours..]) |g| if (std.mem.eql(u8, c.name, g.name))
@compileError("theme name \"" ++ c.name ++ "\" is both ours and generated; rename the vendored source");
}
/// The color roles attached to stable screen geometry. Document backgrounds,
/// syntax, terminal ANSI palettes, and PDF tint colors deliberately are not
/// here: those switch to `theme()` immediately while this small palette moves
/// between themes over a handful of display frames.
/// WHAT THE BOARD BOOTS WITH. An empty buffer is honest and useless: the three words that make
/// this board interesting take an address, and a board's address space is precisely the thing you
/// cannot guess. So the buffer is a tour of it - every address below comes from this repository
/// rather than from memory, which is why they are worth trusting: the two flash figures and the two
/// RAM ones are the linker script's own ORIGINs (`05-zig-p4/build.zig`'s MEMORY block), and the
/// peripheral bases are `DR_REG_*` from ESP-IDF's headers as `05-zig-p4/src/hal` uses them.
///
/// Each command sits alone on its line because an argument list ends at the last argument - a
/// trailing comment would be `ExtraArgument` - so the notes go above the lines they describe. Run
/// one by putting the cursor on it, `x` to select the line, Tab to execute.
///
/// EVERY LINE IS SHORT ENOUGH TO RENDER WHOLE, which is asserted rather than eyeballed: see the
/// test below. A tour whose lines wrap is a worse first screen than no tour.
const boot_buffer =
\\x selects a line, Tab runs it. 0x optional.
\\
\\-- flash: this image's rodata, then its code
\\Hexdump 40000020 40
\\Hexdump 40050000 40
\\-- L2MEM: firmware data, then the heap
\\Hexdump 4ff00000 40
\\Hexdump 4ff40000 40
\\-- the mask ROM
\\Hexdump 4fc00000 20
\\-- UART0, the console you are reading on
\\Peek 500ca000 4
\\-- LP_STORE0: write a word, read it back
\\Poke 5011002c deadbeef
\\Peek 5011002c
\\-- RNG_DATA: not memory. Run it twice.
\\Peek 501101a4
\\Peek 501101a4
\\-- the pins: Gpio draws JP1, Gpio 33 flips
\\Gpio
\\Gpio 33
;
// Three times in this port a line in that buffer has been one or two characters too long for the
// board's 56-column grid, and every time it was found by reading the die's screen rather than by
// reading the source - which is the expensive way to find a string literal's length. The bound is
// the grid minus the line-number gutter minus a column, and the margin below it is deliberate:
// pinning the exact gutter width would make this test a restatement of the renderer instead of a
// statement about the text.
test "every line of the board's boot buffer renders whole" {
const cols: usize = @import("pardes_config").esp32p4_cols;
var it = std.mem.splitScalar(u8, boot_buffer, '\n');
while (it.next()) |line| {
std.testing.expect(line.len + 8 <= cols) catch |err| {
std.debug.print("boot buffer line is {d} of {d} usable: \"{s}\"\n", .{ line.len, cols - 8, line });
return err;
};
}
// and the tour still visits what it says it visits
try std.testing.expect(std.mem.indexOf(u8, boot_buffer, "Hexdump 40000020") != null);
try std.testing.expect(std.mem.indexOf(u8, boot_buffer, "Poke 5011002c deadbeef") != null);
try std.testing.expect(std.mem.indexOf(u8, boot_buffer, "\nGpio\n") != null);
}
pub const ChromeTheme = struct {
tag_bg: [3]u8,
tag_fg: [3]u8,
box: [3]u8,
box_dim: [3]u8,
lineno: [3]u8,
scroll_track: [3]u8,
scroll_thumb: [3]u8,
pub fn fromTheme(th: *const Theme) ChromeTheme {
return .{
.tag_bg = th.tag_bg,
.tag_fg = th.tag_fg,
.box = th.box,
.box_dim = th.box_dim,
.lineno = th.lineno,
.scroll_track = th.scroll_track,
.scroll_thumb = th.scroll_thumb,
};
}
pub fn interpolate(from: ChromeTheme, to: ChromeTheme, step: u16, steps: u16) ChromeTheme {
var out: ChromeTheme = undefined;
inline for (@typeInfo(ChromeTheme).@"struct".fields) |field|
@field(out, field.name) = animation.interpolateRgb(@field(from, field.name), @field(to, field.name), step, steps);
return out;
}
};
/// The fade, or its absence, decided at comptime so that `-Dtheme-animation=false` leaves
/// `ChromeTheme.interpolate` unreachable and therefore out of the binary entirely. Every call site
/// below is written against the shared interface and needs no condition of its own.
const ChromeAnimation = if (theme_animation)
animation.Transition(ChromeTheme)
else
animation.Immediate(ChromeTheme);
const initial_chrome = ChromeTheme.fromTheme(&themes[0]);
// ---- the boundary types ----
pub const Color = union(enum) { default, index: u8, rgb: [3]u8 };
pub const FontRole = enum(u8) { body, tagline };
pub const FontSizeUnit = runtime_cfg.FontSizeUnit;
pub const CellStyle = struct {
fg: Color = .default,
bg: Color = .default,
bold: bool = false,
dim: bool = false,
italic: bool = false,
blink: bool = false,
reverse: bool = false,
invisible: bool = false,
strikethrough: bool = false,
ul: enum { off, single, double, curly, dotted, dashed } = .off,
font_role: FontRole = .body,
};
/// One surface cell. `default = true` means "never painted this frame": the
/// shell renders it as the terminal's default cell (vaxis clear semantics).
// EFFECT_CODE_ASCII_DIFF_BEGIN
pub const Cell = struct {
text: [7]u8 = @splat(' '),
len: u8 = 1,
style: CellStyle = .{},
default: bool = true,
pub fn grapheme(c: *const Cell) []const u8 {
return c.text[0..c.len];
}
/// Equality of what a shell can actually present. Bytes past `len` are
/// scratch left by earlier graphemes and must never manufacture a panel
/// diff; an unpainted default cell likewise has no visible style/text.
pub fn visuallyEqual(a: *const Cell, b: *const Cell) bool {
if (a.default or b.default) return a.default and b.default;
return a.len == b.len and
std.mem.eql(u8, a.grapheme(), b.grapheme()) and
std.meta.eql(a.style, b.style);
}
/// The byte an ASCII transition may walk. Default cells are visibly
/// spaces; painted cells opt in only when their complete grapheme is one
/// printable byte. This keeps an intermediate frame valid UTF-8 and
/// prevents a style-only or multi-byte change from churning its glyph.
pub fn printableAscii(c: *const Cell) ?u8 {
if (c.default) return ' ';
if (c.len != 1) return null;
const byte = c.text[0];
return if (byte >= ' ' and byte <= '~') byte else null;
}
};
/// The semantic character part of one old/new panel-cell diff. It lives in
/// the core because every renderer must present the same byte at a given
/// frame. Backends receive the already-composed Cell; none implements this
/// walk or chooses its own punctuation/noise threshold.
pub const AsciiDiff = struct {
from: u8,
to: u8,
/// Long printable-byte walks complete in about the same time as the other
/// panel effects. Extra distance is crossed by eased character skips.
pub const max_movement_frames = panel_animation.ascii_max_movement_frames;
pub fn between(old: *const Cell, new: *const Cell) ?AsciiDiff {
const from = old.printableAscii() orelse return null;
const to = new.printableAscii() orelse return null;
if (from == to) return null;
return .{ .from = from, .to = to };
}
pub fn distance(diff: AsciiDiff) u8 {
return if (diff.from < diff.to) diff.to - diff.from else diff.from - diff.to;
}
pub fn movementFrames(diff: AsciiDiff) u16 {
return @min(@as(u16, diff.distance()), max_movement_frames);
}
pub fn frameCount(diff: AsciiDiff) u16 {
return diff.movementFrames() + 1;
}
/// Move through the u8 range with integer ease-in-out over exactly
/// `movementFrames` samples. A byte creeps at both ends and crosses the
/// middle of its distance in a few large skips, inside the same frame
/// count the old constant one-byte-per-frame walk took. Keeping this
/// integer-only makes every backend receive the same character.
pub fn byteAt(diff: AsciiDiff, frame: u16) u8 {
const movements: u32 = diff.movementFrames();
const at: u32 = @min(@as(u32, frame), movements);
const delta: u8 = @intCast(easedDistance(diff.distance(), movements, at));
return if (diff.from < diff.to) diff.from + delta else diff.from - delta;
}
/// `distance * smootherstep(at / movements)`, rounded, without touching
/// floating point. Endpoints are exact — zero at frame zero, the whole
/// distance at the last movement — and the curve is monotonic, so a byte
/// never walks backwards between samples.
fn easedDistance(span: u8, movements: u32, at: u32) u32 {
if (movements == 0 or at >= movements) return span;
const n: u64 = at;
const d: u64 = movements;
// Quintic smootherstep as one exact fraction: n^3 (10 d^2 + 6 n^2 -
// 15 d n) over d^5. The positive terms are summed first because
// 10 d^2 + 6 n^2 >= 15 d n for every n <= d: unsigned arithmetic must
// never see the intermediate go below zero.
const shape = n * n * n * (10 * d * d + 6 * n * n - 15 * d * n);
const denominator = d * d * d * d * d;
return @intCast((@as(u64, span) * shape + denominator / 2) / denominator);
}
pub fn complete(diff: AsciiDiff, frame: u16) bool {
return diff.byteAt(frame) == diff.to;
}
};
/// One core-owned classification per cell in the frozen old/new grid. A
/// visual-only diff still matters to dissolve, but PanelAscii only walks the
/// `.ascii` case. That distinction fixes the old effect's habit of replacing
/// unchanged glyphs merely because their colour or other style changed.
pub const PanelCellDiff = union(enum) {
unchanged,
visual,
ascii: AsciiDiff,
pub fn between(old: *const Cell, new: *const Cell) PanelCellDiff {
if (old.visuallyEqual(new)) return .unchanged;
if (AsciiDiff.between(old, new)) |diff| return .{ .ascii = diff };
return .visual;
}
pub fn changed(diff: PanelCellDiff) bool {
return diff != .unchanged;
}
};
// EFFECT_CODE_ASCII_DIFF_END
test "cell visual equality ignores dead grapheme tail bytes" {
var a: Cell = .{ .default = false };
var b = a;
a.text[0] = 'x';
b.text[0] = 'x';
a.text[4] = 'a';
b.text[4] = 'b';
try std.testing.expect(a.visuallyEqual(&b));
b.style.bold = true;
try std.testing.expect(!a.visuallyEqual(&b));
a.default = true;
b.default = true;
try std.testing.expect(a.visuallyEqual(&b));
}
test "ASCII cell diffs ease long byte walks in both directions" {
var low: Cell = .{ .default = false };
low.text[0] = 'A';
var high: Cell = .{ .default = false };
high.text[0] = 'F';
// Ease-in-out inside exactly the five movement frames the old constant
// walk used: the first sample holds, the middle crosses two values at a
// time, and the endpoint is exact.
const rising = AsciiDiff.between(&low, &high).?;
try std.testing.expectEqual(@as(u16, 6), rising.frameCount());
try std.testing.expectEqual(@as(u8, 'A'), rising.byteAt(0));
try std.testing.expectEqual(@as(u8, 'A'), rising.byteAt(1));
try std.testing.expectEqual(@as(u8, 'C'), rising.byteAt(2));
try std.testing.expectEqual(@as(u8, 'F'), rising.byteAt(4));
try std.testing.expectEqual(@as(u8, 'F'), rising.byteAt(500));
const falling = AsciiDiff.between(&high, &low).?;
try std.testing.expectEqual(@as(u8, 'D'), falling.byteAt(2));
try std.testing.expectEqual(@as(u8, 'A'), falling.byteAt(4));
low.text[0] = ' ';
high.text[0] = '~';
const long_rising = AsciiDiff.between(&low, &high).?;
try std.testing.expectEqual(@as(u16, 13), long_rising.frameCount());
try std.testing.expectEqual(@as(u8, ' '), long_rising.byteAt(0));
try std.testing.expectEqual(@as(u8, '#'), long_rising.byteAt(2));
try std.testing.expectEqual(@as(u8, 'O'), long_rising.byteAt(6));
try std.testing.expectEqual(@as(u8, '{'), long_rising.byteAt(10));
try std.testing.expectEqual(@as(u8, '~'), long_rising.byteAt(12));
const long_falling = AsciiDiff.between(&high, &low).?;
try std.testing.expectEqual(@as(u8, 'O'), long_falling.byteAt(6));
try std.testing.expectEqual(@as(u8, ' '), long_falling.byteAt(12));
// The shape itself is the contract: never backwards, and the widest step
// is in the middle of the walk rather than at either end.
var previous = long_rising.byteAt(0);
var first_step: u8 = 0;
var middle_step: u8 = 0;
var frame: u16 = 1;
while (frame <= long_rising.movementFrames()) : (frame += 1) {
const byte = long_rising.byteAt(frame);
try std.testing.expect(byte >= previous);
const step = byte - previous;
if (frame == 1) first_step = step;
if (frame == 6) middle_step = step;
previous = byte;
}
try std.testing.expect(middle_step > first_step);
try std.testing.expect(middle_step > long_rising.byteAt(12) - long_rising.byteAt(11));
}
test "ASCII diff classification skips stable and non-ASCII glyphs" {
var old: Cell = .{ .default = false };
old.text[0] = 'x';
var style_only = old;
style_only.style.bold = true;
try std.testing.expectEqual(PanelCellDiff.visual, PanelCellDiff.between(&old, &style_only));
var changed = old;
changed.text[0] = 'z';
try std.testing.expectEqual(AsciiDiff{ .from = 'x', .to = 'z' }, PanelCellDiff.between(&old, &changed).ascii);
var unicode = old;
unicode.text[0..2].* = .{ 0xc3, 0xa9 };
unicode.len = 2;
try std.testing.expectEqual(PanelCellDiff.visual, PanelCellDiff.between(&old, &unicode));
}
/// One generation of a pixel attachment. `serial` identifies the pane for its
/// whole lifetime; `revision` identifies pixels rendered later by that same
/// pane (for example, a different PDF page or zoom level). Backends must use
/// both: pane slots are reused, while a live pane may replace its pixels.
pub const ImageCacheKey = if (pdf_enabled) struct {
serial: u32,
page: u32,
revision: u32,
pub fn eql(a: @This(), b: @This()) bool {
return a.serial == b.serial and a.page == b.page and
a.revision == b.revision;
}
} else struct {
serial: u32,
pub fn eql(a: @This(), b: @This()) bool {
return a.serial == b.serial;
}
};
const PdfFitMode = pdf_pane.FitMode;
const PdfTintMode = pdf_pane.TintMode;
/// Dynamic placement exists only for native PDF pages. Static image panes need
/// only their pane identity, so feature-off builds carry a zero-bit payload.
pub const NativePlacement = if (pdf_enabled) struct {
revision: u32 = 0,
page: u32 = 0,
fit: image.NativeFit = .contain,
pan_x: u16 = 0,
pan_y: u16 = 0,
/// Continuous-document pages supply their already-clipped geometry.
/// Static images and legacy callers leave this null and derive fit/pan.
geometry: ?image.NativeGeometry = null,
/// Subpixel vertical displacement retained from proportional SDL wheel dy.
pixel_offset_y: f32 = 0,
} else struct {};
/// A pixel image riding the surface: the shell transmits/places it over the
/// given cell rect (tty: Kitty graphics; SDL: alpha-blended GPU texture).
/// This is also the backend-neutral transport for rasterized PDF pages.
pub const ImagePlace = struct {
pane: u8,
/// Pane slots are reused. This identity makes a cached GPU texture or
/// kitty image unambiguously belong to the pane which supplied the bytes.
serial: u32,
native: NativePlacement = .{},
x: u16,
y: u16,
w: u16,
h: u16,
rgba: []const u8,
iw: usize,
ih: usize,
pub fn cacheKey(place: ImagePlace) ImageCacheKey {
if (comptime pdf_enabled)
return .{
.serial = place.serial,
.page = place.native.page,
.revision = place.native.revision,
};
return .{ .serial = place.serial };
}
};
test "pixel attachment cache key follows both pane lifetime and rendered revision" {
if (comptime pdf_enabled) {
const first = ImageCacheKey{ .serial = 41, .page = 7, .revision = 3 };
try std.testing.expect(first.eql(.{ .serial = 41, .page = 7, .revision = 3 }));
try std.testing.expect(!first.eql(.{ .serial = 41, .page = 8, .revision = 3 }));
try std.testing.expect(!first.eql(.{ .serial = 41, .page = 7, .revision = 4 }));
try std.testing.expect(!first.eql(.{ .serial = 42, .page = 7, .revision = 3 }));
} else {
const first = ImageCacheKey{ .serial = 41 };
try std.testing.expect(first.eql(.{ .serial = 41 }));
try std.testing.expect(!first.eql(.{ .serial = 42 }));
}
try std.testing.expectEqual(pdf_enabled, @hasField(ImageCacheKey, "revision"));
try std.testing.expectEqual(pdf_enabled, @hasField(NativePlacement, "fit"));
try std.testing.expectEqual(pdf_enabled, @hasField(CellPixels, "w"));
if (comptime !pdf_enabled) {
try std.testing.expectEqual(@as(usize, 4), @sizeOf(ImageCacheKey));
try std.testing.expectEqual(@as(usize, 0), @sizeOf(NativePlacement));
try std.testing.expectEqual(@as(usize, 0), @sizeOf(CellPixels));
try std.testing.expectEqual(@as(usize, 0), @sizeOf(pdf_pane.PointerDrag));
}
}
test "pixel attachment fit and pan do not invalidate cached pixels" {
if (comptime !pdf_enabled) return;
var place = ImagePlace{
.pane = 0,
.serial = 41,
.native = .{ .revision = 3 },
.x = 0,
.y = 0,
.w = 1,
.h = 1,
.rgba = &.{ 0, 0, 0, 255 },
.iw = 1,
.ih = 1,
};
const key = place.cacheKey();
place.native.fit = .width;
place.native.pan_x = 1234;
place.native.pan_y = 65535;
try std.testing.expect(key.eql(place.cacheKey()));
}
/// The canonical interface: what a frame of pardes IS. The tty shell writes
/// these cells to vaxis one-to-one; the SDL shells rasterize them.
pub const Surface = struct {
cols: u16 = 0,
rows: u16 = 0,
cells: []Cell = &.{},
/// bar: draw an insert-style thin cursor instead of the block
cursor: ?struct { x: u16, y: u16, bar: bool = false } = null,
/// Pixel attachments are the exact visible set. PDFs can legally contain
/// arbitrarily short pages, so no fixed page-count array can represent a
/// viewport without occasionally dropping an intersecting page.
images: []?ImagePlace = &.{},
nimages: usize = 0,
/// Active pane transitions, keyed by the stable pane serial carried in
/// each record. GUI shells evaluate these in shaders; the TTY remaps this
/// same frame's cells through its grid compositor.
panel_tracks: [MAX_PANES * 2]panel_animation.Track = undefined,
npanel_tracks: usize = 0,
/// Frozen canonical cells from before the current content/lifecycle
/// transition, plus the core's semantic old/new classifications. Both are
/// core-owned and remain stable until every associated track has finished.
previous_cells: []const Cell = &.{},
cell_diffs: []const PanelCellDiff = &.{},
pub fn panelTracks(s: *const Surface) []const panel_animation.Track {
return s.panel_tracks[0..s.npanel_tracks];
}
pub fn hasPanelDiff(s: *const Surface) bool {
return s.previous_cells.len == s.cells.len and
s.cell_diffs.len == s.cells.len;
}
pub fn panelCellChanged(s: *const Surface, x: u16, y: u16) bool {
if (!s.hasPanelDiff() or x >= s.cols or y >= s.rows) return false;
return s.cell_diffs[@as(usize, y) * s.cols + x].changed();
}
pub fn panelCellDiff(s: *const Surface, x: u16, y: u16) PanelCellDiff {
if (!s.hasPanelDiff() or x >= s.cols or y >= s.rows) return .unchanged;
return s.cell_diffs[@as(usize, y) * s.cols + x];
}
pub fn at(s: *Surface, x: u16, y: u16) *Cell {
std.debug.assert(x < s.cols and y < s.rows);
return &s.cells[@as(usize, y) * s.cols + x];
}
pub fn set(s: *Surface, x: u16, y: u16, text: []const u8, style: CellStyle) void {
const c = s.at(x, y);
std.debug.assert(text.len <= c.text.len);
@memcpy(c.text[0..text.len], text);
c.len = @intCast(text.len);
c.style = style;
c.default = false;
}
/// Print UTF-8 text into a row, no wrap, clipped to [x, x+w). Returns the
/// column after the last written cell. Wide glyphs take two cells.
///
/// The text is NOT trusted to be valid UTF-8 — a file pane holds whatever
/// bytes are on disk (latin-1 source, an ELF opened by mistake), a path can
/// be any bytes at all, and a search row splices both. std's unchecked
/// iterator panics on a bad start byte, so decode by hand and paint one
/// U+FFFD per undecodable byte (what a terminal does).
fn print(s: *Surface, x: u16, y: u16, w: u16, text: []const u8, style: CellStyle) u16 {
var col = x;
const end = x + w;
var i: usize = 0;
while (i < text.len) {
if (col >= end) break;
// ASCII FAST PATH. Printable ASCII is one byte, one cell, one column, and the general
// path below reaches that answer through a UTF-8 length, a decode, a freshly
// constructed grapheme iterator, a slice validation and a width lookup - per character.
// That made this function 26% of a keystroke when profiled in the ESP32-P4's
// configuration (40x12, no tree-sitter), which is the largest single item there.
//
// The guard on the NEXT byte is what makes it correct rather than merely fast: an ASCII
// base joins a following combining mark, ZWJ or spacing mark into ONE cluster, and every
// scalar that can do that is non-ASCII. So an ASCII byte followed by another ASCII byte
// (or by nothing) is a complete grapheme cluster on its own. Same condition
// `modal.nextGrapheme` uses, for the same reason.
//
// `\t`, `\r` and the C0 controls are excluded by the range test and keep their existing
// handling below; DEL is excluded too.
{
const b = text[i];
if (b >= 0x20 and b < 0x7f and (i + 1 == text.len or text[i + 1] < 0x80)) {
s.set(col, y, text[i .. i + 1], style);
i += 1;
col += 1;
continue;
}
}
if (col >= end) break;
// n == 0: not a start byte at all. A short tail or a bad
// continuation decodes to null the same way — one U+FFFD, one byte.
const n = std.unicode.utf8ByteSequenceLength(text[i]) catch 0;
const decoded: ?u21 = if (n > 0 and i + n <= text.len)
(std.unicode.utf8Decode(text[i .. i + n]) catch null)
else
null;
var cp_slice: []const u8 = "\u{FFFD}";
var consumed: usize = 1;
if (decoded != null) {
// A surface cell is a grapheme, not a codepoint. Keeping the
// complete cluster makes combining marks visible and keeps ZWJ,
// modifier, flag and Indic sequences in the same screen cell
// that cursor/edit math treats as one unit.
var git = uucode.grapheme.utf8Iterator(text[i..]);
if (git.nextGrapheme()) |g| {
const candidate = text[i .. i + g.end];
if (std.unicode.utf8ValidateSlice(candidate)) {
cp_slice = candidate;
consumed = candidate.len;
} else {
cp_slice = text[i .. i + n];
consumed = n;
}
}
}
i += consumed;
var cp = decoded orelse 0xFFFD;
if (cp == '\r') continue;
// A Surface cell is already positioned, not a terminal byte
// stream. Expand tabs here so every Surface consumer — GUI, tty,
// web, and macOS — sees the same configured run of blank cells
// instead of asking its font for a control-character glyph.
if (cp == '\t') {
const spaces = @min(config.tab_width, end - col);
s.fill(col, y, spaces, 1, style);
col += spaces;
continue;
}
// No other C0/C1 control or DEL reaches a font fallback either.
if (cp < ' ' or cp == 0x7f or (cp >= 0x80 and cp <= 0x9f)) {
cp = 0xFFFD;
cp_slice = "\u{FFFD}";
}
const width: u16 = if (decoded == null or (cp < 0x80 and cp_slice.len == 1))
1
else
@max(1, vaxis.gwidth.gwidth(cp_slice, .unicode));
// a DOUBLE-width glyph with one column left is not drawn at all.
// Writing it puts one cell in the surface and two on the glass, and
// when that column is the screen's last the terminal wraps the tail
// onto the next row — where our own model says "space", so the diff
// render never repaints it and the smear outlives the frame. A
// blank at the edge is what every terminal does with the same
// problem. Reachable from any byte cut through wide text: hscroll's
// and soft wrap's both.
if (width == 2 and col + 1 >= end) break;
// The cross-host Cell ABI has seven payload bytes. Preserve a valid
// codepoint prefix when a modern emoji cluster is longer; its full
// width and edit boundary still come from the complete cluster.
var shown = cp_slice;
if (shown.len > @typeInfo(@FieldType(Cell, "text")).array.len) {
const cap = @typeInfo(@FieldType(Cell, "text")).array.len;
var prefix: usize = 0;
while (prefix < shown.len) {
const cp_len = std.unicode.utf8ByteSequenceLength(shown[prefix]) catch break;
if (prefix + cp_len > cap) break;
prefix += cp_len;
}
shown = if (prefix > 0) shown[0..prefix] else "\u{FFFD}";
}
s.set(col, y, shown, style);
if (width == 2 and col + 1 < end) {
// spacer: empty cell under the wide glyph's tail
s.set(col + 1, y, "", style);
}
col += width;
}
return col;
}
pub fn fill(s: *Surface, x: u16, y: u16, w: u16, h: u16, style: CellStyle) void {
var yy = y;
while (yy < y + h) : (yy += 1) {
var xx = x;
while (xx < x + w) : (xx += 1) s.set(xx, yy, " ", style);
}
}
fn clearRect(s: *Surface, x: u16, y: u16, w: u16, h: u16) void {
var yy = y;
while (yy < y + h) : (yy += 1) {
var xx = x;
while (xx < x + w) : (xx += 1) s.at(xx, yy).* = .{};
}
}
/// swap ONLY the glyph, keeping the cell's colors — the resize-handle hint
fn overlayDash(s: *Surface, x: u16, y: u16, glyph: []const u8) void {
const c = s.at(x, y);
@memcpy(c.text[0..glyph.len], glyph);
c.len = @intCast(glyph.len);
c.default = false;
}
};
test "surface print expands configured tabs and normalizes other controls" {
const tab_cells: usize = @as(usize, config.tab_width) * 2;
const replacement_cells = 5;
const cell_count = tab_cells + replacement_cells + 1;
var cells: [cell_count]Cell = @splat(.{});
var surface = Surface{ .cols = cells.len, .rows = 1, .cells = &cells };
const end = surface.print(0, 0, cells.len, "\t\t\x00\x0b\x0c\r\x7f\xc2\x85A", .{});
try std.testing.expectEqual(@as(u16, cells.len), end);
for (cells[0..tab_cells]) |cell|
try std.testing.expectEqualStrings(" ", cell.grapheme());
for (cells[tab_cells .. tab_cells + replacement_cells]) |cell|
try std.testing.expectEqualStrings("\u{FFFD}", cell.grapheme());
try std.testing.expectEqualStrings("A", cells[cell_count - 1].grapheme());
}
test "surface print keeps combining and wide graphemes in their display cells" {
var cells: [8]Cell = @splat(.{});
var surface = Surface{ .cols = cells.len, .rows = 1, .cells = &cells };
const end = surface.print(0, 0, cells.len, "e\u{301}界👩🏽\u{200d}🚀1\u{fe0f}\u{20e3}A", .{});
try std.testing.expectEqual(@as(u16, 8), end);
try std.testing.expectEqualStrings("e\u{301}", cells[0].grapheme());
try std.testing.expectEqualStrings("界", cells[1].grapheme());
try std.testing.expectEqualStrings("", cells[2].grapheme());
try std.testing.expectEqualStrings("👩", cells[3].grapheme());
try std.testing.expectEqualStrings("", cells[4].grapheme());
try std.testing.expectEqualStrings("1\u{fe0f}\u{20e3}", cells[5].grapheme());
try std.testing.expectEqualStrings("", cells[6].grapheme());
try std.testing.expectEqualStrings("A", cells[7].grapheme());
}
test "the ASCII fast path in surface print paints what the general arm paints" {
// The fast path skips a UTF-8 length, a decode, a grapheme iterator, a slice validation and a
// width lookup, so it can only be judged against those: the reference below is `print` with the
// fast-path block deleted and nothing else changed. Both routes paint into equally sized
// surfaces and every cell plus the returned column must match.
const ref = struct {
fn print(s: *Surface, x: u16, y: u16, w: u16, text: []const u8, style: CellStyle) u16 {
var col = x;
const end = x + w;
var i: usize = 0;
while (i < text.len) {
if (col >= end) break;
const n = std.unicode.utf8ByteSequenceLength(text[i]) catch 0;
const decoded: ?u21 = if (n > 0 and i + n <= text.len)
(std.unicode.utf8Decode(text[i .. i + n]) catch null)
else
null;
var cp_slice: []const u8 = "\u{FFFD}";
var consumed: usize = 1;
if (decoded != null) {
var git = uucode.grapheme.utf8Iterator(text[i..]);
if (git.nextGrapheme()) |g| {
const candidate = text[i .. i + g.end];
if (std.unicode.utf8ValidateSlice(candidate)) {
cp_slice = candidate;
consumed = candidate.len;
} else {
cp_slice = text[i .. i + n];
consumed = n;
}
}
}
i += consumed;
var cp = decoded orelse 0xFFFD;
if (cp == '\r') continue;
if (cp == '\t') {
const spaces = @min(config.tab_width, end - col);
s.fill(col, y, spaces, 1, style);
col += spaces;
continue;
}
if (cp < ' ' or cp == 0x7f or (cp >= 0x80 and cp <= 0x9f)) {
cp = 0xFFFD;
cp_slice = "\u{FFFD}";
}
const width: u16 = if (decoded == null or (cp < 0x80 and cp_slice.len == 1))
1
else
@max(1, vaxis.gwidth.gwidth(cp_slice, .unicode));
if (width == 2 and col + 1 >= end) break;
var shown = cp_slice;
if (shown.len > @typeInfo(@FieldType(Cell, "text")).array.len) {
const cap = @typeInfo(@FieldType(Cell, "text")).array.len;
var prefix: usize = 0;
while (prefix < shown.len) {
const cp_len = std.unicode.utf8ByteSequenceLength(shown[prefix]) catch break;
if (prefix + cp_len > cap) break;
prefix += cp_len;
}
shown = if (prefix > 0) shown[0..prefix] else "\u{FFFD}";
}
s.set(col, y, shown, style);
if (width == 2 and col + 1 < end) s.set(col + 1, y, "", style);
col += width;
}
return col;
}
}.print;
const H = struct {
fn check(text: []const u8) !void {
// Every width from 0 past the end, because clipping interacts with the fast path: the
// wide-glyph bail at the right edge is only reachable from the general arm.
var w: u16 = 0;
while (w <= text.len + 4) : (w += 1) {
var fast_cells: [64]Cell = @splat(.{});
var slow_cells: [64]Cell = @splat(.{});
var fast = Surface{ .cols = fast_cells.len, .rows = 1, .cells = &fast_cells };
var slow = Surface{ .cols = slow_cells.len, .rows = 1, .cells = &slow_cells };
const got = fast.print(0, 0, w, text, .{});
const want = ref(&slow, 0, 0, w, text, .{});
std.testing.expectEqual(want, got) catch |e| {
std.debug.print("print end column: {any} w={d}\n", .{ text, w });
return e;
};
for (fast_cells, slow_cells, 0..) |f, sc, col| {
std.testing.expectEqualStrings(sc.grapheme(), f.grapheme()) catch |e| {
std.debug.print("print cell {d}: {any} w={d}\n", .{ col, text, w });
return e;
};
try std.testing.expectEqual(sc.default, f.default);
}
}
}
};
// The scalars that extend an ASCII base into ONE cluster - a combining mark, a ZWJ sequence, a
// spacing mark, a variation selector - are exactly what the guard on the next byte exists for.
// Wide glyphs check the two-cell accounting either side of the fast path, and the three invalid
// sequences check that a bad start byte, a truncated tail and a bad continuation each still
// become one U+FFFD per undecodable byte instead of being swallowed.
const neighbours = [_][]const u8{
"", "x", "\u{301}", "\u{200d}\u{1f680}",
"\u{903}", "\u{fe0f}", "\u{20e3}", "\u{4e16}",
"\u{1f642}", "\xff", "\xe4\xb8", "\xe4\x28\xb8",
"\u{1f1e6}\u{1f1e7}",
};
// Every byte 0x20..0x7e takes the fast path; \t, \r, the rest of the C0 controls and DEL are
// excluded by its range test and must keep the general arm's tab expansion and U+FFFD.
var buf: [16]u8 = undefined;
var b: u8 = 0;
while (b < 0x80) : (b += 1) {
buf[0] = b;
for (neighbours) |tail| {
@memcpy(buf[1..][0..tail.len], tail);
try H.check(buf[0 .. 1 + tail.len]);
@memcpy(buf[0..tail.len], tail);
buf[tail.len] = b;
try H.check(buf[0 .. tail.len + 1]);
}
}
// Runs long enough that the fast path starts, hands over and restarts inside one call.
try H.check("ascii \u{4e16}\u{754c} e\u{301} \xff ok\t\r!");
try H.check("plain");
}
test "insert and normal modes edit complete Unicode graphemes" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 60, .rows = 12 });
defer p.deinit();
const pane = try p.hxOpenFileContent("a" ++ "e\u{301}" ++ "👩🏽\u{200d}🚀" ++ "界" ++ "z");
pane.mode = .insert;
pane.cur_col = 22; // on z, after the CJK grapheme
p.insertKey(pane, .{ .cp = Key.left });
try std.testing.expectEqual(@as(i32, 19), pane.cur_col);
p.insertKey(pane, .{ .cp = Key.left });
try std.testing.expectEqual(@as(i32, 4), pane.cur_col);
p.insertKey(pane, .{ .cp = Key.right });
try std.testing.expectEqual(@as(i32, 19), pane.cur_col);
p.insertKey(pane, .{ .cp = Key.backspace });
try std.testing.expectEqualStrings("ae\u{301}界z", pane.file.?.content);
try std.testing.expectEqual(@as(i32, 4), pane.cur_col);
pane.mode = .normal;
pane.cur_col = 1;
p.normalDelete(pane, false);
try std.testing.expectEqualStrings("a界z", pane.file.?.content);
try std.testing.expectEqual(@as(i32, 1), pane.cur_col);
p.normalReplaceChar(pane, 'λ');
try std.testing.expectEqualStrings("aλz", pane.file.?.content);
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "界a"));
pane.cur_col = 3;
pane.vsel = .{ .active = true, .row = 0, .col = 0, .explicit = true };
p.normalReplaceChar(pane, 'λ');
try std.testing.expectEqualStrings("λλ", pane.file.?.content);
try std.testing.expectEqual(@as(i32, 2), pane.cur_col);
try std.testing.expectEqual(@as(i32, 0), pane.vsel.col);
file_pane.setContent(p, &pane.file.?, try gpa.dupe(u8, "界a"));
pane.cur_col = 0;
pane.vsel = .{ .active = true, .row = 0, .col = 3, .explicit = true };
p.normalReplaceChar(pane, 'λ');
try std.testing.expectEqualStrings("λλ", pane.file.?.content);
try std.testing.expectEqual(@as(i32, 0), pane.cur_col);
try std.testing.expectEqual(@as(i32, 2), pane.vsel.col);
}
test "Unicode display cells map back to body and tag byte cursors" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 60, .rows = 12 });
defer p.deinit();
const pane = try p.hxOpenFileContent("a界e\u{301}z\n");
const f = &pane.file.?;
p.gpa.free(f.path);
f.path = try p.gpa.dupe(u8, "界e\u{301}.txt");
var frame = std.heap.ArenaAllocator.init(gpa);
defer frame.deinit();
_ = try p.render(frame.allocator());
const rect = p.rects[0];
const text_x = rect.x + config.GUTTER + config.PREFIX_W;
const body_y = rect.y + BOX_H;
// The second screen cell is the trailing half of the wide CJK grapheme.
// Both halves map to its one byte boundary.
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .press, .col = text_x + 2, .row = body_y } });
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .release, .col = text_x + 2, .row = body_y } });
try std.testing.expectEqual(@as(i32, 1), pane.cur_col);
// A click in the wide path glyph likewise becomes a byte cursor at the
// grapheme start; arrow motion then advances by the full UTF-8 cluster.
p.enterTagEdit(pane, 1);
try std.testing.expectEqual(@as(u16, 0), pane.tag_col);
p.tagInsertKey(pane, .{ .cp = Key.right });
try std.testing.expectEqual(@as(u16, 3), pane.tag_col);
p.tagInsertKey(pane, .{ .cp = Key.right });
try std.testing.expectEqual(@as(u16, 6), pane.tag_col);
const before = try gpa.dupe(u8, pane.tagSlice());
defer gpa.free(before);
p.enterTagEdit(pane, -1);
const insertion = pane.tag_col;
p.tagInsertKey(pane, .{ .cp = 'λ', .text = "λ" });
try std.testing.expectEqual(insertion + 2, pane.tag_col);
p.tagInsertKey(pane, .{ .cp = Key.backspace });
try std.testing.expectEqual(insertion, pane.tag_col);
try std.testing.expectEqualStrings(before, pane.tagSlice());
}
test "tabbed file aligns syntax cursor and mouse while preserving virtual columns" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 60, .rows = 12 });
defer p.deinit();
const pane = try p.hxOpenFileContent("\treturn x\n");
const f = &pane.file.?;
f.highlights = try p.tree_sitter_gpa.alloc(u8, f.content.len);
@memset(f.highlights, @intFromEnum(syntax.Syn.none));
@memset(f.highlights[1..7], @intFromEnum(syntax.Syn.keyword));
f.syntax_dirty = false;
pane.cur_row = 0;
pane.cur_col = 1;
var frame = std.heap.ArenaAllocator.init(gpa);
defer frame.deinit();
const surface = try p.render(frame.allocator());
const rect = p.rects[0];
const text_x = rect.x + config.GUTTER + config.PREFIX_W;
const body_y = rect.y + BOX_H;
for (0..config.tab_width) |col|
try std.testing.expect(!surface.at(text_x + @as(u16, @intCast(col)), body_y).style.bold);
for (0.."return".len) |col|
try std.testing.expect(surface.at(text_x + config.tab_width + @as(u16, @intCast(col)), body_y).style.bold);
try std.testing.expectEqual(text_x + config.tab_width, surface.cursor.?.x);
const click_x = text_x + config.tab_width + 2;
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .press, .col = click_x, .row = body_y } });
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .release, .col = click_x, .row = body_y } });
try std.testing.expectEqual(@as(i32, 3), pane.cur_col);
// Display-column conversion must not turn a click in the blank space
// after EOL into a click on the final byte. Besides moving the modal
// cursor, that would make a no-drag Look expand the last word instead of
// remaining inert over blank space.
const line = modal.lineSlice(f.content, 0);
const virtual: u16 = 3;
const blank_x = text_x + @as(u16, @intCast(file_pane.displayWidth(line))) + virtual;
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .press, .col = blank_x, .row = body_y } });
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .release, .col = blank_x, .row = body_y } });
try std.testing.expectEqual(@as(i32, @intCast(line.len + @as(usize, virtual))), pane.cur_col);
_ = frame.reset(.retain_capacity);
const virtual_surface = try p.render(frame.allocator());
try std.testing.expectEqual(blank_x, virtual_surface.cursor.?.x);
const local_blank: i32 = @intCast(blank_x - rect.x - config.GUTTER);
try std.testing.expect(p.expandedSel(pane, .{ .state = .dragging, .c0 = local_blank, .c1 = local_blank, .r0 = BOX_H, .r1 = BOX_H }) == null);
// The immediately-adjacent EOL cell and an in-line separator are blank
// too. Pointer expansion must not lean left into the preceding word.
const adjacent: i32 = @intCast(config.PREFIX_W + file_pane.displayWidth(line));
try std.testing.expect(p.expandedSel(pane, .{ .state = .dragging, .c0 = adjacent, .c1 = adjacent, .r0 = BOX_H, .r1 = BOX_H }) == null);
const separator: i32 = @intCast(config.PREFIX_W + config.tab_width + "return".len);
try std.testing.expect(p.expandedSel(pane, .{ .state = .dragging, .c0 = separator, .c1 = separator, .r0 = BOX_H, .r1 = BOX_H }) == null);
}
test "Look hover waits without mutating the pane and input cancels it" {
const delay = config.look_preview_delay_frames orelse return;
try std.testing.expect(delay > 0);
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 60, .rows = 12, .tty_only = true });
defer p.deinit();
while (p.nextEffect()) |_| {}
const pane = try p.hxOpenFileContent("alpha beta gamma\n");
while (p.nextEffect()) |_| {}
const other_id = p.freeSlot() orelse return error.NoSparePaneForHoverTest;
_ = try p.newShell(other_id, "");
try std.testing.expect(p.layoutSplitColumn(0, other_id, false));
p.sync();
while (p.nextEffect()) |_| {}
var frame = std.heap.ArenaAllocator.init(gpa);
defer frame.deinit();
_ = try p.render(frame.allocator());
const rect = p.rects[p.active];
const word_x = rect.x + config.GUTTER + config.PREFIX_W + 7;
const body_y = if (p.settings.tag_bottom) rect.y else rect.y + BOX_H;
const motion = Event{ .mouse = .{ .button = .none, .kind = .motion, .col = word_x, .row = body_y } };
const selections_before = pane.sel;
const active_before = p.active;
const cursor_before = .{ pane.cur_row, pane.cur_col };
const jumps_before = .{ p.njumps, p.jcur, p.n_look_src };
const effects_before = p.effects_len;
p.update(motion);
try std.testing.expect(p.look_hover_wait != null);
try std.testing.expect(p.look_hover_preview == null);
try std.testing.expect(p.animationActive());
var ticks: u16 = 0;
while (ticks + 1 < delay) : (ticks += 1) {
p.update(.tick);
// Repeated motion reports for one cell are noise, not a fresh delay.
if (ticks == delay / 2) p.update(motion);
try std.testing.expect(p.look_hover_preview == null);
}
p.update(.tick);
const preview = p.look_hover_preview orelse return error.MissingLookHoverPreview;
const preview_sel = preview.sel orelse return error.MissingLookHoverSelection;
try std.testing.expectEqual(.done, preview_sel.state);
try std.testing.expectEqual(@as(i32, config.PREFIX_W + 6), preview_sel.c0);
try std.testing.expectEqual(@as(i32, config.PREFIX_W + 9), preview_sel.c1);
try std.testing.expect(!p.animationActive());
// Resolving and displaying the operand is observational only.
try std.testing.expect(std.meta.eql(selections_before, pane.sel));
try std.testing.expectEqual(active_before, p.active);
try std.testing.expectEqual(cursor_before, .{ pane.cur_row, pane.cur_col });
try std.testing.expectEqual(jumps_before, .{ p.njumps, p.jcur, p.n_look_src });
try std.testing.expectEqual(effects_before, p.effects_len);
_ = frame.reset(.retain_capacity);
const surface = try p.render(frame.allocator());
const expected_bg = mix(p.theme().bg orelse p.theme().tag_bg, mix(p.theme().bg orelse p.theme().tag_bg, p.theme().sel_bg));
try std.testing.expectEqual(Color{ .rgb = expected_bg }, surface.at(word_x, body_y).style.bg);
// Background traffic in another pane does not change the text or geometry
// under this pointer and must not strand a stationary hover unarmed.
p.update(.{ .output = .{ .pane = @intCast(other_id), .bytes = "busy\r\n" } });
try std.testing.expect(p.look_hover_preview != null);
// A real leave cannot be represented as an out-of-range motion: motion
// coordinates are deliberately clamped for drags. It also clears the
// ordinary resize-handle hint, not only this Look-specific preview.
const seam_x = p.col_x[0] + p.col_w[0] - 1;
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = seam_x, .row = body_y } });
_ = frame.reset(.retain_capacity);
const hovered_seam = try p.render(frame.allocator());
try std.testing.expectEqualStrings("╎", hovered_seam.at(seam_x, body_y).grapheme());
p.update(.pointer_leave);
try std.testing.expect(p.look_hover_wait == null);
try std.testing.expect(p.look_hover_preview == null);
_ = frame.reset(.retain_capacity);
const left_seam = try p.render(frame.allocator());
try std.testing.expect(!std.mem.eql(u8, "╎", left_seam.at(seam_x, body_y).grapheme()));
// Blank space after EOL has a pointer cell but no Look operand. Ageing it
// to completion must turn the animation clock back off without drawing a
// misleading one-cell preview.
const blank_x = rect.x + config.GUTTER + config.PREFIX_W + 30;
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = blank_x, .row = body_y } });
for (0..delay) |_| p.update(.tick);
try std.testing.expect(p.look_hover_wait == null);
try std.testing.expect(p.look_hover_preview == null);
try std.testing.expect(!p.animationActive());
// File PREFIX_W belongs only to body line numbers. A preview on the tag's
// first character must be paintable all the way at tag column zero.
const tag_y = if (p.settings.tag_bottom) rect.y + rect.h - BOX_H else rect.y;
p.look_hover_preview = .{
.col = rect.x + config.GUTTER,
.row = tag_y,
.pane = p.active,
.serial = pane.serial,
.sel = .{ .state = .done, .c0 = 0, .c1 = 0, .r0 = 0, .r1 = 0 },
};
_ = frame.reset(.retain_capacity);
const tag_surface = try p.render(frame.allocator());
try std.testing.expectEqual(Color{ .rgb = expected_bg }, tag_surface.at(rect.x + config.GUTTER, tag_y).style.bg);
p.look_hover_preview = null;
p.update(motion);
try std.testing.expect(p.look_hover_wait != null);
p.update(.{ .key = .{ .cp = Key.escape } });
try std.testing.expect(p.look_hover_wait == null);
try std.testing.expect(p.look_hover_preview == null);
// The following host repaint must not resurrect a hover after keyboard
// input cancelled its raw-pointer intent.
p.acknowledgePanelPresentation(&.{});
try std.testing.expect(p.look_hover_wait == null);
}
test "cwd changes cancel only the affected pane's Look hover" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .shells = 3 });
defer p.deinit();
const first = p.panes[0] orelse return error.MissingFirstPane;
const other = p.panes[1] orelse return error.MissingOtherPane;
p.setCwd(0, "/work/first");
p.setCwd(1, "/work/other");
p.look_hover_wait = .{ .col = 1, .row = 1, .pane = 0, .serial = first.serial };
// Hosts poll cwd every frame. An unchanged answer is observational and a
// change reported for another pane cannot invalidate this pane's operand.
p.setCwd(0, "/work/first");
try std.testing.expect(p.look_hover_wait != null);
p.setCwd(1, "/work/elsewhere");
try std.testing.expect(p.look_hover_wait != null);
try std.testing.expectEqual(other.serial, p.panes[1].?.serial);
p.setCwd(0, "/work/changed");
try std.testing.expect(p.look_hover_wait == null);
try std.testing.expect(p.look_hover_preview == null);
}
test "plain left click clears explicit modal selection" {
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 40, .rows = 10 });
defer p.deinit();
const pane = try p.hxOpenFileContent("abcdef\n");
pane.cur_row = 0;
pane.cur_col = 5;
pane.vsel = .{ .active = true, .row = 0, .col = 1, .explicit = true };
pane.msel = .{ .active = true, .r0 = 0, .r1 = 0 };
var frame = std.heap.ArenaAllocator.init(gpa);
defer frame.deinit();
_ = try p.render(frame.allocator());
const rect = p.rects[0];
const click_x = rect.x + config.GUTTER + config.PREFIX_W + 3;
const body_y = rect.y + BOX_H;
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .press, .col = click_x, .row = body_y } });
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .release, .col = click_x, .row = body_y } });
try std.testing.expectEqual(@as(i32, 3), pane.cur_col);
try std.testing.expect(!pane.vsel.active);
try std.testing.expect(!pane.msel.active);
try std.testing.expectEqual(.none, pane.sel[@intFromEnum(config.select_button)].state);
}
test "selection drag and queued release do not enter panel pending state" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 50, .rows = 10, .tty_only = true });
defer p.deinit();
const pane = try p.hxOpenFileContent("alpha beta\n");
p.acknowledgePanelPresentation(&.{});
const rect = p.rects[0];
const x = rect.x + config.GUTTER + config.PREFIX_W + 1;
const y = rect.y + BOX_H;
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .press, .col = x, .row = y } });
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .drag, .col = x + 2, .row = y } });
try std.testing.expect(!p.panel_presentation_pending);
p.update(.{ .mouse = .{ .button = config.select_button, .kind = .release, .col = x + 2, .row = y } });
try std.testing.expect(p.drag == .none);
try std.testing.expectEqual(.done, pane.sel[sel_slot].state);
}
pub const Mouse = struct {
// sel indexing relies on left/middle/right being 0/1/2
pub const Button = enum { left, middle, right, wheel_up, wheel_down, wheel_left, wheel_right, none };
pub const Kind = enum { press, release, motion, drag };
button: Button,
kind: Kind,
col: u16,
row: u16,
/// Ctrl held during the click. Only the left press reads it (ctrl-click =
/// goto-definition, the one chord every editor with an LSP has); every
/// other button ignores it, because acme's button semantics are already
/// the vocabulary here and modifiers are not part of it.
ctrl: bool = false,
};
pub const Key = struct {
cp: u21, // codepoint or one of the specials below
text: []const u8 = "",
ctrl: bool = false,
alt: bool = false,
/// Only consulted for keys whose codepoint does NOT already carry the
/// shift (Escape and friends) — `A` is `A`, not shift-`a`, so `hit()`
/// ignores this field unless a binding explicitly asks for it.
shift: bool = false,
pub const enter: u21 = 0x0D;
pub const escape: u21 = 0x1B;
pub const tab: u21 = 0x09;
pub const backspace: u21 = 0x7F;
// private-use plane for non-text keys, matching no real codepoint
pub const up: u21 = 0xF0001;
pub const down: u21 = 0xF0002;
pub const left: u21 = 0xF0003;
pub const right: u21 = 0xF0004;
pub const home: u21 = 0xF0005;
pub const end: u21 = 0xF0006;
pub const page_up: u21 = 0xF0007;
pub const page_down: u21 = 0xF0008;
pub const delete: u21 = 0xF0009;
};
/// Does this press match a binding? Every keymap test in the core goes through
/// here, so the modifier rules are written once instead of once per modifier
/// (the three is/isC/isA predicates this replaces each spelled out the same
/// comparison with a different pair of negations).
///
/// A binding is a LIST: most have two spellings that must reach the same arm —
/// `h` and Left, `Ctrl-f` and PageDown — and the `or` chain that used to do
/// that at every call site is now one loop here.
fn hit(key: Key, binding: []const config.Chord) bool {
for (binding) |c| {
if (key.cp != c.cp or key.ctrl != c.ctrl or key.alt != c.alt) continue;
// shift is carried in the codepoint for anything printable (`A` is
// `A`, not shift-`a`), so it is consulted ONLY when a binding asks for
// it — otherwise every letter binding would newly demand shift be up
if (c.shift and !key.shift) continue;
return true;
}
return false;
}
/// `Pane.sel` is indexed by @intFromEnum(button), so this is the SELECT
/// button's slot: where a sweep lands and where the left half of every acme
/// chord reads its selection from. Named rather than the bare 0 it used to be
/// so that config.select_button is genuinely the only place the choice is
/// made.
const sel_slot = @intFromEnum(config.select_button);
/// The same test for a MODAL PREFIX (`g`, `z`, `m`, `mi`, `]`...). config
/// spells those as bare codepoints rather than Chords because pardes stores
/// the codepoint itself in pane.pending until the next key completes the
/// sequence — so this is the one place the two shapes meet, and it is the same
/// comparison the stored byte gets a few lines later.
fn isPrefix(key: Key, cp: u21) bool {
return key.cp == cp and !key.ctrl and !key.alt;
}
fn roleBindingName(comptime role: normal_input.Role) []const u8 {
return switch (role) {
.prefix_goto => "goto_prefix",
.prefix_view => "view_prefix",
.prefix_match => "match_prefix",
.prefix_find_fwd => "find_char_fwd",
.prefix_find_back => "find_char_back",
.prefix_till_fwd => "till_char_fwd",
.prefix_till_back => "till_char_back",
.prefix_replace => "replace_prefix",
.prefix_next => "next_prefix",
.prefix_prev => "prev_prefix",
else => @tagName(role),
};
}
/// The single physical-key -> BODY-NORMAL vocabulary seam. A key may carry
/// several roles (`h` is both move-left and `gh`'s line-start); the pure
/// normal_input parser chooses among them from its explicit prefix state.
/// Both text panes and PDF panes call this exact function before adapting the
/// resulting semantic Action.
fn normalInput(key: Key) normal_input.Input {
var out: normal_input.Input = .{
.cp = key.cp,
.ctrl = key.ctrl,
.alt = key.alt,
};
inline for (std.enums.values(normal_input.Role)) |role| {
const name = comptime roleBindingName(role);
if (!@hasDecl(config, name))
@compileError("normal input role has no config binding: " ++ name);
const binding = @field(config, name);
const matched = if (@TypeOf(binding) == comptime_int)
isPrefix(key, binding)
else if (@TypeOf(binding) == []const config.Chord)
hit(key, binding)
else
@compileError("normal input binding has unsupported type: " ++ name);
if (matched) out.roles.insert(role);
}
return out;
}
/// Pixel dimensions are meaningful only to the native PDF placement path.
/// Keep resize events layout-only when that path is not part of the build.
pub const CellPixels = if (pdf_enabled) struct {
w: u16 = 8,
h: u16 = 16,
} else struct {};
pub const Event = union(enum) {
key: Key,
mouse: Mouse,
resize: struct {
cols: u16,
rows: u16,
/// Physical pixels in one grid cell, present only when native PDF
/// placement is compiled in. Defaults keep headless/core callers
/// useful and give terminals which cannot report pixels the
/// conventional 1:2 cell aspect.
cell_pixels: CellPixels = .{},
},
output: struct { pane: u8, bytes: []const u8 },
eof: struct { pane: u8 },
/// a language query the shell ran on a worker has finished. `rows` is
/// `+Search`-format text (see lsp.zig) and is borrowed for this call only,
/// exactly like `output` bytes. An id the core no longer recognises is a
/// stale answer (the pane was closed, or a newer query superseded it) and
/// is dropped.
lsp_resp: struct { id: u32, rows: []const u8 },
/// A selection-pipe worker finished. Every output is borrowed for this
/// update only; success is atomic, so a failed/nonzero invocation carries
/// no usable outputs and changes nothing.
pipe_resp: struct { id: u32, success: bool, outputs: []const []const u8 },
/// a file the shell was asked to watch changed on disk; `bytes` are the
/// exact snapshot the host hashed, borrowed for this call like `output`.
/// Text panes adopt a copy; PDF panes reopen the path so MuPDF owns its
/// random-access document. A shell with no filesystem (the browser) or no
/// watcher simply never sends one — nothing in the core waits for it.
file_changed: struct { pane: u8, bytes: []const u8 },
/// Text from the SYSTEM clipboard, borrowed for this call. Two ways in,
/// one handler (applyPaste): SOLICITED, the answer to a `read_clipboard`
/// the core emitted for `SPC p` / `SPC P` / `SPC R`, which decides where
/// it lands; and UNSOLICITED — an outer terminal's bracketed paste, a
/// Cmd-V, the browser's paste event — which means `SPC p`, paste after.
/// Neither touches the default register: that is `y`'s alone (helix).
paste: []const u8,
/// One builtin command line, handed to the shell by a pardes launched
/// INSIDE this one (see nested.zig) — `Look /abs/path` and nothing else
/// today. Borrowed for this call exactly like `output` bytes. It comes in
/// as an EVENT rather than a direct executeBuiltinLine call so it gets the
/// trailing sync and the ordinary effect drain: `Look` on a directory
/// emits a `.spawn` the shell has to perform.
command: []const u8,
/// Native shells may preserve sub-cell wheel distance in physical pixels.
/// TTY button events still enter through the ordinary mouse path.
pdf_scroll: struct { pane: u8, delta_pixels: f32 },
pinch: f32,
touch_scroll: f32,
/// The host pointer left the drawable area. Unlike an out-of-range motion,
/// this must not clamp onto and preview the final grid cell.
pointer_leave,
tick,
/// ONE FILESYSTEM REQUEST from a process that opened a file under the
/// acme-style control mount (src/acmefs.zig, served by src/fuse.zig).
/// `data` is borrowed for this call exactly like `output` bytes, which is
/// why this — like them — never goes through `postEvent`. The answer
/// leaves as an `Effect.fs_reply` in the same update, so the transport
/// that asked is the one that writes it back: no thread, no waiting and
/// no filesystem knowledge anywhere in here.
fs_req: acmefs.Req,
};
/// The longest session name `Effect.attach` can carry. A name is ONE path
/// component under the runtime socket directory (detached/server.zig
/// `socketPath`), so `sun_path`'s 108 bytes cap a usable one far below this;
/// 256 is the width `spawn`'s cwd and `open_link` already reserve, and reusing
/// it is why the new arm costs the effect ring nothing — `save_text`'s
/// {pane, serial, Buf(256)} is still the widest thing in the union.
pub const attach_name_max = 256;
/// What `takeAttach` hands the shell: the session to reach for (empty means
/// "whichever one is there") and the pane whose message row a failed connect
/// is reported on, the way `Effect.dump_themes` carries the pane that receives
/// the native host's answer.
pub const AttachRequest = struct { pane: u8, name: []const u8 };
/// A pane's pty bytes waiting for room in the effect ring. Core-owned (the
/// `Event.paste` slice they came from is borrowed for one `update` only), and
/// freed the moment `off` reaches the end or the pane goes away.
pub const PendingWrite = struct { bytes: []u8, off: usize = 0 };
/// WHAT `pty/ctl`'s `sig` VERB CAN SEND. Named rather than numeric because the
/// core is freestanding: it has no `SIGINT` to name and a number written here
/// would be one platform's number travelling to a host that may not share it.
/// Five, and deliberately not the whole of signal(7): these are the ones a
/// human at a terminal already has a key or a `kill` for, and every one of
/// them means something to a program on a tty. `sig USR1` at a shell is a
/// message to a daemon, not a terminal operation, and nothing asked for it.
pub const PtySignal = enum(u8) { int, term, hup, quit, kill };
/// IO the core wants done. Payloads are inline (fixed buffers): effects are
/// queued values with no lifetime ties back into the core.
pub const Effect = union(enum) {
spawn: struct { pane: u8, cwd: Buf(256) },
write: struct { pane: u8, bytes: Buf(64) },
resize_pty: struct { pane: u8, cols: u16, rows: u16 },
/// Deliver a signal to whatever is on this pane's tty — `pty/ctl`'s
/// `sig INT`, i.e. the ^C a script cannot type because ^C is not a byte
/// the pty would interpret on its own. The only genuinely new capability
/// the `pty/` directory added: `spawn` and `resize_pty` above were already
/// here, so `exec` and `winsize` are those two acquiring a name.
signal_pty: struct { pane: u8, sig: PtySignal },
open_link: Buf(256),
/// write this pane's file content to its path; the shell reads both off
/// the core (content is unbounded, effects are fixed-size values)
save_file: struct { pane: u8 },
/// Write this pane's text to a path WITHOUT converting the pane — a
/// terminal's scrollback, a results buffer's rows, a file copied elsewhere.
/// The path travels HERE, bounded exactly like a spawn's cwd, so two saves
/// armed in one batch cannot cross; the BYTES are read off the pane when
/// this is performed, the way save_file reads a file pane. `serial` is the
/// pane it was armed for: a slot freed and reused before the drain writes
/// nothing rather than another pane's text to this path.
save_text: struct { pane: u8, serial: u32, path: Buf(256) },
/// a serialized state dump is ready in core.dump_out; write it to the
/// path dump.outPath resolves (acme-style: another instance loads it
/// with -l, or the Restore builtin loads it into this one)
write_dump,
/// mirror the yank register OUT to the system clipboard; the shell reads
/// it off the core (OSC 52 out, SDL_SetClipboardText, NSPasteboard).
/// Emitted ONLY by the explicit clipboard commands — see setClipboard.
set_clipboard,
/// ...and the other direction: ask the shell to READ the system clipboard.
/// The answer comes back as an ordinary `Event.paste`, which the core
/// routes to whichever of `SPC p` / `SPC P` / `SPC R` asked for it
/// (Pardes.clip_pending). No payload: the bytes travel in the event.
read_clipboard,
/// answer a language query OFF the event loop and post the rows back as an
/// `lsp_resp` Event. The shell reads the file's path and content off the
/// core (like save_file) and must SNAPSHOT them before the worker starts —
/// the core keeps editing while this is in flight.
lsp: struct { id: u32, kind: lsp.Kind, pane: u8, offset: u32, arg: Buf(128) },
/// Snapshot the matching request with pipeRequest(id), then run it away
/// from the UI/event loop and answer with pipe_resp.
pipe: struct { id: u32 },
/// start (`on`) or stop watching this pane's file on disk. Starting, the
/// shell reads the path off the core exactly like save_file does; stopping
/// carries nothing, because by the time an `off` is drained the pane is
/// already freed — the shell remembers what it watches per pane id.
/// Real text files and PDFs ask for this; an output buffer has no file
/// behind it.
watch: struct { pane: u8, on: bool },
/// Load/unload the one runtime theme file watch. The path lives in the
/// core's fixed request buffer; carrying only its generation keeps this
/// already-large effect ring compact.
theme_file: struct { generation: u32, on: bool },
/// Write the build-time theme ring below the per-user config directory.
/// The pane receives the completion/error message from the native host.
dump_themes: struct { pane: u8 },
/// The answer to an `Event.fs_req`. The bytes are NOT in here: `payload`
/// says where they live (a staging buffer in the core, or a range of a
/// pane's live text) and `fsPayload` resolves it during the drain, so a
/// megabyte read costs one `writev` and no copy. `.again` means the core
/// has nothing yet and the transport must ask again later — acme's
/// blocking `event` read, with the waiting left where the kernel's
/// request already is.
fs_reply: acmefs.Reply,
/// `Attach [name]` — hand this frontend's screen to a detached core, the
/// one `pardes --detach [name]` left running; an empty name means "the
/// session that is there". `pane` is where a failed connect is reported.
///
/// CONNECT FIRST, SWAP SECOND is what the shell owes this, and it is the
/// whole point of the word: the session's socket must be open before
/// anything local is torn down, so an attach that fails leaves this
/// instance running with every pane and every undo intact instead of half
/// dead. Which is also why no host method performs it — see `perform`.
attach: struct { pane: u8, name: Buf(attach_name_max) },
/// `Detach` — this frontend leaves; the session and every other frontend
/// carry on. tmux's detach-client, and deliberately NOT the inverse of
/// `attach`: turning a live LOCAL session into a daemon needs setsid and a
/// fork, or closing the terminal takes the session with it.
///
/// No name travels because there is nobody to name. The word is typed in a
/// frontend that has no core of its own, reaches the daemon as an ordinary
/// `Event.command`, and the daemon routes the effect back to the frontend
/// whose keystroke caused it. `pane` is only for the report a local shell
/// gets instead — `perform`'s null-method arm.
detach: struct { pane: u8 },
quit,
fn Buf(comptime n: usize) type {
return struct {
data: [n]u8 = undefined,
len: u16 = 0,
pub const cap = n;
pub fn slice(b: *const @This()) []const u8 {
return b.data[0..b.len];
}
pub fn from(text: []const u8) @This() {
var b: @This() = .{};
std.debug.assert(text.len <= n);
@memcpy(b.data[0..text.len], text);
b.len = @intCast(text.len);
return b;
}
};
}
};
pub const Mode = enum { normal, insert, tty };
/// An owned editable buffer and the absolute surface row of its first line.
/// Files use row zero; terminal overlays may begin anywhere in scrollback.
pub const EditText = struct { text: []u8, row0: i32 };
/// One mouse selection (block-shaped), per button. c/r are text-area relative;
/// r counts from the tag row (body starts at BOX_H).
pub const Sel = struct {
state: enum { none, dragging, done } = .none,
c0: i32 = 0,
c1: i32 = 0,
r0: i32 = 0,
r1: i32 = 0,
};
const LookHoverWait = struct {
col: u16,
row: u16,
pane: usize,
serial: u32,
frames: u16 = 0,
};
const LookHoverPreview = struct {
col: u16,
row: u16,
pane: usize,
serial: u32,
/// Null when the operand is the pane's modal selection. The renderer uses
/// that marker to paint the live modal range subtly even while tag/search
/// editing would normally hide it. A kept mouse selection carries its
/// exact screen-space range; an ordinary word carries the click expansion.
sel: ?Sel,
/// A wrapped file word is one logical source span, not one rectangular
/// screen selection. Keeping it in source coordinates lets the renderer
/// paint every visible continuation while Look receives the exact same
/// bytes, including a path which crosses a soft-wrap boundary.
file_word: ?FileWordSpan = null,
};
const FileWordSpan = struct {
row: i32,
lo: i32,
hi: i32, // exclusive
};
const PdfWordPreview = if (pdf_enabled) struct {
col: u16,
row: u16,
pane: usize,
serial: u32,
probe: pdf_pane.WordProbe,
fn deinit(preview: *@This(), gpa: std.mem.Allocator) void {
preview.probe.deinit(gpa);
preview.* = undefined;
}
} else void;
/// A modal line selection (helix `x`): whole rows [r0, r1], absolute.
pub const LineSel = struct {
active: bool = false,
r0: i32 = 0,
r1: i32 = 0,
};
/// A modal char-range selection: the anchor lives here, the head is the pane
/// cursor. Since the helix motion model landed, EVERY motion leaves one of
/// these — `explicit` separates user-intent selections (v / x / X / terminal
/// n/N / file-search n/N) from bare motion residue: the acme Enter/Tab chords
/// only act on explicit ones. Mutually exclusive with LineSel.
pub const CharSel = struct {
active: bool = false,
row: i32 = 0,
col: i32 = 0,
explicit: bool = false,
};
/// One position in the n/N walk: a look-able span on one row of one pane,
/// inclusive of both columns. Also what the walk REMEMBERS having stood on
/// (Pane.look_at) — see lookStand for why the cursor alone cannot say.
pub const LookSpot = struct {
row: i32,
col0: i32,
col1: i32,
};
/// ponytail: at most this many cursors at once. helix's `Selection.ranges` is
/// an unbounded Vec; a fixed array keeps a Pane trivially copyable (the undo
/// snapshots memcpy it) and costs nothing at one cursor. The ceiling only
/// bites on `C`/`Alt-s` over a very long selection, where the extra ranges are
/// simply not created — raise the bound if that ever matters.
pub const MAX_SELS = 64;
/// One selection range in PANE coordinates: the block-cursor cell and the
/// anchor cell. Deliberately the same pair `cur_row`/`cur_col` + `vsel`
/// already are, so a range moves in and out of the primary slot without a
/// conversion.
pub const SelRange = struct {
row: i32,
col: i32,
arow: i32,
acol: i32,
/// this range's own j/k goal column (helix Range::old_visual_position);
/// the PRIMARY's copy is Pane.sticky_col
sticky: i32 = -1,
};
const PdfSlot = if (pdf_enabled) ?pdf_pane.State else void;
/// The emulator's raw-byte dump/replay ring, and NOTHING where there is no pty
/// to read bytes from — same shape as `PdfSlot`, for a much harder reason. It
/// is a MEGABYTE inline in every Pane: on the P4 the whole heap is 384 KiB, so
/// carrying it would make `gpa.create(Pane)` fail before anything could ask
/// for a grid, and `Pardes.init` — which creates a pane unconditionally —
/// could not return.
const ReplaySlot = if (terminal_panes) [TTY_REPLAY_CAP]u8 else void;
/// The staging buffer for the query replies ghostty computes. Its only writer
/// is term_pane's `ptyReport` callback, which does not exist without an
/// emulator, so `reply_len` there is permanently 0 and `sync` never reads it.
const ReplySlot = if (terminal_panes) [256]u8 else void;
fn hasPdf(pane: *const Pane) bool {
return if (comptime pdf_enabled) pane.pdf != null else false;
}
fn hasPdfSelection(pane: *const Pane) bool {
return if (comptime pdf_enabled)
if (pane.pdf) |pv| pv.selection != null and pv.selection_text.len > 0 else false
else
false;
}
const Prompt = union(enum) {
none,
search: u16,
pipe: u16,
/// Save on a scratch buffer or a terminal: the tail is a path to write to.
save: u16,
};
pub const Pane = struct {
/// A pane's working directory. `.inherited` is a live `*Pane` link kept
/// valid by deferred teardown (see PaneAllocator) + reapPanes' fixup.
pub const Cwd = union(enum) { none, inherited: *Pane, owned: []const u8 };
vt: term_pane.VtSlot,
stream: term_pane.StreamSlot,
/// The same allocator Pardes holds. A pane already owns heap (its content,
/// its emulator, its undo stacks) and Pardes frees all of it; this is here
/// so the pane methods that need the file's LINE INDEX — scrollBy and
/// ensureCursorVisible — can build it. The alternative was
/// threading an allocator through ensureCursorVisible's 33 call sites.
gpa: std.mem.Allocator,
/// WHICH pane this is, for anything that outlives the pane: slots are
/// REUSED (freeSlot hands back the lowest free one), so a remembered id
/// alone can silently come to mean an unrelated pane. Handed out by
/// Pardes.next_serial and never reused. The one reader is the jump stack.
serial: u32 = 0,
mode: Mode = .normal,
vweight: f32 = 1,
cols: u16,
rows: u16,
greet: bool = false,
pending_command: term_pane.PendingCommand = .{},
file: ?file_pane.State = null,
image: ?image_pane.State = null,
pdf: PdfSlot = if (pdf_enabled) null else {},
msel: LineSel = .{},
vsel: CharSel = .{},
/// MULTIPLE CURSORS. helix's Selection is a list of ranges plus a primary
/// index; pardes keeps the PRIMARY exactly where it has always been —
/// cur_row/cur_col + vsel — and the other ranges here, document-ordered
/// and disjoint (helix's Selection::normalize). That split is the whole
/// design: every motion, operator, renderer and mouse path in this file
/// still reads one selection, so with `nsel == 0` not a byte of behaviour
/// moves, and the 800 differential cases and 66 snapshots keep proving it.
/// The extra ranges are driven by replaying the single-selection key
/// handler once per range (see replaySels).
sels: [MAX_SELS - 1]SelRange = undefined,
nsel: u8 = 0,
/// helix select/extend mode (`v`): motions extend the selection from its
/// fixed anchor instead of replacing it. Reported as mode "select";
/// pane.mode stays .normal (insert/tty transitions drop it).
select: bool = false,
/// sticky goal column for j/k runs (helix old_visual_position): any
/// non-vertical range write resets it to -1.
sticky_col: i32 = -1,
/// an `a` append session's original block-cursor cell: Esc backs the
/// cursor up one grapheme and rebuilds the appended-over selection from
/// here (helix doc.restore_cursor). Null outside `a` sessions.
append_at: ?struct { row: i32, col: i32 } = null,
/// Compact storage for normal_input.State's match sub-prefix.
pending2: u21 = 0,
/// Compact storage for normal_input.State's `mr<from><to>` held char.
pending_ch: u21 = 0,
/// Compact storage for normal_input.State's count (0 = none).
count: u32 = 0,
/// last f/F/t/T motion, for Alt-. repeat
find_op: u8 = 0,
find_ch: u21 = 0,
/// Compact storage for normal_input.State's typed prefix.
pending: u21 = 0,
/// Tag-tail input state. The tag text is presentation; this tag carries
/// which operation owns it and the tail offset restored on submit/cancel.
prompt: Prompt = .none,
search_pane: ?usize = null,
search_row: ?usize = null,
/// Where n/N last stood in this pane, or null when the walk has not been
/// here. Distinct from `search_row`, which points into the RESULTS BUFFER
/// a search armed on this pane; this one is a place in the pane's own
/// text, and n/N step it in every kind of pane.
look_at: ?LookSpot = null,
/// The selection an `s`/`S` input was armed on, as gap offsets over the
/// motion surface. Every keystroke re-derives the preview FROM here rather
/// than from the previous preview — which is what helix's regex_prompt
/// does (it reverts to its snapshot before each update), what makes typing
/// a pattern one character at a time land on the same answer as pasting it
/// whole, and what makes Esc a plain restore with nothing else to undo.
/// `nsel_snap == 0` means no such input is armed; exitTagEdit, the one
/// place the prompt is cleared, clears it too.
sel_snap: [MAX_SELS]modal.HxRange = undefined,
nsel_snap: u8 = 0,
sel_snap_pri: u8 = 0,
/// ...including whether it was a user-intent selection: a preview IS one
/// (you picked those matches), but restoring must not silently promote
/// motion residue into something the acme chords will act on
sel_snap_expl: bool = false,
/// the editable tag tail: a bounded one-line command buffer. Input that
/// does not fit is refused atomically.
tag_tail: [TAG_TAIL_CAP]u8 = undefined,
tag_tail_len: usize = 0,
tag_init: bool = false,
tag_edit: bool = false,
tag_sel: bool = false,
/// the body mode a tag edit hijacked (tags are always insert); terminals
/// restore it on exit so clicking the tag never changes the pane's mode
tag_mode: Mode = .normal,
/// THE tag coordinate space: UTF-8 byte offsets into the WHOLE rendered
/// tag, prefix ++ tail (tagText), always on grapheme boundaries. Motions
/// and edits use these offsets; rendering and pointer input convert at the
/// screen boundary. The prefix is live chrome, so it is selectable,
/// yankable and executable but READ-ONLY: every edit op measures from
/// `edit0` (= tagPrefix().len, the first editable byte) and does nothing
/// left of it.
tag_col: u16 = 0,
tag_anchor: u16 = 0,
ed_undo: [term_pane.history_max]term_pane.Snapshot = undefined,
ed_undo_len: usize = 0,
ed_redo: [term_pane.history_max]term_pane.Snapshot = undefined,
ed_redo_len: usize = 0,
/// Working directory: shell-reported bytes (.owned, in cwd_buf), a live
/// link to the pane it was opened from (.inherited), or unknown (.none).
/// The inherited pointer is kept valid by deferred pane teardown + fixup.
cwd: Cwd = .none,
cwd_buf: [limits.cwd_buf_cap]u8 = undefined,
/// modal cursor, at ABSOLUTE body rows of the pane's SURFACE (file lines,
/// or the terminal's shell rows with its edit buffer standing in). Tracks
/// the shell cursor until pinned by a click or a key.
cur_pinned: bool = false,
cur_row: i32 = 0,
cur_col: i32 = 0,
/// horizontal scroll, file panes only (terminals wrap at pty width, they
/// never have wider lines): content columns hidden left of the gutter.
/// No scrollbar — the wheel and cursor movement (with scrolloff) drive it,
/// the goal is just being able to read long lines. Byte columns, like the
/// rest of the file-pane code.
hscroll: i32 = 0,
/// THE WRAP MAP, and the whole of what soft line breaks are: for every body
/// row of the LAST frame, the document line it showed and the byte column
/// of that line the row started at. `wrap_n == 0` says the body was NOT
/// wrapped, i.e. the rows are the lines from `scroll()` down one each —
/// which is exactly what wrapAt/wrapRow below fall back to, so with the
/// toggle off not one reader computes anything it did not compute before.
///
/// INVALIDATION, the part that rots if nobody says it out loud: written in
/// EXACTLY ONE PLACE, file_pane.bodyText, on every build of a file pane's
/// body. So it is at worst one frame old — which is what a mouse click
/// wants (you click the character you can SEE), and it is fresh for the
/// render passes, every one of which runs after bodyText inside the same
/// renderPane call. Nothing else may write it; a second writer is a second
/// truth, and the first click on a stale row is how you find out.
///
/// ponytail: a fixed `limits.wrap_rows` rows (256; 128 on the board). A pane
/// taller than that does not wrap at all — bodyText leaves wrap_n at 0 and
/// clips the way it always did — rather than half-recording a mapping
/// every site here would then have to distrust. `wrapWidth` derives that
/// refusal from `wrap_line.len` itself, so the bound follows the array.
/// Grow the arrays the day a taller window turns up.
wrap_line: [limits.wrap_rows]i32 = undefined,
wrap_col: [limits.wrap_rows]i32 = undefined,
wrap_n: u16 = 0,
sel: [3]Sel = @splat(.{}),
/// terminals only: the typed-text buffer standing in for shell rows
ovl: ?term_pane.EditBuffer = null,
/// every raw pty byte, in order — a bounded dump/replay ring. Once full,
/// new output evicts the oldest bytes while the live terminal still sees
/// every byte. A megabyte, inline: see `ReplaySlot`.
tty_stream: ReplaySlot = if (terminal_panes) undefined else {},
tty_stream_head: usize = 0,
tty_stream_len: usize = 0,
/// Terminal-only, pane-local presentation mode. Ghostty remains the owner
/// of the unmodified VT palette and dynamic OSC colours; the renderer
/// projects them through the active Pardes theme when this is set.
tty_filter: bool = false,
/// query replies ghostty computed (DSR, DA, kitty); the stream handler has
/// no path to the effect queue, so they land here and sync() drains them
/// into write effects. Bounded: replies are tiny escape sequences.
reply: ReplySlot = if (terminal_panes) undefined else {},
reply_len: u16 = 0,
/// THE TRANSIENT MESSAGE: what just happened to this pane, drawn on its
/// LAST row until the next key or mouse event wipes it (see update). Fixed
/// and inline like `reply` above — a message is one short line, so a pane
/// that never sees one still costs nothing to carry it, and there is no
/// allocation to fail at the moment something is trying to be reported.
/// Written in exactly one place, Pardes.setMessage, by a SHELL.
msg: [256]u8 = undefined,
msg_len: u16 = 0,
fn tagSlice(p: *const Pane) []const u8 {
return p.tag_tail[0..p.tag_tail_len];
}
fn promptAt(p: *const Pane) ?u16 {
return switch (p.prompt) {
.none => null,
.search, .pipe, .save => |at| at,
};
}
fn hasSearchPrompt(p: *const Pane) bool {
return switch (p.prompt) {
.search => true,
else => false,
};
}
fn hasPipePrompt(p: *const Pane) bool {
return switch (p.prompt) {
.pipe => true,
else => false,
};
}
fn hasSavePrompt(p: *const Pane) bool {
return switch (p.prompt) {
.save => true,
else => false,
};
}
fn appendTag(p: *Pane, text: []const u8) bool {
if (text.len > p.tag_tail.len - p.tag_tail_len) return false;
@memcpy(p.tag_tail[p.tag_tail_len..][0..text.len], text);
p.tag_tail_len += text.len;
return true;
}
fn insertTagByte(p: *Pane, at: usize, byte: u8) bool {
if (at > p.tag_tail_len or p.tag_tail_len == p.tag_tail.len) return false;
std.mem.copyBackwards(u8, p.tag_tail[at + 1 .. p.tag_tail_len + 1], p.tag_tail[at..p.tag_tail_len]);
p.tag_tail[at] = byte;
p.tag_tail_len += 1;
return true;
}
fn removeTagByte(p: *Pane, at: usize) void {
if (at >= p.tag_tail_len) return;
std.mem.copyForwards(u8, p.tag_tail[at .. p.tag_tail_len - 1], p.tag_tail[at + 1 .. p.tag_tail_len]);
p.tag_tail_len -= 1;
}
pub fn cwdSlice(p: *const Pane) []const u8 {
return switch (p.cwd) {
.none => "",
.owned => |dir| dir,
.inherited => |src| src.cwdSlice(),
};
}
/// Shell-reported directory: own the bytes in cwd_buf.
pub fn setOwnedCwd(pane: *Pane, dir: []const u8) void {
const n = @min(dir.len, pane.cwd_buf.len);
@memcpy(pane.cwd_buf[0..n], dir[0..n]);
pane.cwd = .{ .owned = pane.cwd_buf[0..n] };
}
pub fn isTerminal(pane: *const Pane) bool {
const no_pdf = if (comptime pdf_enabled) pane.pdf == null else true;
return pane.file == null and pane.image == null and no_pdf;
}
/// The one coloring choice keyed on what a pane IS, so the highlight
/// producer (refreshHighlights) and the render pass agree on the algorithm.
pub const ColorAlgo = enum { none, tty, source, diff };
pub fn colorAlgo(pane: *const Pane) ColorAlgo {
if (pane.isTerminal()) return .tty;
if (pane.file) |f| {
if (std.mem.endsWith(u8, f.path, ".diff") or std.mem.endsWith(u8, f.path, ".patch")) return .diff;
return .source;
}
return .none;
}
pub fn pdfPath(pane: *const Pane) ?[]const u8 {
if (comptime pdf_enabled) if (pane.pdf) |pv| return pv.path;
return null;
}
pub fn pdfPage(pane: *const Pane) ?usize {
if (comptime pdf_enabled) if (pane.pdf) |pv| return pv.page;
return null;
}
/// Surface row of shell row `g`. The edit buffer's lines stand in for the
/// `rows` shell rows it covers, so everything below it slides by the
/// difference — the identity on files and on terminals nobody has typed
/// a newline into, which is why the rest of the row math can stay naive.
pub fn surfRow(pane: *const Pane, g: i32) i32 {
const o = pane.ovl orelse return g;
if (g <= o.row) return g;
const lines: i32 = @intCast(modal.lineCount(o.text));
if (g >= o.row + o.rows) return g + lines - o.rows;
return @min(g, o.row + lines - 1); // inside the buffer: its own rows
}
/// the inverse; every surface row inside the edit buffer maps to its anchor
pub fn gridRow(pane: *const Pane, s: i32) i32 {
const o = pane.ovl orelse return s;
if (s <= o.row) return s;
const lines: i32 = @intCast(modal.lineCount(o.text));
if (s < o.row + lines) return o.row;
return s - lines + o.rows;
}
/// current scroll offset: file top line, or the scrollback offset
pub fn scroll(pane: *Pane) i32 {
if (pane.file) |f| return @intCast(f.scroll);
if (comptime pdf_enabled) if (pane.pdf) |pv| return @intCast(pv.text_scroll);
return pane.surfRow(term_pane.gridOffset(pane));
}
/// The document position a BODY ROW begins at — `vr` 0 is the first row
/// under the tag. The screen->document half of the wrap map, and the half
/// the mouse asks: a click lands on the character the user can see, which
/// is last frame's arrangement, which is what the map holds.
pub fn wrapAt(pane: *Pane, vr: i32) struct { line: i32, at: i32 } {
if (pane.wrap_n > 0 and vr >= 0 and vr < @as(i32, pane.wrap_n))
return .{ .line = pane.wrap_line[@intCast(vr)], .at = pane.wrap_col[@intCast(vr)] };
// unwrapped: rows ARE lines, and the byte column a row starts at is the
// horizontal scroll (always 0 on a terminal, which never has one)
return .{ .line = pane.scroll() + vr, .at = pane.hscroll };
}
/// ...and back: the body row `line`:`col` renders on, plus the byte column
/// that row starts at — subtract it from a document column to get a screen
/// one. `row` is -1 when the position is not on screen, which only a
/// wrapped body ever says: unwrapped the arithmetic answers for any line at
/// all and the callers' own bounds checks do the rejecting, as before.
pub fn wrapRow(pane: *Pane, line: i32, col: i32) struct { row: i32, at: i32 } {
if (pane.wrap_n == 0) return .{ .row = line - pane.scroll(), .at = pane.hscroll };
var i: u16 = 0;
while (i < pane.wrap_n) : (i += 1) {
if (pane.wrap_line[i] != line) continue;
// the LAST row of a line owns every column past its start, so a
// cursor parked on the trailing newline still has somewhere to draw
if (i + 1 < pane.wrap_n and pane.wrap_line[i + 1] == line and col >= pane.wrap_col[i + 1]) continue;
return .{ .row = @intCast(i), .at = pane.wrap_col[i] };
}
return .{ .row = -1, .at = 0 };
}
/// ponytail: `delta` is LOGICAL LINES, wrapped or not — one `j` past the
/// bottom scrolls a whole line even when that line is five screen rows, and
/// a wheel tick or a Ctrl-d page counts lines rather than rows. So a body
/// full of long lines scrolls in jumps, and the view can never sit at the
/// MIDDLE of a wrapped line. That is the ceiling the whole feature buys its
/// smallness with: wrap is render + hit-test and nothing else in the editor
/// knows about it. The upgrade is to make f.scroll a (line, row-within-line)
/// pair, which every reader of it — this, the scrollbar, the syntax window,
/// bodyText, ensureCursorVisible, the gutter click — would then have to
/// learn; do that when scrolling long lines actually annoys someone.
fn scrollBy(pane: *Pane, delta: i32) void {
if (pane.file) |*f| {
const max: i64 = @intCast(file_pane.nlines(pane.gpa, f) -| 1);
const n = std.math.clamp(@as(i64, @intCast(f.scroll)) + delta, 0, max);
const next: usize = @intCast(n);
if (next != f.scroll) {
f.scroll = next;
f.syntax_dirty = true;
}
} else if (hasPdf(pane)) {
if (comptime pdf_enabled) {
const pv = &pane.pdf.?;
const max: i64 = @intCast(modal.lineCount(pv.text) -| 1);
pv.text_scroll = @intCast(std.math.clamp(
@as(i64, @intCast(pv.text_scroll)) + delta,
0,
max,
));
}
} else {
// the vt scrolls in SHELL rows; convert through the edit buffer
const off = term_pane.gridOffset(pane);
term_pane.scrollGrid(pane, pane.gridRow(pane.surfRow(off) + delta) - off);
}
}
pub fn ensureCursorVisible(pane: *Pane) void {
// scrolloff margin, shrunk on short panes so the band stays non-empty
var margin: i32 = @min(config.scroll_off, @divTrunc(@as(i32, pane.rows) - 1, 2));
const off = pane.scroll();
// A WRAPPED body shows fewer LINES than it has rows, and scrolling is
// still by line, so the bottom of the view is not off+rows-1 — a long
// line at the bottom would leave the cursor below the last row it can
// actually see. What the map is asked for is the COUNT of lines that
// fit, not which ones: this runs on every cursor move and the map is
// last FRAME's, but several keys can arrive between two renders (an
// autorepeated j, a paste) and then its absolute line numbers name a
// scroll offset that has already moved on — reading them cost a
// batched j four extra lines of scroll per keystroke. A count is
// scroll-independent, and when nothing wrapped it is exactly `rows`,
// so this whole block is a no-op on an unwrapped body and the margin
// clamp below reduces to the short-pane one above it.
//
// ponytail: last frame's line count applied to this frame's offset. It
// is exact whenever a render happened in between (the normal case) and
// an estimate mid-batch, self-correcting on the next key. The exact
// answer is to re-walk the lines from `off` accumulating wrapped
// heights — do that when a batch visibly lands the cursor off screen.
var last = off + @as(i32, pane.rows) - 1;
if (pane.wrap_n > 0) {
const lines_shown = pane.wrap_line[pane.wrap_n - 1] - pane.wrap_line[0];
last = off + lines_shown;
margin = @min(margin, @divTrunc(@max(0, lines_shown), 2));
}
if (pane.cur_row < off + margin) {
pane.scrollBy(pane.cur_row - margin - off); // scrollBy clamps at line 0
} else if (pane.cur_row > last - margin) {
// don't scroll a file past EOF-at-bottom-row (vim's bottom clamp);
// terminals overshoot harmlessly — the vt clamps at the live bottom
var to = pane.cur_row + margin;
if (pane.file) |*f| to = @min(to, @as(i32, @intCast(file_pane.nlines(pane.gpa, f) -| 1)));
if (comptime pdf_enabled) {
if (pane.pdf) |pv|
to = @min(to, @as(i32, @intCast(modal.lineCount(pv.text) -| 1)));
}
pane.scrollBy(@max(0, to - last));
}
// the horizontal mirror, files only: keep scroll_off columns of
// context around the cursor (wheel-driven hscroll is exempt — it
// never moves the cursor, and a cursor move pulls the view back).
// A wrapped body has nothing to scroll sideways, and its hscroll is
// left ALONE rather than zeroed: turn the wrap back off and the view
// you had is still there.
if (pane.file) |f| {
if (pane.wrap_n != 0) return;
const w: i32 = @max(1, @as(i32, pane.cols) - @as(i32, config.PREFIX_W));
const hmargin: i32 = @min(config.scroll_off, @divTrunc(w - 1, 2));
const line = modal.lineSlice(f.content, @intCast(@max(0, pane.cur_row)));
const raw_cur: usize = @intCast(@max(0, pane.cur_col));
const raw_scroll: usize = @intCast(@max(0, pane.hscroll));
const cur = @as(i32, @intCast(file_pane.rawDisplayCol(line, raw_cur)));
const visual_scroll = @as(i32, @intCast(file_pane.rawDisplayCol(line, raw_scroll)));
var target = visual_scroll;
if (cur < visual_scroll + hmargin)
target = @max(0, cur - hmargin)
else if (cur > visual_scroll + w - 1 - hmargin)
target = cur - (w - 1 - hmargin);
if (target != visual_scroll) pane.hscroll = @intCast(file_pane.rawAtDisplay(line, @intCast(target)));
}
}
fn pinCursor(pane: *Pane) void {
if (pane.cur_pinned) return;
if (pane.file != null or hasPdf(pane)) {
pane.cur_row = pane.scroll();
pane.cur_col = 0;
} else {
const cur = term_pane.gridCursor(pane);
pane.cur_row = pane.surfRow(@as(i32, cur.y) + term_pane.gridOffset(pane));
pane.cur_col = @intCast(cur.x);
}
pane.cur_pinned = true;
}
};
const Drag = union(enum) {
none,
/// `corner` is what makes this a CORNER grab: the press landed on a cell
/// that is both this v-border and one of the two adjoining columns' own
/// h-borders, and then the one drag moves both boundaries — cur_x the
/// column pair, cur_y `corner.col`'s pane pair at index `corner.idx`.
/// null is a plain edge drag and cur_y is only carried along for the
/// preview. The drag is a `border_v` on left_col either way; only the row
/// half changes which column it belongs to.
///
/// Both adjoining columns count, left_col FIRST. The v handle IS left_col's
/// last cell, so left_col's horizontal hint is drawn straight THROUGH it
/// and its crossing reads as a full cross; the right column's spans start
/// one cell further right, so its crossing reads as a T butting into the
/// junction. Either way the two lines meet AT the handle cell, which is
/// what makes both grabbable.
///
/// ponytail: a corner still moves exactly TWO boundaries, never three, so
/// when BOTH columns happen to be split at the grabbed row the LEFT one
/// wins and the right column's seam is left alone — the gesture that
/// existed before is bit-for-bit unchanged.
border_v: struct { left_col: usize, cur_x: u16, corner: ?struct { col: usize, idx: usize } = null, cur_y: u16 = 0 },
border_h: struct { col: usize, top_idx: usize, cur_y: u16 },
move: struct { id: usize, cur_x: u16, cur_y: u16 },
/// a left sweep along a pane's TAG row: it drives the tag's own cursor and
/// selection (rendered-tag columns) rather than the body's block selection,
/// which is what makes a one-line tag select like a line of text
tag: struct { id: usize },
/// chorded: a 1-2/1-3 cut/paste chord fired during this left drag —
/// the drag's own release is then inert
select: struct {
id: usize,
button: Mouse.Button,
chorded: bool = false,
ctrl: bool = false,
/// This gesture began over a usable native PDF raster. The payload is
/// zero-bit when PDF support is absent.
pdf: pdf_pane.PointerDrag = .{},
},
/// The physical button whose release balances this gesture. Layout and
/// tag drags are all left-button gestures; a text selection remembers its
/// own acme button. Deriving this from the gesture keeps multi-button
/// chords exact without a parallel held-button mask.
fn button(drag: Drag) ?Mouse.Button {
return switch (drag) {
.none => null,
.border_v, .border_h, .move, .tag => config.select_button,
.select => |selection| selection.button,
};
}
};
// The two border clamps, pulled out as plain arithmetic on plain numbers for
// one reason: a CORNER drag runs both of them off the same mouse position, and
// the thing that has to hold is that each one only ever looks at its own axis.
// A clamp that consulted the other axis — or a single "is this point legal"
// test over the pair — would freeze the whole gesture the moment either edge
// hit its stop, when what the hand expects is the free axis to keep tracking
// and the pinned one to sit at the wall. Being pure, they are also the piece
// worth a test; see below.
/// Where a vertical border drag settles: `mcol` clamped so neither column of
/// the pair falls under MINW. `lx`/`lw` are the left column's x and width,
/// `rw` the right column's. Degenerate pairs (a window too narrow to hold two
/// minimums at all) pass the mouse through rather than snapping to a lie.
fn clampBorderCol(lx: u16, lw: u16, rw: u16, mcol: u16) u16 {
const lo = lx + config.MINW;
const hi = lx +| lw +| rw -| config.MINW;
return if (lo <= hi) std.math.clamp(mcol, lo, hi) else mcol;
}
/// Where a horizontal border drag settles: `mrow` clamped so either pane may
/// shrink to just its tag row (BOX_H) but no further. `ay`/`ah` are the upper
/// pane's y and height, `bh` the lower pane's.
///
/// The handle is the seam row that is a BODY row, which is the upper pane's
/// LAST row normally and — with Tagbottom, where that row is the upper pane's
/// tag — the lower pane's FIRST. That is the same seam one row further down,
/// so both walls simply move with it.
fn clampBorderRow(ay: u16, ah: u16, bh: u16, mrow: u16, tag_bottom: bool) u16 {
const d: u16 = if (tag_bottom) 1 else 0;
const lo = ay + BOX_H - 1 + d;
const hi = (ay +| ah +| bh -| (BOX_H + 1)) +| d;
return if (lo <= hi) std.math.clamp(mrow, lo, hi) else mrow;
}
test "a corner drag's two axes clamp independently" {
// a 100-wide window split 50/50, and a 30-row column split 15/14 under the
// topbar: the shape windowops.snap drives
const lx: u16 = 0;
const lw: u16 = 50;
const rw: u16 = 50;
const ay: u16 = TOPBAR_H;
const ah: u16 = 15;
const bh: u16 = 14;
// the walls, spelled out for tags-on-top (the tag_bottom = false below),
// where the handle is the upper pane's LAST row: the upper pane bottoms out
// with its tag row alone at ay, and the lower pane does the same one row
// above the pair's end
const row_lo: u16 = ay + BOX_H - 1;
const row_hi: u16 = ay + ah + bh - (BOX_H + 1);
// each axis alone, at both walls
try std.testing.expectEqual(@as(u16, config.MINW), clampBorderCol(lx, lw, rw, 0));
try std.testing.expectEqual(@as(u16, 100 - config.MINW), clampBorderCol(lx, lw, rw, 999));
try std.testing.expectEqual(row_lo, clampBorderRow(ay, ah, bh, 0, false));
try std.testing.expectEqual(row_hi, clampBorderRow(ay, ah, bh, 999, false));
// THE corner property: drag off the right edge while staying mid-height —
// x sits at its wall, y still tracks the mouse row exactly
try std.testing.expectEqual(@as(u16, 100 - config.MINW), clampBorderCol(lx, lw, rw, 999));
try std.testing.expectEqual(@as(u16, 12), clampBorderRow(ay, ah, bh, 12, false));
// and the mirror: pinned at the bottom, x still free
try std.testing.expectEqual(row_hi, clampBorderRow(ay, ah, bh, 999, false));
try std.testing.expectEqual(@as(u16, 40), clampBorderCol(lx, lw, rw, 40));
// both pinned at once is just both walls, not a stuck gesture
try std.testing.expectEqual(@as(u16, config.MINW), clampBorderCol(lx, lw, rw, 0));
try std.testing.expectEqual(row_hi, clampBorderRow(ay, ah, bh, 999, false));
// Tagbottom moves the handle to the LOWER pane's first row, one further
// down, and both walls travel with it — either pane still bottoms out at
// its bare tag row and neither can be squeezed away
try std.testing.expectEqual(row_lo + 1, clampBorderRow(ay, ah, bh, 0, true));
try std.testing.expectEqual(row_hi + 1, clampBorderRow(ay, ah, bh, 999, true));
try std.testing.expectEqual(@as(u16, 12), clampBorderRow(ay, ah, bh, 12, true));
// degenerate pairs pass through untouched, each on its own terms: a pane
// pair with no room stays draggable even when the column pair has room
try std.testing.expectEqual(@as(u16, 7), clampBorderCol(0, 5, 5, 7));
try std.testing.expectEqual(@as(u16, 40), clampBorderCol(lx, lw, rw, 40));
try std.testing.expectEqual(@as(u16, 9), clampBorderRow(TOPBAR_H, 1, 0, 9, false));
}
/// The screen row that is the handle between column `c`'s pane pair `k` and
/// `k+1`: the upper pane's LAST body row, or with Tagbottom — where that row is
/// the upper pane's tag — the lower pane's FIRST. The one place this rule
/// lives; the h hit test, the corner search and the hover hint all read it here.
fn seamRowOf(p: *const Pardes, c: usize, k: usize) u16 {
const r = p.rects[p.col_terms[c][k]];
return if (p.settings.tag_bottom) r.y +| r.h else r.y + r.h -| 1;
}
/// The corner fixture: the classic two-column boot with a SECOND pane added to
/// the RIGHT column, so both columns have a seam of their own and the v handle
/// between them can find either.
fn cornerFixture(gpa: std.mem.Allocator) !*Pardes {
const p = try Pardes.init(gpa, .{ .cols = 100, .rows = 30, .shells = 3 });
p.update(.{ .resize = .{ .cols = 100, .rows = 30 } });
p.active = p.col_terms[1][0];
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell below it, same column
p.sync();
return p;
}
/// Moves column 1's own seam off column 0's, by the ordinary h-border gesture,
/// and answers the row it landed on. Both columns split at the SAME row is the
/// tie case, which is a different test.
fn nudgeRightSeam(p: *Pardes, delta: i32) u16 {
const from = seamRowOf(p, 1, 0);
const inside = p.col_x[1] + p.col_w[1] / 2;
const to: u16 = @intCast(@as(i32, from) + delta);
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = inside, .row = from } });
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = inside, .row = to } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = inside, .row = to } });
p.sync();
return seamRowOf(p, 1, 0);
}
test "a v-handle press at the RIGHT column's seam drags both boundaries" {
if (platform == .web) return;
const p = try cornerFixture(std.testing.allocator);
defer p.deinit();
try std.testing.expectEqual(@as(usize, 2), p.col_n[1]);
const handle = p.col_x[0] + p.col_w[0] - 1;
const right_seam = nudgeRightSeam(p, 3);
try std.testing.expect(right_seam != seamRowOf(p, 0, 0));
const w0 = p.col_weight[0];
const v_left = p.panes[p.col_terms[0][0]].?.vweight;
const v_right = p.panes[p.col_terms[1][0]].?.vweight;
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = right_seam } });
try std.testing.expect(p.drag == .border_v);
const corner = p.drag.border_v.corner orelse return error.NoCorner;
try std.testing.expectEqual(@as(usize, 1), corner.col);
try std.testing.expectEqual(@as(usize, 0), corner.idx);
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = handle + 8, .row = right_seam - 4 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = handle + 8, .row = right_seam - 4 } });
p.sync();
// both halves committed: the column pair widened, and the RIGHT column's
// pane pair reweighted — while the left column's panes stayed put
try std.testing.expect(p.col_weight[0] > w0);
try std.testing.expect(p.panes[p.col_terms[1][0]].?.vweight != v_right);
try std.testing.expectEqual(v_left, p.panes[p.col_terms[0][0]].?.vweight);
}
test "a tie row still moves the LEFT column's pane pair only" {
if (platform == .web) return;
const p = try cornerFixture(std.testing.allocator);
defer p.deinit();
// put column 1's seam exactly on column 0's, the row the eye reads as one
// line across the whole window
const left_seam = seamRowOf(p, 0, 0);
_ = nudgeRightSeam(p, @as(i32, left_seam) - @as(i32, seamRowOf(p, 1, 0)));
try std.testing.expectEqual(left_seam, seamRowOf(p, 1, 0));
const handle = p.col_x[0] + p.col_w[0] - 1;
const v_left = p.panes[p.col_terms[0][0]].?.vweight;
const v_right = p.panes[p.col_terms[1][0]].?.vweight;
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = left_seam } });
const corner = p.drag.border_v.corner orelse return error.NoCorner;
try std.testing.expectEqual(@as(usize, 0), corner.col);
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = handle, .row = left_seam - 4 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = handle, .row = left_seam - 4 } });
p.sync();
try std.testing.expect(p.panes[p.col_terms[0][0]].?.vweight != v_left);
try std.testing.expectEqual(v_right, p.panes[p.col_terms[1][0]].?.vweight);
}
test "a v-handle press at nobody's seam is still a plain edge drag" {
if (platform == .web) return;
const p = try cornerFixture(std.testing.allocator);
defer p.deinit();
const right_seam = nudgeRightSeam(p, 3);
const left_seam = seamRowOf(p, 0, 0);
const handle = p.col_x[0] + p.col_w[0] - 1;
var row: u16 = TOPBAR_H + 1;
while (row == left_seam or row == right_seam) row += 1;
const w0 = p.col_weight[0];
const v_left = p.panes[p.col_terms[0][0]].?.vweight;
const v_right = p.panes[p.col_terms[1][0]].?.vweight;
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = row } });
try std.testing.expect(p.drag == .border_v);
try std.testing.expect(p.drag.border_v.corner == null);
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = handle + 8, .row = row + 5 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = handle + 8, .row = row + 5 } });
p.sync();
// exactly ONE boundary moved
try std.testing.expect(p.col_weight[0] > w0);
try std.testing.expectEqual(v_left, p.panes[p.col_terms[0][0]].?.vweight);
try std.testing.expectEqual(v_right, p.panes[p.col_terms[1][0]].?.vweight);
}
test "a RIGHT-column corner's two axes clamp independently" {
if (platform == .web) return;
const p = try cornerFixture(std.testing.allocator);
defer p.deinit();
const right_seam = nudgeRightSeam(p, 3);
const handle = p.col_x[0] + p.col_w[0] - 1;
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = right_seam } });
try std.testing.expectEqual(@as(usize, 1), (p.drag.border_v.corner orelse return error.NoCorner).col);
// off the right edge at mid-height: x parks at its MINW wall, y is the mouse
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = 999, .row = right_seam } });
try std.testing.expectEqual(@as(u16, 100 - config.MINW), p.drag.border_v.cur_x);
try std.testing.expectEqual(right_seam, p.drag.border_v.cur_y);
// and the mirror: below the bottom at mid-width. y parks, x tracks again
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = handle, .row = 999 } });
try std.testing.expectEqual(handle, p.drag.border_v.cur_x);
const a = p.rects[p.col_terms[1][0]];
const b = p.rects[p.col_terms[1][1]];
try std.testing.expectEqual(clampBorderRow(a.y, a.h, b.h, 999, p.settings.tag_bottom), p.drag.border_v.cur_y);
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = handle, .row = 999 } });
}
test "a new column takes width only from the column that created it" {
if (platform == .web) return;
// 124 deliberately makes the thirty-one-cell source split into unequal
// rounded halves. Independent width rounding moved the right column by a
// cell here; cumulative boundaries keep it pinned.
const p = try Pardes.init(std.testing.allocator, .{ .cols = 124, .rows = 24 });
defer p.deinit();
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
_ = try p.newShell(2, "");
try std.testing.expect(p.layoutSplitColumn(0, 2, true));
p.sync();
// ids 2, 0, 1 now own 1/4, 1/4 and 1/2 of the screen. Splitting the
// middle column must consume its own thirty cells in place: the columns
// on both sides retain their exact rectangles, not merely their weights.
const left_before = p.rects[2];
const right_before = p.rects[1];
_ = try p.newShell(3, "");
try std.testing.expect(p.layoutSplitColumn(0, 3, false));
p.sync();
try std.testing.expectEqual(left_before.x, p.rects[2].x);
try std.testing.expectEqual(left_before.w, p.rects[2].w);
try std.testing.expectEqual(right_before.x, p.rects[1].x);
try std.testing.expectEqual(right_before.w, p.rects[1].w);
try std.testing.expectEqual(@as(u16, 16), p.rects[0].w);
try std.testing.expectEqual(@as(u16, 15), p.rects[3].w);
const narrow = try Pardes.init(std.testing.allocator, .{ .cols = config.MINW * 2 - 1, .rows = 10 });
defer narrow.deinit();
try std.testing.expect(!narrow.layoutSplitColumn(0, 1, false));
try std.testing.expectEqual(@as(usize, 1), narrow.ncol);
// Public callers may chain surgery before sync. The first split leaves
// two minimum-width columns, so the second must read the freshly-derived
// source width and refuse rather than consulting the old full-width rect.
const sequential = try Pardes.init(std.testing.allocator, .{ .cols = config.MINW * 2, .rows = 10 });
defer sequential.deinit();
_ = try sequential.newShell(1, "");
try std.testing.expect(sequential.layoutSplitColumn(0, 1, false));
_ = try sequential.newShell(2, "");
try std.testing.expect(!sequential.layoutSplitColumn(0, 2, false));
try std.testing.expectEqual(@as(usize, 2), sequential.ncol);
// Even a deliberately coarse restored proportion divides into two usable
// columns. Rebase preserves every ratio while giving an odd numerator an
// exact half instead of rendering weight 1:2 from the value 3.
const coarse = try Pardes.init(std.testing.allocator, .{ .cols = 22, .rows = 10 });
defer coarse.deinit();
coarse.col_weight[0] = 3;
_ = try coarse.newShell(1, "");
try std.testing.expect(coarse.layoutSplitColumn(0, 1, false));
coarse.sync();
try std.testing.expectEqual(@as(u16, 11), coarse.col_w[0]);
try std.testing.expectEqual(@as(u16, 11), coarse.col_w[1]);
// A failed rebase is transactional even when the source pane is being
// MOVED out of a stack. Previously absorb/remove ran before overflow was
// discovered, so false meant the pane had silently vanished.
const extreme = try Pardes.init(std.testing.allocator, .{ .cols = 100, .rows = 20 });
defer extreme.deinit();
_ = try extreme.newShell(1, "");
try std.testing.expect(extreme.layoutSplitColumn(0, 1, false));
_ = try extreme.newShell(2, "");
extreme.layoutInsert(0, 1, 2);
extreme.col_weight[0] = std.math.maxInt(u64) / 2 + 2; // odd and cannot double
extreme.col_weight[1] = 1;
extreme.computeGeom();
const terms_before = extreme.col_terms;
const counts_before = extreme.col_n;
const weights_before = extreme.col_weight;
const source_vweight = extreme.panes[0].?.vweight;
const sibling_vweight = extreme.panes[2].?.vweight;
try std.testing.expect(!extreme.layoutSplitColumn(0, 0, false));
try std.testing.expectEqual(terms_before, extreme.col_terms);
try std.testing.expectEqual(counts_before, extreme.col_n);
try std.testing.expectEqual(weights_before, extreme.col_weight);
try std.testing.expectEqual(source_vweight, extreme.panes[0].?.vweight);
try std.testing.expectEqual(sibling_vweight, extreme.panes[2].?.vweight);
}
test "Newcol refuses an unsplittable restored weight before spawning" {
if (platform == .web) return;
const p = try Pardes.init(std.testing.allocator, .{ .cols = 200, .rows = 20 });
defer p.deinit();
// Restore accepts each individual weight up to maxInt/6. Deleting three
// one-pane columns can legitimately coalesce four such values into an odd
// survivor above maxInt/2, which cannot be globally doubled for a split.
for (1..4) |id| {
_ = try p.newShell(id, "");
try std.testing.expect(p.layoutSplitColumn(id - 1, id, false));
}
const restored_cap = std.math.maxInt(u64) / 6;
for (0..4) |column| p.col_weight[column] = restored_cap;
p.col_weight[3] -= 1;
for ([_]usize{ 3, 2, 1 }) |id| {
const pane = p.panes[id].?;
p.layoutRemove(id);
p.deinitPane(pane);
p.panes[id] = null;
}
while (p.nextEffect()) |_| {}
try std.testing.expect(p.col_weight[0] > std.math.maxInt(u64) / 2);
try std.testing.expect(p.col_weight[0] % 2 == 1);
try std.testing.expect(!p.layoutCanSplitColumn(0));
const panes_before = p.panes;
const serial_before = p.next_serial;
try std.testing.expect(p.executeBuiltinLine(0, "Newcol"));
try std.testing.expectEqual(panes_before, p.panes);
try std.testing.expectEqual(serial_before, p.next_serial);
try std.testing.expect(p.nextEffect() == null);
}
test "layout commits publish finite tracks only for changed panes" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20 });
defer p.deinit();
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
const untouched = p.rects[1];
p.settings.panel_transition = .slide;
_ = try p.newShell(2, "");
try std.testing.expect(p.layoutSplitColumn(0, 2, true));
p.sync();
// Pane 1 belongs to the unrelated right column. Its exact layout stayed
// fixed, so it does not receive a presentation record either.
try std.testing.expect(p.panel_tracks[1] == null);
try std.testing.expect(p.panel_tracks[0] != null);
try std.testing.expect(p.panel_tracks[2] != null);
try std.testing.expectEqual(panel_animation.Phase.moving, p.panel_tracks[0].?.phase);
try std.testing.expectEqual(panel_animation.Phase.opening, p.panel_tracks[2].?.phase);
try std.testing.expectEqual(untouched, p.rects[1]);
try std.testing.expect(p.animationActive());
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const surface = try p.render(frame.allocator());
try std.testing.expectEqual(@as(usize, 2), surface.panelTracks().len);
for (0..panel_animation.Transition.slide.frames()) |_| p.update(.tick);
try std.testing.expect(!p.animationActive());
_ = frame.reset(.retain_capacity);
try std.testing.expectEqual(@as(usize, 0), (try p.render(frame.allocator())).panelTracks().len);
p.settings.panel_transition = .zoom;
p.update(.{ .resize = .{ .cols = 101, .rows = 17 } });
try std.testing.expect(!p.animationActive());
for (p.panel_tracks) |track| try std.testing.expect(track == null);
}
test "vertical close samples only a canonical baseline containing that pane" {
// Deleting an opener before its first canonical frame must not animate
// unrelated cells from the older global baseline as though they belonged
// to the short-lived pane.
{
const p = try Pardes.init(std.testing.allocator, .{ .cols = 100, .rows = 16, .tty_only = true });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const boot = try p.render(frame.allocator());
p.acknowledgePanelPresentation(boot.panelTracks());
p.settings.panel_transition = .vertical;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
_ = frame.reset(.retain_capacity);
const opening = try p.render(frame.allocator());
p.acknowledgePanelPresentation(opening.panelTracks());
p.removePane(1);
p.sync();
try std.testing.expectEqual(@as(usize, 0), p.nclosing_panel_tracks);
}
// Once the pane itself has reached a canonical acknowledged frame, that
// exact box is safe frozen source data for its ordinary closing slide.
{
const p = try Pardes.init(std.testing.allocator, .{ .cols = 100, .rows = 16, .tty_only = true });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const boot = try p.render(frame.allocator());
p.acknowledgePanelPresentation(boot.panelTracks());
p.settings.panel_transition = .vertical;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
for (0..panel_animation.Transition.vertical.frames()) |_| p.update(.tick);
_ = frame.reset(.retain_capacity);
const canonical = try p.render(frame.allocator());
try std.testing.expectEqual(@as(usize, 0), canonical.panelTracks().len);
p.acknowledgePanelPresentation(canonical.panelTracks());
const serial = p.panes[1].?.serial;
p.removePane(1);
p.sync();
try std.testing.expectEqual(@as(usize, 1), p.nclosing_panel_tracks);
try std.testing.expectEqual(serial, p.closing_panel_tracks[0].serial);
}
}
test "previous-grid animation refreshes its mask and snaps overlapping layout churn" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const boot = try p.render(frame.allocator());
p.acknowledgePanelPresentation(boot.panelTracks());
p.settings.panel_transition = .vertical;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
_ = frame.reset(.retain_capacity);
const opening = try p.render(frame.allocator());
const changed_index = for (opening.cell_diffs, 0..) |diff, index| {
if (diff.changed()) break index;
} else return error.MissingPanelDiff;
p.acknowledgePanelPresentation(opening.panelTracks());
// Corrupt one cached classification to prove a later live frame derives it again
// from the frozen old cells and freshly rendered new cells.
p.panel_cell_diffs[changed_index] = .unchanged;
_ = frame.reset(.retain_capacity);
const refreshed = try p.render(frame.allocator());
try std.testing.expect(refreshed.cell_diffs[changed_index].changed());
p.acknowledgePanelPresentation(refreshed.panelTracks());
// A second opener before the first canonical endpoint has no truthful
// single old grid. Submit this layout canonically instead of rewinding to
// the boot baseline or manufacturing a stale closing pane.
_ = try p.newShell(2, "");
try std.testing.expect(p.layoutSplitColumn(1, 2, false));
p.sync();
try std.testing.expect(!p.panel_diff_pending and !p.panel_diff_ready);
try std.testing.expectEqual(@as(usize, 0), p.nclosing_panel_tracks);
for (p.panel_tracks) |track| try std.testing.expect(track == null);
try std.testing.expect(p.panel_presentation_pending);
_ = frame.reset(.retain_capacity);
const snapped = try p.render(frame.allocator());
try std.testing.expectEqual(@as(usize, 0), snapped.panelTracks().len);
}
test "canonical fallback and transition toggle retire unpresented tracks" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 100, .rows = 16, .tty_only = true });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const boot = try p.render(frame.allocator());
p.acknowledgePanelPresentation(boot.panelTracks());
p.settings.panel_transition = .slide;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
_ = frame.reset(.retain_capacity);
const animated = try p.render(frame.allocator());
try std.testing.expect(animated.panelTracks().len > 0);
// A host which rendered the canonical fallback acknowledges exactly that
// empty record set; producers cannot resume on its next frame.
p.acknowledgePanelPresentation(&.{});
try std.testing.expect(!p.animationActive());
try std.testing.expect(!p.panel_diff_pending and !p.panel_diff_ready);
_ = frame.reset(.retain_capacity);
try std.testing.expectEqual(@as(usize, 0), (try p.render(frame.allocator())).panelTracks().len);
// Recreate a visible sample, then change the selected effect. Actual old
// pixels remain on screen until the next submit, so pointer input waits.
p.settings.panel_transition = .slide;
p.col_weight[0] = column_weight_unit * 2;
p.col_weight[1] = column_weight_unit;
p.sync();
_ = frame.reset(.retain_capacity);
const moving = try p.render(frame.allocator());
p.acknowledgePanelPresentation(moving.panelTracks());
try std.testing.expect(moving.panelTracks().len > 0);
p.applySettingBuiltin(runtime_cfg.find("PanelZoom").?, null);
try std.testing.expectEqual(panel_animation.Transition.zoom, p.settings.panel_transition);
try std.testing.expect(p.panel_presentation_pending);
try std.testing.expect(p.presentedPointer(10, 4) == null);
for (p.panel_tracks) |track| try std.testing.expect(track == null);
// Once canonical has replaced that sample, make another real transition.
// Re-applying the effective tagline percentage is inert, but changing it
// invalidates the frozen raster's metrics and therefore snaps the tracks.
p.acknowledgePanelPresentation(&.{});
p.col_weight[0] = column_weight_unit;
p.col_weight[1] = column_weight_unit * 2;
p.sync();
_ = frame.reset(.retain_capacity);
const before_resize = try p.render(frame.allocator());
p.acknowledgePanelPresentation(before_resize.panelTracks());
try std.testing.expect(before_resize.panelTracks().len > 0);
const old_tagline_percent = p.settings.font.tagline_percent;
var percent_buf: [3]u8 = undefined;
const same_percent = try std.fmt.bufPrint(&percent_buf, "{d}", .{old_tagline_percent});
p.applySettingBuiltin(runtime_cfg.find("TaglineSize").?, same_percent);
try std.testing.expect(p.animationActive());
const changed_percent: u8 = if (old_tagline_percent == 73) 74 else 73;
const changed_text = try std.fmt.bufPrint(&percent_buf, "{d}", .{changed_percent});
p.applySettingBuiltin(runtime_cfg.find("TaglineSize").?, changed_text);
try std.testing.expectEqual(changed_percent, p.settings.font.tagline_percent);
try std.testing.expect(p.panel_presentation_pending);
for (p.panel_tracks) |track| try std.testing.expect(track == null);
}
test "pointer coordinates follow presented panel geometry" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
const pane = p.panes[0].?;
const moving: panel_animation.Track = .{
.serial = pane.serial,
.pane = 0,
.phase = .moving,
.effect = .slide,
.from = .{ .x = 20, .y = 5, .w = 40, .h = 10 },
.to = .{ .x = 0, .y = 1, .w = 80, .h = 18 },
};
p.acknowledgePanelPresentation(&.{moving});
// One shared physical-to-logical map feeds all pointer gestures. The
// selected sample is 26.25% across and 35% down the presented rectangle.
try std.testing.expectEqual(Pardes.PointerCell{ .col = 21, .row = 7 }, p.presentedPointer(30, 8).?);
// Canonical cells covered only by the not-yet-arrived target are inert.
try std.testing.expect(p.presentedPointer(2, 2) == null);
// Unrelated screen space remains in the ordinary grid coordinate system.
try std.testing.expectEqual(Pardes.PointerCell{ .col = 100, .row = 10 }, p.presentedPointer(100, 10).?);
p.acknowledgePanelPresentation(&.{panel_animation.Track{
.serial = pane.serial,
.pane = 0,
.phase = .opening,
.effect = .zoom,
.from = .{ .x = 40, .y = 10, .w = 0, .h = 0 },
.to = .{ .x = 0, .y = 1, .w = 80, .h = 18 },
}});
try std.testing.expect(p.presentedPointer(40, 10) == null);
// Tracks paint in pane-slot order inside a phase. The later slot is the
// top quad and therefore owns an overlap, even though both are moving.
const overlap = [_]panel_animation.Track{ .{
.serial = pane.serial,
.pane = 0,
.phase = .moving,
.effect = .slide,
.from = .{ .x = 20, .y = 2, .w = 20, .h = 4 },
.to = .{ .x = 0, .y = 2, .w = 20, .h = 4 },
}, .{
.serial = pane.serial + 1,
.pane = 1,
.phase = .moving,
.effect = .slide,
.from = .{ .x = 20, .y = 2, .w = 20, .h = 4 },
.to = .{ .x = 60, .y = 2, .w = 20, .h = 4 },
} };
// Slot one is deliberately absent from the fixture, so install this
// synthetic overlap directly; the production acknowledgement rejects
// dead pane lifetimes before they can participate in input.
p.presented_panel_tracks = @splat(null);
p.presented_panel_tracks[0] = overlap[0];
p.presented_panel_tracks[1] = overlap[1];
try std.testing.expectEqual(Pardes.PointerCell{ .col = 65, .row = 3 }, p.presentedPointer(25, 3).?);
}
test "queued pointer input is inert until a changed layout is presented" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 100, .rows = 16, .tty_only = true });
defer p.deinit();
// Establish that a real host has presented the boot layout.
p.acknowledgePanelPresentation(&.{});
p.settings.panel_transition = .slide;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
try std.testing.expect(p.panel_presentation_pending);
try std.testing.expect(p.presentedPointer(10, 4) == null);
var tracks: [MAX_PANES]panel_animation.Track = undefined;
var len: usize = 0;
for (p.panel_tracks) |maybe| if (maybe) |track| {
tracks[len] = track;
len += 1;
};
p.acknowledgePanelPresentation(tracks[0..len]);
try std.testing.expect(!p.panel_presentation_pending);
// Whether this particular opening sample exposes the chosen cell is the
// transition's concern; it is no longer rejected merely as speculative.
try std.testing.expect(p.presentedPointer(99, 4) != null);
}
test "back-to-back layout commits retarget from the last presented boxes" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const initial = try p.render(frame.allocator());
p.acknowledgePanelPresentation(initial.panelTracks());
const shown_a = Pardes.panelBox(p.rects[0]);
p.settings.panel_transition = .slide;
p.col_weight[0] = column_weight_unit;
p.col_weight[1] = column_weight_unit * 2;
p.sync();
const target_b = p.panel_tracks[0] orelse return error.MissingFirstRetarget;
try std.testing.expect(target_b.from.eql(shown_a));
// No render or acknowledgement of B: the pixels are still A. C must not
// jump to the logical-but-unseen B before beginning its own transition.
p.col_weight[0] = column_weight_unit * 2;
p.col_weight[1] = column_weight_unit;
p.sync();
const target_c = p.panel_tracks[0] orelse return error.MissingSecondRetarget;
try std.testing.expect(target_c.from.eql(shown_a));
try std.testing.expect(target_c.to.eql(Pardes.panelBox(p.rects[0])));
try std.testing.expectEqual(panel_animation.Phase.moving, target_c.phase);
_ = frame.reset(.retain_capacity);
const latest = try p.render(frame.allocator());
var submitted: ?panel_animation.Track = null;
for (latest.panelTracks()) |track| if (track.pane == 0) {
submitted = track;
break;
};
const track = submitted orelse return error.MissingSubmittedRetarget;
p.acknowledgePanelPresentation(latest.panelTracks());
try std.testing.expect(p.presented_panel_layout[0].?.box.eql(track.visualBox()));
}
test "an unpresented opening pane remains in the opening paint phase" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
var frame = std.heap.ArenaAllocator.init(std.testing.allocator);
defer frame.deinit();
const initial = try p.render(frame.allocator());
p.acknowledgePanelPresentation(initial.panelTracks());
p.settings.panel_transition = .slide;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
const first = p.panel_tracks[1] orelse return error.MissingOpeningTrack;
try std.testing.expectEqual(panel_animation.Phase.opening, first.phase);
_ = try p.newShell(2, "");
try std.testing.expect(p.layoutSplitColumn(1, 2, true));
p.sync();
const retargeted = p.panel_tracks[1] orelse return error.MissingOpeningRetarget;
try std.testing.expectEqual(panel_animation.Phase.opening, retargeted.phase);
try std.testing.expect(retargeted.from.eql(first.from));
}
test "core composes ASCII bytes while visual-only cells pass through" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 8, .rows = 4, .tty_only = true });
defer p.deinit();
var current: [4]Cell = @splat(.{ .default = false });
var previous = current;
for (¤t, "Dwxq") |*cell, byte| cell.text[0] = byte;
for (&previous, "Azxq") |*cell, byte| cell.text[0] = byte;
current[2].style.bold = true; // visual-only: same glyph, new style
current[3].text[0..2].* = .{ 0xc3, 0xa9 };
current[3].len = 2; // non-ASCII: canonical immediately
const diffs = [_]PanelCellDiff{
.{ .ascii = .{ .from = 'A', .to = 'D' } },
.{ .ascii = .{ .from = 'z', .to = 'w' } },
.visual,
.visual,
};
var surface: Surface = .{
.cols = 4,
.rows = 1,
.cells = ¤t,
.previous_cells = &previous,
.cell_diffs = &diffs,
};
surface.panel_tracks[0] = .{
.effect = .ascii,
.frame = 2,
.frame_count = 4,
.from = .{ .w = 4, .h = 1 },
.to = .{ .w = 4, .h = 1 },
};
surface.npanel_tracks = 1;
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
defer arena.deinit();
const presented = try p.composeAsciiTransitions(arena.allocator(), &surface);
try std.testing.expect(presented != &surface);
try std.testing.expectEqualStrings("C", presented.at(0, 0).grapheme());
try std.testing.expectEqualStrings("x", presented.at(1, 0).grapheme());
try std.testing.expectEqual(current[2], presented.at(2, 0).*);
try std.testing.expectEqual(current[3], presented.at(3, 0).*);
try std.testing.expectEqualStrings("D", surface.at(0, 0).grapheme());
}
test "core composes character motion out of the new grid, not a fade" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 8, .rows = 4, .tty_only = true });
defer p.deinit();
var current: [8]Cell = @splat(.{ .default = false });
var previous = current;
for (¤t, "abcdefgh") |*cell, byte| cell.text[0] = byte;
for (&previous, "........") |*cell, byte| cell.text[0] = byte;
// Motion effects carry every glyph in the pane, so a cell's semantic
// classification is irrelevant to them; only the frozen grid matters.
const diffs: [8]PanelCellDiff = @splat(.visual);
var surface: Surface = .{
.cols = 8,
.rows = 1,
.cells = ¤t,
.previous_cells = &previous,
.cell_diffs = &diffs,
};
surface.panel_tracks[0] = .{
.effect = .edges,
.frame = 4,
.to = .{ .w = 8, .h = 1 },
};
surface.npanel_tracks = 1;
var arena = std.heap.ArenaAllocator.init(std.testing.allocator);
defer arena.deinit();
// Row zero is sliding in from the left screen edge: it holds real glyphs
// from two columns further right, and the cells its text has not reached
// yet keep the frozen old grid rather than a blend or a blank.
const presented = try p.composeAsciiTransitions(arena.allocator(), &surface);
try std.testing.expect(presented != &surface);
var seen: [8]u8 = undefined;
for (&seen, 0..) |*byte, col| byte.* = presented.at(@intCast(col), 0).text[0];
try std.testing.expectEqualStrings("cdefgh..", &seen);
try std.testing.expectEqualStrings("a", surface.at(0, 0).grapheme());
// The last active sample is the untouched canonical grid, with no copy.
surface.panel_tracks[0].frame = panel_animation.Transition.edges.frames() - 1;
try std.testing.expect(try p.composeAsciiTransitions(arena.allocator(), &surface) == &surface);
}
test "pointer rejects panel content cells which have not materialized" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 80, .rows = 12, .tty_only = true });
defer p.deinit();
const pane = p.panes[0].?;
const target: panel_animation.Box = .{ .x = 4, .y = 2, .w = 32, .h = 4 };
p.panel_cell_diffs = try p.gpa.alloc(PanelCellDiff, @as(usize, p.screen_w) * p.screen_h);
@memset(p.panel_cell_diffs, .unchanged);
for (2..6) |row| {
for (4..36) |col| {
// Distances on both sides of frame five prove that finished ASCII
// bytes are clickable while bytes still walking are not.
p.panel_cell_diffs[row * p.screen_w + col] = .{ .ascii = .{
.from = ' ',
.to = @intCast(' ' + (col - 4) % 12 + 1),
} };
}
}
p.panel_diff_ready = true;
for ([_]panel_animation.Transition{ .dissolve, .ascii }) |effect| {
const frame: u16 = if (effect == .dissolve) 3 else 5;
const track: panel_animation.Track = .{
.serial = pane.serial,
.pane = 0,
.phase = .opening,
.effect = effect,
.frame = frame,
.from = target,
.to = target,
};
p.acknowledgePanelPresentation(&.{track});
var saw_visible = false;
var saw_hidden = false;
for (0..4) |relative_row| for (0..32) |relative_col| {
const rcol: u16 = @intCast(relative_col);
const rrow: u16 = @intCast(relative_row);
const col: u16 = @intCast(4 + relative_col);
const row: u16 = @intCast(2 + relative_row);
const visible = switch (effect) {
.dissolve => panel_animation.dissolveRevealed(
pane.serial,
rcol,
rrow,
track.amount(),
),
.ascii => switch (p.panelCellDiff(col, row)) {
.ascii => |diff| diff.complete(track.frame),
.unchanged, .visual => true,
},
else => unreachable,
};
const mapped = p.presentedPointer(col, row);
try std.testing.expectEqual(visible, mapped != null);
if (mapped) |point|
try std.testing.expectEqual(Pardes.PointerCell{ .col = col, .row = row }, point);
saw_visible = saw_visible or visible;
saw_hidden = saw_hidden or !visible;
};
try std.testing.expect(saw_visible);
try std.testing.expect(saw_hidden);
}
}
test "unchanged content cells remain clickable through data effects" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 40, .rows = 10, .tty_only = true });
defer p.deinit();
const pane = p.panes[0].?;
p.panel_cell_diffs = try p.gpa.alloc(PanelCellDiff, @as(usize, p.screen_w) * p.screen_h);
@memset(p.panel_cell_diffs, .unchanged);
p.panel_diff_ready = true;
const box: panel_animation.Box = .{ .x = 2, .y = 2, .w = 20, .h = 4 };
for ([_]panel_animation.Transition{ .dissolve, .ascii }) |effect| {
p.acknowledgePanelPresentation(&.{.{
.serial = pane.serial,
.pane = 0,
.phase = .opening,
.effect = effect,
.from = box,
.to = box,
}});
try std.testing.expectEqual(Pardes.PointerCell{ .col = 8, .row = 3 }, p.presentedPointer(8, 3).?);
}
}
test "stationary Look hover follows only acknowledged panel samples" {
_ = config.look_preview_delay_frames orelse return;
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
const pane = p.panes[0].?;
const rect = p.rects[0];
const target: panel_animation.Box = .{
.x = @floatFromInt(rect.x),
.y = @floatFromInt(rect.y),
.w = @floatFromInt(rect.w),
.h = @floatFromInt(rect.h),
};
var track: panel_animation.Track = .{
.serial = pane.serial,
.pane = 0,
.phase = .moving,
.effect = .slide,
.from = .{ .x = 20, .y = 5, .w = 40, .h = 10 },
.to = target,
};
p.acknowledgePanelPresentation(&.{track});
p.update(.{ .mouse = .{ .button = .none, .kind = .motion, .col = 30, .row = 8 } });
const first = p.look_hover_wait orelse return error.MissingInitialHoverWait;
// Advancing the producer-side track alone cannot move the semantic cell
// under a stationary pointer.
track.frame = track.effect.frames() - 1;
p.panel_tracks[0] = track;
p.refreshLookHoverFromRaw();
try std.testing.expectEqual(first, p.look_hover_wait.?);
// Once that exact sample is acknowledged, the same raw cell maps through
// the new panel rectangle and the debounce starts over for the new target.
p.acknowledgePanelPresentation(&.{track});
const moved = p.look_hover_wait orelse return error.MissingRemappedHoverWait;
try std.testing.expect(first.col != moved.col or first.row != moved.row);
try std.testing.expectEqual(@as(u16, 0), moved.frames);
// Re-acknowledging the same semantic target is host repaint noise, not a
// new hover, so it preserves the accumulated delay.
p.look_hover_wait.?.frames = 3;
p.acknowledgePanelPresentation(&.{track});
try std.testing.expectEqual(@as(u16, 3), p.look_hover_wait.?.frames);
// A zero-sized opening sample covers its future target but exposes no
// clickable content. Successful presentation therefore cancels the hover.
track.phase = .opening;
track.effect = .zoom;
track.frame = 0;
track.from = .{
.x = target.x + target.w * 0.5,
.y = target.y + target.h * 0.5,
};
p.acknowledgePanelPresentation(&.{track});
try std.testing.expect(p.look_hover_wait == null);
try std.testing.expect(p.look_hover_preview == null);
// The motion intent itself survives temporary invisibility. When a later
// successfully presented sample materializes under the stationary raw
// pointer, it can begin a fresh delay without synthetic mouse motion.
track.frame = track.effect.frames() - 1;
p.acknowledgePanelPresentation(&.{track});
try std.testing.expect(p.look_hover_wait != null);
}
test "held drag follows acknowledged panels and balances an invisible release" {
const p = try Pardes.init(std.testing.allocator, .{ .cols = 120, .rows = 20, .tty_only = true });
defer p.deinit();
const pane = p.panes[0].?;
const target = Pardes.panelBox(p.rects[0]);
var track: panel_animation.Track = .{
.serial = pane.serial,
.pane = 0,
.phase = .moving,
.effect = .slide,
.from = .{ .x = 50, .y = 5, .w = 20, .h = 8 },
.to = target,
};
const raw_col: u16 = 55;
const raw_row: u16 = 7;
p.acknowledgePanelPresentation(&.{track});
p.update(.{ .mouse = .{
.button = config.select_button,
.kind = .press,
.col = raw_col,
.row = raw_row,
} });
try std.testing.expect(p.drag == .select);
const first_col = pane.sel[sel_slot].c1;
const first_row = pane.sel[sel_slot].r1;
// Advancing producer state alone cannot move input. Only the sample the
// host says it actually drew may remap the stationary held endpoint.
track.frame = track.effect.frames() - 1;
p.panel_tracks[0] = track;
try std.testing.expectEqual(first_col, pane.sel[sel_slot].c1);
try std.testing.expectEqual(first_row, pane.sel[sel_slot].r1);
p.acknowledgePanelPresentation(&.{track});
try std.testing.expect(first_col != pane.sel[sel_slot].c1 or
first_row != pane.sel[sel_slot].r1);
const last_col = pane.sel[sel_slot].c1;
const last_row = pane.sel[sel_slot].r1;
track.phase = .opening;
track.effect = .zoom;
track.frame = 0;
track.from = .{
.x = target.x + target.w * 0.5,
.y = target.y + target.h * 0.5,
};
p.acknowledgePanelPresentation(&.{track});
try std.testing.expect(p.presentedPointer(raw_col, raw_row) == null);
try std.testing.expectEqual(last_col, pane.sel[sel_slot].c1);
try std.testing.expectEqual(last_row, pane.sel[sel_slot].r1);
// An unrelated release cannot consume the left drag. Its own release is
// nevertheless balanced at the retained endpoint while the cell is dark.
p.update(.{ .mouse = .{
.button = config.exec_button,
.kind = .release,
.col = raw_col,
.row = raw_row,
} });
try std.testing.expect(p.drag == .select);
p.update(.{ .mouse = .{
.button = config.select_button,
.kind = .release,
.col = raw_col,
.row = raw_row,
} });
try std.testing.expect(p.drag == .none);
try std.testing.expectEqual(.done, pane.sel[sel_slot].state);
}
test "repeated non-dyadic column splits preserve every unrelated boundary" {
if (platform == .web) return;
const p = try Pardes.init(std.testing.allocator, .{ .cols = 979, .rows = 20 });
defer p.deinit();
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
// Make the pair 418/561 through the real divider path. This ratio was a
// counterexample for f32 weights: splitting the right side twice changed
// the already-created middle boundary by one cell.
const handle = p.col_x[0] + p.col_w[0] - 1;
const untouched = p.col_weight;
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = TOPBAR_H + 1 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = handle, .row = TOPBAR_H + 1 } });
try std.testing.expectEqual(untouched, p.col_weight);
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = handle, .row = TOPBAR_H + 1 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .drag, .col = 417, .row = TOPBAR_H + 1 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = 417, .row = TOPBAR_H + 1 } });
p.sync();
try std.testing.expectEqual(@as(u16, 418), p.rects[0].w);
_ = try p.newShell(2, "");
try std.testing.expect(p.layoutSplitColumn(1, 2, false));
p.sync();
const left_before = p.rects[0];
const middle_before = p.rects[1];
_ = try p.newShell(3, "");
try std.testing.expect(p.layoutSplitColumn(2, 3, false));
p.sync();
try std.testing.expectEqual(left_before, p.rects[0]);
try std.testing.expectEqual(middle_before, p.rects[1]);
}
pub const Rect = struct { x: u16, y: u16, w: u16, h: u16 };
const LayoutSnapshot = struct {
serial: u32,
box: panel_animation.Box,
};
pub const Options = struct {
tty_only: bool = false,
/// initial shell panes: 1 (default) or 3 for the classic two-column boot.
/// A `file` outranks this — see there.
shells: u8 = 1,
/// argv FILE (resolved absolute): boot with it as the ONLY pane, focused
/// and filling the window. It names the whole boot layout, so `shells` is
/// not consulted at all (it never was — the file arm always won).
file: ?[]const u8 = null,
file_line: usize = 0,
tty_toggle: u21 = config.tty_toggle_default,
/// load a dump of another instance instead of spawning shells (acme -l)
load_path: ?[]const u8 = null,
/// `--nested`: run a full session even inside another pardes. The core
/// never reads it; it rides here because it is the shells that would
/// otherwise open the nested.zig socket, and this is the way argv already
/// reaches them.
nested: bool = false,
/// Native main fills this with the contents of the per-user config init.
/// Keeping discovery out of the core makes constructors and web builds
/// deterministic; when present, each line is dispatched as a builtin
/// before init returns and therefore before any frontend can render.
startup_config: ?[]const u8 = null,
/// SERVE ACME'S CONTROL FILESYSTEM for this session (`--fs`), and where.
/// `null` is off; `""` means "derive the mount point" (a per-session
/// directory under `$XDG_RUNTIME_DIR`); anything else is the directory
/// `--fs=<dir>` named, which scripts and the snapshot harness need because
/// they have to predict it.
///
/// One field rather than a flag plus a path: two of those encode a state
/// ("no filesystem, mounted here") that means nothing. The core never
/// mounts anything — a mount is a host's business, and one host (the
/// browser) has no filesystem at all — but the option rides here because
/// argv already reaches the shells this way, like `nested`.
fs: ?[]const u8 = null,
/// SERVE THAT SAME TREE OVER 9P2000 on a unix socket (`--fs9`), and under
/// what name. `null` is off; `""` means "derive the socket name" (the
/// session name in a daemon, this pid anywhere else); anything else is the
/// name `--fs9=<name>` gave, which scripts need because they have to
/// predict `$XDG_RUNTIME_DIR/pardes-9p-<name>.sock`.
///
/// INDEPENDENT of `fs` above: either, both or neither. They are two
/// transports onto one tree (`src/acmefs.zig`) and neither is the other's
/// prerequisite — on Linux the FUSE mount needs `fusermount3` and a
/// kernel with FUSE, and this needs neither, which is the whole reason
/// docs/9p.typ §12.4 calls them complementary rather than competing.
///
/// Read by `detached/server.zig` and nowhere else so far: a daemon polls
/// its own listener in the one `poll(2)` it already runs, which costs it
/// no thread. The tty and GUI shells would each need their own wake for
/// it, exactly as they need one for `/dev/fuse`, and they take `fs` only.
fs9: ?[]const u8 = null,
/// Native launcher's resolved per-user `pardes` directory. Relative
/// ThemeFile operands and DumpThemes are rooted here. Null for web and
/// direct core callers which did not opt into per-user configuration.
config_dir: ?[]const u8 = null,
/// ...and WHERE that came from, which is a separate fact: the path
/// resolves even when the file does not exist, and that is precisely the
/// case the Config builtin is asked about. Null on the web and in every
/// core test, where there is no per-user config to name.
startup_config_path: ?[]const u8 = null,
image_allocator: ?std.mem.Allocator = null,
pdf_allocator: ?std.mem.Allocator = null,
tree_sitter_allocator: ?std.mem.Allocator = null,
/// Where each frame's Surface text is built. Hosts pass a purpose-built
/// stack-fallback arena; null means the general allocator.
frame_allocator: ?std.mem.Allocator = null,
/// Initial grid. Shell contract: for LIVE sessions leave these at the
/// defaults and deliver the real size as the first resize EVENT — the core
/// defers an integrated shell's greeting until after a resize AND its OSC
/// 133 B input mark (so `ls` cannot race startup and wraps to the real pane
/// width); pre-sizing here means that resize never fires and the greeting
/// never runs. Pre-size only for dump loads (nothing greets, and it avoids
/// reflowing replayed content twice).
cols: u16 = 80,
rows: u16 = 24,
};
const PendingPipe = struct {
id: u32,
pane: usize,
serial: u32,
revision: u32,
command: []u8,
cwd: []u8,
inputs: []selection_pipe.Input,
ranges: [MAX_SELS]modal.HxRange,
primary: u8,
explicit: bool,
fn deinit(wait: *PendingPipe, gpa: std.mem.Allocator) void {
gpa.free(wait.command);
gpa.free(wait.cwd);
for (wait.inputs) |input| gpa.free(@constCast(input.bytes));
gpa.free(wait.inputs);
wait.* = undefined;
}
fn request(wait: *const PendingPipe) selection_pipe.Request {
return .{
.id = wait.id,
.command = wait.command,
.cwd = wait.cwd,
.inputs = wait.inputs,
};
}
};
/// The acme verb the core just performed, for a shell that can answer with
/// something physical. macOS taps the trackpad under the finger that asked
/// (NSHapticFeedbackManager); the SDL shell already does the same thing with a
/// gamepad — `rumble` in src/gui/deck.zig, "a brief gentle ack for
/// execute/look, not a buzz". Two verbs rather than one flag because they
/// deserve to feel different: Exec did something, Look went somewhere.
pub const Haptic = enum { none, exec, look };
/// Zero-sized off macOS, the way PdfSlot is off -Dmupdf: no other shell reads
/// the field, so no other shell carries it.
const HapticSlot = if (platform == .macos) Haptic else void;
/// Deferred pane teardown. A dropped pane's memory outlives the frame it died
/// in: it is doomed here and actually torn down one full frame later, so any
/// `*Pane` captured that frame — an effect, another pane's inherited cwd —
/// stays valid long enough for the per-frame fixup pass to repair it. `fresh`
/// holds this frame's drops, `stale` the previous frame's, freed next reap.
pub const PaneAllocator = struct {
fresh: [2 * MAX_PANES]?*Pane = @splat(null),
stale: [2 * MAX_PANES]?*Pane = @splat(null),
fn doom(a: *PaneAllocator, pane: *Pane) void {
for (&a.fresh) |*slot| if (slot.* == null) {
slot.* = pane;
return;
};
// One update runs one builtin, and the widest drop is a whole column;
// 2*MAX_PANES cannot fill in a single frame.
unreachable;
}
fn isDoomed(a: *const PaneAllocator, pane: *const Pane) bool {
for (a.fresh) |s| if (s == pane) return true;
for (a.stale) |s| if (s == pane) return true;
return false;
}
};
pub const Pardes = struct {
gpa: std.mem.Allocator,
image_gpa: std.mem.Allocator,
pdf_gpa: std.mem.Allocator,
tree_sitter_gpa: std.mem.Allocator,
opts: Options,
screen_w: u16,
screen_h: u16,
cell_pixels: CellPixels = .{},
resize_count: usize = 0,
panes: [MAX_PANES]?*Pane = @splat(null),
/// Deferred teardown of dropped panes (see PaneAllocator).
pane_alloc: PaneAllocator = .{},
// layout: columns own x by weight; panes own y by vweight within a column.
ncol: usize = 0,
/// Fixed-point horizontal proportions. Integer sums make splitting W
/// into A+B exactly associative, so an unrelated boundary cannot move
/// through floating-point regrouping after repeated source-local splits.
col_weight: [MAX_COLS]u64 = @splat(column_weight_unit),
col_terms: [MAX_COLS][MAX_PANES]usize = undefined,
col_n: [MAX_COLS]usize = @splat(0),
// derived each sync
rects: [MAX_PANES]Rect = undefined,
col_x: [MAX_COLS]u16 = undefined,
col_w: [MAX_COLS]u16 = undefined,
/// Last committed layout and the finite visual tracks derived from it.
/// Both are indexed by pane slot; serial rejects slot reuse.
layout_snapshot: [MAX_PANES]?LayoutSnapshot = @splat(null),
layout_snapshot_ready: bool = false,
/// Boot/config replay is not a visible layout event, and a host resize is
/// already continuous physical motion. Those paths snap this presentation
/// cache once instead of manufacturing panel transitions.
panel_animation_enabled: bool = false,
snap_panel_layout_once: bool = false,
/// Tracks the core is preparing for the next frame, and the independent
/// tracks a backend has actually put on screen. Input must follow the
/// latter: a failed GPU submit or a delayed AppKit draw cannot make an
/// unpresented animation tick clickable.
panel_tracks: [MAX_PANES]?panel_animation.Track = @splat(null),
presented_panel_tracks: [MAX_PANES]?panel_animation.Track = @splat(null),
/// Deleted pane lifetimes cannot stay in the slot-indexed live table: a
/// slot may be reused while its old pixels are still leaving. Tombstones
/// are dense plain records and never retain a functional Pane.
closing_panel_tracks: [MAX_PANES]panel_animation.Track = undefined,
nclosing_panel_tracks: usize = 0,
presented_closing_panel_tracks: [MAX_PANES]panel_animation.Track = undefined,
npresented_closing_panel_tracks: usize = 0,
/// Last canonical grid a backend explicitly acknowledged, and the frozen
/// semantic diff from it to the first canonical frame of this transition.
/// These buffers are capacity-reused and own no pane resources.
presented_cells: []Cell = &.{},
presented_cells_cols: u16 = 0,
presented_cells_rows: u16 = 0,
presented_cells_valid: bool = false,
/// Pane lifetimes and boxes represented by `presented_cells`. This is
/// deliberately separate from `presented_panel_layout`, which follows
/// partially animated pixels. A closing tombstone may sample the frozen
/// grid only when that grid actually contains the exact pane box.
presented_cells_layout: [MAX_PANES]?LayoutSnapshot = @splat(null),
panel_cell_diffs: []PanelCellDiff = &.{},
panel_diff_pending: bool = false,
panel_diff_ready: bool = false,
/// Canonical pane lifetimes/boxes captured by render, and the visual boxes
/// from the last successful acknowledgement. Retargeting reads the latter,
/// never a logical layout which may not have reached the screen yet.
submitted_panel_layout: [MAX_PANES]?LayoutSnapshot = @splat(null),
submitted_panel_layout_ready: bool = false,
presented_panel_layout: [MAX_PANES]?LayoutSnapshot = @splat(null),
/// Becomes true on the first host acknowledgement. Sans-host unit callers
/// retain direct canonical pointer semantics; a real frontend thereafter
/// gets the strict unpresented interval below.
panel_presentation_ready: bool = false,
/// A layout mutation has not reached a backend yet. Pointer gestures are
/// inert during this normally sub-frame interval; guessing frame-zero
/// geometry would make queued input address pixels nobody has presented.
panel_presentation_pending: bool = false,
active: usize = 0,
/// THE focus history: where the keyboard has BEEN, oldest first, and `jcur`
/// is the entry it is at NOW (so `jumps[jcur]` is always the live spot and
/// the entries past it are the ones Ctrl-i walks forward into). Maintained
/// in exactly one place — sync() — and read by everything that asks "where
/// was I": Back/Forward, Last, the Jumplist buffer, prevFocus when a pane
/// closes, Last, and the directory order a look resolves in.
///
/// One list, not two. A jumplist kept beside a focus history is two things
/// to keep agreeing, and they would disagree the first time one of them
/// forgot a pane the other still names.
jumps: [MAX_JUMPS]Loc = undefined,
njumps: usize = 0,
jcur: usize = 0,
/// THE PANES THAT HAVE LOOKED, oldest first, at most one entry each — the
/// spine n/N walks (lookWalkPanes). Serials rather than slots, for the
/// same reason the jumplist stores them: a freed slot is reused, and an
/// entry naming a dead pane must not resolve to the newcomer sitting in
/// its place.
///
/// Not the jumplist, though it looks like one. `jumps` records where FOCUS
/// has been, and a look moves focus to what it OPENED; this records where
/// the look was made FROM, which is the pane holding the list you are
/// working through. The two answer different questions and would only
/// coincide by accident.
look_src: [MAX_PANES]u32 = undefined,
n_look_src: usize = 0,
/// Serial of the pane whose stream n/N is actively walking. Focus may
/// leave it when Enter/Look opens a row; provenance does not. Null/stale
/// falls back to the ordinary history order.
look_walk_owner: ?u32 = null,
/// hands out Pane.serial; monotonic, never reused
next_serial: u32 = 0,
/// Every user-settable, queryable display/runtime choice in one plain
/// authoritative record. Generated setting builtins mutate it directly;
/// rendering and the Config report read those same fields.
settings: runtime_cfg.State = .{ .font = .{ .tagline_percent = config.gui_tagline_font_percent } },
/// One theme-derived Ghostty palette shared by all filtered terminals.
/// Its value key makes a same-name ThemeFile reload invalidate it without
/// coupling terminal rendering to the theme-selection call sites.
tty_filter_palette: term_pane.FilterPalette = .{},
/// Delivery bookkeeping, not configuration: prevents a synchronous host
/// pump from taking one still-pending font request more than once before it
/// acknowledges success or rejection.
font_request_taken: bool = false,
/// One user theme loaded from a .zon file. The parsed value owns its name;
/// all color fields are inline. `theme_file_generation` makes a queued IO
/// request stale as soon as another ThemeFile/Theme/NextColor command wins.
custom_theme: ?Theme = null,
custom_theme_active: bool = false,
/// Sized by `limits.host_path_cap`, which is 0 where the platform has
/// no filesystem to hold a theme file: `set` then refuses every non-empty
/// path and `themeFileRequest` answers `PathTooLong`, which is the honest
/// answer on a board whose only IO is a UART.
theme_file_path: runtime_cfg.Text(limits.host_path_cap) = .{},
theme_file_generation: u32 = 0,
theme_file_pane: u8 = 0,
chrome_animation: ChromeAnimation = ChromeAnimation.init(initial_chrome),
/// False only while startup configuration or a dump restore is selecting
/// its first theme. No frame is rendered in that interval.
///
/// Nothing to do with `-Dtheme-animation`: that is decided by the type of
/// `chrome_animation`, so a build without the fade does not carry a flag
/// saying so.
animate_theme_changes: bool = false,
/// Native pixel attachments supported by the shell (Kitty graphics in a
/// terminal, GPU textures in SDL). Image panes dynamically fall back to
/// the PETSCII matcher without it.
native_images: bool = false,
quit: bool = false,
/// The Look or Exec that has happened and not yet been felt, taken by the
/// shell once per pump (takeHaptic). A pulse, not a queue: five Execs
/// inside one keystroke are still one thing the hand did.
haptic: HapticSlot = if (platform == .macos) .none else {},
drag: Drag = .none,
hover_col: u16 = 0,
hover_row: u16 = 0,
pointer_raw_col: u16 = 0,
pointer_raw_row: u16 = 0,
/// True only after buttonless motion. Presentation acknowledgements may
/// remap that stationary hover; keyboard/button/wheel input clears the
/// intent so an ordinary repaint cannot silently re-arm a cancelled hint.
raw_hover_intent: bool = false,
/// Hosts explicitly tell us when the pointer leaves. Keeping this bit
/// separate from the last coordinates lets a drag retain its endpoint
/// while idle resize-handle hints disappear immediately outside a window.
pointer_inside: bool = false,
look_hover_wait: ?LookHoverWait = null,
look_hover_preview: ?LookHoverPreview = null,
pdf_hover_preview: if (pdf_enabled) ?PdfWordPreview else void = if (pdf_enabled) null else {},
/// touchpad drift guard, counted down in horizontal wheel ticks — see
/// config.wheelTick, which owns the whole rule. Global, and clock-free on
/// purpose: the core has no clock, so "recently scrolled vertically" can
/// only mean "in the last few wheel events", which is all the heuristic
/// needs.
/// ponytail: it therefore never times out — only a horizontal tick spends
/// it, so a sideways swipe an hour after a scroll still pays the toll. If
/// that ever bites, clear it on any non-wheel event: a keypress or a click
/// is proof the gesture ended, and still needs no clock.
wheel_guard: u8 = 0,
ctrl_w_pending: bool = false,
/// A key is being REPLAYED over several selections (replaySels). The one
/// thing the replay cannot do is let a per-pass action that is really a
/// per-KEYSTROKE action fire once per range: the undo snapshot must be
/// taken once, the yank register accumulates instead of being overwritten,
/// and anything that opens, closes or focuses a pane (runBuiltin) or asks
/// the language backend (lspRequest) happens on the first pass and stops
/// the replay dead — see multiOnce.
multi_on: bool = false,
multi_first: bool = false,
multi_stop: bool = false,
/// SPC leader in flight, holding the key path typed so far (empty = just
/// SPC). Global like ctrl_w_pending — there is one leader and it acts on
/// the active pane, whose transient message row shows the pending path.
leader_on: bool = false,
leader_keys: [4]u8 = undefined,
leader_n: u8 = 0,
/// the TOPBAR holds the keyboard, parked at this UTF-8 byte offset of the
/// row-0 line. Global like leader_on for the same reason: row 0 is not a
/// pane and never will be, so its one piece of focus state cannot live on
/// one. `null` = the panes have the keyboard, which is every other frame.
topbar_col: ?u16 = null,
ov_pinch_scale: f32 = 1.0,
ov_touch_scroll_delta: f32 = 0.0,
/// middle+left chord argument: a kept left selection captured by a left
/// press during an active middle select-drag; consumed on middle release
chord_arg: ?[]u8 = null,
/// how many `execute` calls are on the stack — see max_exec_depth
exec_depth: u8 = 0,
/// The one language query in flight. ONE, deliberately: every one of these
/// is a keystroke the user is waiting on, so a second press means "I meant
/// this one" — the id bump makes the older answer stale and lspResponse
/// drops it. A queue would only buy the right to render an answer nobody
/// is waiting for any more.
/// `arg` holds the replacement name for rename and the query for workspace
/// symbols. `serial` rejects a response after its pane slot was reused;
/// `revision` makes a mutating rename conditional on the source snapshot
/// the worker actually analysed. `row`/`col` are where the cursor was when
/// the question was asked. Only `completion` reads them, and only to undo
/// itself: Tab diverted instead of indenting, so an empty answer has to put
/// the indent back — but only if the cursor has not moved since.
lsp_seq: u32 = 0,
lsp_wait: ?struct {
id: u32,
kind: lsp.Kind,
pane: usize,
serial: u32,
revision: u32,
arg: Effect.Buf(128),
row: i32 = 0,
col: i32 = 0,
} = null,
/// One current shell-filter request. A newer submit frees and supersedes
/// it; old worker answers then fail the id check. The request itself owns
/// every byte a shell snapshots while draining the id-only effect.
pipe_seq: u32 = 0,
pipe_wait: ?PendingPipe = null,
/// acme's control filesystem, when a host serves one (`pardes --fs`).
/// Zero-initialised and inert: a core nobody scripts pays for one branch
/// per edit and nothing else. See src/acmefs.zig.
fs: acmefs.State = .{},
/// Pending effects, drained by the shell after each update. The bounded
/// ring preserves byte order; once full, later effects are refused so no
/// already-queued write can be reordered or silently evicted.
effects: [limits.effect_cap]Effect = undefined,
effects_head: usize = 0,
effects_len: usize = 0,
/// Pty bytes that did not fit the ring, per pane, kept because refusing a
/// `write` TRUNCATES a byte stream rather than merely delaying it: a 1 MiB
/// paste used to reach a program as its first 256 KiB, silently. `emitWrite`
/// parks the tail here and `nextEffect` refills the ring from it as the host
/// drains, so the stream is delayed and never cut. See `limits.pending_write_cap`.
///
/// Per pane because two ptys are independent streams: only order WITHIN one
/// matters, so a pane whose tail is waiting never delays another's writes.
pending_write: [MAX_PANES]?PendingWrite = @splat(null),
/// Total bytes parked above, so the drain path costs one comparison when
/// nothing is waiting — which is every frame that is not a large paste.
pending_write_bytes: usize = 0,
/// WHO SERVES THIS CORE. Every method optional; a null one is answered by
/// `fallback` below, so a `Host{}` is a complete in-process pardes.
host: Host = .{},
/// The in-program answers behind every unimplemented host method. Per
/// instance, so several cores behind one fan-out host stay independent.
fallback: Fallback,
/// Input the loop has not consumed yet. Single-threaded: a host's worker
/// threads keep their own thread-safe inbox and post from the loop thread,
/// which is what keeps this ring lock-free.
in_q: [64]Event = undefined,
in_head: usize = 0,
in_len: usize = 0,
/// helix's DEFAULT register (gpa-owned): what `y`/`d`/`c` write and
/// `p`/`P`/`R` read. Never the system clipboard — `SPC y`/`SPC p` are the
/// two commands that cross that line.
yank: ?[]u8 = null,
/// a `SPC p`/`SPC P`/`SPC R` waiting on the shell's clipboard read, or
/// null. At most one: a second request replaces the first, and any
/// keystroke abandons it (update).
clip_pending: ?ClipRequest = null,
/// the last serialized dump (gpa-owned), read by the write_dump effect
dump_out: ?[]u8 = null,
/// where the shell wrote the last dump (shell reports back after
/// write_dump); shown in the topbar as `Restore <path>`
last_dump: ?[]const u8 = null,
/// a Restore builtin wants this dump loaded into the live session; the
/// shell consumes it via takeRestore each frame (restore contents stay host-fed)
restore_req: ?[]const u8 = null,
restore_buf: [1024]u8 = undefined,
/// An Attach builtin wants this frontend's screen handed to a detached
/// core; the shell consumes it via takeAttach from its OUTER loop, beside
/// takeRestore and for the same reason — both END this core, and nothing
/// running inside `pump` may destroy the core it is running in. `name`
/// points into `attach_buf`, which the effect's inline copy is unpacked
/// into: the effect is a value the drain loop owns and dies with it.
attach_req: ?AttachRequest = null,
attach_buf: [attach_name_max]u8 = undefined,
surface: Surface = .{},
/// per-update scratch (paneCursorLines, selection text); reset each update
scratch: std.heap.ArenaAllocator,
/// The arena each frame's Surface text is built in, reset by `pump`. Hosts
/// that still own their loop pass their own arena to `render` instead.
frame_arena: std.heap.ArenaAllocator,
/// the terminal motion surface, memoized against the pane it was built
/// for — see term_pane.RowsCache for the lifetime rule
shell_rows: term_pane.RowsCache = .{},
pub fn init(gpa: std.mem.Allocator, opts: Options) !*Pardes {
const image_gpa = opts.image_allocator orelse gpa;
const pdf_gpa = opts.pdf_allocator orelse gpa;
const tree_sitter_gpa = opts.tree_sitter_allocator orelse gpa;
const p = try gpa.create(Pardes);
p.* = .{
.gpa = gpa,
.image_gpa = image_gpa,
.pdf_gpa = pdf_gpa,
.tree_sitter_gpa = tree_sitter_gpa,
.opts = opts,
.screen_w = opts.cols,
.screen_h = opts.rows,
.scratch = .init(gpa),
.frame_arena = .init(opts.frame_allocator orelse gpa),
.fallback = .{ .gpa = gpa },
};
errdefer p.deinit();
if (opts.file) |path| {
// FILE argv boot: the doc alone, filling the window. Naming a file
// is asking to READ it, not to be handed a shell you did not ask
// for and have to close — and the launch directory is one Newcol
// away when it is wanted. Doc, PDF and image all boot the same way.
_ = initial_doc: {
if (comptime pdf_enabled) if (look.isPdfPath(path))
break :initial_doc try pdf_pane.openPane(p, 0, path, opts.file_line);
if (look.isImagePath(path))
break :initial_doc try image_pane.create(p, 0, path, &.{});
break :initial_doc try file_pane.open(p, 0, path, opts.file_line);
};
p.ncol = 1;
p.col_n[0] = 1;
p.col_terms[0][0] = 0;
} else if (comptime platform == .esp32p4) {
// BARE METAL BOOTS AN EMPTY OUTPUT BUFFER, and a shell is not a layout preference
// here but an impossibility: there is no operating system under this, so there is
// nothing to fork and no pty to give a terminal pane. Booting one anyway produced
// exactly what that describes - a pane whose tag ends in `Filter`, whose pty is the
// Fallback's silent one, with no gutter, no buffer, and no key that reaches anything.
// Measured on an ESP32-P4 over the serial line: every keystroke vanished.
//
// An output buffer is the right default rather than a file pane, and not only because
// `opts.file` cannot work here (the P4's embedded allowlist is empty by design - see
// source_manifest.zig - so `look.readFile` has nothing to resolve a path against). It
// is what the platform's own words WANT: `Peek`, `Poke` and `Hexdump` each fill an
// output buffer, so booting into one means the first dump lands in the same kind of
// pane the boot pane already is. It is editable text with no file behind it, which is
// the honest description of a buffer on a board with no filesystem.
// AND IT BOOTS WITH SOMETHING IN IT. An empty buffer is honest and useless: the three
// words that make this board interesting take an address, and a board's address space is
// precisely the thing you cannot guess.
//
// SHORT, because the window is fourteen rows. The first draft opened with four lines of
// prose about there being no operating system, which is true, unhelpful, and cost a
// third of the screen before the first command. One header line earns its place; the
// rest of the screen is addresses.
//
// Each command sits alone on its line because an argument list ends at the last argument
// - a trailing comment would be `ExtraArgument` - so the labels go above. Every address
// is from this repository or from a session that read it on this die: the flash and RAM
// figures are the linker script's own ORIGINs (`05-zig-p4/build.zig`), the peripheral
// bases are the `DR_REG_*` values `05-zig-p4/src/hal` uses, and the two LP addresses at
// the end are named in ESP-IDF's own headers: 0x5011002c is LP_SYSTEM_REG_LP_STORE0, a
// general-purpose retention register that holds what you put in it, and 0x501101a4 is
// LP_SYSTEM_REG_RNG_DATA, the hardware random generator. Between them they demonstrate
// the whole point of a volatile read: one address gives back what was written and the
// other never gives the same answer twice. Both verified on this die.
const content = try p.gpa.dupe(u8, boot_buffer);
errdefer p.gpa.free(content);
_ = try output_pane.open(p, 0, "", .{ .cmd = .New }, "", content);
p.ncol = 1;
p.col_n[0] = 1;
p.col_terms[0][0] = 0;
} else if (opts.tty_only) {
_ = try p.newShell(0, "");
p.panes[0].?.mode = .tty;
p.ncol = 1;
p.col_n[0] = 1;
p.col_terms[0][0] = 0;
} else if (opts.shells >= 3) {
// classic layout: two columns, the left one split in two.
_ = try p.newShell(0, "");
_ = try p.newShell(1, "");
_ = try p.newShell(2, "");
for (p.panes[0..3]) |slot| slot.?.greet = true;
p.ncol = 2;
p.col_n[0] = 2;
p.col_terms[0][0] = 0;
p.col_terms[0][1] = 1;
p.col_n[1] = 1;
p.col_terms[1][0] = 2;
} else {
// ponytail: 1 and 3 are the only boot layouts; anything else acts as 1
_ = try p.newShell(0, "");
p.panes[0].?.greet = true;
p.ncol = 1;
p.col_n[0] = 1;
p.col_terms[0][0] = 0;
}
p.sync();
p.applyStartupConfig();
p.finishThemeInitialization();
p.sync();
p.panel_animation_enabled = true;
// A config init that opens a file with `Look …` armed the pulse before
// anyone touched anything. Nobody asked for that, so boot is silent.
_ = p.takeHaptic();
return p;
}
pub fn deinit(p: *Pardes) void {
p.cancelLookHover();
for (0..MAX_PANES) |id| p.dropPendingWrite(id);
for (&p.panes) |*slot| if (slot.*) |pane| {
p.teardownPane(pane);
slot.* = null;
};
for (&p.pane_alloc.stale) |*slot| if (slot.*) |pane| {
p.teardownPane(pane);
slot.* = null;
};
for (&p.pane_alloc.fresh) |*slot| if (slot.*) |pane| {
p.teardownPane(pane);
slot.* = null;
};
const gpa = p.gpa;
if (p.yank) |y| gpa.free(y);
if (p.dump_out) |d| gpa.free(d);
p.fallback.deinit();
if (p.last_dump) |d| gpa.free(d);
if (p.custom_theme) |theme_value| std.zon.parse.free(gpa, theme_value);
if (p.chord_arg) |a| gpa.free(a);
if (p.pipe_wait) |*wait| wait.deinit(gpa);
p.fs.deinit(gpa);
p.shell_rows.reset(gpa);
p.scratch.deinit();
p.frame_arena.deinit();
gpa.free(p.surface.cells);
if (p.presented_cells.len > 0) gpa.free(p.presented_cells);
if (p.panel_cell_diffs.len > 0) gpa.free(p.panel_cell_diffs);
if (p.surface.images.len > 0) gpa.free(p.surface.images);
gpa.destroy(p);
}
/// shell feedback after write_dump: remember where the dump landed (the
/// topbar grows a `Restore <path>` word pointing at it)
pub fn setLastDump(p: *Pardes, path: []const u8) void {
const copy = p.gpa.dupe(u8, path) catch return;
if (p.last_dump) |old| p.gpa.free(old);
p.last_dump = copy;
}
/// the shell polls this each frame: a pending Restore's dump path, or null
pub fn takeRestore(p: *Pardes) ?[]const u8 {
const r = p.restore_req;
p.restore_req = null;
return r;
}
/// the shell polls this each frame beside takeRestore: a pending Attach's
/// session and reporting pane, or null
pub fn takeAttach(p: *Pardes) ?AttachRequest {
const a = p.attach_req;
p.attach_req = null;
return a;
}
/// the topbar line: the fixed builtins, plus `Restore <path>` once a dump
/// exists — render and click dispatch must agree on this exact string
fn topbar(p: *Pardes, buf: []u8) []const u8 {
if (p.last_dump) |d|
return std.fmt.bufPrint(buf, config.topbar_str ++ " Restore {s}", .{d}) catch config.topbar_str;
return config.topbar_str;
}
/// Drop a pane: its slot is freed for reuse now, but the allocation is
/// doomed and actually torn down a frame later (reapPanes), so pointers to
/// it survive the frame. Callers still null `panes[id]` themselves.
pub fn deinitPane(p: *Pardes, pane: *Pane) void {
// Logical close, while the pane is still installed: stop the file/PDF
// watch keyed to this slot and drop any hover it owns. The heap
// teardown is deferred (reapPanes) so pointers to it survive the frame.
const watched = (if (pane.file) |f| f.output == null else false) or hasPdf(pane);
for (p.panes, 0..) |slot, id| if (slot == pane) {
if (watched) p.emit(.{ .watch = .{ .pane = @intCast(id), .on = false } });
// A pane's filesystem state dies WITH the pane, here, while the
// slot still names it: the alternative is a script that held its
// `event` file open leaving the editor suppressing button actions
// for whatever pane lands in this slot next.
p.fs.forget(p.gpa, id);
// ...and so do bytes still queued for the pty it no longer has.
p.dropPendingWrite(id);
};
if (p.lookHoverPane()) |h| if (h < p.panes.len and p.panes[h] == pane) p.cancelLookHover();
p.pane_alloc.doom(pane);
}
/// The real teardown, run by reapPanes once the pane has been doomed for a
/// full frame (or at deinit). Frees every heap payload the pane owns.
fn teardownPane(p: *Pardes, pane: *Pane) void {
if (p.lookHoverPane()) |hovered| {
if (hovered < p.panes.len and p.panes[hovered] == pane)
p.cancelLookHover();
}
p.shell_rows.dropPane(pane);
term_pane.deinitPendingCommand(pane);
if (pane.image) |*iv| {
iv.deinit(p.image_gpa);
}
if (comptime pdf_enabled) if (pane.pdf) |*pv| pdf_pane.deinitPane(p, pane, pv);
if (pane.file) |*file| file_pane.deinit(p, pane, file);
if (pane.ovl) |o| p.gpa.free(o.text);
for (pane.ed_undo[0..pane.ed_undo_len]) |sn| if (sn.ovl) |o| p.gpa.free(o.text);
for (pane.ed_redo[0..pane.ed_redo_len]) |sn| if (sn.ovl) |o| p.gpa.free(o.text);
term_pane.deinitEmulator(pane, p.gpa);
p.gpa.destroy(pane);
}
/// Once a frame: repair live panes' pointers to doomed panes, then free the
/// panes doomed a full frame ago. Fixup runs first so no pointer outlives
/// the memory. `stale` (last frame's dead) is freed; `fresh` becomes stale.
fn reapPanes(p: *Pardes) void {
for (p.panes) |slot| if (slot) |pane| p.fixupPaneRefs(pane);
for (&p.pane_alloc.stale) |*slot| if (slot.*) |pane| {
p.teardownPane(pane);
slot.* = null;
};
p.pane_alloc.stale = p.pane_alloc.fresh;
p.pane_alloc.fresh = @splat(null);
}
/// Visit each Pane field that holds a pane pointer; when it names a doomed
/// pane, snapshot that pane's directory into our own bytes so the link can
/// die with it. One field carries a pointer today (the inherited cwd); the
/// comptime walk keeps that honest as fields come and go.
fn fixupPaneRefs(p: *Pardes, pane: *Pane) void {
inline for (@typeInfo(Pane).@"struct".fields) |f| {
if (f.type == Pane.Cwd) switch (@field(pane, f.name)) {
.inherited => |src| if (p.pane_alloc.isDoomed(src)) pane.setOwnedCwd(paneDir(src)),
else => {},
};
}
}
/// Put a fully constructed pane in a free slot and give it the monotonic
/// identity every slot-reuse guard relies on. Pane kinds construct their
/// own payloads; this registration rule remains a core invariant.
fn installPane(p: *Pardes, id: usize, pane: *Pane) void {
std.debug.assert(p.panes[id] == null);
p.next_serial += 1;
pane.serial = p.next_serial;
p.panes[id] = pane;
}
/// Allocate a pane slot with a live terminal emulator and queue the spawn
/// effect (optionally in a directory); the shell answers by forking a pty
/// and wiring reads back as Event.output for this pane id.
pub fn newShell(p: *Pardes, id: usize, cwd: []const u8) !*Pane {
std.debug.assert(p.panes[id] == null);
if (cwd.len > 256) return error.PathTooLong; // spawn effect cwd is a Buf(256)
const pane = try term_pane.create(p.gpa, p.screen_w, p.screen_h);
term_pane.armShellSpawn(pane);
p.installPane(id, pane);
p.emit(.{ .spawn = .{ .pane = @intCast(id), .cwd = .from(cwd) } });
return pane;
}
/// a doc pane (file/image/PDF): no pty and no spawn. Whatever emulator half
/// it still needs is term_pane's business — see `createDoc` there.
pub fn newDocPane(p: *Pardes, id: usize) !*Pane {
std.debug.assert(p.panes[id] == null);
const pane = try term_pane.createDoc(p.gpa, p.screen_w, p.screen_h);
p.installPane(id, pane);
return pane;
}
/// An empty output buffer opened FROM `from_id`: no file behind it, its cwd
/// a live link to the opener so Save can prefill that directory. New and
/// Newcol place it (below, or in a column). Installed in slot `free`.
fn newScratch(p: *Pardes, from_id: usize, free: usize) !*Pane {
const src = p.panes[from_id] orelse return error.MissingPane;
const content = try p.gpa.dupe(u8, "");
errdefer p.gpa.free(content);
const np = try output_pane.open(p, free, paneDir(src), .{ .cmd = .New }, "", content);
np.cwd = .{ .inherited = src };
np.cur_pinned = true;
return np;
}
/// New: a scratch below the calling pane, in its column.
pub fn newScratchBelow(p: *Pardes, from_id: usize) void {
const free = p.freeSlot() orelse return;
const sf = p.layoutFindTerm(from_id) orelse return;
const np = p.newScratch(from_id, free) catch return;
p.layoutInsert(sf.col, sf.idx + 1, free);
p.splitBelow(from_id, np);
p.active = free;
}
/// Newcol: a scratch in a fresh column beside the calling pane.
pub fn newScratchColumn(p: *Pardes, from_id: usize) void {
const free = p.freeSlot() orelse return;
if (!p.layoutCanSplitColumn(from_id)) return;
_ = p.newScratch(from_id, free) catch return;
std.debug.assert(p.layoutSplitColumn(from_id, free, false));
p.active = free;
}
pub fn freeSlot(p: *Pardes) ?usize {
return for (p.panes, 0..) |slot, i| {
if (slot == null) break i;
} else null;
}
/// The slot holding the pane with this serial, if it is still open.
pub fn paneBySerial(p: *Pardes, serial: u32) ?usize {
return for (p.panes, 0..) |slot, i| {
if (slot) |pane| if (pane.serial == serial) break i;
} else null;
}
/// `id` just performed a look: put it on top of the walk's spine.
///
/// MOVE to the top rather than push, so a pane you keep looking out of
/// stays one entry instead of filling the list with itself — the walk's
/// order is "which panes, most recent first", not "how many times".
/// Dropping the oldest when full can only ever discard a DEAD pane's
/// serial: MAX_PANES entries with no duplicates already names every slot
/// there is.
fn noteLookSource(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
var w: usize = 0;
for (p.look_src[0..p.n_look_src]) |s| {
if (s == pane.serial) continue;
p.look_src[w] = s;
w += 1;
}
if (w == p.look_src.len) {
std.mem.copyForwards(u32, p.look_src[0 .. w - 1], p.look_src[1..w]);
w -= 1;
}
p.look_src[w] = pane.serial;
p.n_look_src = w + 1;
p.look_walk_owner = pane.serial;
}
/// Arm n/N on a concrete live pane without pretending that pane has
/// already performed a Look. Result producers use this when a fresh or
/// refilled list supersedes older walk history. An empty answer cannot
/// supersede anything: it has no position to resume, so preserve the pane
/// whose prior Look established the walk instead of stealing provenance.
pub fn armLookWalk(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
if (pane.file) |file| if (file.content.len == 0) return;
p.look_walk_owner = pane.serial;
}
/// Chunk arbitrary-length bytes into fixed-size write effects, order kept.
///
/// The ring refuses when full rather than evicting, which is right for every
/// other effect and WRONG for a byte stream: the tail of a large paste was
/// dropped where the program needed it whole (and, under bracketed paste, the
/// closing marker went with it, leaving the program in paste mode). What does
/// not fit parks in `pending_write` and `nextEffect` feeds it back as the host
/// drains, so this never truncates while `pending_write_cap` has room.
pub fn emitWrite(p: *Pardes, id: usize, bytes: []const u8) void {
var off: usize = 0;
// Anything already parked for this pane owns the stream's position, so
// new bytes queue BEHIND it — emitting them now would reorder the pty.
if (p.pending_write[id] == null) {
while (off < bytes.len and p.effects_len < p.effects.len) {
const n = @min(bytes.len - off, 64);
p.emit(.{ .write = .{ .pane = @intCast(id), .bytes = .from(bytes[off .. off + n]) } });
off += n;
}
}
if (off < bytes.len) p.parkPendingWrite(id, bytes[off..]);
}
/// Take ownership of bytes the ring had no room for. A failed allocation or
/// an exhausted cap degrades to the old behaviour — dropping the tail — because
/// the alternative on a full heap is refusing to run at all.
fn parkPendingWrite(p: *Pardes, id: usize, bytes: []const u8) void {
if (comptime limits.pending_write_cap == 0) return;
if (p.pending_write_bytes + bytes.len > limits.pending_write_cap) return;
if (p.pending_write[id]) |*pw| {
// Compact what the drain already sent before growing: a burst that
// arrives in pieces must not keep re-copying bytes nobody wants.
const keep = pw.bytes.len - pw.off;
const grown = p.gpa.alloc(u8, keep + bytes.len) catch return;
@memcpy(grown[0..keep], pw.bytes[pw.off..]);
@memcpy(grown[keep..], bytes);
p.gpa.free(pw.bytes);
pw.* = .{ .bytes = grown };
} else {
p.pending_write[id] = .{ .bytes = p.gpa.dupe(u8, bytes) catch return };
}
p.pending_write_bytes += bytes.len;
}
/// The shell reports the spawned pane's working directory (and later cwd
/// changes it observes, e.g. via /proc/<pid>/cwd before each frame).
pub fn setCwd(p: *Pardes, id: usize, cwd: []const u8) void {
const pane = p.panes[id] orelse return;
const n = @min(cwd.len, pane.cwd_buf.len);
const cur = switch (pane.cwd) {
.owned => |dir| dir,
else => "",
};
if (cur.len == n and std.mem.eql(u8, cur, cwd[0..n])) return;
if (p.lookHoverPane() == id) p.cancelLookHover();
pane.setOwnedCwd(cwd[0..n]);
}
/// Can a command line be typed into this pane RIGHT NOW: a terminal whose
/// tty still belongs to the prompt the host forked. A terminal running vim
/// answers false and is then treated exactly like a document pane — the
/// command goes to some other shell (ttyForDir), because keystrokes are all
/// a full-screen program would make of it.
///
/// The occupancy half of that question is the host's to answer (look.ttyTaken
/// walks the processes under the pane's shell pid against the tty's
/// foreground process group) and it is asked HERE, lazily: only for a pane a
/// command line is about to go to, and only at the moment it is about to go
/// there. It used to be pushed in by every host on every frame for every
/// pane, which bought nothing — nothing else in the core has ever wanted the
/// answer, and a verdict one frame old is a worse one than a verdict taken
/// now. The cheap half is tested first, so a pane in the wrong directory
/// costs no syscalls at all.
///
/// No query (web has no processes, a dump replay has no shells yet, and the
/// core's own tests install their own) means every terminal is a prompt,
/// which is exactly how pardes behaved before the probe existed.
fn takesCommandLine(p: *const Pardes, id: usize) bool {
const pane = p.panes[id] orelse return false;
if (!pane.isTerminal()) return false;
return !p.hostTtyTaken(id);
}
/// What a shell should exec for the next terminal — a bare name to be
/// looked up, or an absolute path to be used as it stands. The resolving
/// is the shells' half: the core has no filesystem to ask.
pub fn shellBin(p: *const Pardes) []const u8 {
const selected = p.settings.shell.requested.get();
return if (selected.len == 0) config.default_shell else selected;
}
/// The native host resolved the request (or chose a fallback) for a real
/// spawn. Record the executable that actually ran; web never calls this
/// because it has no process backend.
pub fn acknowledgeShell(p: *Pardes, id: usize, executable: []const u8, prompt_marks: bool) void {
if (id < MAX_PANES) term_pane.shellSpawned(p, id, prompt_marks);
if (p.settings.shell.effective.set(executable))
p.settings.shell.pending = false;
}
/// Small backend reads over the same plain state the builtins mutate.
/// Take the newest unresolved Font request once. `pending` remains true
/// until the host explicitly acknowledges success or rejection; requested
/// name/path remain queryable either way.
pub fn takeFontRequest(p: *Pardes) ?[]const u8 {
if (comptime !font_picker) return null;
if (!p.settings.font.pending or p.font_request_taken) return null;
const path = p.settings.font.requested_path.get();
if (path.len == 0) return null;
p.font_request_taken = true;
return path;
}
/// Record the face a GUI host is currently wearing. Boot, zoom and backing
/// scale changes are observations, not answers to a pending Font request:
/// only acknowledgeFont may resolve one after takeFontRequest handed it to
/// the host.
pub fn observeFont(
p: *Pardes,
effective_name: []const u8,
effective_size_hundredths: u16,
unit: FontSizeUnit,
) bool {
if (comptime !font_picker) return false;
if (!p.settings.font.effective_name.set(effective_name)) return false;
p.settings.font.effective_size_hundredths = effective_size_hundredths;
p.settings.font.effective_size_unit = unit;
return true;
}
/// Resolve the request already handed to the GUI host. Requested and
/// effective tuples deliberately remain separate so Config can show both.
pub fn acknowledgeFont(
p: *Pardes,
effective_name: []const u8,
effective_size_hundredths: u16,
unit: FontSizeUnit,
) bool {
if (comptime !font_picker) return false;
if (!p.settings.font.pending or !p.font_request_taken) return false;
const changed = !std.mem.eql(
u8,
p.settings.font.effective_name.get(),
effective_name,
) or p.settings.font.effective_size_hundredths != effective_size_hundredths or
p.settings.font.effective_size_unit != unit;
if (!p.observeFont(effective_name, effective_size_hundredths, unit)) return false;
p.settings.font.pending = false;
p.font_request_taken = false;
// The host has already replaced its face/atlas at this boundary. Even
// when the new face measures to the same grid, a frozen old panel
// layer cannot truthfully be rasterized through those new glyphs.
if (changed) p.abandonPanelAnimations();
return true;
}
pub fn rejectFont(p: *Pardes) void {
if (comptime !font_picker) return;
if (!p.settings.font.pending or !p.font_request_taken) return;
p.settings.font.pending = false;
p.font_request_taken = false;
}
fn nextThemeFileGeneration(p: *Pardes) u32 {
p.theme_file_generation +%= 1;
if (p.theme_file_generation == 0) p.theme_file_generation = 1;
return p.theme_file_generation;
}
/// Resolve and queue `ThemeFile` without doing filesystem work in the
/// core. Relative paths belong to the per-user config directory; absolute
/// paths remain useful for trying a file elsewhere.
pub fn requestThemeFile(p: *Pardes, id: usize, argument: []const u8) void {
if (comptime !hosted) return;
const input = std.mem.trim(u8, argument, " \t\r\n");
if (input.len == 0 or !std.mem.endsWith(u8, input, ".zon")) {
p.reportError(id, "theme file", error.InvalidThemePath);
return;
}
const absolute = std.fs.path.isAbsolute(input);
if (!absolute and p.opts.config_dir == null) {
p.reportError(id, "theme file", error.NoConfigDirectory);
return;
}
var joined: [4095]u8 = undefined;
const resolved = if (absolute) input else path: {
const dir = p.opts.config_dir.?;
const separator = std.Io.Dir.path.sep;
const needs_separator = dir.len > 0 and dir[dir.len - 1] != separator;
const len = dir.len + @intFromBool(needs_separator) + input.len;
if (len > joined.len) {
p.reportError(id, "theme file", error.PathTooLong);
return;
}
@memcpy(joined[0..dir.len], dir);
var at = dir.len;
if (needs_separator) {
joined[at] = separator;
at += 1;
}
@memcpy(joined[at..][0..input.len], input);
break :path joined[0..len];
};
if (!p.theme_file_path.set(resolved)) {
p.reportError(id, "theme file", error.PathTooLong);
return;
}
p.theme_file_pane = @intCast(@min(id, MAX_PANES - 1));
const generation = p.nextThemeFileGeneration();
p.emit(.{ .theme_file = .{ .generation = generation, .on = true } });
}
pub const ThemeFileRequest = struct {
path: []const u8,
pane: u8,
};
/// Borrow the current request while a native host performs its synchronous
/// read. A later command invalidates an already-queued generation.
pub fn themeFileRequest(p: *const Pardes, generation: u32) ?ThemeFileRequest {
if (generation == 0 or generation != p.theme_file_generation) return null;
const path = p.theme_file_path.get();
if (path.len == 0) return null;
return .{ .path = path, .pane = p.theme_file_pane };
}
pub fn failThemeFile(p: *Pardes, generation: u32, err: anyerror) void {
const request = p.themeFileRequest(generation) orelse return;
p.reportError(request.pane, "theme file", err);
}
/// Parse and atomically wear one exact ZON snapshot. Parse failure leaves
/// the last valid custom/built-in theme untouched. `animate` is false for
/// the launcher's pre-frame drain and true for an interactive load/reload.
pub fn loadThemeFile(p: *Pardes, generation: u32, bytes: []const u8, animate: bool) bool {
const request = p.themeFileRequest(generation) orelse return false;
if (bytes.len > 1024 * 1024) {
p.reportError(request.pane, "theme file", error.ThemeFileTooLarge);
return false;
}
const source = p.gpa.dupeZ(u8, bytes) catch |err| {
p.reportError(request.pane, "theme file", err);
return false;
};
defer p.gpa.free(source);
var diagnostics: std.zon.parse.Diagnostics = .{};
defer diagnostics.deinit(p.gpa);
const parsed = std.zon.parse.fromSliceAlloc(Theme, p.gpa, source, &diagnostics, .{}) catch |err| {
p.reportError(request.pane, "theme file", err);
return false;
};
if (parsed.name.len == 0 or parsed.name.len > 255) {
std.zon.parse.free(p.gpa, parsed);
p.reportError(request.pane, "theme file", error.InvalidThemeName);
return false;
}
const target_chrome = ChromeTheme.fromTheme(&parsed);
if (animate and p.animate_theme_changes)
p.chrome_animation.retarget(target_chrome)
else
p.chrome_animation.snap(target_chrome);
const old = p.custom_theme;
p.custom_theme = parsed;
p.custom_theme_active = true;
if (old) |theme_value| std.zon.parse.free(p.gpa, theme_value);
p.invalidateThemeDependentRasters();
_ = p.scratch.reset(.retain_capacity);
p.sync();
return true;
}
/// Post the transient message on `id`'s last row. Called by a SHELL once
/// the IO it narrates has actually happened, exactly as the shell completes
/// a `save_file` effect: the core neither writes files nor owns a
/// clock, so both the outcome and the wall time in `text` come from there
/// (message.zig spells it, once, for both native shells).
///
/// Nothing here decides WHEN it goes away — update does, on the next key or
/// mouse event — and nothing here knows whether the row is free: an armed
/// prompt simply outranks a message at render time, so a message posted
/// under one is stored and invisible rather than refused.
pub fn setMessage(p: *Pardes, id: usize, text: []const u8) void {
if (id >= MAX_PANES) return;
const pane = p.panes[id] orelse return;
pane.msg_len = @intCast(@min(text.len, pane.msg.len));
@memcpy(pane.msg[0..pane.msg_len], text[0..pane.msg_len]);
}
pub fn reportError(p: *Pardes, id: usize, operation: []const u8, err: anyerror) void {
var buf: [256]u8 = undefined;
const text = std.fmt.bufPrint(&buf, "{s}: {s}", .{ operation, @errorName(err) }) catch operation;
p.setMessage(id, text);
}
/// Apply one watched-path snapshot to the payload which owns that path.
/// True means the pane now represents this successful host transaction;
/// native watchers commit their generation only then, so a transient PDF
/// reopen/allocation failure remains retryable.
fn applyWatchedFileChanged(p: *Pardes, id: u8, bytes: []const u8) bool {
if (id >= MAX_PANES) return false;
const pane = p.panes[id] orelse return false;
if (comptime pdf_enabled) if (pane.pdf != null) {
pdf_pane.reloadWatched(p, pane) catch |err| {
p.reportError(id, "PDF reload", err);
return false;
};
return true;
};
if (pane.file == null) return false;
file_pane.changed(p, id, bytes);
return if (p.panes[id]) |current|
if (current.file) |file| std.mem.eql(u8, file.content, bytes) else false
else
false;
}
/// Synchronous host seam for a watched file. Event.update routes through
/// the same payload operation, while native watchers use this spelling to
/// learn whether they may commit the observed disk generation.
pub fn reloadWatchedFile(p: *Pardes, id: u8, bytes: []const u8) bool {
p.invalidateLookHover(id);
const applied = p.applyWatchedFileChanged(id, bytes);
_ = p.scratch.reset(.retain_capacity);
p.sync();
return applied;
}
/// Content replacement invalidates a preview whose operand was expanded
/// from that pane. Payload modules call this for derived buffers they
/// refresh as part of the same transaction.
pub fn invalidateLookHover(p: *Pardes, id: usize) void {
if (p.lookHoverPane() != id) return;
p.raw_hover_intent = false;
p.cancelLookHover();
}
pub fn emit(p: *Pardes, e: Effect) void {
if (p.effects_len == p.effects.len) return;
const tail = (p.effects_head + p.effects_len) % p.effects.len;
p.effects[tail] = e;
p.effects_len += 1;
}
pub fn nextEffect(p: *Pardes) ?Effect {
// Before the emptiness test, not after: a pane whose tail is parked
// must not read as "no effects left" while the host's drain loop is
// still asking. This is what turns a truncated paste into a delayed one.
p.refillPendingWrites();
if (p.effects_len == 0) {
p.effects_head = 0;
return null;
}
const e = p.effects[p.effects_head];
p.effects_head = (p.effects_head + 1) % p.effects.len;
p.effects_len -= 1;
return e;
}
/// Move parked pty bytes into whatever room the ring now has, oldest pane
/// slot first. Costs one comparison when nothing is parked.
fn refillPendingWrites(p: *Pardes) void {
if (p.pending_write_bytes == 0) return;
for (&p.pending_write, 0..) |*slot, id| {
while (p.effects_len < p.effects.len) {
// `|*pw|` points INTO the slot: capturing by value would advance
// a copy's cursor and re-send the same chunk for ever.
const pw = if (slot.*) |*live| live else break;
const n = @min(pw.bytes.len - pw.off, 64);
p.emit(.{ .write = .{ .pane = @intCast(id), .bytes = .from(pw.bytes[pw.off..][0..n]) } });
pw.off += n;
p.pending_write_bytes -= n;
if (pw.off == pw.bytes.len) {
p.gpa.free(pw.bytes);
slot.* = null;
break;
}
}
if (p.effects_len == p.effects.len) return;
}
}
/// Drop a pane's parked bytes: its pty is gone, and the slot it occupied
/// may be handed to a different pane next frame.
fn dropPendingWrite(p: *Pardes, id: usize) void {
const pw = p.pending_write[id] orelse return;
p.pending_write_bytes -= pw.bytes.len - pw.off;
p.gpa.free(pw.bytes);
p.pending_write[id] = null;
}
/// Queue input for the next `pump`. Single-threaded, and a VALUE queue: an
/// event that carries a borrowed slice cannot survive the trip, so this
/// asserts rather than documents it. Hand those to `update` directly inside
/// the host's borrow window instead — which is also what keeps the pty read
/// path copy-free.
pub fn postEvent(p: *Pardes, ev: Event) void {
switch (ev) {
.key => |k| std.debug.assert(k.text.len == 0),
.output, .paste, .lsp_resp, .pipe_resp, .file_changed, .command, .fs_req => unreachable,
else => {},
}
if (p.in_len == p.in_q.len) return;
p.in_q[(p.in_head + p.in_len) % p.in_q.len] = ev;
p.in_len += 1;
}
fn nextQueued(p: *Pardes) ?Event {
if (p.in_len == 0) {
p.in_head = 0;
return null;
}
const ev = p.in_q[p.in_head];
p.in_head = (p.in_head + 1) % p.in_q.len;
p.in_len -= 1;
return ev;
}
/// Has a program taken this pane's tty? A host that cannot tell says no,
/// which is how pardes behaved before the probe existed. Public because
/// `pty/status` reports it: it is the one field of that file the core does
/// not own itself, and asking here rather than reaching for the vtable in
/// acmefs keeps the null-method default in one place.
pub fn hostTtyTaken(p: *const Pardes, id: usize) bool {
const f = p.host.vtable.pull_tty_taken orelse return false;
return f(p.host.ctx, @intCast(id));
}
fn hostWriteFile(p: *Pardes, pane: u8, path: []const u8, bytes: []const u8) void {
if (p.host.vtable.push_write_file) |f| return f(p.host.ctx, pane, path, bytes);
p.fallback.writeFile(path, bytes);
}
/// The path a watch is about: a real file's, or a PDF's.
fn watchPath(p: *const Pardes, id: u8) ?[]const u8 {
const pane = p.panes[id] orelse return null;
if (pane.file) |f| return if (f.output == null) f.path else null;
return pane.pdfPath();
}
/// THE BYTES BEHIND AN `.fs_reply`, resolved in the drain. A filesystem
/// read answers with either something the handler formatted (staged in the
/// core, valid until the next request) or a window onto a pane's live text,
/// which is handed over WITHOUT A COPY — the same trick, and the same
/// serial check, `.save_text` uses to write a megabyte it never duplicated.
/// A slot reused between the answer and this call resolves to nothing
/// rather than to another pane's text.
pub fn fsPayload(p: *const Pardes, r: acmefs.Reply) []const u8 {
return switch (r.payload) {
.none => &.{},
.staged => |n| p.fs.out.items[0..@min(n, p.fs.out.items.len)],
.region => |g| region: {
const pane = p.panes[g.pane] orelse break :region &.{};
if (pane.serial != g.serial) break :region &.{};
const text = if (pane.file) |*f| f.content else break :region &.{};
const lo = @min(g.off, text.len);
break :region text[lo..@min(lo + g.len, text.len)];
},
};
}
/// Perform one effect through the host, falling back per METHOD (not per
/// host) to the in-process implementation. This is the switch that used to
/// be copied into all four shells.
pub fn perform(p: *Pardes, e: Effect) void {
const v = p.host.vtable;
switch (e) {
.spawn => |s| if (v.push_spawn) |f| f(p.host.ctx, s.pane, s.cwd.slice()) else {
p.fallback.spawned[s.pane] = true;
},
// A pane with no child is silent: nothing invents output on its
// screen, and the bytes are dropped rather than transcribed.
.write => |w| if (v.push_pty_write) |f| f(p.host.ctx, w.pane, w.bytes.slice()),
.resize_pty => |r| if (v.push_pty_resize) |f| f(p.host.ctx, r.pane, r.cols, r.rows),
// A host with no signal method has no child to signal: the
// fallback host's ptys are silent (see `.write` above), so there
// is nothing to record and nothing to lie about.
.signal_pty => |s| if (v.push_pty_signal) |f| f(p.host.ctx, s.pane, s.sig),
.open_link => |u| if (v.push_open_link) |f|
f(p.host.ctx, u.slice())
else
p.fallback.setLink(u.slice()),
.save_file => |sf| {
const pane = p.panes[sf.pane] orelse return;
const f = pane.file orelse return;
p.hostWriteFile(sf.pane, f.path, f.content);
},
.save_text => |st| {
const pane = p.panes[st.pane] orelse return;
if (pane.serial != st.serial) return; // a recycled slot: not ours
if (pane.file) |f| return p.hostWriteFile(st.pane, st.path.slice(), f.content);
if (!pane.isTerminal()) return;
const text = term_pane.screenTextAlloc(pane, p.gpa) catch return;
defer p.gpa.free(text);
p.hostWriteFile(st.pane, st.path.slice(), text);
},
.write_dump => {
const out = p.dump_out orelse return;
if (v.push_write_dump) |f| {
f(p.host.ctx, out);
} else {
// A real host reports where it landed, which is what puts
// `Restore <path>` in the topbar; the virtual one owes the
// same, or the bytes it holds are unreachable.
p.fallback.writeFile(fallback_dump_path, out);
p.setLastDump(fallback_dump_path);
}
},
.set_clipboard => {
const text = p.yank orelse "";
if (v.push_set_clipboard) |f| f(p.host.ctx, text) else p.fallback.setClipboard(text);
},
// No desktop to ask: answer from the in-process clipboard at once,
// which is the same shape as a host answering later.
.read_clipboard => if (v.pull_read_clipboard) |f|
f(p.host.ctx)
else
p.update(.{ .paste = p.fallback.clipboard.items }),
.lsp => |q| if (v.pull_lsp) |f|
f(p.host.ctx, .{ .id = q.id, .kind = q.kind, .pane = q.pane, .offset = q.offset, .arg = q.arg.slice() })
else
p.update(.{ .lsp_resp = .{ .id = q.id, .rows = "" } }),
.pipe => |q| if (v.pull_pipe) |f|
f(p.host.ctx, q.id)
else
p.update(.{ .pipe_resp = .{ .id = q.id, .success = false, .outputs = &.{} } }),
.watch => |w| if (v.push_watch_file) |f|
f(p.host.ctx, w.pane, p.watchPath(w.pane) orelse "", w.on)
else {
p.fallback.watched[w.pane] = w.on;
},
.theme_file => |t| if (v.push_watch_theme) |f| f(p.host.ctx, t.generation, t.on),
.dump_themes => |d| if (v.push_dump_themes) |f| f(p.host.ctx, d.pane),
// The bytes are read off the core HERE, in the drain, exactly as
// save_file reads a file pane: the reply named where they live and
// this is the borrow window. A host with no filesystem serving
// cannot have asked, so a null method is not a dropped answer.
.fs_reply => |r| if (v.push_fs_reply) |f| f(p.host.ctx, &r, p.fsPayload(r)),
// THE ONE EFFECT NO HOST METHOD CAN SERVE: attaching REPLACES the
// core this call is running inside — `pump` is two frames up the
// stack — so all it may do here is record the request where the
// shell's outer loop finds it, which is Restore's shape exactly.
// Reaching it through the ring rather than straight from the
// builtin is what ORDERS it: a `Save` queued by the same update is
// performed first, so nothing you typed is still unwritten when
// the screen changes owners. A shell that never polls (the
// browser, the board) simply cannot attach, which is the truth
// about a machine with no unix socket to attach to.
.attach => |a| {
const name = a.name.slice();
@memcpy(p.attach_buf[0..name.len], name);
p.attach_req = .{ .pane = a.pane, .name = p.attach_buf[0..name.len] };
},
// ...and its counterpart, which a host CAN serve and usually does
// not. Only a detached core's host fills `push_detach` in; a local
// tty or SDL shell leaves it null, and the honest answer there is
// a message row rather than a frontend that quits or a word that
// silently does nothing. A null-method fallback and not a comptime
// gate, because whether there is a session to leave is a fact
// about this RUN — the same binary attaches one minute and does
// not the next.
.detach => |d| if (v.push_detach) |f|
f(p.host.ctx)
else
p.reportError(d.pane, "detach", error.NotAttached),
// the loop's own condition; a host tears down after its own loop
.quit => p.quit = true,
}
}
/// ONE ITERATION OF THE LOOP, and the reason the core owns it: the ORDER
/// here — wait, apply input, perform effects, poll, render, present — was
/// copied into four shells and drifted in each. A host supplies the parts
/// only it can (blocking, pixels, processes) and nothing else.
///
/// It is one PUMP and never a `while`: no host gives up its outer loop.
/// AppKit owns NSApplication's run loop, the browser owns the frame
/// callback, and both Linux hosts keep a thin one so Restore can swap the
/// whole core between frames.
pub fn pump(p: *Pardes, h: Host) !void {
p.host = h;
const v = h.vtable;
if (v.pull_wait_input) |f| f(h.ctx, if (p.animationActive()) animation.frame_ms else 0);
while (p.nextQueued()) |ev| p.update(ev);
while (p.nextEffect()) |e| p.perform(e);
// A quitting frame has already freed what it would draw.
if (p.quit) return;
if (v.push_poll_frame) |f| f(h.ctx);
_ = p.frame_arena.reset(.retain_capacity);
const surface = try p.render(p.frame_arena.allocator());
if (v.push_present) |f| f(h.ctx, surface);
if (v.push_post_present) |f| f(h.ctx);
// Animation TIME is not spent here. `wait_input` was told how long it
// may sleep; a display clock wakes faster than that on input, so only
// the host knows when a real frame interval has passed. Each spends it
// by handing back one `.tick`.
}
pub fn update(p: *Pardes, ev: Event) void {
// Free a motion surface that went bad during the LAST update, before
// anything in this one can ask for it. Nothing frees it mid-update:
// handlers hand `rows` around for the length of a single update.
p.shell_rows.sweep(p.gpa);
// A preview describes the frame under an idle pointer. Any state
// change can replace that text or geometry, so it cancels; buttonless
// motion is the one event that debounces/re-arms it, and ticks only
// age the current candidate.
switch (ev) {
.tick => {},
.mouse => |m| if (!(m.button == .none and m.kind == .motion)) {
p.raw_hover_intent = false;
p.cancelLookHover();
},
.output => |o| if (p.lookHoverPane() == o.pane) {
p.raw_hover_intent = false;
p.cancelLookHover();
},
.file_changed => |changed| if (p.lookHoverPane() == changed.pane) {
p.raw_hover_intent = false;
p.cancelLookHover();
},
.pdf_scroll => |scroll| if (p.lookHoverPane() == scroll.pane) {
p.raw_hover_intent = false;
p.cancelLookHover();
},
else => {
p.raw_hover_intent = false;
p.cancelLookHover();
},
}
// A transient message is exactly as old as your last input: touch the
// keyboard or the mouse and it is gone, on every pane, because a
// message is a report and you have just proved you are back. Only
// INPUT counts — a resize, pty output, a watch or an answering worker
// all repaint without you, and a message that a background shell could
// wipe would be one you never got to read.
//
// An ARMED PROMPT is a different occupant of the same row and is not
// touched here: it lives in tag_tail, it is what the keystroke is being
// typed INTO, and it ends at Enter or Esc. So clearing here can never
// fight one — at worst it clears something the prompt was already
// hiding.
switch (ev) {
.key, .mouse => {
for (p.panes) |slot| {
if (slot) |pane| pane.msg_len = 0;
}
// ...and the same reasoning bounds a clipboard read in flight.
// A terminal that gates or refuses the OSC 52 request never
// answers at all, so the request cannot be allowed to sit and
// then fire minutes later into whatever pane is focused by
// then: it lives exactly until your next keystroke, and a
// shell that answers within one round trip (every one but a
// refusing tty) is unaffected.
p.clip_pending = null;
},
else => {},
}
// Which input this update IS, in acme's origin alphabet, so every
// event record the handlers below produce is attributed without any
// of them being told: `K` for the keyboard, `M` for the mouse. A
// filesystem write says `E`/`F` for itself (see acmefs).
if (p.fs.listeners != 0) p.fs.origin = switch (ev) {
.key => 'K',
.mouse => 'M',
else => p.fs.origin,
};
switch (ev) {
.resize => |sz| {
p.snap_panel_layout_once = true;
if (comptime pdf_enabled) {
var before: [MAX_PANES]?pdf_pane.Viewport = @splat(null);
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
if (pane.pdf != null) before[id] = pdf_pane.paneViewport(p, pane);
}
p.screen_w = sz.cols;
p.screen_h = sz.rows;
p.cell_pixels.w = @max(1, sz.cell_pixels.w);
p.cell_pixels.h = @max(1, sz.cell_pixels.h);
// Compare the effective per-pane pixel viewport, not the
// resize event itself: duplicate SIGWINCH notifications
// must not undo a reader's manual pan.
p.computeGeom();
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
if (pane.pdf) |*pv| {
if (!std.meta.eql(before[id], pdf_pane.paneViewport(p, pane))) {
pdf_pane.captureLayoutAnchor(pv);
pv.layout_valid = false;
pv.search_reveal_pending = pv.search_query.len > 0;
}
}
}
} else {
p.screen_w = sz.cols;
p.screen_h = sz.rows;
}
p.resize_count += 1;
},
.output => |o| {
const pane = p.panes[o.pane] orelse return;
// The RAW bytes, before the emulator eats them. `pty/data`'s
// read is the only thing that wants them — the grid is a
// rendering and cannot be un-rendered — and this is one load
// and one branch on a pane nobody is reading. See
// `acmefs.notePtyOutput`.
acmefs.notePtyOutput(p, o.pane, o.bytes);
term_pane.feedOutput(p, pane, o.bytes);
},
.eof => |e| p.removePane(e.pane),
.lsp_resp => |r| p.lspResponse(r.id, r.rows),
.pipe_resp => |r| p.pipeResponse(r.id, r.success, r.outputs),
.file_changed => |fc| _ = p.applyWatchedFileChanged(fc.pane, fc.bytes),
.key => |key| p.handleKey(key),
.mouse => |m| {
// Layout is only committed on RELEASE. Mark that one frame as
// a direct-manipulation snap before dragRelease mutates the
// weights; text/tag/PDF drags never touch panel presentation.
if (m.kind == .release) switch (p.drag) {
.border_v, .border_h, .move => p.snap_panel_layout_once = true,
else => {},
};
p.handleMouse(m);
},
.pdf_scroll => |scroll| {
if (comptime pdf_enabled) {
if (scroll.pane < MAX_PANES) {
if (p.panes[scroll.pane]) |pane| {
if (hasPdf(pane) and p.native_images)
_ = pdf_pane.scrollPane(p, pane, @floatCast(scroll.delta_pixels));
}
}
}
},
.paste => |bytes| p.applyPaste(bytes),
.command => |line| _ = p.executeBuiltinLine(p.active, line),
// One filesystem request in, one answer out, in this update. The
// whole of the concurrency is that the transport asked from the
// loop thread; see acmefs.zig's header.
.fs_req => |r| p.emit(.{ .fs_reply = acmefs.handle(p, r) }),
.pinch => |scale| p.ov_pinch_scale = scale,
.touch_scroll => |delta| p.ov_touch_scroll_delta = delta,
.pointer_leave => p.pointer_inside = false,
.tick => {
p.chrome_animation.advance();
p.advancePanelAnimations();
p.advanceLookHover();
},
}
_ = p.scratch.reset(.retain_capacity);
p.sync();
p.fsReport();
}
/// TAG EDITS, which no single call site owns: a tag is assembled from a
/// live prefix and an editable tail by half a dozen paths (typing, a prompt
/// arming, a Save clearing the dirty marker, a shell reporting a new cwd),
/// so it is diffed at the END of an update, where it is finally settled.
/// acme can hook `textinsert` on the tag itself because its tag IS a text
/// buffer; pardes's is a rendering, so the diff is the honest equivalent.
///
/// Costs nothing when nobody is listening: one branch, and the snapshots
/// are only allocated for panes a script has opened.
fn fsReport(p: *Pardes) void {
if (p.fs.listeners == 0) return;
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
if (!p.fs.scripted(id)) continue;
const tag = p.tagText(p.scratch.allocator(), pane) catch continue;
const snap = &p.fs.panes[id].tag_snap;
if (std.mem.eql(u8, snap.items, tag)) continue;
// First sight of a tag is not an edit: the script just opened the
// file and can read `tag` for itself. `release` drops the snapshot
// with the last reader, so this stays true across re-opens.
if (snap.capacity != 0 or snap.items.len != 0)
acmefs.noteReplace(p, id, true, snap.items, tag);
snap.clearRetainingCapacity();
snap.appendSlice(p.gpa, tag) catch {};
}
}
/// THE DEFAULT REGISTER, and nothing else. helix: an ordinary `y`/`d`/`c`
/// writes here and the system clipboard never hears about it — which is
/// also the bug this spelling fixes, because a mirror on every write made
/// deleting one character clobber whatever the desktop was holding.
/// `SPC y` is the command that crosses over (setClipboard below).
fn setYank(p: *Pardes, text: []const u8) void {
// Inside a multi-selection replay the register collects EVERY range's
// text, in document order — the passes run last-range-first, so each
// new piece goes in front of what is already there.
// ponytail: helix keeps one register VALUE per range and pastes
// value[i] back at range[i]; pardes has a single register, so N
// cursors yank one newline-joined blob and a paste puts that whole
// blob at every cursor. Written down as a differential waiver rather
// than faked — a per-range register is its own feature.
if (p.multi_on and !p.multi_first) {
const old = p.yank orelse "";
const sep: []const u8 = if (text.len > 0 and text[text.len - 1] == '\n') "" else "\n";
const joined = std.fmt.allocPrint(p.gpa, "{s}{s}{s}", .{ text, sep, old }) catch return;
if (p.yank) |y| p.gpa.free(y);
p.yank = joined;
return;
}
if (p.yank) |y| p.gpa.free(y);
p.yank = p.gpa.dupe(u8, text) catch null;
}
/// ...and the register PLUS the system clipboard, which is the whole
/// difference between `y` and `SPC y`.
///
/// One mirror per KEYSTROKE rather than per cursor: a multi-selection
/// replay runs last-range-first and `multi_first` marks its first pass, so
/// emitting there queues exactly one effect — and the shell reads
/// `core.yank` when it DRAINS, by which time every later pass has folded
/// its range in. That asymmetry used to be a silent hole: the old mirror
/// sat past the join's early return, so a multi-cursor yank reached the
/// clipboard on one cursor and not on two.
fn setClipboard(p: *Pardes, text: []const u8) void {
p.setYank(text);
if (!p.multi_on or p.multi_first) p.emit(.{ .set_clipboard = {} });
}
/// Where a `SPC p` / `SPC P` / `SPC R` goes once the shell answers.
pub const ClipRequest = struct {
pane: usize,
/// the pane's identity, not its slot: the answer can arrive whole
/// keystrokes later (a tty's OSC 52 round trip) and a freed slot is
/// reused by an unrelated pane.
serial: u32,
mode: enum { after, before, replace },
};
/// `SPC p` / `SPC P` / `SPC R`: ask the shell for the system clipboard and
/// remember what to do with it. The request is deliberately fire-and-hope
/// — a terminal that refuses the OSC 52 read simply never answers, and the
/// next keystroke drops the request (see update) rather than letting a
/// paste land minutes late in whatever pane is focused by then.
pub fn clipRequest(p: *Pardes, id: usize, mode: @FieldType(ClipRequest, "mode")) void {
const pane = p.panes[id] orelse return;
p.clip_pending = .{ .pane = id, .serial = pane.serial, .mode = mode };
p.emit(.read_clipboard);
}
/// Type text at a pane's program, the way a terminal emulator pastes:
/// bracketed when the app set mode 2004 (readline/vim/helix strip the
/// markers and refuse to run what arrives), else with `\n` turned to `\r`,
/// because a raw newline in an unbracketed paste IS the Enter key and a
/// multi-line paste would run every line but the last.
pub fn typeToTty(p: *Pardes, id: usize, pane: *const Pane, text: []const u8) void {
if (text.len == 0) return;
if (term_pane.bracketedPaste(pane)) {
p.emitWrite(id, "\x1b[200~");
p.emitWrite(id, text);
p.emitWrite(id, "\x1b[201~");
return;
}
const cp = p.scratch.allocator().dupe(u8, text) catch return;
for (cp) |*ch| {
if (ch.* == '\n') ch.* = '\r';
}
p.emitWrite(id, cp);
}
/// The shell answered with system-clipboard text — or the desktop pasted
/// into us unasked. Either way the bytes are pasted WITHOUT going through
/// the register: helix's clipboard commands and the default register are
/// separate stores, and a paste that quietly overwrote your `y` would be
/// the same clobbering bug in the other direction.
fn applyPaste(p: *Pardes, bytes: []const u8) void {
const req = p.clip_pending;
p.clip_pending = null;
if (bytes.len == 0) return;
const id = if (req) |r| r.pane else p.active;
const pane = p.panes[id] orelse return;
if (req) |r| if (pane.serial != r.serial) return;
p.active = id;
// A pane in tty mode has no editable buffer to paste INTO — the pty
// owns its screen. Type the bytes at the program instead, which is
// also what makes a desktop paste (Ctrl-Shift-V, middle click, the
// window manager's own) reach a shell at all.
if (pane.isTerminal() and pane.mode == .tty) return p.typeToTty(id, pane, bytes);
switch (if (req) |r| r.mode else .after) {
.after => p.pasteText(pane, bytes, false),
.before => p.pasteText(pane, bytes, true),
.replace => p.replaceWithText(pane, bytes),
}
}
/// `SPC y` / `SPC Y`: the selection to the system clipboard. `main_only`
/// is helix's capital — every cursor's text joined, versus the primary
/// selection's alone. A PDF has no editable buffer to replay over, so its
/// own selection answers directly.
pub fn clipYank(p: *Pardes, pane: *Pane, main_only: bool) void {
if (comptime pdf_enabled) if (pane.pdf) |pv| {
if (pv.selection_text.len > 0) p.setClipboard(pv.selection_text);
return;
};
// the ordinary `y` path, so what reaches the clipboard is exactly what
// the key would have put in the register — including the multi-cursor
// join, which is replaySels' business and not a second implementation
if (pane.nsel > 0 and !main_only) {
p.replaySels(pane, .{ .normal = .{ .edit = .{ .kind = .yank, .count = 1 } } });
} else {
const others = pane.nsel;
pane.nsel = 0;
p.normalYank(pane);
pane.nsel = others;
}
p.emit(.{ .set_clipboard = {} });
}
/// A per-KEYSTROKE action reached from inside a per-SELECTION replay —
/// one that opens, closes or focuses a pane, or asks the language backend.
/// It must happen once rather than once per cursor, and once it has, the
/// remaining passes are meaningless (the pane they would edit may be gone),
/// so the replay stops. True = this pass may go ahead.
fn multiOnce(p: *Pardes) bool {
if (!p.multi_on) return true;
p.multi_stop = true;
return p.multi_first;
}
// ---- tag + selection text (chord sources) ----
/// the live tag prefix: the pane's cwd/path, plus pane-local state whose
/// owner reports it (PDF view and image renderer choices). Those choices
/// mutate only through builtins under SPC t. The mode used to lead this as a word; it is
/// the one character in the layout box now (renderPane), so every tagline
/// starts four columns further left and spends them on the path instead.
///
/// Arena-allocated like everything the renderer is handed — the tag is
/// retained through the frame and a cwd can be rewritten under us by the
/// next shell report, so this owns its bytes rather than lending the
/// pane's.
pub fn tagPrefix(p: *Pardes, pane: *Pane) ![]u8 {
const arena = p.scratch.allocator();
if (comptime pdf_enabled) if (pane.pdf) |pv| return std.fmt.allocPrint(
arena,
"pdf {d}/{d} {s} PdfFit {s} PdfTint PdfSections {s}",
.{ pv.page + 1, pv.page_count, @tagName(pv.fit), @tagName(pv.tint), pv.path },
);
if (pane.image) |*state| return image_pane.tagPrefix(arena, state);
if (pane.file) |f| {
if (output_pane.fileTraits(f.output).saves and f.revision != f.saved_revision)
return std.fmt.allocPrint(arena, "{s}{s}", .{ f.path, dirty_marker });
return arena.dupe(u8, f.path);
}
return arena.dupe(u8, pane.cwdSlice());
}
/// the editable tail: the user's edited buffer once touched, else defaults
fn curTail(pane: *Pane) []const u8 {
if (pane.tag_init) return pane.tagSlice();
return defaultTail(pane);
}
/// The untouched command tail for this pane class. `curTail` and tagGap
/// must ask the same question: otherwise a terminal renders Filter but
/// still votes for the shorter generic tail when a column is aligned.
///
/// Save leads wherever the pane holds text of its own — every pane with a
/// file, an output buffer included, plus every terminal. What is left is an
/// image and a PDF: their bytes on disk already are what they are.
fn defaultTail(pane: *const Pane) []const u8 {
if (pane.file != null) return file_pane_tail;
if (pane.isTerminal()) return terminal_pane_tail;
return pane_tail;
}
fn paneIdOf(p: *const Pardes, pane: *const Pane) ?usize {
for (p.panes, 0..) |slot, id| if (slot) |sp| {
if (sp == pane) return id;
};
return null;
}
/// Spaces to sit between the path and the commands, so the commands END
/// `tag_right_pad` columns short of the pane's edge — right-aligned, with
/// that many columns left free to type in.
///
/// Real spaces rather than a second print at an offset, because the tag is
/// ONE buffer that tag_col, the mouse, the motions and the chord all index
/// by the same columns; two separately-positioned pieces would need a
/// column-to-offset map that none of them has. Being characters is also
/// what makes both paddings editable, which is the point: `:` lands at the
/// start of this gap, and there are `tag_right_pad` free columns past the
/// commands to type into.
///
/// Zero once the tag has been touched. From then on the spaces are IN
/// tag_tail and belong to you — recomputing would both double them and
/// slide the commands sideways under your cursor as you type. So an
/// untouched tag reflows with the pane and an edited one stays put.
///
/// The end column is shared by the whole LAYOUT COLUMN — every DRAWN pane
/// at the same x and width, which is exactly the set whose taglines sit
/// above one another on screen (`h == 0` is a pane squeezed off the bottom
/// by a shrunk window: renderPane returns early on it, so it has no words
/// to line up with and gets no vote). `tag_right_pad` sets the end, but a
/// path too long to fit inside that pad used to collapse only ITS pane's
/// gap to zero, which left one row's commands jammed against the path while
/// the row below kept its out at the pad. Now the column moves out
/// together, so the words stay in a line and a click walks down them.
///
/// Alignment is measured in display cells. Cursor and selection state use
/// UTF-8 byte offsets, then map through the same grapheme-width helpers at
/// the screen boundary.
///
/// Two rules make up the "when possible":
///
/// - a voter that does not FIT is counted at the pane's right edge rather
/// than dropped. Dropping it would leave the rest of the column its
/// typing room, but it is a threshold: one column of resize either side
/// of the fit moves every tagline in the column by the whole pad, and
/// dragging a window edge across that width snaps the words back and
/// forth under the pointer. Clamping buys a crossing one column wide
/// and monotone, and the price is a column of taglines that can end
/// hard against the right edge with nothing left over to type in.
/// - a TOUCHED tag votes with the end it was FROZEN at, not with its live
/// tail: the gap is baked into tag_tail as leading spaces, and counting
/// what you type after the builtins would drag the column sideways on
/// every keystroke. It still takes no gap of its own (above) — but it
/// has to keep voting, or clicking the widest tagline in a column would
/// snap every other one left, out from under the next click.
///
/// ponytail: every voter's prefix is FORMATTED to be measured, so a frame
/// costs up to MAX_PANES² path dupes — 256 bump allocations into the
/// scratch arena that renderPane resets anyway, at a realistic two to four
/// panes. The alternative was a second tagPrefix that only counted, and
/// keeping two spellings of one string in step by comment is the more
/// expensive kind of cost.
fn tagGap(p: *Pardes, pane: *const Pane, used: usize) usize {
if (pane.tag_init) return 0;
const id = p.paneIdOf(pane) orelse return 0;
const r = p.rects[id];
if (r.w <= config.GUTTER) return 0;
const tw: usize = r.w - config.GUTTER;
var end: usize = tw -| config.tag_right_pad;
for (p.panes, 0..) |slot, qid| if (slot) |q| {
const qr = p.rects[qid];
if (qr.h == 0 or qr.x != r.x or qr.w != r.w) continue;
// prefix ++ the spaces in front of the words ++ the words: the
// frozen gap for a touched tail, the default's own single leading
// space for an untouched one (which is why there is no +1 here)
const words = defaultTail(q);
const laid = if (q.tag_init) q.tagSlice() else words;
const lead = laid.len - std.mem.trimStart(u8, laid, " ").len;
const q_end = file_pane.displayWidth(p.tagPrefix(q) catch continue) + lead + file_pane.displayWidth(std.mem.trimStart(u8, words, " "));
end = @max(end, @min(q_end, tw));
};
return end -| used;
}
/// the tag exactly as it is rendered: prefix ++ gap ++ tail. THE text
/// tag_col and tag_anchor index, so the renderer, the mouse, the motions
/// and the chord all read the same bytes at the same columns.
pub fn tagText(p: *Pardes, arena: std.mem.Allocator, pane: *Pane) ![]u8 {
const prefix = try p.tagPrefix(pane);
const tail = curTail(pane);
const gap = p.tagGap(pane, file_pane.displayWidth(prefix) + file_pane.displayWidth(tail));
const out = try arena.alloc(u8, prefix.len + gap + tail.len);
@memcpy(out[0..prefix.len], prefix);
@memset(out[prefix.len..][0..gap], ' ');
@memcpy(out[prefix.len + gap ..], tail);
return out;
}
/// Take the laid-out tail into the pane's own buffer, once, on first touch.
/// The gap comes along as ordinary characters — that is what hands the
/// padding to you to edit, and what freezes it against reflow from here on.
pub fn seedTail(p: *Pardes, pane: *Pane) void {
if (pane.tag_init) return;
const tail = curTail(pane);
const prefix = (p.tagPrefix(pane) catch return);
const gap = p.tagGap(pane, file_pane.displayWidth(prefix) + file_pane.displayWidth(tail));
if (gap + tail.len > pane.tag_tail.len) return;
@memset(pane.tag_tail[0..gap], ' ');
@memcpy(pane.tag_tail[gap..][0..tail.len], tail);
pane.tag_tail_len = gap + tail.len;
pane.tag_init = true;
}
/// focus the tag for editing, seeding the tail on first touch and parking
/// the byte cursor at the grapheme displayed under screen column `col`.
/// NEGATIVE means the tail's first WORD, which is where `:` and a tagline
/// hop land: a place no click can name, so it needs no sentinel of its own
/// and the callers need no prefix length.
fn enterTagEdit(p: *Pardes, pane: *Pane, col: i32) void {
const edit0: i32 = @intCast((p.tagPrefix(pane) catch return).len);
p.seedTail(pane);
if (!pane.tag_init) return;
if (!pane.tag_edit) pane.tag_mode = pane.mode;
pane.tag_edit = true;
pane.tag_sel = false;
// a one-line tag has no use for normal mode: always insert
pane.mode = .insert;
pane.pending = 0;
const end = edit0 + @as(i32, @intCast(pane.tag_tail_len));
// Past the gap that right-aligns the builtins, not at the first
// editable column: `:` promises the tail's START, and the start of a
// run of layout spaces is not it. Landing there would cost `:w` its
// second keystroke — w would select the whitespace and execute nothing
// — and `:w` being the same two keys every time is the whole point of
// the door. The spaces stay editable; h and Left still walk into them.
const tail = pane.tagSlice();
const lead: i32 = @intCast(tail.len - std.mem.trimStart(u8, tail, " ").len);
if (col < 0) {
pane.tag_col = @intCast(@min(edit0 + lead, end));
} else {
const text = p.tagText(p.scratch.allocator(), pane) catch return;
pane.tag_col = @intCast(@min(text.len, file_pane.rawAtDisplay(text, @intCast(col))));
}
}
fn exitTagEdit(pane: *Pane) void {
// tags are always insert; leaving one restores the body mode: files
// back to normal, terminals to whatever they had — a click (this runs
// on every body press) must never change a shell pane's mode
if (pane.isTerminal()) {
if (pane.tag_edit) pane.mode = pane.tag_mode;
} else pane.mode = .normal;
pane.tag_edit = false;
pane.tag_sel = false;
pane.prompt = .none; // an abandoned prompt stays as tag text
pane.nsel_snap = 0; // ...and its s/S preview keeps whatever it previewed
}
fn tagSelBounds(pane: *Pane) struct { lo: usize, hi: usize } {
const a: usize = pane.tag_anchor;
const c: usize = pane.tag_col;
return .{ .lo = @min(a, c), .hi = @max(a, c) };
}
/// the text a tag Enter/Tab chord (and `y`) acts on: the char selection,
/// else the file-ish word under the cursor. Over the WHOLE rendered tag, so
/// the path is a word like any other — Enter on it looks it.
fn tagChordText(p: *Pardes, pane: *Pane) ?[]const u8 {
const text = p.tagText(p.scratch.allocator(), pane) catch return null;
if (pane.tag_sel) {
const b = tagSelBounds(pane);
const hi = modal.nextGrapheme(text, b.hi);
return if (hi > b.lo) text[b.lo..hi] else null;
}
const b = config.wordBounds(text, @min(@as(usize, pane.tag_col), text.len));
return if (b.hi > b.lo) text[b.lo..b.hi] else null;
}
/// tag-edit key dispatch: a modal one-line editor over the rendered tag,
/// sharing the pane's mode — the cursor moves over all of it, edits reach
/// only the tail. Newlines are always dropped.
fn tagInsertKey(p: *Pardes, pane: *Pane, key: Key) void {
if (hit(key, config.escape)) {
exitTagEdit(pane); // the tag is ALWAYS insert; Esc leaves it
return;
}
// the acme chords on the selection or the word at the cursor
if (hit(key, config.look_key) or hit(key, config.exec_key)) {
if (p.tagChordText(pane)) |txt| {
pane.tag_sel = false;
p.runBuiltin(if (hit(key, config.look_key)) config.look_cmd else config.exec_cmd, p.active, "", txt);
}
return;
}
// the prefix is live chrome, not text you own: the cursor may sit in it
// (that is how the path selects), but every edit below is measured from
// the first EDITABLE column and simply does nothing to the left of it.
const edit0: u16 = @intCast((p.tagPrefix(pane) catch return).len);
const end: u16 = edit0 + @as(u16, @intCast(pane.tag_tail_len));
if (key.text.len > 0) {
if (pane.tag_col < edit0) return; // typing inside the path: inert
var insert_len: usize = 0;
for (key.text) |ch| insert_len += @intFromBool(ch != '\n' and ch != '\r');
if (insert_len > pane.tag_tail.len - pane.tag_tail_len) return;
for (key.text) |ch| {
if (ch == '\n' or ch == '\r') continue; // one-line tag
if (!pane.insertTagByte(pane.tag_col - edit0, ch)) return;
pane.tag_col += 1;
}
return;
}
switch (key.cp) {
Key.backspace => if (pane.tag_col > edit0) {
const text = p.tagText(p.scratch.allocator(), pane) catch return;
const prev = @max(@as(usize, edit0), modal.prevGrapheme(text, pane.tag_col));
const count = @as(usize, pane.tag_col) - prev;
for (0..count) |_| pane.removeTagByte(prev - edit0);
pane.tag_col = @intCast(prev);
},
Key.left => if (pane.tag_col > 0) {
const text = p.tagText(p.scratch.allocator(), pane) catch return;
pane.tag_col = @intCast(modal.prevGrapheme(text, pane.tag_col));
},
Key.right => if (pane.tag_col < end) {
const text = p.tagText(p.scratch.allocator(), pane) catch return;
pane.tag_col = @intCast(modal.nextGrapheme(text, pane.tag_col));
},
Key.home => pane.tag_col = 0,
Key.end => pane.tag_col = end,
else => {},
}
}
/// write a helix range back onto the tag cursor + selection: the rendered
/// tag's one-line mirror of setPaneRange.
fn setTagRange(pane: *Pane, text: []const u8, r: modal.HxRange) void {
const lo = @min(r.anchor, r.head);
const hi = @max(r.anchor, r.head);
pane.tag_col = @intCast(modal.hxCursor(text, r));
pane.tag_sel = modal.nextGrapheme(text, lo) < hi; // one grapheme IS the block cursor
if (pane.tag_sel) pane.tag_anchor = @intCast(if (r.head > r.anchor) lo else modal.prevGrapheme(text, hi));
}
/// normal mode ON the tag — where `:` lands. The body's own helix motions
/// with the WHOLE rendered tag as a one-line document (so the path selects
/// like any other text, and Enter on it looks it), plus insert entry and
/// the acme chords; editing keys stay in insert (`i` then type, like the
/// mouse path) and never reach left of `edit0`.
fn tagNormalKey(p: *Pardes, pane: *Pane, key: Key) void {
const text = p.tagText(p.scratch.allocator(), pane) catch return;
const cur: usize = @min(@as(usize, pane.tag_col), text.len);
// Esc abandons the command line: back to the body, tail kept as text
if (hit(key, config.escape)) return exitTagEdit(pane);
// the chord: run the selection (or the word under the cursor) and drop
// back into the body — the whole point of `:`. The same two bindings as
// everywhere else (config.look_key / exec_key), so the command line is
// `:w<Tab>` by default.
// Nothing under the cursor means nothing ran: the tag keeps focus.
if (hit(key, config.look_key) or hit(key, config.exec_key)) {
const cmd = if (hit(key, config.look_key)) config.look_cmd else config.exec_cmd;
const txt = p.tagChordText(pane) orelse return;
const id = p.active;
exitTagEdit(pane); // leave the tag FIRST: Del frees the pane
p.runBuiltin(cmd, id, "", txt);
return;
}
// y — yank what the chord would run: the selection, else the word under
// the cursor. The path is selectable, so this is how you copy it out.
//
// The ONE register write that still mirrors to the system clipboard
// without `SPC` in front of it, and it is not an exception so much as
// the only spelling available: a tag is always in insert mode, the
// leader is body-normal only, so `SPC y` cannot be pressed here — and
// "copy this path somewhere else" is the entire reason the chord
// exists. A path that only reached the internal register would be a
// key that does nothing you can observe.
if (hit(key, config.tag_yank)) {
if (p.tagChordText(pane)) |txt| p.setClipboard(txt);
return;
}
// insert entry (one line, so I/A are the tail's ends). The prefix is
// read-only, so entering insert inside it parks at the first editable
// column instead — you can never be typing into the path.
if (hit(key, config.insert) or hit(key, config.append) or
hit(key, config.insert_line_start) or hit(key, config.insert_line_end))
{
const edit0: usize = (p.tagPrefix(pane) catch return).len;
pane.tag_col = @intCast(@max(edit0, if (hit(key, config.append))
modal.nextGrapheme(text, cur)
else if (hit(key, config.insert_line_start))
0
else if (hit(key, config.insert_line_end))
text.len
else
cur));
pane.tag_sel = false;
pane.mode = .insert;
return;
}
// h/j/k/l — a tagline is a place in the LAYOUT, so the four letters walk
// it: focus the neighbour and land on ITS tagline, still in normal mode,
// so tag-to-tag navigation never drops through a body. Runs the SAME
// Left/Down/Up/Right builtins `SPC w h/j/k/l` and `Ctrl-w` run, off the
// SAME table (config.window_keys) — one focusDir, one binding. Only the
// LETTER column: the arrows keep the in-tag grapheme motion below, so
// the letters cost nothing. Nothing in that direction = stay put, tag
// and all: focusDir left `active` alone, so there is nothing to undo —
// EXCEPT upwards, where "nothing" is still something (see below).
const dir: ?Builtin = for (config.window_keys) |wk| {
if (hit(key, &.{wk.letter})) break wk.cmd;
} else null;
if (dir) |d| {
const from = p.active;
p.runBuiltin(d, from, "", null);
if (p.active == from) {
// above the topmost tagline is the TOPBAR — row 0, the global
// one. It is not a pane, so focusDir can never reach it; this
// one fallback is what makes `k` walk off the top of the
// layout instead of dying there. Only from a tagline: a body's
// `SPC w k`/`Ctrl-w k` keeps its pane-to-pane meaning.
if (d == .Up) {
exitTagEdit(pane);
p.topbar_col = 0;
}
return;
}
const dest = p.panes[p.active] orelse return;
exitTagEdit(pane); // the pane we left is fully out of its tag...
p.enterTagEdit(dest, -1); // ...and the tail's start is the new park
if (dest.tag_edit) dest.mode = .normal;
return;
}
if (lineMotion(text, cur, key)) |r| setTagRange(pane, text, r);
}
/// the one-line normal-mode motion vocabulary as a helix range over `text`,
/// or null when `key` is not one of them: arrows by grapheme, `0`/`$`/`^`
/// (Home/End) to the ends, and the word motions, which select the span they
/// traverse exactly like the body's. A pane's tag and the TOPBAR are the
/// same one-line normal mode over different bytes, so the keys are read in
/// one place; only `h`/`l` differ — a tagline spends them on the layout,
/// the topbar has no layout — and each caller answers those itself.
fn lineMotion(text: []const u8, cur: usize, key: Key) ?modal.HxRange {
const target: ?usize = if (hit(key, config.line_move_left))
modal.prevGrapheme(text, cur)
else if (hit(key, config.line_move_right))
modal.nextGrapheme(text, cur)
else if (hit(key, config.line_start))
0
else if (hit(key, config.line_end))
modal.prevGrapheme(text, text.len)
else if (hit(key, config.line_first_nonws))
modal.firstNonWs(text)
else
null;
if (target) |t| return .{ .anchor = t, .head = t };
const wt: ?modal.WordTarget = if (hit(key, config.next_word_start))
.next_word_start
else if (hit(key, config.prev_word_start))
.prev_word_start
else if (hit(key, config.next_word_end))
.next_word_end
else if (hit(key, config.next_long_word_start))
.next_long_word_start
else if (hit(key, config.prev_long_word_start))
.prev_long_word_start
else if (hit(key, config.next_long_word_end))
.next_long_word_end
else
null;
const t = wt orelse return null;
return modal.hxWordMove(text, .{ .anchor = cur, .head = modal.nextGrapheme(text, cur) }, 1, t);
}
/// normal mode ON the topbar — row 0, where `k` off a top-row tagline
/// lands. The same one-line vocabulary a tag has (lineMotion), plus `h`/`l`
/// as plain grapheme motion: up here they have no neighbouring window to
/// walk to, so they cost nothing. Enter/Tab runs the word under the cursor
/// through the very dispatch a middle click on it uses, and `j` drops back
/// onto a tagline. The bar is chrome with no tail of its own, so there is
/// deliberately no insert mode and no selection: focus, move, run, leave.
fn topbarKey(p: *Pardes, key: Key) void {
var tb_buf: [1200]u8 = undefined;
const bar = p.topbar(&tb_buf);
// the line GROWS a `Restore <path>` word the moment a dump lands, so
// the column is clamped against the live line on every use
const cur: usize = @min(@as(usize, p.topbar_col orelse return), bar.len);
if (hit(key, config.escape)) {
p.topbar_col = null; // the active pane still has its body focus
return;
}
// the chord: run the word under the cursor, exactly as a middle click
// on it does. Leave the bar FIRST — `Kill` lives up here and tears the
// session down, the same hazard the pane-tag chord has with `Del`.
if (hit(key, config.look_key) or hit(key, config.exec_key)) {
const word = wordAtCol(bar, cur);
p.topbar_col = null;
if (word.len > 0) _ = p.execute(p.active, word);
return;
}
// j — back down onto a tagline, the mirror of the k that got you here:
// the pane you came from if it still holds the top row, else the
// leftmost pane that does. Recomputed, never remembered, so a pane
// deleted while the bar had focus strands nobody.
if (hit(key, config.topbar_down)) {
var dest: ?usize = null;
for (p.panes, 0..) |slot, i| {
if (slot == null or p.rects[i].y != TOPBAR_H) continue;
if (i == p.active) {
dest = i;
break;
}
if (dest == null or p.rects[i].x < p.rects[dest.?].x) dest = i;
}
const d = dest orelse return;
const pane = p.panes[d].?;
p.topbar_col = null;
p.active = d;
p.enterTagEdit(pane, -1);
if (pane.tag_edit) pane.mode = .normal;
return;
}
const col: ?usize = if (hit(key, config.topbar_left))
modal.prevGrapheme(bar, cur)
else if (hit(key, config.topbar_right))
modal.nextGrapheme(bar, cur)
else if (lineMotion(bar, cur, key)) |r|
modal.hxCursor(bar, r)
else
null;
// never past the last cell: there is nothing to append up here, so the
// block cursor stays ON a character (which is where `$` already lands)
if (col) |c| p.topbar_col = @intCast(@min(c, modal.prevGrapheme(bar, bar.len)));
}
/// tag + '\n' + body: the full selectable pane text (row 0 = the tag)
fn paneText(p: *Pardes, pane: *Pane) ![]u8 {
const arena = p.scratch.allocator();
return std.fmt.allocPrint(arena, "{s}\n{s}", .{ try p.tagText(arena, pane), try p.bodyText(arena, pane) });
}
/// block-selected text, newline-joined per row; reads the rendered screen
/// so typed text and shell output select identically. Scratch-owned.
fn selectionText(p: *Pardes, pane: *Pane, sl: Sel) ![]const u8 {
const arena = p.scratch.allocator();
const r0 = @min(sl.r0, sl.r1);
const r1 = @max(sl.r0, sl.r1);
const c0: usize = @intCast(@max(0, @min(sl.c0, sl.c1)));
const c1: usize = @intCast(@max(0, @max(sl.c0, sl.c1)));
const text = try p.paneText(pane);
var total: usize = 0;
var selected: usize = 0;
var count_it = std.mem.splitAny(u8, text, "\n");
var count_row: i32 = 0;
while (count_it.next()) |line| : (count_row += 1) {
if (count_row < r0 or count_row > r1) continue;
const b0 = @min(file_pane.renderedLineByteCol(pane, count_row, line, c0), line.len);
const b1 = modal.nextGrapheme(line, @min(file_pane.renderedLineByteCol(pane, count_row, line, c1), line.len));
total += b1 - b0 + @intFromBool(selected > 0);
selected += 1;
}
const out = try arena.alloc(u8, total);
var at: usize = 0;
var it = std.mem.splitAny(u8, text, "\n");
var v: i32 = 0;
var first = true;
while (it.next()) |line| : (v += 1) {
if (v < r0 or v > r1) continue;
if (!first) {
out[at] = '\n';
at += 1;
}
first = false;
const b0 = @min(file_pane.renderedLineByteCol(pane, v, line, c0), line.len);
const b1 = modal.nextGrapheme(line, @min(file_pane.renderedLineByteCol(pane, v, line, c1), line.len));
@memcpy(out[at..][0 .. b1 - b0], line[b0..b1]);
at += b1 - b0;
}
return out;
}
/// Is (r,c) inside the span (ar,ac)..(br,bc), in reading order? Either end
/// may be given first — a selection swept upwards has its anchor after its
/// head — and the coordinate SYSTEM is the caller's: screen cells for a
/// mouse selection, absolute rows for a modal one.
fn spanHas(r: i32, c: i32, ar: i32, ac: i32, br: i32, bc: i32) bool {
const fwd = ar < br or (ar == br and ac <= bc);
const sr, const sc = if (fwd) .{ ar, ac } else .{ br, bc };
const er, const ec = if (fwd) .{ br, bc } else .{ ar, ac };
return (r > sr or (r == sr and c >= sc)) and (r < er or (r == er and c <= ec));
}
const ExpandedWord = struct { lo: usize, hi: usize };
/// The single spelling rule used by pointer and keyboard expansion.
/// Spaces inside an explicit @`command run` belong to that run; every
/// other separator is no operand. In particular, do not let wordBounds'
/// left scan make a blank cell borrow its neighbour.
fn expandedWord(line: []const u8, col: usize) ?ExpandedWord {
if (col >= line.len) return null;
const b = config.wordBounds(line, col);
const command_run = b.hi > b.lo and config.commandWord(line[b.lo..b.hi]) != null;
if (!config.isFileChar(line[col]) and !command_run) return null;
if (b.hi <= b.lo) return null;
return .{ .lo = b.lo, .hi = b.hi };
}
/// acme: a no-drag middle/right click expands to the word under it —
/// file-ish, or a whole `` @`...` `` run (config.wordBounds is the spelling)
fn expandedSel(p: *Pardes, pane: *Pane, at: Sel) ?Sel {
var sl = at;
if (sl.c0 != sl.c1 or sl.r0 != sl.r1) return sl;
const text = p.paneText(pane) catch return null;
var it = std.mem.splitAny(u8, text, "\n");
var v: i32 = 0;
while (it.next()) |line| : (v += 1) {
if (v != sl.r0) continue;
const display_col: usize = @intCast(@max(0, sl.c0));
const col = file_pane.renderedLineByteCol(pane, v, line, display_col);
const b = expandedWord(line, col) orelse return null;
sl.c0 = @intCast(file_pane.renderedLineDisplayCol(pane, v, line, b.lo));
sl.c1 = @intCast(file_pane.renderedLineDisplayCol(pane, v, line, b.hi) - 1);
return sl;
}
return null;
}
/// the word under the modal cursor as a pane-local selection (paneText
/// coords: row 0 is the tag; file panes carry the line-number prefix)
fn cursorWordSel(p: *Pardes, pane: *Pane) Sel {
const w = pane.wrapRow(pane.cur_row, pane.cur_col);
const vrow = w.row + @as(i32, BOX_H);
const vcol = if (pane.file != null)
file_pane.displayOffset(pane, pane.cur_row, w.at, pane.cur_col) + @as(i32, config.PREFIX_W)
else blk: {
const pl = p.paneCursorLines(pane) catch break :blk pane.cur_col;
const local = pane.cur_row - pl.row0;
if (local < 0 or @as(usize, @intCast(local)) >= pl.lines.len) break :blk pane.cur_col;
break :blk file_pane.lineDisplayOffset(pl.lines[@intCast(local)], @intCast(@max(0, w.at)), @intCast(@max(0, pane.cur_col)));
};
return .{ .state = .done, .c0 = vcol, .c1 = vcol, .r0 = vrow, .r1 = vrow };
}
/// the active modal selection as text (v range or x lines), if any
fn currentSelText(p: *Pardes, pane: *Pane) ?[]const u8 {
if (comptime pdf_enabled) if (p.native_images) if (pane.pdf) |pv|
if (pv.selection != null and pv.selection_text.len > 0) return pv.selection_text;
if (pane.vsel.active) return p.vselText(pane);
if (!pane.msel.active) return null;
return p.yankRows(pane, @min(pane.msel.r0, pane.msel.r1), @max(pane.msel.r0, pane.msel.r1));
}
const PointerOperand = struct {
/// Absolute body position corresponding to the pointed screen cell.
row: i32,
col: i32,
/// Exactly what a no-drag middle/right click will dispatch.
text: ?[]const u8 = null,
/// What hover paints. Null names the pane's live modal selection.
preview: ?Sel = null,
/// File words stay logical so a soft-wrapped operand is not cut into
/// unrelated rendered fragments. Null for tags and non-file panes.
file_word: ?FileWordSpan = null,
/// A newly expanded word is installed in the gesture's button slot;
/// an existing selection is only borrowed and must not replace it.
expanded: ?Sel = null,
};
/// Resolve a no-drag pointer gesture without mutating Pane. Click release
/// and delayed Look hover call this same production primitive, so existing
/// selection precedence and word expansion cannot drift into two policies.
fn pointerOperand(p: *Pardes, pane: *Pane, clicked: Sel) PointerOperand {
const visible = clicked.r0 - @as(i32, BOX_H);
const wrapped = pane.wrapAt(visible);
const row = wrapped.line;
const col = if (clicked.r0 >= BOX_H)
p.paneByteAtDisplay(
pane,
wrapped.line,
wrapped.at,
clicked.c0 - (if (pane.file != null) @as(i32, config.PREFIX_W) else 0),
)
else
clicked.c0;
var result: PointerOperand = .{ .row = row, .col = col };
const kept = pane.sel[sel_slot];
if (kept.state == .done and
spanHas(clicked.r0, clicked.c0, kept.r0, kept.c0, kept.r1, kept.c1))
{
result.text = p.selectionText(pane, kept) catch null;
result.preview = kept;
return result;
}
if (pane.vsel.active and pane.vsel.explicit and
spanHas(row, col, pane.vsel.row, pane.vsel.col, pane.cur_row, pane.cur_col))
{
result.text = p.currentSelText(pane);
return result;
}
if (pane.msel.active and row >= @min(pane.msel.r0, pane.msel.r1) and
row <= @max(pane.msel.r0, pane.msel.r1))
{
result.text = p.currentSelText(pane);
return result;
}
if (pane.file != null and clicked.r0 >= BOX_H and clicked.r0 == clicked.r1 and clicked.c0 == clicked.c1) {
const line = file_pane.sourceLine(pane, row);
const source_col: usize = @intCast(@max(0, col));
const b = expandedWord(line, source_col) orelse return result;
const lo = std.math.cast(i32, b.lo) orelse return result;
const hi = std.math.cast(i32, b.hi) orelse return result;
result.text = line[b.lo..b.hi];
result.file_word = .{ .row = row, .lo = lo, .hi = hi };
// The transient middle/right slot still carries screen endpoints,
// but no text is reconstructed from this rectangular legacy
// shape. The logical span above is authoritative for dispatch and
// hover painting.
var expanded = clicked;
const first = pane.wrapRow(row, lo);
const last = pane.wrapRow(row, hi - 1);
if (first.row >= 0 and last.row >= 0) {
expanded.r0 = first.row + @as(i32, BOX_H);
expanded.c0 = @as(i32, config.PREFIX_W) + file_pane.displayOffset(pane, row, first.at, lo);
expanded.r1 = last.row + @as(i32, BOX_H);
expanded.c1 = @as(i32, config.PREFIX_W) + file_pane.displayEndOffset(pane, row, last.at, hi - 1);
}
result.preview = expanded;
result.expanded = expanded;
return result;
}
const expanded = p.expandedSel(pane, clicked) orelse return result;
result.text = p.selectionText(pane, expanded) catch null;
if (result.text == null or result.text.?.len == 0) return result;
result.preview = expanded;
result.expanded = expanded;
return result;
}
/// What an execute takes as its ARGUMENT: text selected ANYWHERE (acme —
/// the chord argument is whatever is selected, in any window), searched
/// `first` (the pane the execute happened in), then the active pane (making
/// a selection focuses its pane, so it holds the most recent one), then
/// slot order. Per pane a kept left selection wins, else an explicit modal
/// (v/x, n/N) one. Scratch-owned: dead at the next arena reset, so a caller
/// that keeps it (the 2-1 chord) copies.
fn heldSelection(p: *Pardes, first: usize) ?[]const u8 {
var k: usize = 0;
while (k < p.panes.len + 2) : (k += 1) {
const i = switch (k) {
0 => first,
1 => p.active,
else => k - 2,
};
if (k > 0 and (i == first or (k > 1 and i == p.active))) continue;
const t = p.panes[i] orelse continue;
if (comptime pdf_enabled) if (p.native_images) if (t.pdf) |pv| {
if (pv.selection != null and pv.selection_text.len > 0)
return pv.selection_text;
};
if (t.sel[sel_slot].state == .done) {
if (p.selectionText(t, t.sel[sel_slot]) catch null) |tx| return tx;
} else if ((t.vsel.active and t.vsel.explicit) or t.msel.active) {
if (p.currentSelText(t)) |tx| return tx;
}
}
return null;
}
/// Splice a chord argument onto what the gesture pointed at. acme's 2-1
/// chord means "run this WITH that", and that is a command LINE: `Grep`
/// plus a held `foo` is the same string `Grep foo` you could have typed,
/// so it goes down the one path that already knows how to split a name
/// from its tail. The alternative — a second argument threaded past the
/// dispatcher — is what used to be here, and it could not survive Exec
/// becoming an ordinary builtin with one argument slot like every other.
/// Scratch-owned; `txt` itself when there is nothing to splice.
fn withArg(p: *Pardes, txt: []const u8, arg: ?[]const u8) []const u8 {
const a = std.mem.trim(u8, arg orelse return txt, " \t\r\n");
if (a.len == 0) return txt;
const t = std.mem.trim(u8, txt, " \t\r\n");
return std.fmt.allocPrint(p.scratch.allocator(), "{s} {s}", .{ t, a }) catch txt;
}
fn handleKey(p: *Pardes, key: Key) void {
// the topbar holds the keyboard (`k` off the topmost tagline): row 0 is
// its own one-line normal mode and owns every key until Esc or a chord.
// Before the pane lookup because it needs no pane — that is the point.
if (p.topbar_col != null) return p.topbarKey(key);
const pane = p.panes[p.active] orelse return;
// a SPC leader in flight swallows the next key, whatever it is —
// before Ctrl-w, so a modified key abandons the sequence instead of
// arming a second prefix on top of it
if (p.leader_on) return p.leaderKey(key);
// Ctrl-w prefix: helix-style directional pane focus (h/j/k/l or the
// arrows), running the SAME builtins `SPC w h/j/k/l` runs off the SAME
// table a tagline's own h/j/k/l reads. It stays despite the leader
// covering it because it reaches one place the leader cannot: a pane
// in raw tty mode never sees SPC (the shell owns every printable key),
// so this is the only keyboard way out of one.
if (p.ctrl_w_pending) {
p.ctrl_w_pending = false;
for (config.window_keys) |wk| {
if (hit(key, &.{ wk.letter, wk.arrow })) return p.runBuiltin(wk.cmd, p.active, "", null);
}
return;
}
// insert mode owns Ctrl-w (delete word backward, helix); the focus
// prefix keeps normal/tty
if (hit(key, config.window_prefix) and pane.mode != .insert) {
p.ctrl_w_pending = true;
return;
}
// global window ops (any mode): Alt-n new terminal below, Alt-c move
// the active terminal into a fresh column
if (hit(key, config.new_shell_below)) {
const free = p.freeSlot() orelse return;
const nt = p.newShell(free, "") catch return;
nt.greet = true;
const src = p.splitParent(p.active);
const f = p.layoutFindTerm(src).?;
p.layoutInsert(f.col, f.idx + 1, free);
p.splitBelow(src, nt);
p.active = free;
return;
}
// the jump chords, global for the same reason: Ctrl-o has to get you
// out of wherever you are, including a pane in raw tty mode. Above the
// acme chords below, which is what makes Ctrl-i reachable at all — on
// a kitty-protocol host it arrives as its own key, and where it does
// not it IS Tab (0x09) and falls through to Exec, see config.jump_keys.
for (config.jump_keys) |jk| {
if (hit(key, &.{jk.chord})) return p.runBuiltin(jk.cmd, p.active, "", null);
}
if (hit(key, config.pane_to_new_column)) {
const f = p.layoutFindTerm(p.active).?;
if (p.ncol < MAX_COLS and p.col_n[f.col] > 1) {
_ = p.layoutSplitColumn(p.active, p.active, false);
}
return;
}
// the configured Ctrl-key, or Shift-Esc, toggles raw tty mode in and
// out (terminals only); tty is deliberately off the normal editing
// path. Shift-Esc needs a host that reports modifiers on Escape (the
// kitty keyboard protocol); where it doesn't it arrives as a plain
// Escape and still means what Escape always means.
const tty_alt = hit(key, config.tty_toggle_alt);
const tty_toggle = (key.ctrl and key.cp == p.opts.tty_toggle) or tty_alt;
if (pane.isTerminal() and tty_toggle) {
if (pane.mode == .tty) {
// Shift-Esc IN tty is what Escape is in normal mode: Last,
// the pane you were in before this one. The pane keeps its tty
// mode, so coming back lands you in the program you left rather
// than in normal mode on top of it — and Ctrl-<the configured
// key> is still how you leave tty in place.
if (tty_alt) return p.runBuiltin(.Last, p.active, "", null);
pane.mode = .normal;
pane.pending = 0;
} else term_pane.enterTty(p, p.active);
return;
}
// A shell prompt is a pane you can leave: plain Esc there is Shift-Esc.
if (pane.isTerminal() and pane.mode == .tty and hit(key, config.escape) and p.takesCommandLine(p.active))
return p.runBuiltin(.Last, p.active, "", null);
if (pane.isTerminal() and pane.mode == .tty) {
// Clipboard first: `hit` ignores a shift no binding asked for, so
// the plain Ctrl-V below would otherwise swallow Ctrl-Shift-V.
if (hit(key, config.tty_paste_clipboard)) return p.clipRequest(p.active, .after);
if (hit(key, config.tty_paste)) return p.typeToTty(p.active, pane, p.yank orelse return);
}
// `|` owns the same visible one-line tag input as search, but Enter
// snapshots an asynchronous shell filter. Escape is a pure cancel:
// restore the old tail and never emit a request.
if (pane.hasPipePrompt() and (hit(key, config.search_submit) or hit(key, config.escape))) {
const prompt_at = pane.promptAt().?;
if (hit(key, config.search_submit)) p.submitPipe(p.active);
pane.tag_tail_len = @min(prompt_at, pane.tag_tail_len);
exitTagEdit(pane);
pane.mode = .normal;
pane.pending = 0;
return;
}
// a save input in flight (scratch or terminal): Enter writes the path,
// Esc abandons; both drop the prompt text and return to the body.
if (pane.hasSavePrompt() and (hit(key, config.search_submit) or hit(key, config.escape))) {
const prompt_at = pane.promptAt().?;
if (hit(key, config.search_submit))
p.submitSave(p.active)
else
pane.tag_tail_len = @min(prompt_at, pane.tag_tail_len);
exitTagEdit(pane);
pane.mode = .normal;
pane.pending = 0;
return;
}
// a search input in flight (`/` or Find): Enter searches, Esc abandons;
// both restore the tag tail and hand focus back to the body.
if (pane.hasSearchPrompt() and (hit(key, config.search_submit) or hit(key, config.escape))) {
const prompt_at = pane.promptAt().?;
if (hit(key, config.search_submit))
p.submitSearch(p.active)
else if (selRegexArmed(pane)) |_|
p.applySelRegex(pane, "", false);
pane.tag_tail_len = @min(prompt_at, pane.tag_tail_len);
exitTagEdit(pane);
pane.mode = .normal;
pane.pending = 0;
return;
}
// tag editing intercepts every other key: a modal one-line editor over
// the tail, sharing the pane's mode. Above the body chords — a focused
// tag owns Enter/Tab too (that IS the `:` command line).
if (pane.tag_edit) {
if (pane.mode == .normal) p.tagNormalKey(pane, key) else p.tagInsertKey(pane, key);
// an armed `s`/`S` re-runs its pattern after EVERY keystroke: that
// live preview is what makes it interactive. Through the slot, not
// `pane` — a tag chord above can run a builtin that closed it.
const pn = p.panes[p.active] orelse return;
if (selRegexArmed(pn)) |a| p.applySelRegex(pn, a.pat, a.split);
return;
}
// the acme chords in the body — look at / execute (config.look_key and
// exec_key, Enter and Tab by default) the EXPLICIT modal selection
// (v/x/X, terminal n/N, search n/N); implicit motion residue falls back
// to the file-ish word under the cursor.
if (pane.mode == .normal and (hit(key, config.look_key) or hit(key, config.exec_key))) {
const cmd = if (hit(key, config.look_key)) config.look_cmd else config.exec_cmd;
p.pinPaneCursor(pane);
const explicit = (p.native_images and hasPdfSelection(pane)) or
(pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
if (explicit) {
if (p.currentSelText(pane)) |txt| {
pane.vsel.active = false;
pane.msel.active = false;
pane.select = false;
p.runBuiltin(cmd, p.active, "", txt);
return;
}
}
const sel = p.expandedSel(pane, p.cursorWordSel(pane)) orelse return;
const word = p.selectionText(pane, sel) catch return;
p.runBuiltin(cmd, p.active, "", word);
return;
}
// PDFs share BODY-NORMAL recognition with text, then deliberately
// adapt only navigation and the cross-pane command/search actions.
// Returning here keeps unsupported edits away from placeholder cells.
if (pane.mode == .normal and hasPdf(pane)) return p.handlePdfNormal(pane, key);
switch (pane.mode) {
.normal => {
p.handleNormal(pane, key);
},
.insert => {
if (hit(key, config.escape)) {
pane.mode = .normal;
pane.msel.active = false;
pane.pending = 0;
// leaving an `a` append session: the cursor backs up one
// grapheme and the appended-over span becomes the
// implicit selection (helix doc.restore_cursor)
if (pane.append_at) |aa| {
pane.append_at = null;
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
const gap = modal.hxOff(text, .{ .row = @intCast(@max(0, pane.cur_row)), .col = @intCast(@max(0, pane.cur_col)) });
const a_off = modal.hxOff(text, .{ .row = @intCast(@max(0, aa.row)), .col = @intCast(@max(0, aa.col)) });
// helix restore_cursor is Range::new(from, prev(to)) on
// the GAP range, so it can never walk back past the
// append origin — a session whose edits ate everything
// typed collapses ONTO it. Without the clamp the cursor
// lands one cell before where the append began (`la`,
// Backspace, Esc).
const back = @max(a_off, modal.prevGrapheme(text, gap));
const bc = modal.hxPos(text, back);
pane.cur_row = @intCast(bc.row);
pane.cur_col = @intCast(bc.col);
pane.vsel = .{ .active = a_off != back, .row = aa.row, .col = aa.col, .explicit = false };
pane.cur_pinned = true;
pane.ensureCursorVisible();
// The other cursors move the same way the primary did —
// every one of them was handed the same keys, so every
// session shrank by the same grapheme — but they
// COLLAPSE rather than span: only the primary remembers
// where its append began (append_at is one field).
// ponytail: helix restores every range's appended-over
// span; store an origin per SelRange if that matters.
for (pane.sels[0..pane.nsel]) |*s| {
const sgap = modal.hxOff(text, .{ .row = @intCast(@max(0, s.row)), .col = @intCast(@max(0, s.col)) });
const b2 = if (back == gap) sgap else modal.prevGrapheme(text, sgap);
const bp = modal.hxPos(text, b2);
s.row = @intCast(bp.row);
s.col = @intCast(bp.col);
s.arow = s.row;
s.acol = s.col;
}
}
return;
}
p.handleInsert(pane, key);
},
.tty => term_pane.forwardKey(p, p.active, key),
}
}
/// A key after SPC: walk the leader tree (leader_rows, the comptime table).
/// `?` at any depth opens Help scoped to the path typed so far; an exact
/// path runs its builtin with no arguments; a key that only extends a
/// group keeps waiting. ANYTHING else abandons the sequence — a typo must
/// not leave the next keystroke armed at a builtin that closes panes, and
/// the indicator vanishing is the receipt (vim and helix drop unmapped
/// leader keys the same way). Esc lands here as one of those.
fn leaderKey(p: *Pardes, key: Key) void {
p.leader_on = false; // only "still a prefix" below re-arms it
if (key.ctrl or key.alt or key.cp < 0x20 or key.cp > 0x7e) return;
const c: u8 = @intCast(key.cp);
if (c == config.leader_help) {
output_pane.openHelp(p, p.active, p.leader_keys[0..p.leader_n]) catch |err|
p.reportError(p.active, "help", err);
return;
}
if (p.leader_n >= p.leader_keys.len) return;
p.leader_keys[p.leader_n] = c;
p.leader_n += 1;
const pfx = p.leader_keys[0..p.leader_n];
// a path-less builtin is a row here too (it is the same index Help
// reads), and SPC cannot reach one — so both scans skip it
for (builtin_rows) |row| {
if (std.mem.eql(u8, row.path orelse continue, pfx)) return p.runBuiltin(row.cmd, p.active, "", null);
}
for (builtin_rows) |row| {
if (std.mem.startsWith(u8, row.path orelse continue, pfx)) {
p.leader_on = true;
return;
}
}
}
/// move focus to the nearest pane in `dir` of `from` (overlap-aware
/// nearest edge). `from` is the pane the builtin ran on, which is the
/// active one for a key but the CLICKED one for a name executed in a tag.
pub fn focusDir(p: *Pardes, from: usize, dir: enum { left, right, up, down }) void {
const a = p.rects[from];
var best: ?usize = null;
var best_d: i32 = 0;
for (p.panes, 0..) |slot, i| {
if (slot == null or i == from) continue;
const r = p.rects[i];
const vov = a.y < r.y + r.h and r.y < a.y + a.h;
const hov = a.x < r.x + r.w and r.x < a.x + a.w;
const ok = switch (dir) {
.left => r.x + r.w <= a.x and vov,
.right => r.x >= a.x + a.w and vov,
.up => r.y + r.h <= a.y and hov,
.down => r.y >= a.y + a.h and hov,
};
if (!ok) continue;
const d: i32 = switch (dir) {
.left => @as(i32, a.x) - @as(i32, r.x + r.w),
.right => @as(i32, r.x) - @as(i32, a.x + a.w),
.up => @as(i32, a.y) - @as(i32, r.y + r.h),
.down => @as(i32, r.y) - @as(i32, a.y + a.h),
};
if (best == null or d < best_d) {
best = i;
best_d = d;
}
}
if (best) |b| {
p.active = b;
// a count typed before the hop was meant for the pane you left
p.panes[b].?.pending = 0;
}
}
// ---- move-drag placement ----
const MovePlacement = struct {
preview_col: usize,
above_id: usize,
row: u16,
above_y: u16,
above_h: u16,
};
fn targetColumn(p: *Pardes, cur_x: u16) usize {
var tc: usize = if (p.ncol > 0) p.ncol - 1 else 0;
for (0..p.ncol) |c| {
if (cur_x >= p.col_x[c] and cur_x < p.col_x[c] + p.col_w[c]) {
tc = c;
break;
}
}
return tc;
}
fn splitRowForExtent(y: u16, h: u16, cur_y: u16) ?u16 {
if (h < 2) return null;
const min_each: u16 = if (h >= config.MINH * 2) config.MINH else 1;
const lo = y +| min_each;
const hi = y + h - min_each;
if (lo > hi) return y + h / 2;
return std.math.clamp(cur_y, lo, hi);
}
fn movePlacement(p: *Pardes, id: usize, cur_x: u16, cur_y: u16) ?MovePlacement {
const src = p.layoutFindTerm(id) orelse return null;
const tc = p.targetColumn(cur_x);
if (tc == src.col and p.col_n[src.col] == 1) return null;
if (tc == src.col) {
const sr = p.rects[id];
if (cur_y >= sr.y and cur_y < sr.y + sr.h) return null;
}
var heights: [MAX_PANES]u16 = @splat(0);
for (0..p.ncol) |c| {
for (0..p.col_n[c]) |k| {
const pid = p.col_terms[c][k];
heights[pid] = p.rects[pid].h;
}
}
if (p.col_n[src.col] > 1) {
const sib = if (src.idx > 0) p.col_terms[src.col][src.idx - 1] else p.col_terms[src.col][src.idx + 1];
heights[sib] +|= p.rects[id].h;
}
var y: u16 = TOPBAR_H;
var last: ?MovePlacement = null;
for (0..p.col_n[tc]) |k| {
const pid = p.col_terms[tc][k];
if (pid == id) continue;
const h = heights[pid];
const row = splitRowForExtent(y, h, cur_y) orelse {
y +|= h;
continue;
};
const placement: MovePlacement = .{
.preview_col = tc,
.above_id = pid,
.row = row,
.above_y = y,
.above_h = h,
};
last = placement;
if (cur_y < y + h) return placement;
y +|= h;
}
return last;
}
/// drop pane `id` below the pane under the cursor, converting on-screen
/// heights to weights so ONLY the split pane changes size
fn moveTerm(p: *Pardes, id: usize, cur_x: u16, cur_y: u16) void {
const placement = p.movePlacement(id, cur_x, cur_y) orelse return;
const src = p.layoutFindTerm(id) orelse return;
const source_multi = p.col_n[src.col] > 1;
var heights: [MAX_PANES]u16 = @splat(0);
for (0..p.ncol) |c| {
for (0..p.col_n[c]) |k| {
const pid = p.col_terms[c][k];
heights[pid] = p.rects[pid].h;
}
}
p.layoutRemove(id);
if (source_multi and src.col < p.ncol and p.col_n[src.col] > 0) {
const sib = if (src.idx > 0) p.col_terms[src.col][src.idx - 1] else p.col_terms[src.col][src.idx];
heights[sib] +|= p.rects[id].h;
}
const af = p.layoutFindTerm(placement.above_id) orelse return;
const upper_h = @max(1, placement.row -| placement.above_y);
const lower_h = @max(1, placement.above_h -| upper_h);
heights[placement.above_id] = upper_h;
heights[id] = lower_h;
p.layoutInsert(af.col, af.idx + 1, id);
p.setColumnWeights(af.col, &heights);
if (source_multi and src.col < p.ncol and src.col != af.col) p.setColumnWeights(src.col, &heights);
}
fn setColumnWeights(p: *Pardes, col: usize, heights: *const [MAX_PANES]u16) void {
if (col >= p.ncol) return;
for (0..p.col_n[col]) |k| {
const pid = p.col_terms[col][k];
if (p.panes[pid]) |pane| pane.vweight = @floatFromInt(@max(1, heights[pid]));
}
}
// ---- helix-modal normal mode ----
const PaneLines = struct {
lines: []const []const u8,
row0: i32, // absolute row of lines[0]
};
/// The lines the cursor moves over, absolute rows. File: all content lines.
/// Terminal: the whole history+active grid with the edit buffer's lines
/// standing in for the rows it covers, so motions ride the scrollback and
/// the typed text alike. Scratch-arena backed.
/// (pub only for test/hxdiff.zig — the helix differential harness dumps
/// this surface as a tty case's final text.)
pub fn paneCursorLines(p: *Pardes, pane: *Pane) !PaneLines {
const arena = p.scratch.allocator();
if (pane.file) |*f| return .{ .lines = try file_pane.cursorLines(arena, pane, f), .row0 = 0 };
if (hasPdf(pane)) {
if (comptime pdf_enabled) return .{
.lines = try pdf_pane.textLines(&pane.pdf.?, p.pdf_gpa, arena),
.row0 = 0,
};
unreachable;
}
return .{ .lines = try term_pane.cursorLines(p, pane), .row0 = 0 };
}
fn paneByteAtDisplay(p: *Pardes, pane: *Pane, row: i32, from_raw: i32, display_col: i32) i32 {
if (pane.file != null)
return file_pane.byteAtRowDisplay(pane, row, from_raw, display_col);
const pl = p.paneCursorLines(pane) catch return @max(0, from_raw + display_col);
const local = row - pl.row0;
if (local < 0 or @as(usize, @intCast(local)) >= pl.lines.len)
return @max(0, from_raw + display_col);
return @intCast(file_pane.byteAtDisplayFrom(
pl.lines[@intCast(local)],
@intCast(@max(0, from_raw)),
@intCast(@max(0, display_col)),
));
}
/// Freeze the live terminal cursor into the modal coordinate space. The
/// emulator reports screen cells; editing state stores UTF-8 byte offsets.
fn pinPaneCursor(p: *Pardes, pane: *Pane) void {
if (pane.cur_pinned) return;
pane.pinCursor();
if (pane.file == null and !hasPdf(pane))
pane.cur_col = p.paneByteAtDisplay(pane, pane.cur_row, 0, pane.cur_col);
}
fn toModalCursor(pane: *Pane, pl: PaneLines) modal.Cursor {
const r: i32 = pane.cur_row - pl.row0;
return .{ .row = @intCast(@max(0, r)), .col = @intCast(@max(0, pane.cur_col)) };
}
fn fromModalCursor(pane: *Pane, pl: PaneLines, c: modal.Cursor) void {
pane.cur_row = @as(i32, @intCast(c.row)) + pl.row0;
pane.cur_col = @intCast(c.col);
pane.cur_pinned = true;
}
fn insertVerticalCursor(lines: []const []const u8, c: modal.Cursor, down: bool) modal.Cursor {
if (lines.len == 0) return c;
const row = if (down) @min(c.row + 1, lines.len - 1) else c.row -| 1;
const target = lines[row];
if (target.len == 0) return .{ .row = row, .col = 0 };
const source = if (c.row < lines.len) lines[c.row] else "";
const goal = file_pane.rawDisplayCol(source, c.col);
const mapped = file_pane.rawAtDisplay(target, goal);
const last = modal.prevGrapheme(target, target.len);
return .{ .row = row, .col = modal.graphemeStart(target, @min(mapped, last)) };
}
// ---- helix range plumbing (see modal.zig "helix range engine") ----
// The pane's cursor + vsel cells render ONE helix gap range over the flat
// motion surface. Every motion builds the current range, transforms it the
// way the helix command would, and writes it back: normal mode REPLACES
// the selection with the motion's range, select mode (v) extends it via
// put_cursor. The differential suite (zig build hxdiff) pins all of this
// against a real helix, key for key.
/// the flat motion surface: file content as-is; terminals join the
/// cursor-lines dump (scratch-arena backed, same lifetime as pl)
fn flatSurface(p: *Pardes, pane: *Pane, pl: PaneLines) ![]const u8 {
if (pane.file) |f| return f.content;
if (hasPdf(pane)) {
if (comptime pdf_enabled) return pane.pdf.?.ensureText(p.pdf_gpa);
unreachable;
}
return term_pane.flatSurface(p, pane, pl.lines);
}
fn paneOff(pane: *Pane, text: []const u8, c: modal.Cursor) usize {
if (pane.file != null) return file_pane.textOffset(pane, text, c);
return modal.hxOff(text, c);
}
fn paneLineStart(pane: *Pane, text: []const u8, row: usize) usize {
if (pane.file != null) return file_pane.textLineStart(pane, text, row);
return modal.lineStartOffset(text, row);
}
fn paneLineCount(pane: *Pane, text: []const u8) usize {
if (pane.file != null) return file_pane.textLineCount(pane, text);
return modal.hxLineCount(text);
}
fn panePos(pane: *Pane, text: []const u8, off: usize) modal.Cursor {
if (pane.file != null) return file_pane.textPosition(pane, text, off);
return modal.hxPos(text, off);
}
/// the current selection as a helix gap range over `text`, whose first
/// line is absolute row `row0` (0 for the motion surface and for file
/// content; a terminal's edit buffer starts wherever it was anchored)
fn paneRange(pane: *Pane, text: []const u8, row0: i32) modal.HxRange {
const c = paneOff(pane, text, .{ .row = @intCast(@max(0, pane.cur_row - row0)), .col = @intCast(@max(0, pane.cur_col)) });
if (pane.msel.active) {
// legacy line selection (file-search results highlight): linewise
const r0: usize = @intCast(@max(0, @min(pane.msel.r0, pane.msel.r1) - row0));
const r1: usize = @intCast(@max(0, @max(pane.msel.r0, pane.msel.r1) - row0));
const s = modal.lineStartOffset(text, r0);
const e = if (r1 + 1 >= modal.hxLineCount(text)) text.len else modal.lineStartOffset(text, r1 + 1);
return .{ .anchor = s, .head = @max(e, modal.nextGrapheme(text, c)) };
}
if (pane.vsel.active) return cellRange(text, pane.vsel.row - row0, pane.vsel.col, pane.cur_row - row0, pane.cur_col);
return .{ .anchor = c, .head = modal.nextGrapheme(text, c) };
}
/// a gap range from its two block-cursor CELLS — the arithmetic paneRange
/// does for cur/vsel, shared with the extra selections, which are stored
/// in exactly the same shape
fn cellRange(text: []const u8, arow: i32, acol: i32, hrow: i32, hcol: i32) modal.HxRange {
const a = modal.hxOff(text, .{ .row = @intCast(@max(0, arow)), .col = @intCast(@max(0, acol)) });
const c = modal.hxOff(text, .{ .row = @intCast(@max(0, hrow)), .col = @intCast(@max(0, hcol)) });
return cellOffRange(text, a, c);
}
/// the same, from the two cells' gap offsets
fn cellOffRange(text: []const u8, a: usize, c: usize) modal.HxRange {
if (a <= c) return .{ .anchor = a, .head = modal.nextGrapheme(text, c) };
return .{ .anchor = modal.nextGrapheme(text, a), .head = c };
}
/// the inverse: a gap range's cursor and anchor CELLS (equal for a bare
/// 1-wide cursor). setPaneRange's own conversion, factored out so the
/// extra selections write back through the same three lines.
fn rangeCells(text: []const u8, r: modal.HxRange) struct { cur: usize, anc: usize } {
if (r.head > r.anchor) return .{ .cur = modal.prevGrapheme(text, r.head), .anc = r.anchor };
if (r.head < r.anchor) return .{ .cur = r.head, .anc = modal.prevGrapheme(text, r.anchor) };
return .{ .cur = r.head, .anc = r.head };
}
/// write a helix range back into pane state. `explicit` marks user-intent
/// selections (v/x/X, terminal n/N, file-search n/N) — the acme chords
/// act only on those; motion residue stays implicit.
fn setPaneRange(pane: *Pane, pl: PaneLines, text: []const u8, r0: modal.HxRange, explicit: bool) void {
var r = r0;
if (r.anchor == r.head) r.head = modal.nextGrapheme(text, r.head); // min_width_1
const off = rangeCells(text, r);
const cc = panePos(pane, text, off.cur);
// a bare block cursor has both cells on the same offset — the common
// case by far — and this conversion is not free even indexed
const ac = if (off.anc == off.cur) cc else panePos(pane, text, off.anc);
pane.cur_row = @as(i32, @intCast(cc.row)) + pl.row0;
pane.cur_col = @intCast(cc.col);
pane.vsel = .{
.active = off.anc != off.cur or pane.select,
.row = @as(i32, @intCast(ac.row)) + pl.row0,
.col = @intCast(ac.col),
.explicit = explicit or pane.select,
};
pane.msel.active = false;
pane.nsel = 0; // writing ONE range means the selection IS that range
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.pending = 0;
pane.ensureCursorVisible();
}
// ---- the OTHER selections (helix Selection.ranges / primary_index) ----
// Two functions read and write the whole list; everything else in this
// file still speaks the single primary range, and replaySels below is what
// makes an ordinary key act at every cursor.
/// The whole selection as helix gap ranges over `text`, DOCUMENT ORDER
/// (pane.sels is kept that way, so this only has to slot the primary in).
/// Returns how many were written and which index is the primary.
fn paneRanges(pane: *Pane, text: []const u8, row0: i32, out: *[MAX_SELS]modal.HxRange) struct { n: usize, pri: usize } {
const pr = paneRange(pane, text, row0);
var n: usize = 0;
var pri: usize = 0;
var placed = false;
for (pane.sels[0..pane.nsel]) |s| {
const r = cellRange(text, s.arow - row0, s.acol, s.row - row0, s.col);
if (!placed and @min(pr.anchor, pr.head) <= @min(r.anchor, r.head)) {
pri = n;
out[n] = pr;
n += 1;
placed = true;
}
out[n] = r;
n += 1;
}
if (!placed) {
pri = n;
out[n] = pr;
n += 1;
}
return .{ .n = n, .pri = pri };
}
/// Write a whole selection back — helix's `Selection::new`: min-width-1,
/// sorted by start, overlapping ranges merged (the primary following its
/// range through a merge). `ranges[pri]` lands in the primary slot through
/// setPaneRange, so nothing downstream can tell it apart from a lone
/// cursor; the rest become pane.sels. `sticky` carries each range's own
/// j/k goal column, -1 for the ones that have none.
fn setPaneRanges(pane: *Pane, pl: PaneLines, text: []const u8, in: []const modal.HxRange, sticky: []const i32, pri0: usize, explicit: bool) void {
if (in.len == 0) return; // helix asserts non-empty; here it just means "no change"
var r: [MAX_SELS]modal.HxRange = undefined;
var st: [MAX_SELS]i32 = undefined;
var n: usize = @min(in.len, MAX_SELS);
var pri: usize = @min(pri0, n - 1);
for (in[0..n], 0..) |x, i| {
r[i] = x;
if (r[i].anchor == r[i].head) r[i].head = modal.nextGrapheme(text, r[i].head);
st[i] = if (i < sticky.len) sticky[i] else -1;
}
// insertion sort by start — n is tiny and usually already ordered
var i: usize = 1;
while (i < n) : (i += 1) {
var j = i;
while (j > 0 and @min(r[j].anchor, r[j].head) < @min(r[j - 1].anchor, r[j - 1].head)) : (j -= 1) {
std.mem.swap(modal.HxRange, &r[j], &r[j - 1]);
std.mem.swap(i32, &st[j], &st[j - 1]);
if (pri == j) pri = j - 1 else if (pri == j - 1) pri = j;
}
}
// merge overlaps (helix Range::overlaps + Range::merge, kept forward:
// a merged range takes the union and loses its direction only when the
// two disagree, which is what helix's else-branch does)
var k: usize = 0;
i = 1;
while (i < n) : (i += 1) {
const a = r[k];
const b = r[i];
const af = @min(a.anchor, a.head);
const at = @max(a.anchor, a.head);
const bf = @min(b.anchor, b.head);
const bt = @max(b.anchor, b.head);
if (af == bf or (at > bf and bt > af)) {
r[k] = if (a.anchor > a.head and b.anchor > b.head)
.{ .anchor = @max(a.anchor, b.anchor), .head = @min(a.head, b.head) }
else
.{ .anchor = @min(af, bf), .head = @max(at, bt) };
if (pri == i) pri = k;
if (st[k] < 0) st[k] = st[i];
continue;
}
k += 1;
r[k] = b;
st[k] = st[i];
if (pri == i) pri = k;
}
n = k + 1;
setPaneRange(pane, pl, text, r[pri], explicit);
pane.sticky_col = st[pri];
var w: usize = 0;
for (r[0..n], 0..) |x, idx| {
if (idx == pri) continue;
const c = rangeCells(text, x);
const cc = modal.hxPos(text, c.cur);
const ac = modal.hxPos(text, c.anc);
pane.sels[w] = .{
.row = @as(i32, @intCast(cc.row)) + pl.row0,
.col = @intCast(cc.col),
.arow = @as(i32, @intCast(ac.row)) + pl.row0,
.acol = @intCast(ac.col),
.sticky = st[idx],
};
w += 1;
}
pane.nsel = @intCast(w);
}
/// The helix keys that act on the selection LIST rather than on the text.
/// Each reads the whole list and writes a whole list back; none is a
/// motion, which is why Action.scope marks them exempt from per-range
/// replay. The goal columns are dropped on the way through — every
/// one of these is a fresh intent about WHERE the cursors are, the same
/// reason setPaneRange resets sticky_col.
fn multiSelAction(pane: *Pane, pl: PaneLines, text: []const u8, kind: normal_input.Multi, cnt: usize) void {
var rs: [MAX_SELS]modal.HxRange = undefined;
const got = paneRanges(pane, text, pl.row0, &rs);
const n = got.n;
const expl = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
if (kind == .remove_primary) {
if (n < 2) return; // helix: "no selections remaining"
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
for (rs[0..n], 0..) |r, i| {
if (i == got.pri) continue;
out[m] = r;
m += 1;
}
// helix Selection::remove: the NEXT range takes over, or the
// previous one when the primary was last
return setPaneRanges(pane, pl, text, out[0..m], &.{}, @min(got.pri, m - 1), expl);
}
if (kind == .rotate_forward or kind == .rotate_backward) {
const step = cnt % n;
const pri = if (kind == .rotate_forward) (got.pri + step) % n else (got.pri + (n - step)) % n;
return setPaneRanges(pane, pl, text, rs[0..n], &.{}, pri, expl);
}
if (kind == .merge) {
// helix merge_selections: first.merge(last) — the ranges are
// sorted, so that is simply the whole span
const lo = @min(rs[0].anchor, rs[0].head);
const hi = @max(rs[n - 1].anchor, rs[n - 1].head);
const rev = rs[0].anchor > rs[0].head and rs[n - 1].anchor > rs[n - 1].head;
const one: modal.HxRange = if (rev) .{ .anchor = hi, .head = lo } else .{ .anchor = lo, .head = hi };
return setPaneRanges(pane, pl, text, &.{one}, &.{}, 0, expl);
}
if (kind == .merge_consecutive) {
// ranges that TOUCH become one; setPaneRanges already merges the
// ones that overlap, so widening each by a grapheme says exactly
// "consecutive counts as overlapping" and nothing else
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
var pri: usize = 0;
for (rs[0..n], 0..) |r, i| {
if (m > 0 and @min(r.anchor, r.head) == @max(out[m - 1].anchor, out[m - 1].head)) {
const lo = @min(@min(out[m - 1].anchor, out[m - 1].head), @min(r.anchor, r.head));
const hi = @max(@max(out[m - 1].anchor, out[m - 1].head), @max(r.anchor, r.head));
out[m - 1] = .{ .anchor = lo, .head = hi };
if (i == got.pri) pri = m - 1;
continue;
}
if (i == got.pri) pri = m;
out[m] = r;
m += 1;
}
return setPaneRanges(pane, pl, text, out[0..m], &.{}, pri, expl);
}
if (kind == .split_newline) {
// helix selection::split_on_newline — one range per line the
// selection covers, the newlines themselves left out
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
for (rs[0..n]) |r| {
const from = @min(r.anchor, r.head);
const to = @max(r.anchor, r.head);
if (from == to) {
if (m < MAX_SELS) {
out[m] = r;
m += 1;
}
continue;
}
var start = from;
while (start < to and m < MAX_SELS) {
const eol = modal.hxLineEndIdx(text, modal.hxLineOf(text, start));
if (eol >= to) {
out[m] = .{ .anchor = start, .head = to };
m += 1;
break;
}
out[m] = .{ .anchor = start, .head = eol };
m += 1;
start = eol + 1;
}
}
if (m == 0) return;
return setPaneRanges(pane, pl, text, out[0..m], &.{}, 0, true); // helix keeps primary 0
}
if (kind == .trim) {
// helix trim_selections: whitespace off both ends; ranges that are
// empty or all whitespace are dropped entirely
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
for (rs[0..n]) |r| {
var from = @min(r.anchor, r.head);
var to = @max(r.anchor, r.head);
while (from < to and std.ascii.isWhitespace(text[from])) from += 1;
while (to > from and std.ascii.isWhitespace(text[to - 1])) to -= 1;
if (from >= to) continue;
out[m] = if (r.anchor > r.head) .{ .anchor = to, .head = from } else .{ .anchor = from, .head = to };
m += 1;
}
if (m == 0) { // helix: collapse_selection + keep_primary_selection
const c = modal.hxCursor(text, rs[got.pri]);
return setPaneRange(pane, pl, text, .{ .anchor = c, .head = c }, false);
}
// helix: the first survivor that OVERLAPS the old primary, else the last
const pf = @min(rs[got.pri].anchor, rs[got.pri].head);
const pt = @max(rs[got.pri].anchor, rs[got.pri].head);
var pri = m - 1;
for (out[0..m], 0..) |r, i| {
const f = @min(r.anchor, r.head);
const t = @max(r.anchor, r.head);
if (f == pf or (t > pf and pt > f)) {
pri = i;
break;
}
}
return setPaneRanges(pane, pl, text, out[0..m], &.{}, pri, expl);
}
// C / Alt-C — helix copy_selection_on_line, a copy of each range on the
// next/previous line that is long enough to hold its columns.
// ponytail: BYTE columns, not helix's visual ones, so a TAB counts as
// one column here. Everything else in this file measures the same way
// (hscroll, the mouse, the renderer's gutter), and fixing it means
// teaching all of them tab stops at once.
const below = kind == .copy_below;
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
var pri: usize = 0;
const nlines = modal.hxLineCount(text);
for (rs[0..n], 0..) |r, ri| {
const is_pri = ri == got.pri;
// head-exclusive: back the leading end off onto its own cell
const hp = modal.hxPos(text, if (r.anchor < r.head) modal.prevGrapheme(text, r.head) else r.head);
const ap = modal.hxPos(text, if (r.anchor < r.head) r.anchor else modal.prevGrapheme(text, r.anchor));
const height = @max(hp.row, ap.row) - @min(hp.row, ap.row) + 1;
if (m >= MAX_SELS) break;
if (is_pri) pri = m;
out[m] = r;
m += 1;
var made: usize = 0;
var k: usize = 0;
while (made < cnt and m < MAX_SELS) : (k += 1) {
const d = (k + 1) * height;
const arow = if (below) ap.row + d else ap.row -| d;
const hrow = if (below) hp.row + d else hp.row -| d;
if (arow >= nlines or hrow >= nlines) break;
const a2 = modal.hxOff(text, .{ .row = arow, .col = ap.col });
const h2 = modal.hxOff(text, .{ .row = hrow, .col = hp.col });
// a line too short to reach the column is skipped, not clamped
if (modal.hxPos(text, a2).col == ap.col and modal.hxPos(text, h2).col == hp.col) {
if (is_pri) pri = m;
out[m] = modal.hxPutCursor(text, .{ .anchor = a2, .head = a2 }, h2, true);
m += 1;
made += 1;
}
if (arow == 0 and hrow == 0) break;
}
}
setPaneRanges(pane, pl, text, out[0..m], &.{}, pri, expl);
}
// ---- `s` / `S`: the selection LIST from a regex ----
// The other two list-making keys, and the only ones that need a pattern
// typed first. They reuse the `/` input wholesale (startSearch — the tag
// tail IS the prompt) and differ from it in one thing: the pattern is
// re-applied on every keystroke, so the selection is the preview.
/// helix `s` / `S`: arm the tag input for a regex, remembering the
/// selection it is about to rewrite. Nothing moves yet — every keystroke
/// below re-derives the preview from this snapshot, and Enter simply stops
/// while Esc puts the snapshot back.
fn startSelRegex(p: *Pardes, pane: *Pane, split: bool) void {
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
const got = paneRanges(pane, text, pl.row0, &pane.sel_snap);
pane.nsel_snap = @intCast(got.n);
pane.sel_snap_pri = @intCast(got.pri);
pane.sel_snap_expl = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
p.startSearch(pane, if (split) config.split_marker else config.select_marker);
}
/// The pattern an armed `s`/`S` input holds right now, and which of the two
/// it is — read back off the MARKER, exactly the way submitSearch decides
/// which search is running. Null for `/`, Find, Grep and Rename.
fn selRegexArmed(pane: *Pane) ?struct { pat: []const u8, split: bool } {
const prompt_at = switch (pane.prompt) {
.search => |at| at,
else => return null,
};
if (pane.nsel_snap == 0) return null;
const tail = pane.tagSlice();
const armed = tail[@min(prompt_at, tail.len)..];
const split = std.mem.startsWith(u8, armed, config.split_marker);
if (!split and !std.mem.startsWith(u8, armed, config.select_marker)) return null;
const slash = std.mem.indexOfScalar(u8, armed, '/') orelse return null;
return .{ .pat = armed[slash + 1 ..], .split = split };
}
/// Put the selection back the way `s`/`S` found it and then, if `pat`
/// compiles and hits, rewrite it: helix's select_on_matches (every match
/// INSIDE each range becomes a range) and split_on_matches (each range
/// becomes the pieces BETWEEN its matches).
///
/// Anything that yields nothing — an empty pattern, one that will not
/// compile, one that does not match — leaves the snapshot standing, which
/// is helix's "nothing selected" and also what makes typing a pattern one
/// character at a time bearable: every prefix of it is one of those.
///
/// ponytail: MAX_SELS ranges, and matches past that are dropped rather
/// than growing the list — the ceiling the whole selection model has.
/// ponytail: mvzr searches from each match's end, so `^` and `$` assert
/// against THAT position rather than against a line the way helix's
/// multi_line regex does, and `.` matches a newline like any other byte.
/// Both are waived. `[^\n]` LOOKS like the workaround for the second and
/// must not be suggested as one: the live preview compiles every prefix,
/// and the prefix `[^\` panics mvzr (index out of bounds in parseCharSet,
/// mvzr.zig valueFor) before the pattern can ever be finished. Guarding
/// the compile is what would make the advice sayable.
fn applySelRegex(p: *Pardes, pane: *Pane, pat: []const u8, split: bool) void {
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
const snap = pane.sel_snap[0..pane.nsel_snap];
var out: [MAX_SELS]modal.HxRange = undefined;
var m: usize = 0;
if (pat.len > 0) if (mvzr.compile(pat)) |re| {
// helix smart-case: a pattern with no uppercase in it matches
// case-blind. mvzr has no such flag — "lowercase your string" is
// its own advice — and ASCII folding is byte for byte, so a
// lowercased copy of the surface has exactly the same offsets.
var hay_all = text;
if (for (pat) |c| {
if (std.ascii.isUpper(c)) break false;
} else true) {
const low = p.scratch.allocator().dupe(u8, text) catch return;
for (low) |*c| c.* = std.ascii.toLower(c.*);
hay_all = low;
}
for (snap) |r| {
const from = @min(r.anchor, r.head);
const to = @min(@max(r.anchor, r.head), text.len);
if (from >= to) continue;
const hay = hay_all[from..to];
var at: usize = 0;
var piece = from; // split: where the next piece begins
while (at < hay.len and m < MAX_SELS) {
const hit_at = re.matchPos(at, hay) orelse break;
if (split) {
out[m] = .{ .anchor = piece, .head = from + hit_at.start };
m += 1;
piece = from + hit_at.end;
} else if (from + hit_at.start != to) {
// a match sitting right off the END of the range is
// dropped (helix: what `\b` and empty matches produce
// there), everything else becomes a range
out[m] = .{ .anchor = from + hit_at.start, .head = from + hit_at.end };
m += 1;
}
// an empty match would otherwise never advance
at = if (hit_at.end > hit_at.start) hit_at.end else hit_at.end + 1;
}
if (split and piece < to and m < MAX_SELS) {
out[m] = .{ .anchor = piece, .head = to };
m += 1;
}
}
};
if (m == 0) {
// the text CAN move under an armed prompt (a tag chord runs a
// builtin), and these are raw offsets into the surface as it was
for (snap) |*r| {
r.anchor = @min(r.anchor, text.len);
r.head = @min(r.head, text.len);
}
return setPaneRanges(pane, pl, text, snap, &.{}, pane.sel_snap_pri, pane.sel_snap_expl);
}
setPaneRanges(pane, pl, text, out[0..m], &.{}, 0, true); // helix keeps primary 0 (its own TODO)
}
/// Pane keeps compact codepoints for dump/layout stability; this pair is
/// the only bridge to the parser's typed state. Recognition never reads
/// these representation fields directly.
fn paneNormalState(pane: *const Pane) normal_input.State {
const prefix: normal_input.Prefix = if (pane.pending == config.goto_prefix)
.goto
else if (pane.pending == config.view_prefix)
.view
else if (pane.pending == config.match_prefix)
.match
else if (pane.pending == config.find_char_fwd)
.find_fwd
else if (pane.pending == config.find_char_back)
.find_back
else if (pane.pending == config.till_char_fwd)
.till_fwd
else if (pane.pending == config.till_char_back)
.till_back
else if (pane.pending == config.replace_prefix)
.replace
else if (pane.pending == config.next_prefix)
.next
else if (pane.pending == config.prev_prefix)
.prev
else
.none;
const match_sub: normal_input.MatchSub = if (pane.pending2 == config.match_inside)
.inside
else if (pane.pending2 == config.match_around)
.around
else if (pane.pending2 == config.surround_add)
.surround_add
else if (pane.pending2 == config.surround_replace)
.surround_replace
else if (pane.pending2 == config.surround_delete)
.surround_delete
else
.none;
return .{
.count = pane.count,
.prefix = prefix,
.match_sub = match_sub,
.held_char = pane.pending_ch,
};
}
fn putPaneNormalState(pane: *Pane, state: normal_input.State) void {
pane.count = state.count;
pane.pending = switch (state.prefix) {
.none => 0,
.goto => config.goto_prefix,
.view => config.view_prefix,
.match => config.match_prefix,
.find_fwd => config.find_char_fwd,
.find_back => config.find_char_back,
.till_fwd => config.till_char_fwd,
.till_back => config.till_char_back,
.replace => config.replace_prefix,
.next => config.next_prefix,
.prev => config.prev_prefix,
};
pane.pending2 = switch (state.match_sub) {
.none => 0,
.inside => config.match_inside,
.around => config.match_around,
.surround_add => config.surround_add,
.surround_replace => config.surround_replace,
.surround_delete => config.surround_delete,
};
pane.pending_ch = state.held_char;
}
/// Everything one keystroke may CONSUME on the way through the modal
/// handler. A key means the same thing at every cursor, so the replay puts
/// all of it back before each pass and keeps whatever the PRIMARY's pass
/// left. (sticky_col is deliberately absent: it is per-range, and rides
/// along in SelRange.sticky instead.)
const KeyState = struct {
mode: Mode,
select: bool,
count: u32,
pending: u21,
pending2: u21,
pending_ch: u21,
find_op: u8,
find_ch: u21,
append_at: @FieldType(Pane, "append_at"),
fn of(pane: *Pane) KeyState {
return .{
.mode = pane.mode,
.select = pane.select,
.count = pane.count,
.pending = pane.pending,
.pending2 = pane.pending2,
.pending_ch = pane.pending_ch,
.find_op = pane.find_op,
.find_ch = pane.find_ch,
.append_at = pane.append_at,
};
}
fn into(s: KeyState, pane: *Pane) void {
pane.mode = s.mode;
pane.select = s.select;
pane.count = s.count;
pane.pending = s.pending;
pane.pending2 = s.pending2;
pane.pending_ch = s.pending_ch;
pane.find_op = s.find_op;
pane.find_ch = s.find_ch;
pane.append_at = s.append_at;
}
};
/// what a replayed key does at each cursor
const Replay = union(enum) {
normal: normal_input.Action,
insert: Key,
};
/// Run one keystroke at EVERY cursor, by replaying the single-selection
/// handler once per range. This IS the multiple-cursor mechanism, and it
/// is why one cursor costs nothing: with `nsel == 0` nobody calls it, and
/// the handler underneath is the same code the 800 differential cases pin.
///
/// Two rules make the replay legal without helix's change-mapping:
/// * ranges are visited LAST FIRST, so an edit never disturbs the
/// row/col of a range still waiting its turn — everything it touches
/// is below.
/// * a finished pass's result is recorded as a distance from the END of
/// the surface, which an edit strictly before it cannot change (the
/// text and the position shift by exactly the same amount).
fn replaySels(p: *Pardes, pane: *Pane, what: Replay) void {
const id = p.active;
const serial = pane.serial;
// the whole selection in pane coordinates, document order. pane.sels
// is already ordered, so this only slots the primary into place.
var list: [MAX_SELS]SelRange = undefined;
var n: usize = 0;
var pri: usize = 0;
const prim: SelRange = .{
.row = pane.cur_row,
.col = pane.cur_col,
.arow = if (pane.vsel.active) pane.vsel.row else pane.cur_row,
.acol = if (pane.vsel.active) pane.vsel.col else pane.cur_col,
.sticky = pane.sticky_col,
};
const pr = selStart(prim);
var placed = false;
for (pane.sels[0..pane.nsel]) |s| {
const sr = selStart(s);
if (!placed and (pr.row < sr.row or (pr.row == sr.row and pr.col <= sr.col))) {
pri = n;
list[n] = prim;
n += 1;
placed = true;
}
list[n] = s;
n += 1;
}
if (!placed) {
pri = n;
list[n] = prim;
n += 1;
}
const saved = KeyState.of(pane);
const explicit = pane.vsel.explicit;
var after = saved;
var after_expl = explicit;
// each pass's result: cursor and anchor cells as distances from the
// end of the surface text, plus the range's own j/k goal column
var res: [MAX_SELS]struct { cur: usize, anc: usize, sticky: i32 } = undefined;
p.multi_on = true;
p.multi_stop = false;
var passes: usize = 0;
var i: usize = n;
while (i > 0) {
i -= 1;
p.multi_first = passes == 0;
passes += 1;
saved.into(pane);
pane.nsel = 0; // the handler underneath sees ONE selection
pane.cur_row = list[i].row;
pane.cur_col = list[i].col;
pane.vsel = .{
.active = list[i].arow != list[i].row or list[i].acol != list[i].col or pane.select,
.row = list[i].arow,
.col = list[i].acol,
.explicit = explicit,
};
pane.msel.active = false;
pane.sticky_col = list[i].sticky;
switch (what) {
.normal => |normal_action| p.executeNormalAction(pane, normal_action),
.insert => |insert_key| p.insertKey(pane, insert_key),
}
// the stop check comes FIRST: the pass that set it may have freed
// this very pane (a builtin closing it), so nothing below may read
// through the pointer
if (p.multi_stop) break;
if (i == pri) {
after = KeyState.of(pane);
after_expl = pane.vsel.explicit;
}
const pl = p.paneCursorLines(pane) catch {
p.multi_stop = true; // out of memory mid-replay: collapse, don't guess
break;
};
const text = p.flatSurface(pane, pl) catch {
p.multi_stop = true;
break;
};
const co = modal.hxOff(text, .{ .row = @intCast(@max(0, pane.cur_row - pl.row0)), .col = @intCast(@max(0, pane.cur_col)) });
const ao = if (pane.vsel.active)
modal.hxOff(text, .{ .row = @intCast(@max(0, pane.vsel.row - pl.row0)), .col = @intCast(@max(0, pane.vsel.col)) })
else
co;
res[i] = .{ .cur = text.len - @min(co, text.len), .anc = text.len - @min(ao, text.len), .sticky = pane.sticky_col };
}
p.multi_on = false;
p.multi_first = false;
if (p.multi_stop) {
// the pass reached outside the buffer (a builtin, a language
// query) and may have closed or reused the pane it ran on: drop
// back to one cursor rather than replaying it n more times
p.multi_stop = false;
const pn = p.panes[id] orelse return;
if (pn.serial == serial) pn.nsel = 0;
return;
}
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
var rs: [MAX_SELS]modal.HxRange = undefined;
var st: [MAX_SELS]i32 = undefined;
for (res[0..n], 0..) |r, k| {
rs[k] = cellOffRange(text, text.len - @min(r.anc, text.len), text.len - @min(r.cur, text.len));
st[k] = r.sticky;
}
setPaneRanges(pane, pl, text, rs[0..n], st[0..n], pri, after_expl);
after.into(pane);
pane.ensureCursorVisible(); // the view follows the PRIMARY, not the last pass
}
/// a range's start CELL (document order key) — the smaller of its two ends
fn selStart(s: SelRange) struct { row: i32, col: i32 } {
if (s.arow < s.row or (s.arow == s.row and s.acol < s.col)) return .{ .row = s.arow, .col = s.acol };
return .{ .row = s.row, .col = s.col };
}
/// The last line a goto may land on: helix skips the empty trailing line.
/// Called from the three `g`/`G` Action branches that need it and nowhere
/// else — it used to be eager at the top of body-normal execution, so every
/// keystroke of every kind paid a full count of the buffer's newlines.
/// "Does the buffer end in a newline" is the same question as the walk to
/// the last line start that stood here, and it is one byte instead of a
/// second pass.
fn maxLine(text: []const u8) usize {
const nl = modal.hxLineCount(text);
return if (text.len == 0 or text[text.len - 1] == '\n') nl -| 2 else nl - 1;
}
/// point-target motion: collapse there (extend in select mode)
fn pointMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, target: usize) void {
setPaneRange(pane, pl, text, modal.hxPutCursor(text, range, target, pane.select), false);
}
/// word motions select their traversed span (extend mode: head only)
fn wordMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, cnt: usize, target: modal.WordTarget) void {
const wr = modal.hxWordMove(text, range, cnt, target);
const res = if (pane.select) modal.hxPutCursor(text, range, modal.hxCursor(text, wr), true) else wr;
setPaneRange(pane, pl, text, res, false);
}
/// f/t/F/T: anchor at the old cursor cell, head on the hit (not found: no move)
fn findMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, ch: u21, fwd: bool, till: bool, cnt: usize) void {
const cur = modal.hxCursor(text, range);
const t = modal.hxFindTarget(text, cur, ch, fwd, till, cnt) orelse return;
const res = if (pane.select)
modal.hxPutCursor(text, range, t, true)
else
modal.hxPutCursor(text, .{ .anchor = cur, .head = cur }, t, true);
setPaneRange(pane, pl, text, res, false);
}
/// j/k and friends: sticky goal column, clamped onto short lines' newline
fn verticalMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, down: bool, cnt: usize) void {
const cur = modal.hxCursor(text, range);
const pos = panePos(pane, text, cur);
const goal: usize = if (pane.sticky_col >= 0)
@intCast(pane.sticky_col)
else
file_pane.rawDisplayCol(modal.lineSlice(text, pos.row), pos.col);
// modal.hxVertTarget with the row we already have and the indexed
// offset conversion — it would otherwise recount the buffer's newlines
// and walk to the target line, two more full passes per j/k
const last_row = paneLineCount(pane, text) - 1;
const nline = if (down) @min(pos.row + @max(1, cnt), last_row) else pos.row -| @max(1, cnt);
const target_col = file_pane.rawAtDisplay(modal.lineSlice(text, nline), goal);
const t = paneOff(pane, text, .{ .row = nline, .col = target_col });
// extend mode never walks onto the empty trailing line (helix)
if (pane.select and t == text.len and text.len > 0 and text[text.len - 1] == '\n') return;
setPaneRange(pane, pl, text, modal.hxPutCursor(text, range, t, pane.select), false);
pane.sticky_col = @intCast(goal);
}
/// `gj`/`gk`: one VISUAL line, following the automatic breaks a wrapped
/// body draws rather than the newlines in the file. The goal column is the
/// one INSIDE the visual row, so a run of them walks straight down a
/// paragraph; on the last visual row of a line the step crosses into the
/// next line's first row, exactly as the eye does.
///
/// With wrapping off — Wrap unset, a terminal pane, an output pane too
/// narrow to record its map — a line is one visual row and this IS
/// verticalMove, which is why nothing upstream branches on the setting.
fn visualMove(
pane: *Pane,
pl: PaneLines,
text: []const u8,
range: modal.HxRange,
down: bool,
cnt: usize,
width: usize,
) void {
const cur = modal.hxCursor(text, range);
const pos = panePos(pane, text, cur);
const last_row = paneLineCount(pane, text) - 1;
var row = pos.row;
var line = modal.lineSlice(text, row);
var vrow = file_pane.visualRow(line, pos.col, width);
const goal: usize = if (pane.sticky_col >= 0)
@intCast(pane.sticky_col)
else
file_pane.rawDisplayCol(line[vrow.start..vrow.end], pos.col -| vrow.start);
var steps = @max(1, cnt);
while (steps > 0) : (steps -= 1) {
if (down) {
if (vrow.end < line.len) {
vrow = file_pane.visualRow(line, vrow.end, width);
continue;
}
if (row == last_row) break;
row += 1;
line = modal.lineSlice(text, row);
vrow = file_pane.visualRow(line, 0, width);
} else {
if (vrow.start > 0) {
vrow = file_pane.visualRow(line, vrow.start - 1, width);
continue;
}
if (row == 0) break;
row -= 1;
line = modal.lineSlice(text, row);
vrow = file_pane.visualRow(line, line.len, width);
}
}
// The newline slot is a real cursor position, but the first byte of the
// NEXT visual row is not: landing there would read as two rows moved.
var target_col = vrow.start + file_pane.rawAtDisplay(line[vrow.start..vrow.end], goal);
if (vrow.end < line.len and target_col >= vrow.end)
target_col = modal.graphemeStart(line, vrow.end - 1);
const t = paneOff(pane, text, .{ .row = row, .col = target_col });
// extend mode never walks onto the empty trailing line (helix)
if (pane.select and t == text.len and text.len > 0 and text[text.len - 1] == '\n') return;
setPaneRange(pane, pl, text, modal.hxPutCursor(text, range, t, pane.select), false);
pane.sticky_col = @intCast(goal);
}
/// How wide a wrapped row of this pane is, or 0 when it does not wrap.
/// Only a file-backed body wraps: a terminal's rows are the emulator's
/// own, already broken where it decided to break them.
fn paneWrapWidth(p: *const Pardes, pane: *const Pane) usize {
if (pane.file == null) return 0;
return file_pane.wrapWidth(pane, p.settings.wrap);
}
/// Ctrl-d/u: scroll half a page AND move the cursor by the same rows
fn halfPageMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, down: bool) void {
const half: i32 = @max(1, @divTrunc(@as(i32, pane.rows), 2));
pane.scrollBy(if (down) half else -half);
verticalMove(pane, pl, text, range, down, @intCast(half));
}
/// helix `scroll` without cursor sync (Ctrl-f/b, PgUp/PgDn, zj/zk): shift
/// the view, then snap a fallen-out cursor to the near scrolloff edge, col 0
fn scrollViewMove(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, delta: i32) void {
const margin: i32 = @min(config.scroll_off, @divTrunc(@as(i32, pane.rows) - 1, 2));
pane.scrollBy(delta);
const top = pane.scroll();
const last_row: i32 = @intCast(paneLineCount(pane, text) - 1);
const cur = modal.hxCursor(text, range);
if (delta > 0) {
const snap: i32 = @max(0, @min(top + margin, last_row));
const head = paneLineStart(pane, text, @intCast(snap));
if (head <= cur) return;
const anchor = if (pane.select) range.anchor else head;
setPaneRange(pane, pl, text, .{ .anchor = anchor, .head = head }, false);
} else {
const snap: i32 = @max(0, @min(top + @as(i32, pane.rows) - margin - 1, last_row));
const head = paneLineStart(pane, text, @intCast(snap));
if (head >= cur) return;
const anchor = if (pane.select) range.anchor else head;
setPaneRange(pane, pl, text, .{ .anchor = anchor, .head = head }, false);
}
}
/// gt/gc/gb: view-relative rows, col 0, scrolloff clamped (helix goto_window)
fn gotoWindow(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, which: enum { top, center, bottom }, cnt: usize) void {
const margin: i32 = @min(config.scroll_off, @divTrunc(@as(i32, pane.rows) - 1, 2));
const top = pane.scroll();
const last_row: i32 = @intCast(paneLineCount(pane, text) - 1);
const last_vis: i32 = @min(@as(i32, pane.rows) - 1, last_row - top);
const n: i32 = @intCast(cnt - 1);
var vline: i32 = switch (which) {
.top => top + margin + n,
.center => top + @divTrunc(last_vis, 2),
.bottom => top + last_vis - (margin + n),
};
vline = @max(vline, top + margin);
vline = @min(vline, top + last_vis - margin);
const row: i32 = std.math.clamp(vline, 0, last_row);
pointMove(pane, pl, text, range, paneLineStart(pane, text, @intCast(row)));
}
/// helix Range::line_range — the inclusive line span a range covers
fn rangeLineSpan(text: []const u8, r: modal.HxRange) struct { start: usize, end: usize } {
const from = @min(r.anchor, r.head);
const to = @max(r.anchor, r.head);
const to_adj = if (from == to) to else @max(modal.prevGrapheme(text, to), from);
return .{ .start = modal.hxLineOf(text, from), .end = modal.hxLineOf(text, to_adj) };
}
fn lineStartOrEof(text: []const u8, line: usize) usize {
if (line >= modal.hxLineCount(text)) return text.len;
return modal.lineStartOffset(text, line);
}
/// helix `x` extend_line_below: full lines incl. the newline, cursor ON
/// the last one's '\n'; an already-line-bounded selection grows downward
fn lineSelect(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange, cnt: usize) void {
const span = rangeLineSpan(text, range);
const start = modal.lineStartOffset(text, span.start);
const end = lineStartOrEof(text, span.end + 1);
const full = @min(range.anchor, range.head) == start and @max(range.anchor, range.head) == end;
const head = lineStartOrEof(text, span.end + cnt + @intFromBool(full));
setPaneRange(pane, pl, text, .{ .anchor = start, .head = head }, true);
}
/// helix `X` extend_to_line_bounds (direction kept)
fn lineBoundsSelect(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange) void {
const span = rangeLineSpan(text, range);
const start = modal.lineStartOffset(text, span.start);
const end = lineStartOrEof(text, span.end + 1);
const r: modal.HxRange = if (range.head < range.anchor)
.{ .anchor = end, .head = start }
else
.{ .anchor = start, .head = end };
setPaneRange(pane, pl, text, r, true);
}
/// helix `Alt-x` shrink_to_line_bounds (single-line selections untouched)
fn shrinkSelToLineBounds(pane: *Pane, pl: PaneLines, text: []const u8, range: modal.HxRange) void {
const span = rangeLineSpan(text, range);
if (span.start == span.end) return;
const from = @min(range.anchor, range.head);
const to = @max(range.anchor, range.head);
var start = modal.lineStartOffset(text, span.start);
var end = lineStartOrEof(text, span.end + 1);
if (start != from) start = lineStartOrEof(text, span.start + 1);
if (end != to) end = modal.lineStartOffset(text, span.end);
const expl = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
const r: modal.HxRange = if (range.head < range.anchor)
.{ .anchor = end, .head = start }
else
.{ .anchor = start, .head = end };
setPaneRange(pane, pl, text, r, expl);
}
/// Keys that are about the selection LIST, or about the session rather
/// than the text: they act ONCE however many cursors there are. The
/// multi-cursor family rewrites the list wholesale, and the rest would
/// either fight the replay (Esc, undo) or fire n times (`:`, `/`, n/N, SPC).
///
fn handleNormal(p: *Pardes, pane: *Pane, key: Key) void {
var state = paneNormalState(pane);
const parsed = normal_input.parse(&state, normalInput(key));
putPaneNormalState(pane, state);
const semantic = switch (parsed) {
.pending, .ignored, .unbound => return,
.action => |value| value,
};
if (pane.nsel == 0 or semantic.scope() == .once)
return p.executeNormalAction(pane, semantic);
p.replaySels(pane, .{ .normal = semantic });
}
/// Text-pane adapter for the semantic BODY-NORMAL vocabulary. Parsing is
/// complete before this function runs; this switch reads document state
/// only to execute the already-recognized action.
fn executeNormalAction(p: *Pardes, pane: *Pane, semantic: normal_input.Action) void {
p.pinPaneCursor(pane);
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
const lines = pl.lines;
const range = paneRange(pane, text, pl.row0);
const cur = modal.hxCursor(text, range);
switch (semantic) {
.escape => {
pane.select = false;
return p.runBuiltin(.Last, p.active, "", null);
},
.goto => |go| switch (go.target) {
.file_start => {
const line = if (go.explicit_count) @min(@as(usize, go.count) - 1, maxLine(text)) else 0;
return pointMove(pane, pl, text, range, modal.lineStartOffset(text, line));
},
.last_line => return pointMove(pane, pl, text, range, modal.lineStartOffset(text, maxLine(text))),
.line_start => return pointMove(pane, pl, text, range, modal.lineStartOffset(text, modal.hxLineOf(text, cur))),
.line_end => {
const line = modal.hxLineOf(text, cur);
const ls = modal.lineStartOffset(text, line);
return pointMove(pane, pl, text, range, @max(ls, modal.prevGrapheme(text, modal.hxLineEndIdx(text, line))));
},
.first_nonws => {
const line = modal.hxLineOf(text, cur);
const ls = modal.lineStartOffset(text, line);
const slice = text[ls..modal.hxLineEndIdx(text, line)];
const nw = modal.firstNonWs(slice);
if (nw == slice.len) return;
return pointMove(pane, pl, text, range, ls + nw);
},
.line_down => return visualMove(pane, pl, text, range, true, go.count, p.paneWrapWidth(pane)),
.line_up => return visualMove(pane, pl, text, range, false, go.count, p.paneWrapWidth(pane)),
.column => {
const line = modal.hxLineOf(text, cur);
const ls = modal.lineStartOffset(text, line);
const slice = text[ls..modal.hxLineEndIdx(text, line)];
return pointMove(pane, pl, text, range, ls + modal.graphemeAtColumn(slice, @as(usize, go.count) - 1));
},
.view_top => return gotoWindow(pane, pl, text, range, .top, go.count),
.view_center => return gotoWindow(pane, pl, text, range, .center, go.count),
.view_bottom => return gotoWindow(pane, pl, text, range, .bottom, go.count),
},
.view => |view| switch (view) {
.top => {
pane.scrollBy(pane.cur_row - pane.scroll());
pane.ensureCursorVisible();
},
.center => {
pane.scrollBy(pane.cur_row - (pane.scroll() + @divTrunc(@as(i32, pane.rows), 2) - 1));
pane.ensureCursorVisible();
},
.bottom => {
pane.scrollBy(pane.cur_row - (pane.scroll() + @as(i32, pane.rows) - 1));
pane.ensureCursorVisible();
},
.scroll_down => return scrollViewMove(pane, pl, text, range, 1),
.scroll_up => return scrollViewMove(pane, pl, text, range, -1),
},
.find => |find| {
const op: u8 = switch (find.kind) {
.forward => @intCast(config.find_char_fwd),
.backward => @intCast(config.find_char_back),
.till_forward => @intCast(config.till_char_fwd),
.till_backward => @intCast(config.till_char_back),
};
pane.find_op = op;
pane.find_ch = find.char;
return findMove(
pane,
pl,
text,
range,
find.char,
find.kind == .forward or find.kind == .till_forward,
find.kind == .till_forward or find.kind == .till_backward,
find.count,
);
},
.replace_char => |char| return p.normalReplaceChar(pane, char),
.match_bracket => {
const mc = modal.matchBracket(lines, modal.hxPos(text, cur)) orelse return;
return pointMove(pane, pl, text, range, modal.hxOff(text, mc));
},
.textobject => |object| return p.textobjectSelect(pane, pl, object.char, object.around),
.surround_add => |char| return p.surroundAdd(pane, char),
.surround_delete => |char| return p.surroundDelete(pane, pl, char),
.surround_replace => |replace| return p.surroundReplace(pane, pl, replace.from, replace.to),
.paragraph => |paragraph| {
const r2 = modal.hxParaMove(text, range, paragraph.count, paragraph.direction == .forward, pane.select);
return setPaneRange(pane, pl, text, r2, false);
},
.add_newline => |newline| return p.addNewline(pane, newline.direction == .forward, newline.count),
.diagnostic => |diagnostic| {
const fwd = diagnostic.direction == .forward;
if (!diagnostic.endpoint) {
if (output_pane.resultsFrom(p, pane, .{ .query = .diagnostics }) and
p.searchStep(p.active, if (fwd) 1 else -1)) return;
return p.lspRequest(p.active, .diagnostics, "");
}
if (!output_pane.resultsFrom(p, pane, .{ .query = .diagnostics }))
return p.lspRequest(p.active, .diagnostics, "");
if (!fwd) {
pane.search_row = null;
_ = p.searchStep(p.active, 1);
return;
}
const rp = p.panes[pane.search_pane orelse return] orelse return;
const rf = rp.file orelse return;
pane.search_row = std.mem.count(u8, rf.content, "\n");
_ = p.searchStep(p.active, -1);
},
.move => |move| switch (move.motion) {
.left => {
var target = cur;
for (0..move.count) |_| target = modal.prevGrapheme(text, target);
return pointMove(pane, pl, text, range, target);
},
.right => {
var target = cur;
for (0..move.count) |_| target = modal.nextGrapheme(text, target);
return pointMove(pane, pl, text, range, target);
},
.down => return verticalMove(pane, pl, text, range, true, move.count),
.up => return verticalMove(pane, pl, text, range, false, move.count),
.next_word_start => return wordMove(pane, pl, text, range, move.count, .next_word_start),
.prev_word_start => return wordMove(pane, pl, text, range, move.count, .prev_word_start),
.next_word_end => return wordMove(pane, pl, text, range, move.count, .next_word_end),
.next_long_word_start => return wordMove(pane, pl, text, range, move.count, .next_long_word_start),
.prev_long_word_start => return wordMove(pane, pl, text, range, move.count, .prev_long_word_start),
.next_long_word_end => return wordMove(pane, pl, text, range, move.count, .next_long_word_end),
},
.repeat_find => |count| {
if (pane.find_op == 0) return;
const fwd = pane.find_op == config.find_char_fwd or pane.find_op == config.till_char_fwd;
const till = pane.find_op == config.till_char_fwd or pane.find_op == config.till_char_back;
var repeated = range;
var moved = false;
for (0..count) |_| {
const cc = modal.hxCursor(text, repeated);
const target = modal.hxFindTarget(text, cc, pane.find_ch, fwd, till, 1) orelse break;
repeated = if (pane.select)
modal.hxPutCursor(text, repeated, target, true)
else
modal.hxPutCursor(text, .{ .anchor = cc, .head = cc }, target, true);
moved = true;
}
if (!moved) return;
return setPaneRange(pane, pl, text, repeated, false);
},
.line => |line_kind| switch (line_kind) {
.start => return pointMove(pane, pl, text, range, modal.lineStartOffset(text, modal.hxLineOf(text, cur))),
.end => {
const line = modal.hxLineOf(text, cur);
const ls = modal.lineStartOffset(text, line);
return pointMove(pane, pl, text, range, @max(ls, modal.prevGrapheme(text, modal.hxLineEndIdx(text, line))));
},
.first_nonws => {
const line = modal.hxLineOf(text, cur);
const ls = modal.lineStartOffset(text, line);
const slice = text[ls..modal.hxLineEndIdx(text, line)];
const nw = modal.firstNonWs(slice);
if (nw == slice.len) return;
return pointMove(pane, pl, text, range, ls + nw);
},
},
.goto_line => |go| {
if (!go.explicit) return;
const line = @min(@as(usize, go.count) - 1, maxLine(text));
return pointMove(pane, pl, text, range, modal.lineStartOffset(text, line));
},
.page => |page| switch (page.kind) {
// Counts were parsed historically but these four text view
// actions intentionally move exactly one viewport unit.
.half_down => return halfPageMove(pane, pl, text, range, true),
.half_up => return halfPageMove(pane, pl, text, range, false),
.down => return scrollViewMove(pane, pl, text, range, @as(i32, pane.rows)),
.up => return scrollViewMove(pane, pl, text, range, -@as(i32, pane.rows)),
},
.insert => |insert| {
const where: InsertAt = switch (insert.kind) {
.at => .at,
.append => .append,
.line_start => .line_start,
.line_end => .line_end,
.open_below => .open_below,
.open_above => .open_above,
};
return p.enterInsert(pane, where, insert.count);
},
.select => |select| switch (select.kind) {
.mode => {
if (pane.select) {
pane.select = false;
} else {
pane.select = true;
if (pane.msel.active) {
setPaneRange(pane, pl, text, range, true);
} else if (!pane.vsel.active) {
pane.vsel = .{ .active = true, .row = pane.cur_row, .col = pane.cur_col, .explicit = true };
} else {
pane.vsel.explicit = true;
}
}
pane.cur_pinned = true;
},
.line => return lineSelect(pane, pl, text, range, select.count),
.line_bounds => return lineBoundsSelect(pane, pl, text, range),
.shrink_to_line_bounds => return shrinkSelToLineBounds(pane, pl, text, range),
.collapse => return setPaneRange(pane, pl, text, .{ .anchor = cur, .head = cur }, false),
.flip => {
const explicit = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
return setPaneRange(pane, pl, text, .{ .anchor = range.head, .head = range.anchor }, explicit);
},
.all => return setPaneRange(pane, pl, text, .{ .anchor = 0, .head = text.len }, false),
},
.multi => |multi| {
if (multi.kind == .keep_primary) {
pane.nsel = 0;
return;
}
return multiSelAction(pane, pl, text, multi.kind, multi.count);
},
.select_regex => |split| return p.startSelRegex(pane, split),
.edit => |edit| switch (edit.kind) {
.delete => return p.normalDelete(pane, true),
.delete_noyank => return p.normalDelete(pane, false),
.change => return p.normalChange(pane),
.yank => return p.normalYank(pane),
.replace_with_yank => return p.normalReplaceYank(pane),
.paste_after => {
pane.count = edit.count;
return p.normalPaste(pane, false);
},
.paste_before => {
pane.count = edit.count;
return p.normalPaste(pane, true);
},
.switch_case => return p.normalCase(pane, .toggle),
.lowercase => return p.normalCase(pane, .lower),
.uppercase => return p.normalCase(pane, .upper),
.join_lines => return p.normalJoin(pane),
.indent => return p.normalIndent(pane, edit.count, true),
.unindent => return p.normalIndent(pane, edit.count, false),
.comment_toggle => return p.normalToggleComment(pane),
.undo => return p.doUndo(pane),
.redo => return p.doRedo(pane),
},
.lsp => |request| return p.lspRequest(p.active, switch (request) {
.definition => .definition,
.declaration => .declaration,
.type_definition => .type_definition,
.implementation => .implementation,
.references => .references,
.format => .format,
}, ""),
.adjust_number => |delta| return p.normalAdjustNumber(pane, delta),
.leader => {
p.leader_on = true;
p.leader_n = 0;
},
.command_line => {
p.enterTagEdit(pane, -1);
if (pane.tag_edit) pane.mode = .normal;
},
.pipe_selection => return p.startPipe(pane),
.search => return p.startSearch(pane, config.search_marker),
.search_step => |direction| return p.lookWalk(
if (direction == .forward) @as(i32, 1) else -1,
),
}
}
// ---- selection pipe (`|`): visible prompt, async shell, atomic edit ----
fn startPipe(p: *Pardes, pane: *Pane) void {
// A buffer that IS a file, or the scratch that becomes one: a filter
// rewrites bytes the pane owns. Never a terminal (shell output cannot
// be rewritten), never a rendering that its next refill would discard.
const f = pane.file orelse return;
if (!output_pane.fileTraits(f.output).saves) return;
p.seedTail(pane);
if (!pane.tag_init) return;
const prompt_at: u16 = @intCast(pane.tag_tail_len);
if (!pane.appendTag(config.pipe_marker)) return;
pane.prompt = .{ .pipe = prompt_at };
pane.tag_edit = true;
pane.tag_sel = false;
pane.mode = .insert;
pane.pending = 0;
pane.tag_col = @intCast((p.tagPrefix(pane) catch return).len + pane.tag_tail_len);
}
/// Snapshot command/cwd/ranges/selection bytes before emitting the id-only
/// effect. Every allocation is owned by pipe_wait, so the frontend can
/// copy it synchronously and the core can keep editing immediately after.
fn submitPipe(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
const f = pane.file orelse return;
if (!output_pane.fileTraits(f.output).saves) return;
const tail = pane.tagSlice();
const armed = tail[@min(pane.promptAt() orelse return, tail.len)..];
if (!std.mem.startsWith(u8, armed, config.pipe_marker)) return;
const command = armed[config.pipe_marker.len..];
if (command.len == 0) return;
var ranges: [MAX_SELS]modal.HxRange = undefined;
const got = paneRanges(pane, f.content, 0, &ranges);
const inputs = p.gpa.alloc(selection_pipe.Input, got.n) catch return;
var made: usize = 0;
for (ranges[0..got.n], 0..) |range, i| {
const lo = @min(range.anchor, range.head);
const hi = @max(range.anchor, range.head);
if (hi > f.content.len) break;
const copy = p.gpa.dupe(u8, f.content[lo..hi]) catch break;
inputs[i] = .{ .bytes = copy };
made += 1;
}
if (made != got.n) {
for (inputs[0..made]) |input| p.gpa.free(@constCast(input.bytes));
p.gpa.free(inputs);
return;
}
const command_copy = p.gpa.dupe(u8, command) catch {
for (inputs) |input| p.gpa.free(@constCast(input.bytes));
p.gpa.free(inputs);
return;
};
const cwd_copy = p.gpa.dupe(u8, paneDir(pane)) catch {
p.gpa.free(command_copy);
for (inputs) |input| p.gpa.free(@constCast(input.bytes));
p.gpa.free(inputs);
return;
};
p.pipe_seq +%= 1;
if (p.pipe_wait) |*old| old.deinit(p.gpa);
p.pipe_wait = .{
.id = p.pipe_seq,
.pane = id,
.serial = pane.serial,
.revision = f.revision,
.command = command_copy,
.cwd = cwd_copy,
.inputs = inputs,
.ranges = ranges,
.primary = @intCast(got.pri),
.explicit = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active,
};
p.emit(.{ .pipe = .{ .id = p.pipe_seq } });
}
/// Frontends call this while draining a .pipe effect, then immediately
/// copy the borrowed view into a worker-owned selection_pipe.Job.
pub fn pipeRequest(p: *const Pardes, id: u32) ?selection_pipe.Request {
if (p.pipe_wait) |*wait| {
if (wait.id == id) return wait.request();
}
return null;
}
fn pipeResponse(p: *Pardes, id: u32, success: bool, outputs: []const []const u8) void {
if (p.pipe_wait == null or p.pipe_wait.?.id != id) return;
var wait = p.pipe_wait.?;
p.pipe_wait = null;
defer wait.deinit(p.gpa);
if (!success or outputs.len != wait.inputs.len) return;
const pane = p.panes[wait.pane] orelse return;
if (pane.serial != wait.serial) return;
const f = if (pane.file) |*file| file else return;
if (!output_pane.fileTraits(f.output).saves or f.revision != wait.revision) return;
var total_output: usize = 0;
var removed: usize = 0;
var previous_end: usize = 0;
for (outputs, wait.ranges[0..outputs.len]) |output, range| {
if (output.len > selection_pipe.max_stdout_bytes) return;
total_output = std.math.add(usize, total_output, output.len) catch return;
if (total_output > selection_pipe.max_total_stdout_bytes) return;
const lo = @min(range.anchor, range.head);
const hi = @max(range.anchor, range.head);
if (lo < previous_end or hi > f.content.len) return;
removed = std.math.add(usize, removed, hi - lo) catch return;
previous_end = hi;
}
const kept = f.content.len - removed;
const final_len = std.math.add(usize, kept, total_output) catch return;
const replacement = p.gpa.alloc(u8, final_len) catch return;
var new_ranges: [MAX_SELS]modal.HxRange = undefined;
var read_at: usize = 0;
var write_at: usize = 0;
for (outputs, wait.ranges[0..outputs.len], 0..) |output, range, i| {
const lo = @min(range.anchor, range.head);
const hi = @max(range.anchor, range.head);
@memcpy(replacement[write_at .. write_at + (lo - read_at)], f.content[read_at..lo]);
write_at += lo - read_at;
const out_start = write_at;
@memcpy(replacement[write_at .. write_at + output.len], output);
write_at += output.len;
const out_end = write_at;
new_ranges[i] = if (range.anchor > range.head)
.{ .anchor = out_end, .head = out_start }
else
.{ .anchor = out_start, .head = out_end };
read_at = hi;
}
@memcpy(replacement[write_at..], f.content[read_at..]);
// One async request is one history transaction, even at 64 cursors.
p.pushUndo(pane);
file_pane.setContent(p, f, replacement);
const pl = p.paneCursorLines(pane) catch return;
setPaneRanges(pane, pl, f.content, new_ranges[0..outputs.len], &.{}, wait.primary, wait.explicit);
pane.select = false;
pane.ensureCursorVisible();
}
// ---- search (`/`, Find, n/N): results into an output buffer, look the rows ----
const Search = enum { text, find, grep };
const SearchStart = enum { top, cursor };
fn paneDir(pane: *const Pane) []const u8 {
// an inherited cwd is a live link that outranks a scratch buffer's own
// synthetic path: follow it to the pane it was opened from.
switch (pane.cwd) {
.inherited => |src| return paneDir(src),
else => {},
}
if (pane.file) |f| return std.fs.path.dirname(f.path) orelse "/";
if (comptime pdf_enabled) if (pane.pdf) |pv|
return std.fs.path.dirname(pv.path) orelse "/";
if (pane.image) |iv| return std.fs.path.dirname(iv.path) orelse "/";
return pane.cwdSlice();
}
/// `/` (and the Find builtin) on any pane: type the pattern into the tag
/// tail after `marker` — the existing modal one-line editor, visible while
/// typing, nothing that disappears. Enter/Esc are intercepted in handleKey.
pub fn startSearch(p: *Pardes, pane: *Pane, marker: []const u8) void {
p.seedTail(pane);
if (!pane.tag_init) return;
const prompt_at: u16 = @intCast(pane.tag_tail_len);
if (!pane.appendTag(marker)) return;
pane.prompt = .{ .search = prompt_at };
pane.tag_edit = true;
pane.tag_sel = false;
pane.mode = .insert;
pane.pending = 0;
// tag_col and the prompt offset are both UTF-8 byte offsets.
pane.tag_col = @intCast((p.tagPrefix(pane) catch return).len + pane.tag_tail_len);
}
/// Save on a pane with no file of its own — an output buffer or a terminal
/// — arms a PATH input in the tag, prefilled with the pane's directory (an
/// inherited scratch follows the pane it was opened from). submitSave
/// hands what you type to saveTo.
pub fn startSavePrompt(p: *Pardes, pane: *Pane) void {
p.seedTail(pane);
if (!pane.tag_init) return;
const prompt_at: u16 = @intCast(pane.tag_tail_len);
if (!pane.appendTag(config.save_marker)) return;
const dir = paneDir(pane);
_ = pane.appendTag(dir);
if (dir.len == 0 or dir[dir.len - 1] != '/') _ = pane.appendTag("/");
pane.prompt = .{ .save = prompt_at };
pane.tag_edit = true;
pane.tag_sel = false;
pane.mode = .insert;
pane.pending = 0;
pane.tag_col = @intCast((p.tagPrefix(pane) catch return).len + pane.tag_tail_len);
}
/// Enter on a save input: the path is everything past the marker.
fn submitSave(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
const at = switch (pane.prompt) {
.save => |a| a,
else => return,
};
const armed = pane.tag_tail[at..pane.tag_tail_len];
pane.tag_tail_len = at; // drop the prompt back to the seeded tail
if (!std.mem.startsWith(u8, armed, config.save_marker)) return;
const path = std.mem.trim(u8, armed[config.save_marker.len..], " \t\r\n");
if (path.len == 0) return;
p.saveTo(id, path);
}
/// Write the file this pane already has: acme's Put, and the one Save that
/// needs no argument because the path was never a question.
pub fn saveFile(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
const f = if (pane.file) |*file| file else return;
if (f.output != null) return; // nothing behind it yet: saveTo, with a path
p.emit(.{ .save_file = .{ .pane = @intCast(id) } });
f.saved_revision = f.revision;
}
/// Commit a path — prompted, typed after the word, or chorded onto it.
///
/// The pane is left ALONE: a terminal stays a terminal, a results buffer
/// keeps its rows and its place in the n/N ring, and an open file keeps the
/// file it has, so `Save <elsewhere>` is a copy and never a rename. The one
/// pane that changes is the scratch New opened, which exists to become the
/// file you name and does (output traits: `saves`).
///
/// A relative path resolves against the PANE's directory — the way a look
/// resolves a relative word — and never against whatever directory the
/// process happened to start in. `.`, `..` and doubled slashes normalize
/// with it, so `Save ./notes` and `Save notes` are one path and one answer
/// to "is this the file I already have open".
///
/// What it will not do is guess. A path that names no FILE (empty, or
/// ending in `/` — the bare prompt prefill accepted with Enter), one that
/// carries a newline (a multi-line selection chorded onto the word), and
/// one that does not resolve ABSOLUTE (a terminal whose shell has not
/// reported a directory yet, where the alternative is writing into
/// whatever directory pardes was started in) are all refused, and say so
/// on the message row. That check comes FIRST because the scratch's branch
/// below rewrites the pane's identity: a host write can only fail silently
/// afterwards, so a buffer must never become a "file" that never existed.
pub fn saveTo(p: *Pardes, id: usize, path: []const u8) void {
const pane = p.panes[id] orelse return;
if (path.len == 0 or path[path.len - 1] == '/' or
std.mem.indexOfScalar(u8, path, '\n') != null)
return p.reportError(id, "save", error.NoFilename);
const full = std.fs.path.resolvePosix(
p.scratch.allocator(),
&.{ paneDir(pane), path },
) catch return;
if (!std.fs.path.isAbsolute(full)) return p.reportError(id, "save", error.NoDirectory);
if (full.len > SavePath.cap) return p.reportError(id, "save", error.PathTooLong);
const f = if (pane.file) |*file| file else {
// a terminal writes its scrollback; an image and a PDF have nothing
// of their own that is unwritten, so they have nothing to write
if (pane.isTerminal()) p.askWrite(id, pane.serial, full);
return;
};
if (f.output != null and output_pane.fileTraits(f.output).saves) {
const owned = p.gpa.dupe(u8, full) catch return;
p.gpa.free(f.path);
f.path = owned;
f.output = null; // an ordinary file pane from here on
pane.cwd = .none; // its directory is now its own path's dirname
f.saved_revision = f.revision;
pane.tag_init = false; // re-derive the tag as a plain file
pane.tag_tail_len = 0;
p.emit(.{ .save_file = .{ .pane = @intCast(id) } });
p.emit(.{ .watch = .{ .pane = @intCast(id), .on = true } });
return;
}
// its own path, spelled out: the in-place write, so the pane comes clean
if (f.output == null and std.mem.eql(u8, f.path, full)) return p.saveFile(id);
p.askWrite(id, pane.serial, full);
}
/// The bound on a save path, which travels inside its effect: nothing is
/// stashed, so two saves armed in one batch cannot be confused for each
/// other and a whole buffer is never copied to write it.
const SavePath = Effect.Buf(256);
/// Ask the host to write this pane's text at `path` without touching the
/// pane. The bytes are the pane's own, so the drain reads them back off it
/// (perform, .save_text) the way save_file does — with `serial` saying
/// which pane asked, since the slot may be freed before the drain.
fn askWrite(p: *Pardes, id: usize, serial: u32, path: []const u8) void {
p.emit(.{ .save_text = .{
.pane = @intCast(id),
.serial = serial,
.path = SavePath.from(path),
} });
}
/// Enter on an armed input: the pattern is everything past the marker's
/// `/` (so a pattern may itself contain slashes), and the marker names the
/// search — " Find /" walks the filesystem for NAMES, " Grep /" for
/// CONTENTS, " /" reads the pane's own text. No `/` left means the editor
/// ate the marker: nothing to run.
fn submitSearch(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
// `s`/`S` have already applied themselves keystroke by keystroke;
// Enter re-runs the final pattern so a submit is one code path with
// the preview and cannot disagree with what is on screen.
if (selRegexArmed(pane)) |a| return p.applySelRegex(pane, a.pat, a.split);
const tail = pane.tagSlice();
const armed = tail[@min(pane.promptAt() orelse return, tail.len)..];
const slash = std.mem.indexOfScalar(u8, armed, '/') orelse return;
if (std.mem.startsWith(u8, armed, config.rename_marker)) return p.lspRequest(id, .rename, armed[slash + 1 ..]);
if (std.mem.startsWith(u8, armed, config.symbol_marker)) return p.lspRequest(id, .workspace_symbols, armed[slash + 1 ..]);
const kind: Search = if (std.mem.startsWith(u8, armed, config.find_marker))
.find
else if (std.mem.startsWith(u8, armed, config.grep_marker))
.grep
else
.text;
p.runSearch(id, armed[slash + 1 ..], kind, .top) catch |err| return p.reportError(id, "search", err);
// ...and the bare `/` GOES there. Find and Grep answer with OTHER
// files, and opening the first of them on submit would rearrange the
// screen before you have read what was found; `/` searched the text
// already in front of you, so its first hit is a scroll, not a jump.
if (kind == .text) p.lookFirstHit(id);
}
/// Land ON the first hit of a `/`, instead of beside a list of them.
///
/// No new motion: the results buffer is FOCUSED and then the two ordinary
/// verbs run in the order a hand would run them — the step `n` is, and the
/// look Enter is. Focusing is the part that cannot be skipped and the
/// reason this is not just a call to the walk: lookWalkPanes deliberately
/// leaves the ACTIVE pane out of the ring, so `n` pressed straight after a
/// search steps whichever list was looked most recently, which in a
/// session with any history at all is not the one that just answered.
///
/// Everything the walk needs to be reversible from here is left by the
/// step itself (landLookSpot's `look_at`), so `N` afterwards goes back to
/// the row above exactly as it would have if you had pressed `n` yourself.
fn lookFirstHit(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
const rid = pane.search_pane orelse return;
const rp = p.panes[rid] orelse return;
// Nothing matched: the empty buffer is the answer, and aiming the walk
// at a list with no rows would send it round the ring into a NEIGHBOUR
// and open a row from some other search.
if ((rp.file orelse return).content.len == 0) return;
p.active = rid;
p.lookWalk(1);
if (p.active != rid) return; // walked out of the list; leave it there
const txt = p.currentSelText(rp) orelse return;
// spent, exactly as the look chord spends it (handleKey)
rp.vsel.active = false;
rp.msel.active = false;
rp.select = false;
p.runBuiltin(config.look_cmd, rid, "", txt);
}
/// Fill this pane's results buffer with everything matching `pat_raw`
/// (plain substring, case-insensitive) — ONE function for both searches,
/// because they differ only in where the rows come from and agree on every
/// row being a LOOK TARGET, which is what makes n/N work:
/// text (`/`) — the pane's own flat text, the same view Look and Execute
/// read, so a terminal searches its scrollback exactly as a file
/// searches its content. Rows are `location text`, the location ended
/// by a SPACE (a trailing `:` would read as part of it): the pane's
/// path when it has a real file, else `@pN`.
/// find — the pane's DIRECTORY, walked like fd. Rows are bare paths.
/// grep — the CONTENTS of every file under every pane's directory,
/// walked like `grep -R`. Rows are `path:LINE:COL-ENDCOL text`, the
/// path relative to THIS pane's directory (absolute for a hit outside
/// it).
/// Both searches that match TEXT name the match's whole span, so looking a
/// row — which is all n/N do — selects what matched rather than parking on
/// its first cell. Find's rows are bare paths and have nothing to span.
/// No matches = an empty buffer.
///
/// `start` is where the WALK begins, which belongs to the gesture and not
/// to the search: a click POINTS at one of the hits, so its list is armed
/// there and the first step goes to the next one (acme's button-3 walking a
/// word). `/`, Find and Grep point at nothing, so their list is walked from
/// the top, which is also the only place a list of OTHER files could start.
pub fn runSearch(p: *Pardes, id: usize, pat_raw: []const u8, kind: Search, start: SearchStart) !void {
const pane = p.panes[id] orelse return;
const pat = std.mem.trim(u8, pat_raw, " \t\r\n");
if (pat.len == 0) return;
const arena = p.scratch.allocator();
// where the pane lives: a file's directory, a shell's cwd — the walk
// root, and the directory the results buffer is named in.
const dir = paneDir(pane);
const out = try arena.alloc(u8, look.search_max_output_bytes);
var out_len: usize = 0;
var nrows: usize = 0;
var anchor: ?usize = null;
if (kind == .grep) {
// One walk per PLACE the session is open on: every pane's
// directory, minus the ones another pane's already contains, so a
// tree two panes sit in is greped once and a pane deep inside
// another's tree adds nothing. Slot order, so the same session
// gives the same buffer twice running.
var roots: [MAX_PANES][]const u8 = undefined;
var nroots: usize = 0;
for (p.panes) |slot| {
const pp = slot orelse continue;
const d = paneDir(pp);
var covered = false;
var k: usize = 0;
while (k < nroots) {
if (pathUnder(d, roots[k])) {
covered = true;
break;
}
if (pathUnder(roots[k], d)) { // this one swallows a root already kept
nroots -= 1;
roots[k] = roots[nroots];
continue;
}
k += 1;
}
if (covered) continue;
roots[nroots] = d;
nroots += 1;
}
for (roots[0..nroots]) |r|
out_len += try look.grep(arena, p.gpa, r, dir, pat, out[out_len..]);
} else if (kind == .find) {
out_len = try look.find(arena, dir, pat, out);
} else if (hasPdf(pane)) {
if (comptime pdf_enabled) {
const found = try pdf_pane.searchRows(
&pane.pdf.?,
p.pdf_gpa,
arena,
pat,
start == .cursor,
out,
);
out_len = found.bytes;
nrows = found.rows;
anchor = found.anchor;
}
} else {
const pl = try p.paneCursorLines(pane);
// a real file names itself; a terminal or an output buffer has no path
const has_path = if (pane.file) |f| f.output == null else false;
var idbuf: [16]u8 = undefined;
// relative to `dir`, like Find's rows — and `dir` IS this file's
// own directory, so that is exactly its basename
const loc: []const u8 = if (has_path)
std.fs.path.basename(pane.file.?.path)
else
std.fmt.bufPrint(&idbuf, config.pane_addr ++ "{d}", .{id}) catch return error.PathTooLong;
// the hit at or before the cursor is the one you are ON, so arming
// there makes the first step land on the NEXT one: a click on the
// second `foo` goes to the third, not back to the first.
const cl: usize = @intCast(@max(0, pane.cur_row));
const cc: usize = @intCast(@max(0, pane.cur_col));
for (pl.lines, 0..) |ln, i| {
const at = std.ascii.indexOfIgnoreCase(ln, pat) orelse continue;
const row = try std.fmt.allocPrint(arena, "{s}:{d}:{d}{c}{d} {s}\n", .{
loc, i + 1, at + 1, config.range_sep, at + pat.len, std.mem.trimEnd(u8, ln, " \t"),
});
if (row.len > out.len - out_len) break;
if (start == .cursor and (i < cl or (i == cl and at <= cc))) anchor = nrows;
@memcpy(out[out_len..][0..row.len], row);
out_len += row.len;
nrows += 1;
}
}
const content = try p.gpa.dupe(u8, out[0..out_len]);
// the buffer records WHICH search filled it, pattern and all: Find and
// Grep are builtins (words you can execute), the bare `/` is a key
const from: output_pane.Origin = switch (kind) {
.text => .search,
.find => .{ .cmd = .Find },
.grep => .{ .cmd = .Grep },
};
// A different pattern still gets its own buffer: two searches are two
// lists, both stay open at their sizes, and the new one stacks directly
// below this pane. Everything about landing the rows — which open
// buffer counts as this same search, keeping a refill's place, opening
// fresh when there is none — is output_pane.fillResults.
try output_pane.fillResults(p, id, dir, from, pat, content, anchor);
}
/// Step to the next/previous row of this pane's results buffer and ACT on
/// it — which of the two acme verbs that is comes from the buffer's own
/// traits. A location list (every search, every language answer) Looks the
/// leading `path:LINE:COL` word; a command list (ThemeSel, FontSel) Execs
/// the whole row. False = no live results to step.
///
/// n/N used to BE this, and are not any more (lookWalk): stepping a list
/// of places now selects and stops, because a step that also opened meant
/// you could not walk past a hit without landing on it. What still comes
/// through here is what is not n/N at all: `]d`/`[d`, whose whole job is
/// to GO to the next diagnostic, and acme's button-3, where clicking a
/// word that names nothing searches for it and goes to the first hit.
fn searchStep(p: *Pardes, id: usize, delta: i32) bool {
const pane = p.panes[id] orelse return false;
const rid = pane.search_pane orelse return false;
const rp = p.panes[rid] orelse return false;
const rf = if (rp.file) |*f| f else return false;
// one question covers both hazards: a freed slot can be reused by an
// unrelated pane, and a buffer of PROSE has nowhere to step to
const tr = output_pane.fileTraits(rf.output);
if (!tr.steps) return false;
// fresh results: n starts at the first row, N has nothing behind it
const nrows: i64 = @intCast(std.mem.count(u8, rf.content, "\n"));
const step: i64 = if (pane.search_row) |c| @as(i64, @intCast(c)) + delta else if (delta > 0) 0 else -1;
if (step < 0 or step >= nrows) return true; // armed, nowhere left to go
const r: i32 = @intCast(step);
pane.search_row = @intCast(step);
// select the result row in the results pane and keep it in view
rp.msel = .{ .active = true, .r0 = r, .r1 = r };
rp.vsel.active = false;
rp.nsel = 0;
rp.cur_row = r;
rp.cur_pinned = true;
// in view, but WITHOUT scrolloff: a results pane is short, and a
// three-row margin on a seven-row one means every single n scrolls the
// list out from under the eye. A row already on screen moves nothing.
const off = rp.scroll();
const last = off + @as(i32, rp.rows) - 1;
if (r < off) rp.scrollBy(r - off) else if (r > last) rp.scrollBy(r - last);
const ln = modal.lineSlice(rf.content, @intCast(step));
var realbuf: [4096]u8 = undefined;
const span = if (tr.commands)
wholeRowSpan(ln)
else
look.lookableLineSpan(ln, paneDir(rp), &realbuf);
if (span) |selected| {
rp.cur_col = @intCast(selected.start);
rp.look_at = .{
.row = r,
.col0 = @intCast(selected.start),
.col1 = @intCast(selected.end - 1),
};
} else {
rp.cur_col = 0;
rp.look_at = null;
}
// Both arms are the BUILTIN, run on the results pane — the same call a
// middle or right click on that row would make, so a stepped row and a
// clicked row can never drift apart. A command row goes whole (its
// argument is the tail after the name); a location row is cut to the
// leading file-ish word, since the rest of it is the matched text.
if (tr.commands) {
p.runBuiltin(config.exec_cmd, rid, "", std.mem.trim(u8, ln, " \t\r"));
} else {
var hi: usize = 0;
while (hi < ln.len and config.isFileChar(ln[hi])) hi += 1;
p.runBuiltin(config.look_cmd, rid, "", ln[0..hi]);
}
// the look may focus what it opened — a Find row opens a whole new
// file pane every time — so focus comes back to the pane that owns the
// search and the next n keeps stepping. A `/` row looks at the
// searching pane itself, so this is what already happened there.
p.active = id;
return true;
}
/// Ask the backend something about the symbol under the cursor. Only a
/// real file can be asked: a terminal's rows are a program's output and an
/// output buffer is our own text, neither of which has a language behind
/// it. Unsupported kinds never get here (the keymap drops them), so a
/// backend that answers nothing simply never opens a buffer.
pub fn lspRequest(p: *Pardes, id: usize, kind: lsp.Kind, arg: []const u8) void {
if (!p.multiOnce()) return; // one question per keystroke, from the primary
if (!lsp.supports.contains(kind)) return;
const pane = p.panes[id] orelse return;
// `status` is about the BACKEND, not about a document, so it answers
// from ANY pane — a terminal, a +Search, anywhere. That matters
// precisely when the pane you are sitting in is the thing going wrong.
// Every other kind needs a real file: a terminal's rows are a
// program's output and an output buffer is our own text.
if (kind != .status) {
const f = pane.file orelse return;
if (f.output != null) return;
}
if (arg.len > 128) return; // the effect's arg is a Buf(128)
if (kind == .rename and (!std.zig.isValidId(arg) or std.zig.isUnderscore(arg))) return;
const off = if (pane.file) |f| modal.hxOff(f.content, .{
.row = @intCast(@max(0, pane.cur_row)),
.col = @intCast(@max(0, pane.cur_col)),
}) else 0;
p.lsp_seq +%= 1;
p.lsp_wait = .{
.id = p.lsp_seq,
.kind = kind,
.pane = id,
.serial = pane.serial,
.revision = if (pane.file) |f| f.revision else 0,
.arg = .from(arg),
.row = pane.cur_row,
.col = pane.cur_col,
};
p.emit(.{ .lsp = .{
.id = p.lsp_seq,
.kind = kind,
.pane = @intCast(id),
.offset = @intCast(off),
.arg = .from(arg),
} });
}
const LspEdit = struct { start: usize, end: usize };
fn parseLspEdits(p: *Pardes, bytes: []const u8) ?[]LspEdit {
if (bytes.len == 0 or bytes[bytes.len - 1] != '\n') return null;
const edits = p.scratch.allocator().alloc(LspEdit, std.mem.count(u8, bytes, "\n")) catch return null;
var lines = std.mem.splitScalar(u8, bytes, '\n');
var n: usize = 0;
while (lines.next()) |line| {
if (line.len == 0) {
if (lines.peek() == null) break;
return null;
}
var fields = std.mem.tokenizeScalar(u8, line, ' ');
if (!std.mem.eql(u8, fields.next() orelse return null, "@edit")) return null;
const start = std.fmt.parseInt(usize, fields.next() orelse return null, 10) catch return null;
const end = std.fmt.parseInt(usize, fields.next() orelse return null, 10) catch return null;
if (fields.next() != null) return null;
edits[n] = .{ .start = start, .end = end };
n += 1;
}
return if (n == 0) null else edits[0..n];
}
fn mapLspEditOffset(edits: []const LspEdit, replacement_len: usize, old: usize) usize {
var old_at: usize = 0;
var new_at: usize = 0;
for (edits) |e| {
if (old < e.start) return new_at + (old - old_at);
new_at += e.start - old_at;
if (old < e.end) return new_at + @min(old - e.start, replacement_len - 1);
new_at += replacement_len;
if (old == e.end) return new_at;
old_at = e.end;
}
return new_at + (old - old_at);
}
fn applyLspRename(p: *Pardes, pane: *Pane, revision: u32, new_name: []const u8, bytes: []const u8) void {
const f = if (pane.file) |*file| file else return;
if (f.revision != revision) return;
const edits = p.parseLspEdits(bytes) orelse return;
var removed: usize = 0;
var previous_end: usize = 0;
for (edits) |e| {
if (e.start < previous_end or e.start >= e.end or e.end > f.content.len) return;
removed = std.math.add(usize, removed, e.end - e.start) catch return;
previous_end = e.end;
}
if (std.mem.eql(u8, f.content[edits[0].start..edits[0].end], new_name)) return;
const added = std.math.mul(usize, edits.len, new_name.len) catch return;
const final_len = std.math.add(usize, f.content.len - removed, added) catch return;
const replacement = p.gpa.alloc(u8, final_len) catch return;
const old_cursor = modal.hxOff(f.content, .{
.row = @intCast(@max(0, pane.cur_row)),
.col = @intCast(@max(0, pane.cur_col)),
});
const mapped_cursor = mapLspEditOffset(edits, new_name.len, old_cursor);
var read_at: usize = 0;
var write_at: usize = 0;
for (edits) |e| {
@memcpy(replacement[write_at .. write_at + (e.start - read_at)], f.content[read_at..e.start]);
write_at += e.start - read_at;
@memcpy(replacement[write_at .. write_at + new_name.len], new_name);
write_at += new_name.len;
read_at = e.end;
}
@memcpy(replacement[write_at..], f.content[read_at..]);
p.pushUndo(pane);
file_pane.setContent(p, f, replacement);
const cursor = modal.hxPos(f.content, mapped_cursor);
pane.cur_row = @intCast(cursor.row);
pane.cur_col = @intCast(cursor.col);
pane.vsel.active = false;
pane.msel.active = false;
pane.select = false;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// A worker answered. Rename's edit records are consumed first and never
/// rendered. Every other response is the ordinary look/output path:
/// one row, a goto -> jump straight there (helix jumps on a single
/// location and shows a picker on several)
/// anything else -> an output buffer, which n/N already steps. That
/// buffer IS the picker; there was never one to write.
pub fn lspResponse(p: *Pardes, id: u32, rows: []const u8) void {
const w = p.lsp_wait orelse return;
if (w.id != id) return; // superseded by a newer press, or the pane died
p.lsp_wait = null;
const pane = p.panes[w.pane] orelse return;
if (pane.serial != w.serial) return;
if (w.kind == .rename) return p.applyLspRename(pane, w.revision, w.arg.slice(), rows);
if (rows.len == 0) {
// No rows is a legal answer everywhere except here. Tab DIVERTED
// instead of indenting, so an empty answer would eat the keystroke
// — a dot in a comment, a dot in a string, a half-typed line
// nothing can be made of — and a Tab that silently does nothing is
// worse than not having the feature. So the indent happens now,
// late, on the condition that nothing has moved: same pane, still
// in insert, one cursor, and the cursor still on the cell the Tab
// was pressed at. Anyone who kept typing during the query gets
// nothing rather than four spaces landing 300ms behind their hands.
if (w.kind == .completion and pane.mode == .insert and pane.nsel == 0 and
pane.cur_row == w.row and pane.cur_col == w.col) p.insertTab(pane);
return;
}
const from: output_pane.Origin = .{ .query = w.kind };
const nrows = std.mem.count(u8, rows, "\n");
if (output_pane.traits(from).jumps and nrows == 1) {
const ln = std.mem.trimEnd(u8, rows, "\n");
var hi: usize = 0;
while (hi < ln.len and config.isFileChar(ln[hi])) hi += 1;
// exactly what a `/` result row does when n steps onto it: look the
// `path:LINE:COL` token from the pane that asked, so placement,
// dedup-onto-an-open-pane and centering are the ONE look path.
// (helix would also push its jumplist here; pardes has none, so
// there is nothing to push — do not read this as one.)
return p.lookAt(w.pane, ln[0..hi]);
}
const dir = if (pane.file) |f| (std.fs.path.dirname(f.path) orelse "/") else pane.cwdSlice();
const content = p.gpa.dupe(u8, rows) catch return;
// Landing the rows is runSearch's path exactly, keyed on the KIND
// rather than the argument (fillResults reads that off the origin).
// Why the refill is not optional here: docs/lsp.md.
output_pane.fillResults(p, w.pane, dir, from, w.arg.slice(), content, null) catch |err|
p.reportError(w.pane, "language response", err);
}
// ---- n/N: the walk over look-able text ----
/// How many rows ONE PRESS may scan, across every pane it visits. A
/// shell's motion surface is its whole scrollback and every whitespace run
/// on it costs a realpath, so the walk is bounded.
///
/// Running out STOPS the walk where it stands rather than treating the
/// pane as exhausted and moving on, and that distinction is load-bearing:
/// giving up in the middle of a pane and hopping to the next one would
/// make the two directions disagree about where a pane ENDS, and n/N have
/// to be exact inverses. Not moving is the one failure that always is.
/// A pane whose next look-able text is eight thousand rows away is a pane
/// to scroll, not to step.
const max_look_rows = 8192;
/// Where a step STARTS inside a pane. `col` null enters the pane at the
/// row's edge — every span on it is ahead of you — which is what a hop
/// from a neighbouring pane does. `strict` says the column is a position
/// the walk itself established, so the span sitting ON it is the one you
/// are already at and the step must go past it.
const LookFrom = struct { row: i32, col: ?i32, strict: bool = false };
/// Entering a pane from a neighbour: the first row going forward, the last
/// going back. Spelled once because it is exactly what makes the two
/// directions inverses across a pane boundary.
fn lookEdge(delta: i32) LookFrom {
return .{ .row = if (delta > 0) 0 else std.math.maxInt(i32), .col = null };
}
/// Where the walk currently stands in `pane`.
///
/// `Pane.look_at` and not the cursor alone, because the cursor cannot
/// answer the question. A cursor parked on the first look-able span may
/// mean the walk put it there — so the next step is the SECOND span — or
/// that the pane simply opened that way, which is every fresh +Search, and
/// there the next step must be the FIRST. `search_row` answered the same
/// question the same way for the same reason. When the recorded stand no
/// longer matches the cursor you have moved it yourself since, and the
/// cursor wins: the walk continues from where you are looking.
fn lookStand(pane: *Pane) LookFrom {
if (pane.look_at) |s| if (s.row == pane.cur_row and s.col0 == pane.cur_col)
return .{ .row = s.row, .col = s.col0, .strict = true };
return .{ .row = pane.cur_row, .col = pane.cur_col };
}
/// The panes n/N walk, in the order it walks them: every pane that has
/// performed a LOOK, most recent first, then the OUTPUT buffers none has,
/// newest first — and, only when that comes to nothing at all, the pane
/// you are in.
///
/// The look history is the spine because looking is what marks a pane as
/// the one you are reading things OUT of — the +Search you are stepping,
/// the diagnostics list, the shell whose `ls` rows you keep opening. The
/// unlooked output buffers come after it so a fresh `/`, which has looked
/// at nothing yet, still has somewhere for the first `n` to go: its own
/// results. FILO among them, so two searches step the newer list first.
///
/// The ACTIVE pane is the fallback and NOT a member, which is the
/// difference between n continuing a list and n wandering off it. Look a
/// row out of a +Search and focus lands in the file that opened; the next
/// n has to go back to the +Search, not start walking the paths that
/// happen to be in the source you just opened. Only when nothing has
/// looked and no buffer has answered — a shell one minute into a session,
/// which is where n/N started life — is the pane in front of you the list.
fn lookWalkPanes(p: *Pardes, out: *[MAX_PANES]usize) []const usize {
var n: usize = 0;
var i = p.n_look_src;
while (i > 0) {
i -= 1;
const id = p.paneBySerial(p.look_src[i]) orelse continue;
out[n] = id;
n += 1;
}
const looked = n;
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
const f = pane.file orelse continue;
if (f.output == null) continue;
for (out[0..looked]) |k| {
if (k == id) break;
} else {
// insertion by serial descending — at most MAX_PANES
// comparisons, which is not a sort worth naming
var at = n;
while (at > looked and p.panes[out[at - 1]].?.serial < pane.serial) : (at -= 1)
out[at] = out[at - 1];
out[at] = id;
n += 1;
}
}
if (n == 0) {
if (p.panes[p.active] == null) return out[0..0];
out[0] = p.active;
n = 1;
}
return out[0..n];
}
/// Is a span starting at `col0` PAST `from` in the direction of travel?
/// Only the row a walk STARTED on is filtered — every span on a row it
/// arrived at is ahead of it — and the comparison is against `col0` rather
/// than the whitespace run's start. Those are different columns the moment
/// a wrapper is peeled: `(mise.toml)` is a run starting at 0 and a span
/// starting at 1, and a backward step filtered on the run would find the
/// span it is standing on still ahead of it and never leave the row.
fn lookPast(col0: i32, from: LookFrom, on_start_row: bool, delta: i32) bool {
if (!on_start_row) return true;
const c = from.col orelse return true;
if (delta > 0) return if (from.strict) col0 > c else col0 >= c;
return if (from.strict) col0 < c else col0 <= c;
}
/// The whole row as one span, first non-blank cell to last — the `.whole`
/// grain. The trailing trim keeps a padded row selecting the command and
/// not the padding.
fn wholeRowSpan(ln: []const u8) ?look.Span {
var lo: usize = 0;
while (lo < ln.len and (ln[lo] == ' ' or ln[lo] == '\t')) lo += 1;
const hi = std.mem.trimEnd(u8, ln, " \t\r").len;
return if (hi > lo) .{ .start = lo, .end = hi } else null;
}
/// The next STEPPABLE span in `pane` from `from`, in `delta`'s direction,
/// or null when the pane has none left that way. `budget` is the caller's
/// remaining row allowance and is spent here; a null return with a budget
/// of zero means GAVE UP, not exhausted (see max_look_rows).
///
/// WHAT A SPAN IS comes from the pane's grain (output_pane.Grain) and is
/// the one thing about this motion a buffer gets to change:
/// .word free text — a terminal, a file, a PDF — where a row may hold
/// several places and every look-able run is a stop: an `ls`
/// line hops big.txt -> plain.txt -> sub (look.lookableSpan).
/// .line a results buffer, where a row IS one location: one stop per
/// row, on the largest run its head resolves as, and the matched
/// text after it is not a second stop (look.lookableLineSpan).
/// .whole a command list (ThemeSel, FontSel), where the line is the
/// word: `Theme gruvbox` has no path inside it to pick out.
/// Same motion, same selection, same Enter/Tab afterwards.
///
/// Symmetric by construction in all three, and that is the whole point:
/// both directions ask the same question about the same rows, and both
/// compare against `col0` — the column the walk parks the cursor on. So a
/// step forward off a span and a step back onto it are the same two
/// positions read in the two orders.
fn lookSpanIn(p: *Pardes, pane: *Pane, from: LookFrom, delta: i32, budget: *usize) ?LookSpot {
const pl = p.paneCursorLines(pane) catch return null;
const nrows: i32 = @intCast(pl.lines.len);
if (nrows == 0) return null;
const grain: output_pane.Grain = if (pane.file) |*f| output_pane.grain(f.output) else .word;
const dir = paneDir(pane);
var realbuf: [4096]u8 = undefined;
const start = std.math.clamp(from.row, 0, nrows - 1);
var r = start;
while (r >= 0 and r < nrows) : (r += delta) {
if (budget.* == 0) return null;
budget.* -= 1;
const ln = pl.lines[@intCast(r)];
const on_start = r == start;
switch (grain) {
.word => {
var best: ?LookSpot = null;
var i: usize = 0;
while (i < ln.len) {
while (i < ln.len and (ln[i] == ' ' or ln[i] == '\t')) i += 1;
const t0 = i;
while (i < ln.len and ln[i] != ' ' and ln[i] != '\t') i += 1;
if (i == t0) break;
const sp = look.lookableSpan(ln[t0..i], dir, &realbuf) orelse continue;
const col0: i32 = @intCast(t0 + sp.start);
if (!lookPast(col0, from, on_start, delta)) continue;
best = .{ .row = r, .col0 = col0, .col1 = @intCast(t0 + sp.end - 1) };
if (delta > 0) break; // first one forward; keep the last one back
}
if (best) |b| return b;
},
// one span per row, so there is nothing to keep and nothing to
// scan past: the row either offers it or it does not
.line, .whole => {
const sp = (if (grain == .line)
look.lookableLineSpan(ln, dir, &realbuf)
else
wholeRowSpan(ln)) orelse continue;
const col0: i32 = @intCast(sp.start);
if (lookPast(col0, from, on_start, delta))
return .{ .row = r, .col0 = col0, .col1 = @intCast(sp.end - 1) };
},
}
}
return null;
}
/// n/N: move the SELECTION to the next/previous look-able text and open
/// NOTHING. Enter looks what this leaves selected, and that separation is
/// the change: a step is a motion you can take twenty of and then decide,
/// where it used to be twenty panes.
///
/// The sequence stepped is the concatenation, in lookWalkPanes' order, of
/// each pane's look-able spans in document order, AND IT IS A RING. `n` is
/// the next position on that ring and `N` the previous one, computed the
/// same way from the same state — so x presses one way and x back land
/// exactly where you started, across pane boundaries included: a pane
/// entered forward is entered at its FIRST span, and leaving it backward
/// from that span drops into the previous pane's LAST.
///
/// A ring rather than a list with two ends, for two reasons that turn out
/// to be one. A shell's cursor sits at the PROMPT, below everything it has
/// printed, so a walk that could not come round would have nowhere to go
/// on the very first press — which is the case n/N was written for. And a
/// ring is still exactly reversible, so nothing is given up for it: acme's
/// search has always been one, and this is that.
///
/// (One press is not symmetric, and cannot be: from a cursor the walk has
/// never stood on, the first step ACQUIRES a position rather than moving
/// one — see lookStand. Every press after that is exact.)
///
/// Position stays in each pane (`look_at`); the one global serial records
/// only WHICH stream owns the next step after a Look moves focus away.
/// Serials make deletion/reuse stale safely, and refilling a list simply
/// re-arms that list without manufacturing a second cursor.
///
/// ONE MOTION, EVERYWHERE. Not a pane kind, not a buffer kind, not a mode:
/// n/N are this walk in all of them, which is the other half of making
/// them trustworthy. A PDF used to step its results buffer and jump; it
/// steps the same ring now, which IS that buffer, and Enter does the
/// jumping. The single thing any buffer gets to change is the GRAIN of
/// what a step selects, and it changes it by BEING a kind of buffer rather
/// than by a branch here (output_pane.Grain, read in lookSpanIn): free
/// text steps every look-able word, a results list steps one ROW at a time
/// — its head is the location and the rest is the match — and a command
/// list steps the whole line, because a ThemeSel row is a word to run and
/// not a place to go.
///
/// `]d`/`[d` are not n/N. They are helix's diagnostic motions, their job
/// is to ARRIVE at the next diagnostic, and they still reach searchStep.
fn lookWalk(p: *Pardes, delta: i32) void {
var buf: [MAX_PANES]usize = undefined;
const order = p.lookWalkPanes(&buf);
if (order.len == 0) return;
// A Look may move focus away from the list it came from. Continue the
// explicitly armed origin first; only a stale/missing owner falls back
// to the pane under focus and then the history head.
const owner = if (p.look_walk_owner) |serial| p.paneBySerial(serial) else null;
const active_at = std.mem.indexOfScalar(usize, order, p.active) orelse 0;
const at = if (owner) |wanted|
std.mem.indexOfScalar(usize, order, wanted) orelse active_at
else
active_at;
var from = lookStand(p.panes[order[at]] orelse return);
// ...then every OTHER pane once, in the direction of travel, entered
// at its edge — and `k == order.len` brings the starting pane round a
// second time, from ITS edge, which is the wrap. That bound is also
// what makes a screen with nothing look-able on it terminate.
var budget: usize = max_look_rows;
var k: usize = 0;
while (k <= order.len) : (k += 1) {
// `+ 2 * len` only so the backward subtraction stays unsigned
const idx = (if (delta > 0) at + k else at + 2 * order.len - k) % order.len;
const pane = p.panes[order[idx]] orelse continue;
if (p.lookSpanIn(pane, from, delta, &budget)) |spot|
return p.landLookSpot(order[idx], pane, spot);
if (budget == 0) return; // gave up mid-pane: stay put, stay reversible
from = lookEdge(delta);
}
}
/// Select `spot` and focus its pane. The selection is EXPLICIT so Enter's
/// look chord acts on it, with the anchor on the span's last cell and the
/// cursor on its FIRST — the same shape the old terminal stepper left, and
/// the reason `col0` is the position the walk compares against.
fn landLookSpot(p: *Pardes, id: usize, pane: *Pane, spot: LookSpot) void {
p.pinPaneCursor(pane); // fresh out of tty mode the cursor still tracks the shell
pane.vsel = .{ .active = true, .row = spot.row, .col = spot.col1, .explicit = true };
pane.msel.active = false;
pane.nsel = 0;
pane.cur_row = spot.row;
pane.cur_col = spot.col0;
pane.cur_pinned = true;
pane.look_at = spot;
p.look_walk_owner = pane.serial;
p.active = id;
pane.ensureCursorVisible();
}
/// Route shared edit operations to a file's content or a terminal overlay.
fn editText(p: *Pardes, pane: *Pane, lo: i32, hi: i32, col: i32) ?EditText {
if (pane.file) |f| return .{ .text = f.content, .row0 = 0 };
if (pane.image != null or hasPdf(pane)) return null;
return term_pane.editText(p, pane, lo, hi, col);
}
/// editText for an op whose selection can END on a line's newline cell:
/// eating that newline joins with the line BELOW, so a terminal's buffer
/// has to cover that row too (a file's content always already does).
fn editTextEol(p: *Pardes, pane: *Pane, b: Bounds) ?EditText {
const eb = p.editText(pane, b.lo_row, b.hi_row, -1) orelse return null;
const r: usize = @intCast(@max(0, b.hi_row - eb.row0));
if (r + 1 < modal.lineCount(eb.text)) return eb;
if (b.hi_col < @as(i32, @intCast(modal.lineSlice(eb.text, r).len))) return eb;
return p.editText(pane, b.lo_row, b.hi_row + 1, -1);
}
/// install a rewritten editable text (frees the old one)
fn setEditText(p: *Pardes, pane: *Pane, new: []u8) void {
if (pane.file) |*f| return file_pane.setContent(p, f, new);
term_pane.setEditText(p, pane, new);
}
const InsertAt = enum { at, append, line_start, line_end, open_below, open_above };
fn enterInsert(p: *Pardes, pane: *Pane, where: InsertAt, cnt: usize) void {
if (hasPdf(pane)) return;
p.pinPaneCursor(pane);
// snapshot once per insert session (WITH the pre-insert selection) so
// `u` undoes the whole session and restores what was selected
p.pushUndo(pane);
pane.select = false;
pane.append_at = null;
pane.sticky_col = -1;
const pl = p.paneCursorLines(pane) catch {
pane.mode = .insert;
pane.msel.active = false;
pane.vsel.active = false;
pane.pending = 0;
return;
};
const text = p.flatSurface(pane, pl) catch return;
const cur = toModalCursor(pane, pl);
const llen: usize = if (cur.row < pl.lines.len) pl.lines[cur.row].len else 0;
// helix selection-aware entry: `i` to the selection's START (the
// selection flips and survives until the first edit); `a` one past
// its END, remembering the origin cell for the Esc restore
const b: ?Bounds = if (pane.vsel.active) vselBounds(pane) else null;
switch (where) {
.at => {
if (b) |bb| {
pane.cur_row = bb.lo_row;
pane.cur_col = bb.lo_col;
pane.vsel = .{ .active = true, .row = bb.hi_row, .col = bb.hi_col, .explicit = false };
pane.cur_pinned = true;
}
},
.append => {
const lo_row = if (b) |bb| bb.lo_row else pane.cur_row;
const lo_col = if (b) |bb| bb.lo_col else pane.cur_col;
const hi_row = if (b) |bb| bb.hi_row else pane.cur_row;
const hi_col = if (b) |bb| bb.hi_col else pane.cur_col;
pane.append_at = .{ .row = lo_row, .col = lo_col };
const gap = modal.nextGrapheme(text, modal.hxOff(text, .{ .row = @intCast(@max(0, hi_row)), .col = @intCast(@max(0, hi_col)) }));
const gc = modal.hxPos(text, gap);
pane.cur_row = @intCast(gc.row);
pane.cur_col = @intCast(gc.col);
pane.vsel = .{ .active = b != null, .row = lo_row, .col = lo_col, .explicit = false };
pane.cur_pinned = true;
},
.line_start => {
fromModalCursor(pane, pl, modal.firstNonWsOf(pl.lines, cur));
pane.vsel.active = false;
},
.line_end => {
pane.cur_col = @intCast(llen);
pane.cur_pinned = true;
pane.vsel.active = false;
},
.open_below, .open_above => {
pane.vsel.active = false;
const below = where == .open_below;
const abs: i32 = if (b) |bb| (if (below) bb.hi_row else bb.lo_row) else pane.cur_row;
const eb = p.editText(pane, abs, abs, -1) orelse return;
const row: usize = @intCast(@max(0, abs - eb.row0));
const ind = modal.hxIndentString(modal.lineSlice(eb.text, row));
const arena = p.scratch.allocator();
const block_len = std.math.mul(usize, cnt, ind.len + 1) catch return;
const block = arena.alloc(u8, block_len) catch return;
var block_at: usize = 0;
for (0..cnt) |_| {
if (below) {
block[block_at] = '\n';
block_at += 1;
}
@memcpy(block[block_at..][0..ind.len], ind);
block_at += ind.len;
if (!below) {
block[block_at] = '\n';
block_at += 1;
}
}
const at: modal.Cursor = if (below)
.{ .row = row, .col = modal.lineSlice(eb.text, row).len }
else
.{ .row = row, .col = 0 };
const new = modal.insertAt(p.gpa, eb.text, at, block) catch return;
p.setEditText(pane, new);
pane.cur_row = @as(i32, @intCast(if (below) row + 1 else row)) + eb.row0;
pane.cur_col = @intCast(ind.len);
pane.cur_pinned = true;
if (cnt > 1 and !p.multi_on) opened: {
const pl2 = p.paneCursorLines(pane) catch break :opened;
const t2 = p.flatSurface(pane, pl2) catch break :opened;
var rs: [MAX_SELS]modal.HxRange = undefined;
const m = @min(cnt, MAX_SELS);
for (0..m) |k| {
const o = modal.hxOff(t2, .{ .row = @intCast(@max(0, pane.cur_row - pl2.row0) + @as(i32, @intCast(k))), .col = ind.len });
rs[k] = .{ .anchor = o, .head = o };
}
setPaneRanges(pane, pl2, t2, rs[0..m], &.{}, 0, false);
}
},
}
pane.mode = .insert;
pane.msel.active = false;
pane.pending = 0;
pane.ensureCursorVisible();
}
/// insert mode. ONE path for both pane kinds: a file edits its content, a
/// terminal edits the buffer standing in for its shell rows (editText
/// materializes and grows it), so typing, Enter, joins and the kill runs
/// mean exactly the same thing in a shell pane as in a document.
fn handleInsert(p: *Pardes, pane: *Pane, key: Key) void {
if (pane.nsel == 0) return p.insertKey(pane, key);
p.replaySels(pane, .{ .insert = key });
}
fn insertKey(p: *Pardes, pane: *Pane, key: Key) void {
// helix aliases: normalize to the base key and re-dispatch
if (hit(key, config.insert_backspace_alias)) return p.insertKey(pane, .{ .cp = Key.backspace });
if (hit(key, config.insert_enter_alias)) return p.insertKey(pane, .{ .cp = Key.enter });
if (hit(key, config.insert_delete_alias)) return p.insertKey(pane, .{ .cp = Key.delete });
// a selection carried into insert (i/a) survives only until the next
// key: helix maps it through every edit, pardes drops it instead —
// its only pardes use (the acme chords) needs explicit selections
// anyway, and those never enter insert mode
pane.vsel.active = false;
if (!pane.cur_pinned) p.pinPaneCursor(pane);
// arrows and paging are pure motion over the WHOLE surface, so they
// run before editText — a terminal must not freeze shell rows into an
// edit buffer just because you walked across them
switch (key.cp) {
Key.left, Key.right, Key.up, Key.down => {
const pl = p.paneCursorLines(pane) catch return;
const cur0 = toModalCursor(pane, pl);
const nc = switch (key.cp) {
Key.left => modal.charLeft(pl.lines, cur0),
Key.right => modal.charRight(pl.lines, cur0),
Key.up => insertVerticalCursor(pl.lines, cur0, false),
Key.down => insertVerticalCursor(pl.lines, cur0, true),
else => cur0,
};
fromModalCursor(pane, pl, nc);
pane.ensureCursorVisible();
return;
},
Key.page_up, Key.page_down => {
// helix binds insert pageup/pagedown to the same view
// scroll + cursor snap as normal mode
const pl = p.paneCursorLines(pane) catch return;
const flat = p.flatSurface(pane, pl) catch return;
const range = paneRange(pane, flat, pl.row0);
const step: i32 = @intCast(@max(1, pane.rows));
scrollViewMove(pane, pl, flat, range, if (key.cp == Key.page_down) step else -step);
return;
},
Key.home => {
pane.cur_col = 0;
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
},
Key.end => {
// helix insert End: past the last char (goto_line_end_newline)
const pl = p.paneCursorLines(pane) catch return;
const cur0 = toModalCursor(pane, pl);
pane.cur_col = @intCast(if (cur0.row < pl.lines.len) pl.lines[cur0.row].len else 0);
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
},
else => {},
}
const eb = p.editText(pane, pane.cur_row, pane.cur_row, pane.cur_col) orelse return;
const text = eb.text;
const c = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - eb.row0)), .col = @intCast(@max(0, pane.cur_col)) };
if (key.text.len > 0 and !key.ctrl and !key.alt) {
const new = modal.insertAt(p.gpa, text, c, key.text) catch return;
p.setEditText(pane, new);
for (key.text) |ch| {
if (ch == '\n') {
pane.cur_row += 1;
pane.cur_col = 0;
} else pane.cur_col += 1;
}
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
}
// helix insert-mode kills (word/line; deleteSpan is exclusive)
if (hit(key, config.delete_word_backward)) {
// helix delete_word_backward: to the previous word start —
// crossing the newline at col 0, which takes the word before it
// too, so on the buffer's first line a terminal grows up one row
const e2 = if (c.row == 0 and c.col == 0)
(p.editText(pane, pane.cur_row - 1, pane.cur_row, 0) orelse return)
else
eb;
const c2 = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - e2.row0)), .col = c.col };
const g = modal.hxOff(e2.text, c2);
if (g == 0) return;
const wr = modal.hxWordMove(e2.text, .{ .anchor = g, .head = g }, 1, .prev_word_start);
const from = @min(wr.anchor, wr.head);
const fc = modal.hxPos(e2.text, from);
const new = modal.deleteSpan(p.gpa, e2.text, fc, c2) catch return;
p.setEditText(pane, new);
pane.cur_row = @as(i32, @intCast(fc.row)) + e2.row0;
pane.cur_col = @intCast(fc.col);
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
}
if (hit(key, config.delete_word_forward)) {
// helix delete_word_forward: to the next word END (trailing
// whitespace survives), crossing newlines at line ends — at the
// buffer's last line a terminal grows down one row to allow it
const e2 = if (c.col >= modal.lineSlice(text, c.row).len and c.row + 1 >= modal.lineCount(text))
(p.editText(pane, pane.cur_row, pane.cur_row + 1, pane.cur_col) orelse return)
else
eb;
const c2 = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - e2.row0)), .col = c.col };
const g = modal.hxOff(e2.text, c2);
const wr = modal.hxWordMove(e2.text, .{ .anchor = g, .head = g }, 1, .next_word_end);
const to = @max(wr.anchor, wr.head);
if (to <= g) return;
const new = modal.deleteSpan(p.gpa, e2.text, c2, modal.hxPos(e2.text, to)) catch return;
p.setEditText(pane, new);
pane.cur_pinned = true;
return;
}
if (hit(key, config.kill_to_line_start)) {
const new = modal.deleteSpan(p.gpa, text, .{ .row = c.row, .col = 0 }, c) catch return;
p.setEditText(pane, new);
pane.cur_col = 0;
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
}
if (hit(key, config.kill_to_line_end)) {
const llen = modal.lineSlice(text, c.row).len;
const new = modal.deleteSpan(p.gpa, text, c, .{ .row = c.row, .col = llen }) catch return;
p.setEditText(pane, new);
pane.cur_pinned = true;
return;
}
switch (key.cp) {
Key.enter => {
const line = modal.lineSlice(text, c.row);
const indent = modal.hxNewlineIndentWidth(line, c.col);
const arena = p.scratch.allocator();
const block = arena.alloc(u8, 1 + indent) catch return;
block[0] = '\n';
@memset(block[1..], ' ');
const new = modal.insertAt(p.gpa, text, c, block) catch return;
p.setEditText(pane, new);
pane.cur_row += 1;
pane.cur_col = @intCast(indent);
pane.cur_pinned = true;
pane.ensureCursorVisible();
},
Key.backspace => {
if (pane.cur_col > 0) {
const line = modal.lineSlice(text, c.row);
const prev = modal.prevGrapheme(line, c.col);
const new = modal.deleteChar(p.gpa, text, .{ .row = c.row, .col = prev }) catch return;
p.setEditText(pane, new);
pane.cur_col = @intCast(prev);
pane.cur_pinned = true;
pane.ensureCursorVisible();
return;
}
// at col 0: eat the newline above (join up) — a terminal grows
// its buffer over the row it is joining with
if (pane.cur_row <= 0) return;
const e2 = p.editText(pane, pane.cur_row - 1, pane.cur_row, 0) orelse return;
const row: usize = @intCast(@max(0, pane.cur_row - e2.row0));
if (row == 0) return;
const prevlen = modal.lineSlice(e2.text, row - 1).len;
const new = modal.deleteSpan(p.gpa, e2.text, .{ .row = row - 1, .col = prevlen }, .{ .row = row, .col = 0 }) catch return;
p.setEditText(pane, new);
pane.cur_row -= 1;
pane.cur_col = @intCast(prevlen);
pane.cur_pinned = true;
pane.ensureCursorVisible();
},
Key.delete => {
// delete forward; at line end eat the newline (join), which on
// a terminal means the buffer swallowing the row below
const line = modal.lineSlice(text, c.row);
if (c.col < line.len) {
const new = modal.deleteChar(p.gpa, text, c) catch return;
p.setEditText(pane, new);
} else {
const e2 = p.editText(pane, pane.cur_row, pane.cur_row + 1, pane.cur_col) orelse return;
const row: usize = @intCast(@max(0, pane.cur_row - e2.row0));
if (row + 1 >= modal.lineCount(e2.text)) return;
const new = modal.deleteSpan(p.gpa, e2.text, .{ .row = row, .col = c.col }, .{ .row = row + 1, .col = 0 }) catch return;
p.setEditText(pane, new);
}
pane.cur_pinned = true;
},
Key.tab => {
// Tab straight after a `.` asks the language backend what
// could go there — an output buffer of DEFINITIONS, one row
// per candidate, not an autocomplete popup and not an
// insertion. Only where an answer is possible: a terminal, an
// output buffer or a file the backend does not speak still
// indents, because a Tab that silently does nothing is worse
// than not having the feature. The extension list stays the
// backend's (lsp.speaks); this only asks. (An answer that
// comes back EMPTY indents too, late — see lspResponse.)
//
// Never with several cursors. A language query is a
// per-KEYSTROKE action inside a per-SELECTION replay, so
// multiOnce would stop the replay dead: the other cursors
// would neither ask nor indent and the whole multicursor would
// collapse on a Tab. Every other insert key applies to all of
// them, and so does this one — by indenting.
const ln = modal.lineSlice(text, c.row);
if (!p.multi_on and c.col > 0 and c.col <= ln.len and ln[c.col - 1] == '.') dot: {
const f = pane.file orelse break :dot;
if (f.output != null or !lsp.speaks(f.path)) break :dot;
// speaks() is the fast path only — lspRequest has four
// bails of its own (unsupported kind, dead pane, output
// buffer, multiOnce) and each one would eat the Tab. The
// seq bump is the one honest "the question went out", so
// ask and fall through to the indent if it did not.
const seq = p.lsp_seq;
p.lspRequest(p.active, .completion, "");
if (p.lsp_seq != seq) return;
}
p.insertTab(pane);
},
else => {},
}
}
/// helix insert_tab with a Spaces indent style: spaces to the next tab
/// stop (smart-tab machinery skipped). A function because lspResponse
/// presses the same key, a turn of the loop later.
fn insertTab(p: *Pardes, pane: *Pane) void {
const eb = p.editText(pane, pane.cur_row, pane.cur_row, pane.cur_col) orelse return;
const c: modal.Cursor = .{
.row = @intCast(@max(0, pane.cur_row - eb.row0)),
.col = @intCast(@max(0, pane.cur_col)),
};
const pad = modal.INDENT_W - (c.col % modal.INDENT_W);
const new = modal.insertAt(p.gpa, eb.text, c, " "[0..pad]) catch return;
p.setEditText(pane, new);
pane.cur_col += @intCast(pad);
pane.cur_pinned = true;
pane.ensureCursorVisible();
}
const Bounds = struct { lo_row: i32, lo_col: i32, hi_row: i32, hi_col: i32 };
/// a range's two cells, normalized to document order
fn cellBounds(s: SelRange) Bounds {
if (s.row < s.arow or (s.row == s.arow and s.col < s.acol))
return .{ .lo_row = s.row, .lo_col = s.col, .hi_row = s.arow, .hi_col = s.acol };
return .{ .lo_row = s.arow, .lo_col = s.acol, .hi_row = s.row, .hi_col = s.col };
}
/// the char selection [anchor, cursor] normalized to document order
fn vselBounds(pane: *Pane) Bounds {
return cellBounds(.{ .row = pane.cur_row, .col = pane.cur_col, .arow = pane.vsel.row, .acol = pane.vsel.col });
}
/// the char selection as text. Read off the pane's SURFACE (file content /
/// terminal shell rows + edit buffer), not the rendered body: a yank of a
/// whole line has to carry its newline, the way a file's does, or p/P
/// paste it charwise. Scratch-owned.
fn vselText(p: *Pardes, pane: *Pane) []const u8 {
const arena = p.scratch.allocator();
const b = vselBounds(pane);
const text = if (pane.file) |f| f.content else surface: {
const pl = p.paneCursorLines(pane) catch return "";
break :surface p.flatSurface(pane, pl) catch return "";
};
return modal.rangeText(arena, text, .{ .row = @intCast(@max(0, b.lo_row)), .col = @intCast(@max(0, b.lo_col)) }, .{ .row = @intCast(@max(0, b.hi_row)), .col = @intCast(@max(0, b.hi_col)) }) catch "";
}
/// join surface rows [r0, r1] (absolute) with '\n'; scratch-owned
fn yankRows(p: *Pardes, pane: *Pane, r0: i32, r1: i32) []const u8 {
const arena = p.scratch.allocator();
const pl = p.paneCursorLines(pane) catch return "";
const rows_count: usize = @intCast(@max(0, r1 - r0 + 1));
var total: usize = rows_count -| 1;
var i = r0;
while (i <= r1) : (i += 1) {
if (i >= 0 and @as(usize, @intCast(i)) < pl.lines.len)
total += pl.lines[@intCast(i)].len;
}
const out = arena.alloc(u8, total) catch return "";
var at: usize = 0;
i = r0;
while (i <= r1) : (i += 1) {
if (i > r0) {
out[at] = '\n';
at += 1;
}
if (i >= 0 and @as(usize, @intCast(i)) < pl.lines.len) {
const line = pl.lines[@intCast(i)];
@memcpy(out[at..][0..line.len], line);
at += line.len;
}
}
return out;
}
// ---- edit operations (d / c / y / p) ----
fn normalDelete(p: *Pardes, pane: *Pane, yank: bool) void {
pane.select = false; // helix delete exits select mode
pane.sticky_col = -1;
if (pane.vsel.active) {
const b = vselBounds(pane);
if (yank) p.setYank(p.vselText(pane)); // read the range before the move
p.pushUndo(pane);
const eb = p.editTextEol(pane, b) orelse {
pane.vsel.active = false;
return;
};
const d = modal.deleteRange(p.gpa, eb.text, .{ .row = @intCast(@max(0, b.lo_row - eb.row0)), .col = @intCast(@max(0, b.lo_col)) }, .{ .row = @intCast(@max(0, b.hi_row - eb.row0)), .col = @intCast(@max(0, b.hi_col)) }) catch {
pane.vsel.active = false;
return;
};
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
pane.cur_row = b.lo_row;
pane.cur_col = b.lo_col;
clampCursor(pane, d.content, eb.row0);
return;
}
if (pane.msel.active) {
const r0 = @min(pane.msel.r0, pane.msel.r1);
const r1 = @max(pane.msel.r0, pane.msel.r1);
p.pushUndo(pane);
// linewise: a line's newline lives on the row below it
const eb = p.editText(pane, r0, r1 + 1, -1) orelse {
pane.msel.active = false;
return;
};
const d = modal.deleteLines(p.gpa, eb.text, @intCast(@max(0, r0 - eb.row0)), @intCast(@max(0, r1 - eb.row0))) catch {
pane.msel.active = false;
return;
};
p.setEditText(pane, d.content);
if (yank) p.setYank(d.deleted);
p.gpa.free(d.deleted);
const n = modal.lineCount(d.content);
pane.cur_row = @as(i32, @intCast(@min(@as(usize, @intCast(@max(0, r0 - eb.row0))), if (n == 0) 0 else n - 1))) + eb.row0;
pane.cur_col = 0;
pane.msel.active = false;
pane.cur_pinned = true;
pane.ensureCursorVisible();
} else {
p.pushUndo(pane);
const eb = p.editTextEol(pane, .{ .lo_row = pane.cur_row, .lo_col = pane.cur_col, .hi_row = pane.cur_row, .hi_col = pane.cur_col }) orelse return;
const c = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - eb.row0)), .col = @intCast(@max(0, pane.cur_col)) };
if (yank) {
const arena = p.scratch.allocator();
p.setYank(modal.rangeText(arena, eb.text, c, c) catch return);
}
// deleteRange (not deleteChar): the cursor may sit ON a '\n'
// cell, where a delete joins the lines (helix 1-wide selection)
const d = modal.deleteRange(p.gpa, eb.text, c, c) catch return;
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
const llen = modal.lineSlice(d.content, c.row).len;
pane.cur_col = @min(pane.cur_col, @as(i32, @intCast(llen)));
}
}
fn normalYank(p: *Pardes, pane: *Pane) void {
pane.select = false;
if (pane.vsel.active) {
p.setYank(p.vselText(pane));
return;
}
if (pane.msel.active) {
p.setYank(p.yankRows(pane, @min(pane.msel.r0, pane.msel.r1), @max(pane.msel.r0, pane.msel.r1)));
} else {
const save = pane.vsel;
pane.vsel = .{ .active = true, .row = pane.cur_row, .col = pane.cur_col, .explicit = false };
p.setYank(p.vselText(pane));
pane.vsel = save;
}
}
/// helix p/P: the DEFAULT register, after/before the selection.
fn normalPaste(p: *Pardes, pane: *Pane, before: bool) void {
p.pasteText(pane, p.yank orelse return, before);
}
/// ...and the paste itself, over text from wherever: the register above,
/// or the system clipboard `SPC p` asked the shell for, which deliberately
/// never passes through the register on its way here.
///
/// Text ending in '\n' pastes as whole lines below/above the SELECTION's
/// line span; anything else splices inline at the selection's outer edge.
/// The paste (repeated <count> times) becomes the implicit selection,
/// cursor on its last char (linewise: ON the last pasted line's newline).
fn pasteText(p: *Pardes, pane: *Pane, y0: []const u8, before: bool) void {
if (y0.len == 0) return;
p.pushUndo(pane);
pane.select = false;
pane.sticky_col = -1;
const cnt: usize = @max(1, pane.count);
pane.count = 0;
const arena = p.scratch.allocator();
var y: []const u8 = y0;
if (cnt > 1) {
const total = std.math.mul(usize, cnt, y0.len) catch return;
const buf = arena.alloc(u8, total) catch return;
for (0..cnt) |i| @memcpy(buf[i * y0.len ..][0..y0.len], y0);
y = buf;
}
const b: Bounds = if (pane.vsel.active)
vselBounds(pane)
else
.{ .lo_row = pane.cur_row, .lo_col = pane.cur_col, .hi_row = pane.cur_row, .hi_col = pane.cur_col };
const eb = p.editText(pane, b.lo_row, b.hi_row, -1) orelse return;
const row0 = eb.row0;
if (y[y.len - 1] == '\n') {
const block_text = y[0 .. y.len - 1];
// a yanked BLANK line is "\n": the block is empty and lineCount
// says 0 lines, but it still pastes as one (empty) line — without
// the floor every `n - 1` below underflows and panics.
const n = @max(1, modal.lineCount(block_text));
var out: []u8 = undefined;
if (before) {
const row: usize = @intCast(@max(0, b.lo_row - row0));
const block = std.fmt.allocPrint(arena, "{s}\n", .{block_text}) catch return;
out = modal.insertAt(p.gpa, eb.text, .{ .row = row, .col = 0 }, block) catch return;
pane.cur_row = @as(i32, @intCast(row + n - 1)) + row0;
} else {
const row: usize = @intCast(@max(0, b.hi_row - row0));
out = modal.pasteLineBelow(p.gpa, eb.text, row, block_text) catch return;
pane.cur_row = @as(i32, @intCast(row + n)) + row0;
}
p.setEditText(pane, out);
pane.vsel = .{ .active = true, .row = pane.cur_row - @as(i32, @intCast(n - 1)), .col = 0, .explicit = false };
// cursor ON the last pasted line's '\n' (helix)
const llen = modal.lineSlice(out, @intCast(@max(0, pane.cur_row - row0))).len;
pane.cur_col = @intCast(llen);
} else {
const at: modal.Cursor = if (before)
.{ .row = @intCast(@max(0, b.lo_row - row0)), .col = @intCast(@max(0, b.lo_col)) }
else blk: {
const hrow: usize = @intCast(@max(0, b.hi_row - row0));
const hi_col: usize = @intCast(@max(0, b.hi_col));
const high_line = modal.lineSlice(eb.text, hrow);
if (hi_col >= high_line.len) break :blk .{ .row = hrow + 1, .col = 0 };
const gcol = modal.nextGrapheme(high_line, hi_col);
break :blk .{ .row = hrow, .col = gcol };
};
const out = modal.insertAt(p.gpa, eb.text, at, y) catch return;
p.setEditText(pane, out);
pane.vsel = .{ .active = modal.nextGrapheme(y, 0) < y.len, .row = @as(i32, @intCast(at.row)) + row0, .col = @intCast(at.col), .explicit = false };
const end = modal.advanceBy(at, y);
if (end.col > 0) {
pane.cur_row = @as(i32, @intCast(end.row)) + row0;
pane.cur_col = @intCast(modal.prevGrapheme(modal.lineSlice(out, end.row), end.col));
} else {
pane.cur_row = @as(i32, @intCast(end.row -| 1)) + row0;
pane.cur_col = @intCast(modal.lineSlice(out, end.row -| 1).len);
}
}
pane.msel.active = false;
pane.cur_pinned = true;
pane.ensureCursorVisible();
}
fn normalChange(p: *Pardes, pane: *Pane) void {
pane.select = false;
pane.sticky_col = -1;
if (pane.vsel.active) {
const b = vselBounds(pane);
const eb = p.editTextEol(pane, b) orelse return;
const hi_len = modal.lineSlice(eb.text, @intCast(@max(0, b.hi_row - eb.row0))).len;
if (b.lo_col == 0 and @as(usize, @intCast(@max(0, b.hi_col))) >= hi_len) {
p.setYank(p.vselText(pane));
p.pushUndo(pane);
const d = modal.deleteLines(p.gpa, eb.text, @intCast(@max(0, b.lo_row - eb.row0)), @intCast(@max(0, b.hi_row - eb.row0))) catch return;
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
const n = modal.lineCount(d.content);
const row: usize = @min(@as(usize, @intCast(@max(0, b.lo_row - eb.row0))), if (n == 0) 0 else n - 1);
const ind = modal.hxIndentString(modal.lineSlice(d.content, row));
const arena = p.scratch.allocator();
const block = std.fmt.allocPrint(arena, "{s}\n", .{ind}) catch return;
const new = modal.insertAt(p.gpa, d.content, .{ .row = row, .col = 0 }, block) catch return;
p.setEditText(pane, new);
pane.cur_row = @as(i32, @intCast(row)) + eb.row0;
pane.cur_col = @intCast(ind.len);
pane.vsel.active = false;
pane.msel.active = false;
pane.cur_pinned = true;
pane.mode = .insert;
pane.pending = 0;
pane.ensureCursorVisible();
return;
}
p.setYank(p.vselText(pane));
p.pushUndo(pane);
const d = modal.deleteRange(p.gpa, eb.text, .{ .row = @intCast(@max(0, b.lo_row - eb.row0)), .col = @intCast(@max(0, b.lo_col)) }, .{ .row = @intCast(@max(0, b.hi_row - eb.row0)), .col = @intCast(@max(0, b.hi_col)) }) catch {
pane.vsel.active = false;
return;
};
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
pane.cur_row = b.lo_row;
pane.cur_col = b.lo_col;
clampCursor(pane, d.content, eb.row0);
pane.mode = .insert;
pane.pending = 0;
return;
}
if (pane.msel.active) {
const r0 = @min(pane.msel.r0, pane.msel.r1);
const r1 = @max(pane.msel.r0, pane.msel.r1);
p.pushUndo(pane);
const eb = p.editText(pane, r0, r1 + 1, -1) orelse return;
const arena = p.scratch.allocator();
const lo: usize = @intCast(@max(0, r0 - eb.row0));
const hi: usize = @intCast(@max(0, r1 - eb.row0));
var total: usize = hi - lo;
for (lo..hi + 1) |r| total += modal.lineSlice(eb.text, r).len;
const buf = arena.alloc(u8, total) catch return;
var at: usize = 0;
for (lo..hi + 1) |r| {
if (r > lo) {
buf[at] = '\n';
at += 1;
}
const line = modal.lineSlice(eb.text, r);
@memcpy(buf[at..][0..line.len], line);
at += line.len;
}
p.setYank(buf);
var body: []u8 = eb.text;
if (hi > lo) {
const d = modal.deleteLines(p.gpa, body, lo + 1, hi) catch {
pane.msel.active = false;
return;
};
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
body = d.content;
}
const cl = modal.clearLine(p.gpa, body, lo) catch {
pane.msel.active = false;
return;
};
p.setEditText(pane, cl);
pane.cur_row = r0;
pane.cur_col = 0;
pane.msel.active = false;
pane.cur_pinned = true;
pane.mode = .insert;
pane.pending = 0;
pane.ensureCursorVisible();
} else {
p.pushUndo(pane);
const eb = p.editTextEol(pane, .{ .lo_row = pane.cur_row, .lo_col = pane.cur_col, .hi_row = pane.cur_row, .hi_col = pane.cur_col }) orelse return;
const c = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - eb.row0)), .col = @intCast(@max(0, pane.cur_col)) };
const arena = p.scratch.allocator();
p.setYank(modal.rangeText(arena, eb.text, c, c) catch return);
const d = modal.deleteRange(p.gpa, eb.text, c, c) catch return;
p.setEditText(pane, d.content);
p.gpa.free(d.deleted);
const llen = modal.lineSlice(d.content, c.row).len;
pane.cur_col = @min(pane.cur_col, @as(i32, @intCast(llen)));
pane.mode = .insert;
pane.pending = 0;
}
}
// ---- helix change ops (r R ~ ` J > < Ctrl-a m-mode ]space) ----
// Terminals go through the same edit buffer as files: since editText
// materializes one over whatever rows the op names, every one of these
// works the same in a shell pane as in a document.
/// the selection as an inclusive cursor range in `content`, whose first
/// line is absolute row `row0`: vsel span, msel line span, else the char
/// under the cursor (helix's implicit 1-wide selection)
fn selRange(pane: *Pane, content: []const u8, row0: i32) modal.Range {
if (pane.vsel.active) {
const b = vselBounds(pane);
return .{
.a = .{ .row = @intCast(@max(0, b.lo_row - row0)), .col = @intCast(@max(0, b.lo_col)) },
.b = .{ .row = @intCast(@max(0, b.hi_row - row0)), .col = @intCast(@max(0, b.hi_col)) },
};
}
if (pane.msel.active) {
const r0: usize = @intCast(@max(0, @min(pane.msel.r0, pane.msel.r1) - row0));
const r1: usize = @intCast(@max(0, @max(pane.msel.r0, pane.msel.r1) - row0));
const llen = modal.lineSlice(content, r1).len;
return .{ .a = .{ .row = r0, .col = 0 }, .b = .{ .row = r1, .col = if (llen == 0) 0 else modal.prevGrapheme(modal.lineSlice(content, r1), llen) } };
}
const c = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row - row0)), .col = @intCast(@max(0, pane.cur_col)) };
return .{ .a = c, .b = c };
}
/// the rows an op's selection spans, absolute (what editText must cover)
fn selRows(pane: *Pane) Bounds {
if (pane.vsel.active) return vselBounds(pane);
if (pane.msel.active) return .{
.lo_row = @min(pane.msel.r0, pane.msel.r1),
.lo_col = 0,
.hi_row = @max(pane.msel.r0, pane.msel.r1),
.hi_col = 0,
};
return .{ .lo_row = pane.cur_row, .lo_col = pane.cur_col, .hi_row = pane.cur_row, .hi_col = pane.cur_col };
}
/// `r<ch>`: overwrite the selection (or the cursor char) with ch —
/// newlines included (helix), so `xrz` joins the selected lines
fn normalReplaceChar(p: *Pardes, pane: *Pane, ch: u21) void {
pane.select = false;
const eb = p.editTextEol(pane, selRows(pane)) orelse return;
const before = paneRange(pane, eb.text, eb.row0);
const lo = @min(before.anchor, before.head);
const hi = @max(before.anchor, before.head);
var graphemes: usize = 0;
var at = lo;
while (at < hi) : (graphemes += 1) at = modal.nextGrapheme(eb.text, at);
var encoded: [4]u8 = undefined;
const encoded_len = std.unicode.utf8Encode(ch, &encoded) catch return;
const r = selRange(pane, eb.text, eb.row0);
p.pushUndo(pane);
const new = modal.replaceChars(p.gpa, eb.text, r.a, r.b, ch) catch return;
p.setEditText(pane, new);
const end = lo + graphemes * encoded_len;
const mapped: modal.HxRange = if (before.head < before.anchor)
.{ .anchor = end, .head = lo }
else
.{ .anchor = lo, .head = end };
setPaneRange(pane, .{ .lines = &.{}, .row0 = eb.row0 }, new, mapped, pane.vsel.explicit);
}
/// `R`: replace the selection (or the cursor char) with the DEFAULT
/// register. `SPC R` is the same verb over the system clipboard.
fn normalReplaceYank(p: *Pardes, pane: *Pane) void {
p.replaceWithText(pane, p.yank orelse return);
}
/// The pasted text becomes the selection, head on its last char (which for
/// a trailing-newline `y` is the '\n' cell of the last full line).
fn replaceWithText(p: *Pardes, pane: *Pane, y: []const u8) void {
if (y.len == 0) return;
pane.select = false;
const eb = p.editTextEol(pane, selRows(pane)) orelse return;
const r = selRange(pane, eb.text, eb.row0);
p.pushUndo(pane);
const new = modal.replaceRange(p.gpa, eb.text, r.a, r.b, y) catch return;
p.setEditText(pane, new);
pane.msel.active = false;
pane.vsel = .{ .active = modal.nextGrapheme(y, 0) < y.len, .row = @as(i32, @intCast(r.a.row)) + eb.row0, .col = @intCast(r.a.col), .explicit = false };
const end = modal.advanceBy(r.a, y);
if (end.col > 0) {
pane.cur_row = @as(i32, @intCast(end.row)) + eb.row0;
pane.cur_col = @intCast(modal.prevGrapheme(modal.lineSlice(new, end.row), end.col));
} else {
// the yank ended in '\n': the cursor lands ON that newline
pane.cur_row = @as(i32, @intCast(end.row -| 1)) + eb.row0;
pane.cur_col = @intCast(modal.lineSlice(new, end.row -| 1).len);
}
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// `~` / `` ` `` / ``Alt-` ``: case-map the selection (or the cursor char),
/// keeping the selection (helix)
fn normalCase(p: *Pardes, pane: *Pane, op: modal.CaseOp) void {
pane.select = false;
const eb = p.editTextEol(pane, selRows(pane)) orelse return;
const r = selRange(pane, eb.text, eb.row0);
p.pushUndo(pane);
const new = modal.changeCase(p.gpa, eb.text, r.a, r.b, op) catch return;
p.setEditText(pane, new);
}
/// a change to apply to file content: delete [from, to), insert `ins` at
/// `from`. Ascending and disjoint.
const TextChange = struct { from: usize, to: usize, ins: []const u8 };
/// map an original-text offset through a change list (insertions AT a
/// position push it right — helix Assoc::After; positions inside a
/// deleted span collapse to its start)
fn mapThroughChanges(chs: []const TextChange, pos: usize) usize {
var delta: i64 = 0;
for (chs) |ch| {
if (pos < ch.from) break;
if (ch.from == ch.to) {
delta += @intCast(ch.ins.len);
continue;
}
if (pos == ch.from) break;
if (pos < ch.to) return @intCast(@as(i64, @intCast(ch.from)) + delta);
delta += @as(i64, @intCast(ch.ins.len)) - @as(i64, @intCast(ch.to - ch.from));
}
return @intCast(@as(i64, @intCast(pos)) + delta);
}
/// apply a change list. gpa-owned result.
fn applyChanges(p: *Pardes, text: []const u8, chs: []const TextChange) ![]u8 {
var total = text.len;
for (chs) |ch| total = total - (ch.to - ch.from) + ch.ins.len;
const out = try p.gpa.alloc(u8, total);
errdefer p.gpa.free(out);
var copied: usize = 0;
var at: usize = 0;
for (chs) |ch| {
const unchanged = text[copied..ch.from];
@memcpy(out[at..][0..unchanged.len], unchanged);
at += unchanged.len;
@memcpy(out[at..][0..ch.ins.len], ch.ins);
at += ch.ins.len;
copied = ch.to;
}
@memcpy(out[at..], text[copied..]);
return out;
}
/// `J`: helix join_selections — join the selection's line span (a bare
/// cursor joins with the next line): each '\n' + following indent become
/// one space, EXCEPT before content-less lines (no space) — and on the
/// buffer's last line the trailing newline is deleted. The selection and
/// cursor map through the edit; the count is ignored (helix).
fn normalJoin(p: *Pardes, pane: *Pane) void {
// a join always eats the newline of its last line, so the buffer has
// to reach one row PAST the selection
const sr = selRows(pane);
const eb = p.editText(pane, sr.lo_row, sr.hi_row + 1, -1) orelse return;
const text = eb.text;
const range = paneRange(pane, text, eb.row0);
const span = rangeLineSpan(text, range);
const nlines = modal.hxLineCount(text);
var end = span.end;
if (span.start == end) end = @min(end + 1, nlines - 1);
if (end <= span.start) return;
const arena = p.scratch.allocator();
const chs = arena.alloc(TextChange, end - span.start) catch return;
var chs_len: usize = 0;
var l = span.start;
while (l < end) : (l += 1) {
const from = modal.hxLineEndIdx(text, l);
var to = if (l + 1 >= nlines) text.len else modal.lineStartOffset(text, l + 1);
while (to < text.len and (text[to] == ' ' or text[to] == '\t')) to += 1;
const sep: []const u8 = if (to == modal.hxLineEndIdx(text, @min(l + 1, nlines - 1))) "" else " ";
chs[chs_len] = .{ .from = from, .to = to, .ins = sep };
chs_len += 1;
}
if (chs_len == 0) return;
p.pushUndo(pane);
const cur_off = modal.hxOff(text, .{ .row = @intCast(@max(0, pane.cur_row - eb.row0)), .col = @intCast(@max(0, pane.cur_col)) });
const anc_off = if (pane.vsel.active)
modal.hxOff(text, .{ .row = @intCast(@max(0, pane.vsel.row - eb.row0)), .col = @intCast(@max(0, pane.vsel.col)) })
else
cur_off;
const new = p.applyChanges(text, chs[0..chs_len]) catch return;
const nc = mapThroughChanges(chs[0..chs_len], cur_off);
const na = mapThroughChanges(chs[0..chs_len], anc_off);
p.setEditText(pane, new);
const cc = modal.hxPos(new, nc);
const ac = modal.hxPos(new, na);
pane.cur_row = @as(i32, @intCast(cc.row)) + eb.row0;
pane.cur_col = @intCast(cc.col);
if (pane.vsel.active) {
pane.vsel.row = @as(i32, @intCast(ac.row)) + eb.row0;
pane.vsel.col = @intCast(ac.col);
}
pane.msel.active = false;
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// `>` / `<`: helix indent/unindent over the selection's line span.
/// Blank (all-whitespace) lines are skipped; `>` inserts count levels
/// realigned to the next INDENT_W stop; `<` removes up to count levels of
/// leading whitespace (a tab advances to the next stop). Cursor and
/// selection map through the edit.
fn normalIndent(p: *Pardes, pane: *Pane, cnt: usize, add: bool) void {
pane.select = false;
const sr = selRows(pane);
const eb = p.editText(pane, sr.lo_row, sr.hi_row, -1) orelse return;
const text = eb.text;
const range = paneRange(pane, text, eb.row0);
const span = rangeLineSpan(text, range);
const arena = p.scratch.allocator();
// one run of spaces, sliced per line: `>` never inserts more than this
const pad = arena.alloc(u8, modal.INDENT_W * cnt) catch return;
@memset(pad, ' ');
const chs = arena.alloc(TextChange, span.end - span.start + 1) catch return;
var chs_len: usize = 0;
var l = span.start;
while (l <= span.end) : (l += 1) {
const ls = modal.lineStartOffset(text, l);
const le = modal.hxLineEndIdx(text, l);
const line = text[ls..le];
const nw = modal.firstNonWs(line);
if (nw == line.len) continue; // blank lines stay blank (helix)
if (add) {
const ins = modal.INDENT_W * cnt - (nw % modal.INDENT_W);
chs[chs_len] = .{ .from = ls, .to = ls, .ins = pad[0..ins] };
chs_len += 1;
} else {
const want = modal.INDENT_W * cnt;
var w: usize = 0;
var pos: usize = 0;
while (pos < line.len) {
if (line[pos] == ' ') {
w += 1;
} else if (line[pos] == '\t') {
w = (w / modal.INDENT_W + 1) * modal.INDENT_W;
} else break;
pos += 1;
if (w >= want) break;
}
if (pos > 0) {
chs[chs_len] = .{ .from = ls, .to = ls + pos, .ins = "" };
chs_len += 1;
}
}
}
if (chs_len == 0) return;
p.pushUndo(pane);
const cur_off = modal.hxOff(text, .{ .row = @intCast(@max(0, pane.cur_row - eb.row0)), .col = @intCast(@max(0, pane.cur_col)) });
const anc_off = if (pane.vsel.active)
modal.hxOff(text, .{ .row = @intCast(@max(0, pane.vsel.row - eb.row0)), .col = @intCast(@max(0, pane.vsel.col)) })
else
cur_off;
const new = p.applyChanges(text, chs[0..chs_len]) catch return;
const nc = mapThroughChanges(chs[0..chs_len], cur_off);
const na = mapThroughChanges(chs[0..chs_len], anc_off);
p.setEditText(pane, new);
const cc = modal.hxPos(new, nc);
const ac = modal.hxPos(new, na);
pane.cur_row = @as(i32, @intCast(cc.row)) + eb.row0;
pane.cur_col = @intCast(cc.col);
if (pane.vsel.active) {
pane.vsel.row = @as(i32, @intCast(ac.row)) + eb.row0;
pane.vsel.col = @intCast(ac.col);
}
pane.msel.active = false;
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// `Ctrl-c`: helix toggle_comments. Every line the selection touches gets
/// the language's line-comment token put in front of it — or taken off,
/// and WHICH of the two is decided once for the whole set: one uncommented
/// non-blank line among them and everything gets commented. That single
/// decision is why Action.scope runs this once instead of per cursor;
/// replayed, a half-commented block would end up half-commented the other
/// way round.
///
/// The rest is helix's find_line_comment, quirks included: the token goes
/// in at the SHALLOWEST indent in the set (so a deeper line is commented
/// mid-whitespace), all-blank lines are skipped entirely and do not vote,
/// and uncommenting also eats one space after the token unless some line
/// lacks it.
fn normalToggleComment(p: *Pardes, pane: *Pane) void {
const expl = (pane.vsel.active and pane.vsel.explicit) or pane.msel.active;
pane.select = false; // helix exit_select_mode
// the buffer must cover every cursor's rows, not just the primary's
var b = selRows(pane);
for (pane.sels[0..pane.nsel]) |s| {
b.lo_row = @min(b.lo_row, @min(s.row, s.arow));
b.hi_row = @max(b.hi_row, @max(s.row, s.arow));
}
// ...and ONE ROW PAST them, like normalJoin: a selection may end on
// its last line's newline cell, and a terminal buffer that stops at
// that line has nowhere to put it (a file's content always does).
// Never past the surface's own last row, though — materialising a row
// that does not exist yet would ADD a blank line to the pane, and this
// op may well decide to change nothing.
const pl0 = p.paneCursorLines(pane) catch return;
const last_row = pl0.row0 + @as(i32, @intCast(pl0.lines.len)) - 1;
const eb = p.editText(pane, b.lo_row, @min(b.hi_row + 1, last_row), -1) orelse return;
const text = eb.text;
var rs: [MAX_SELS]modal.HxRange = undefined;
const got = paneRanges(pane, text, eb.row0, &rs);
const nlines = modal.hxLineCount(text);
const arena = p.scratch.allocator();
// the lines the ranges cover, each ONE ONCE and in order (helix's
// min_next_line: two cursors on one line comment it once)
const lines = arena.alloc(usize, nlines) catch return;
var lines_len: usize = 0;
var next: usize = 0;
for (rs[0..got.n]) |r| {
const span = rangeLineSpan(text, r);
var l = @max(span.start, next);
const end = @min(span.end + 1, nlines);
while (l < end) : (l += 1) {
lines[lines_len] = l;
lines_len += 1;
}
next = @max(next, end);
}
// which token: the file's EXTENSION, which is the same thing
// src/syntax.zig tells languages apart by, read off the one table in
// config. A terminal and an output buffer have no extension and get
// the default, which is what helix does for a buffer with no language.
const ext = if (pane.file) |f| std.fs.path.extension(f.path) else "";
var token: []const u8 = config.comment_token_default;
lang: for (config.comment_tokens) |row| {
for (row.exts) |e| if (std.ascii.eqlIgnoreCase(ext, e)) {
token = row.token;
break :lang;
};
}
var commented = true;
var indent: usize = std.math.maxInt(usize);
var margin: usize = 1;
var live: usize = 0;
for (lines[0..lines_len]) |l| {
const line = text[modal.lineStartOffset(text, l)..modal.hxLineEndIdx(text, l)];
const nw = modal.firstNonWs(line);
if (nw == line.len) continue;
indent = @min(indent, nw);
if (!std.mem.startsWith(u8, line[nw..], token)) commented = false;
if (nw + token.len >= line.len or line[nw + token.len] != ' ') margin = 0;
live += 1;
}
if (live == 0) return; // nothing but blank lines
const ins = std.fmt.allocPrint(arena, "{s} ", .{token}) catch return;
const chs = arena.alloc(TextChange, lines_len) catch return;
var chs_len: usize = 0;
for (lines[0..lines_len]) |l| {
const ls = modal.lineStartOffset(text, l);
const le = modal.hxLineEndIdx(text, l);
const line = text[ls..le];
if (modal.firstNonWs(line) == line.len) continue; // blank lines untouched
const at = ls + indent;
// the @min can never bind: margin is 1 only when every line has a
// space after its own token, which is a byte past `at + token.len`
chs[chs_len] = if (commented)
.{ .from = at, .to = @min(at + token.len + margin, le), .ins = "" }
else
.{ .from = at, .to = at, .ins = ins };
chs_len += 1;
}
p.pushUndo(pane);
// one edit, and the WHOLE selection rides through it (helix maps the
// selection with the transaction)
var cells: [MAX_SELS]SelRange = undefined;
const new = p.applyChanges(text, chs[0..chs_len]) catch return;
for (rs[0..got.n], 0..) |r, i| {
const c = rangeCells(new, .{
.anchor = mapThroughChanges(chs[0..chs_len], r.anchor),
.head = mapThroughChanges(chs[0..chs_len], r.head),
});
const cc = modal.hxPos(new, c.cur);
const ac = modal.hxPos(new, c.anc);
cells[i] = .{
.row = @as(i32, @intCast(cc.row)) + eb.row0,
.col = @intCast(cc.col),
.arow = @as(i32, @intCast(ac.row)) + eb.row0,
.acol = @intCast(ac.col),
};
}
p.setEditText(pane, new);
const pl2 = p.paneCursorLines(pane) catch return;
const t2 = p.flatSurface(pane, pl2) catch return;
for (cells[0..got.n], 0..) |s, i| rs[i] = cellRange(t2, s.arow - pl2.row0, s.acol, s.row - pl2.row0, s.col);
setPaneRanges(pane, pl2, t2, rs[0..got.n], &.{}, got.pri, expl);
}
/// `Ctrl-a` / `Ctrl-x`: increment/decrement the SELECTION as a decimal
/// integer (helix: the selected fragment itself, no number scan around
/// the cursor); a fragment that isn't an integer is a no-op. The new
/// number becomes the selection, cursor on its last char.
fn normalAdjustNumber(p: *Pardes, pane: *Pane, delta: i64) void {
const eb = p.editTextEol(pane, selRows(pane)) orelse return;
const r = selRange(pane, eb.text, eb.row0);
const arena = p.scratch.allocator();
const frag = modal.rangeText(arena, eb.text, r.a, r.b) catch return;
const rep = (modal.hxIncrement(arena, frag, delta) catch null) orelse return;
p.pushUndo(pane);
pane.select = false;
const new = modal.replaceRange(p.gpa, eb.text, r.a, r.b, rep) catch return;
p.setEditText(pane, new);
const start = modal.lineStartOffset(new, r.a.row) + r.a.col;
const cc = modal.hxPos(new, modal.prevGrapheme(new, start + rep.len));
pane.vsel = .{ .active = modal.nextGrapheme(rep, 0) < rep.len, .row = @as(i32, @intCast(r.a.row)) + eb.row0, .col = @intCast(r.a.col), .explicit = false };
pane.msel.active = false;
pane.cur_row = @as(i32, @intCast(cc.row)) + eb.row0;
pane.cur_col = @intCast(cc.col);
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// `]Space` / `[Space`: add blank lines below/above, the cursor staying
/// on its text line (the selection rides along)
fn addNewline(p: *Pardes, pane: *Pane, below: bool, cnt: usize) void {
const eb = p.editText(pane, pane.cur_row, pane.cur_row, -1) orelse return;
p.pushUndo(pane);
const row: usize = @intCast(@max(0, pane.cur_row - eb.row0));
const arena = p.scratch.allocator();
const nl = arena.alloc(u8, cnt) catch return;
@memset(nl, '\n');
const llen = modal.lineSlice(eb.text, row).len;
const new = modal.insertAt(p.gpa, eb.text, .{ .row = row, .col = if (below) llen else 0 }, nl) catch return;
p.setEditText(pane, new);
if (!below) {
pane.cur_row += @intCast(cnt); // the line moved down; stay on it
if (pane.vsel.active and pane.vsel.row >= @as(i32, @intCast(row))) pane.vsel.row += @intCast(cnt);
} else if (pane.vsel.active and pane.vsel.row > @as(i32, @intCast(row))) {
pane.vsel.row += @intCast(cnt);
}
pane.cur_pinned = true;
pane.ensureCursorVisible();
}
/// pair mapping for m-mode: either bracket names the pair; anything else
/// surrounds with itself (quotes)
fn pairFor(ch: u21) ?struct { o: u8, c: u8 } {
return switch (ch) {
'(', ')' => .{ .o = '(', .c = ')' },
'[', ']' => .{ .o = '[', .c = ']' },
'{', '}' => .{ .o = '{', .c = '}' },
'<', '>' => .{ .o = '<', .c = '>' },
else => if (ch <= 0x7f) .{ .o = @intCast(ch), .c = @intCast(ch) } else null,
};
}
/// `mi<obj>` / `ma<obj>`: select inside/around a textobject (pure range
/// math over the motion surface — works on terminals too). Word and
/// paragraph objects are helix textobject.rs ports; pairs/quotes are the
/// plain-text scans (quotes line-scoped — ponytail).
fn textobjectSelect(p: *Pardes, pane: *Pane, pl: PaneLines, obj: u21, around: bool) void {
const text = p.flatSurface(pane, pl) catch return;
const range = paneRange(pane, text, pl.row0);
switch (obj) {
'w', 'W' => {
const r = modal.hxTextobjectWord(text, range, around, obj == 'W');
return setPaneRange(pane, pl, text, r, false);
},
'p' => {
const r = modal.hxTextobjectParagraph(text, range, around, 1);
return setPaneRange(pane, pl, text, r, false);
},
else => {},
}
const cur = modal.hxPos(text, modal.hxCursor(text, range));
const pair: ?modal.Range = switch (obj) {
'\'', '"', '`' => modal.enclosingQuote(pl.lines, cur, @intCast(obj)),
'(', ')' => modal.enclosingPair(pl.lines, cur, '(', ')'),
'[', ']' => modal.enclosingPair(pl.lines, cur, '[', ']'),
'{', '}' => modal.enclosingPair(pl.lines, cur, '{', '}'),
'<', '>' => modal.enclosingPair(pl.lines, cur, '<', '>'),
else => null,
};
const pr = pair orelse return;
var a = modal.hxOff(text, pr.a);
var head = modal.nextGrapheme(text, modal.hxOff(text, pr.b));
if (!around) {
// inside: shrink off the delimiters; an EMPTY pair collapses to
// a 1-wide cursor on the closing char (helix)
a = modal.nextGrapheme(text, a);
head = modal.prevGrapheme(text, head);
}
setPaneRange(pane, pl, text, .{ .anchor = a, .head = head }, false);
}
/// `ms<ch>`: wrap the selection (or the cursor char) in a pair; the wrap
/// including the pair becomes the selection
fn surroundAdd(p: *Pardes, pane: *Pane, ch: u21) void {
const pr = pairFor(ch) orelse return;
pane.select = false;
const eb = p.editTextEol(pane, selRows(pane)) orelse return;
const r = selRange(pane, eb.text, eb.row0);
p.pushUndo(pane);
const close_col = modal.nextGrapheme(modal.lineSlice(eb.text, r.b.row), r.b.col);
var new = modal.insertAt(p.gpa, eb.text, .{ .row = r.b.row, .col = close_col }, &[1]u8{pr.c}) catch return;
p.setEditText(pane, new);
new = modal.insertAt(p.gpa, new, .{ .row = r.a.row, .col = r.a.col }, &[1]u8{pr.o}) catch return;
p.setEditText(pane, new);
pane.msel.active = false;
pane.vsel = .{ .active = true, .row = @as(i32, @intCast(r.a.row)) + eb.row0, .col = @intCast(r.a.col), .explicit = false };
pane.cur_row = @as(i32, @intCast(r.b.row)) + eb.row0;
pane.cur_col = @intCast(close_col + @as(usize, if (r.a.row == r.b.row) 1 else 0));
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
}
/// `md<ch>`: delete the enclosing pair's chars; the cursor maps through
fn surroundDelete(p: *Pardes, pane: *Pane, pl: PaneLines, ch: u21) void {
const pr = pairFor(ch) orelse return;
// the pair is found over the motion surface, whose rows are absolute;
// the edit runs in the buffer covering those rows, and every offset
// below is taken in THAT text so the cursor maps through it
const cur = toModalCursor(pane, pl);
const r = (if (pr.o == pr.c)
modal.enclosingQuote(pl.lines, cur, pr.o)
else
modal.enclosingPair(pl.lines, cur, pr.o, pr.c)) orelse return;
const lo: i32 = @intCast(@min(r.a.row, cur.row));
const hi: i32 = @intCast(@max(r.b.row, cur.row));
const eb = p.editText(pane, lo + pl.row0, hi + pl.row0, -1) orelse return;
const text = eb.text;
const drow = pl.row0 - eb.row0; // surface row -> buffer row
const ra: modal.Cursor = .{ .row = @intCast(@as(i32, @intCast(r.a.row)) + drow), .col = r.a.col };
const rb: modal.Cursor = .{ .row = @intCast(@as(i32, @intCast(r.b.row)) + drow), .col = r.b.col };
p.pushUndo(pane);
const a_off = modal.hxOff(text, ra);
const b_off = modal.hxOff(text, rb);
const cur_off = modal.hxOff(text, .{ .row = @intCast(@as(i32, @intCast(cur.row)) + drow), .col = cur.col });
// the close first, so the open's position stays valid
var new = modal.deleteChar(p.gpa, text, rb) catch return;
p.setEditText(pane, new);
new = modal.deleteChar(p.gpa, new, ra) catch return;
p.setEditText(pane, new);
var nc = cur_off;
if (nc > b_off) nc -= 1;
if (nc > a_off) nc -= 1;
const cc = modal.hxPos(new, nc);
pane.cur_row = @as(i32, @intCast(cc.row)) + eb.row0;
pane.cur_col = @intCast(cc.col);
pane.vsel.active = false;
pane.msel.active = false;
pane.cur_pinned = true;
pane.ensureCursorVisible();
}
/// `mr<from><to>`: swap the enclosing <from> pair's chars for <to>'s
fn surroundReplace(p: *Pardes, pane: *Pane, pl: PaneLines, from: u21, to: u21) void {
const fp = pairFor(from) orelse return;
const tp = pairFor(to) orelse return;
const cur = toModalCursor(pane, pl);
const r = (if (fp.o == fp.c)
modal.enclosingQuote(pl.lines, cur, fp.o)
else
modal.enclosingPair(pl.lines, cur, fp.o, fp.c)) orelse return;
const eb = p.editText(pane, @as(i32, @intCast(r.a.row)) + pl.row0, @as(i32, @intCast(r.b.row)) + pl.row0, -1) orelse return;
const drow = pl.row0 - eb.row0; // surface row -> buffer row
const ar: usize = @intCast(@as(i32, @intCast(r.a.row)) + drow);
const br: usize = @intCast(@as(i32, @intCast(r.b.row)) + drow);
p.pushUndo(pane);
const out = p.gpa.dupe(u8, eb.text) catch return;
out[modal.lineStartOffset(out, ar) + r.a.col] = tp.o;
out[modal.lineStartOffset(out, br) + r.b.col] = tp.c;
p.setEditText(pane, out);
}
// ---- dumb undo/redo: whole-state snapshots, one per edit op ----
/// pull the cursor back inside `text` after a rewrite; `row0` is the
/// absolute surface row of its first line (0 for a file)
fn clampCursor(pane: *Pane, text: []const u8, row0: i32) void {
const n = modal.lineCount(text);
const row: usize = @min(@as(usize, @intCast(@max(0, pane.cur_row - row0))), if (n == 0) 0 else n - 1);
const llen = modal.lineSlice(text, row).len;
pane.cur_row = @as(i32, @intCast(row)) + row0;
pane.cur_col = @intCast(@min(@as(usize, @intCast(@max(0, pane.cur_col))), llen));
pane.cur_pinned = true;
pane.vsel.active = false;
pane.msel.active = false;
pane.ensureCursorVisible();
}
fn pushUndo(p: *Pardes, pane: *Pane) void {
// one keystroke, one undo step — even when it edited at ten cursors.
if (p.multi_on and !p.multi_first) return;
if (pane.file != null) return file_pane.pushUndo(p, pane);
term_pane.pushUndo(p, pane);
}
fn doUndo(p: *Pardes, pane: *Pane) void {
if (pane.file != null) return file_pane.undo(p, pane);
term_pane.undo(p, pane);
}
fn doRedo(p: *Pardes, pane: *Pane) void {
if (pane.file != null) return file_pane.redo(p, pane);
term_pane.redo(p, pane);
}
pub const ChromeTarget = struct { col: u16, row: u16 };
/// Is this cell layout CHROME, and if so which cell should the press be
/// delivered at? For the touch shells: a finger on a tag row or a resize
/// handle latches a left-mouse drag, everything else is body text and gets
/// one-finger scrolling and tap-as-look. A gesture is classified once, at
/// finger-down, and never turns into a scroll afterwards.
///
/// It lives here because it is a MIRROR of handleMouse's own hit test
/// below, in both the geometry and the ORDER: the move box beats a
/// horizontal handle on a tag-only pane, the rest of the tag row beats the
/// fat-finger tolerance around a separator, and Tagbottom moves both the
/// tag row and the h-handle together (a pane's tag on its LAST row makes
/// its first an ordinary body row and puts the seam on the lower pane's
/// first). It was a line-for-line clone in web.zig and gui.zig, kept in
/// step by a comment in each saying it was a clone of the other; the two
/// conditionals Tagbottom added went into both copies four times.
///
/// The one-cell tolerance is the only thing here that is not handleMouse's
/// rule: a mouse is exact, a finger is not.
pub fn chromeTarget(p: *const Pardes, col: u16, row: u16) ?ChromeTarget {
if (row < TOPBAR_H) return .{ .col = col, .row = row };
for (p.panes, 0..) |slot, id| {
if (slot == null) continue;
const rect = p.rects[id];
const tag = if (p.settings.tag_bottom) rect.y + rect.h -| BOX_H else rect.y;
if (row == tag and col >= rect.x and col < rect.x + rect.w and col < rect.x + config.GUTTER)
return .{ .col = col, .row = tag };
}
for (0..p.ncol -| 1) |column| {
const handle = p.col_x[column] + p.col_w[column] -| 1;
if (col == handle) return .{ .col = handle, .row = row };
}
for (0..p.ncol) |column| {
if (col < p.col_x[column] or col >= p.col_x[column] + p.col_w[column]) continue;
for (0..p.col_n[column] -| 1) |index| {
const rect = p.rects[p.col_terms[column][index]];
const handle = if (p.settings.tag_bottom) rect.y +| rect.h else rect.y + rect.h -| 1;
if (row == handle) return .{ .col = col, .row = handle };
}
}
for (p.panes, 0..) |slot, id| {
if (slot == null) continue;
const rect = p.rects[id];
const tag = if (p.settings.tag_bottom) rect.y + rect.h -| BOX_H else rect.y;
if (row == tag and col >= rect.x and col < rect.x + rect.w)
return .{ .col = col, .row = tag };
}
for (0..p.ncol -| 1) |column| {
const handle = p.col_x[column] + p.col_w[column] -| 1;
if (@max(col, handle) - @min(col, handle) == 1) return .{ .col = handle, .row = row };
}
for (0..p.ncol) |column| {
if (col < p.col_x[column] or col >= p.col_x[column] + p.col_w[column]) continue;
for (0..p.col_n[column] -| 1) |index| {
const rect = p.rects[p.col_terms[column][index]];
const handle = if (p.settings.tag_bottom) rect.y +| rect.h else rect.y + rect.h -| 1;
if (@max(row, handle) - @min(row, handle) == 1) return .{ .col = col, .row = handle };
}
}
return null;
}
fn paneAt(p: *const Pardes, col: u16, row: u16) ?usize {
for (p.panes, 0..) |slot, id| {
if (slot == null) continue;
const r = p.rects[id];
if (col >= r.x and col < r.x + r.w and row >= r.y and row < r.y + r.h) return id;
}
return null;
}
const PointerTextSelection = struct {
sel: Sel,
on_tag: bool,
};
/// Map one physical grid cell into the selection coordinate space shared
/// by Look, Exec and the hover preview. Geometry lives here once: the tag
/// is always selection row zero and body rows start at BOX_H, even when
/// Tagbottom swaps their physical positions.
fn pointerTextSelection(p: *const Pardes, id: usize, col: u16, row: u16) ?PointerTextSelection {
if (p.panes[id] == null) return null;
const r = p.rects[id];
if (col < r.x + config.GUTTER or col >= r.x + r.w or row < r.y or row >= r.y + r.h) return null;
const tag_y = if (p.settings.tag_bottom) r.y + r.h -| BOX_H else r.y;
const body_y = if (p.settings.tag_bottom) r.y else r.y + BOX_H;
const on_tag = row >= tag_y and row < tag_y + BOX_H;
const c: i32 = @as(i32, col) - @as(i32, r.x + config.GUTTER);
const v: i32 = if (on_tag) 0 else @as(i32, row) - @as(i32, body_y) + @as(i32, BOX_H);
return .{
.sel = .{ .state = .dragging, .c0 = c, .c1 = c, .r0 = v, .r1 = v },
.on_tag = on_tag,
};
}
fn cancelLookHover(p: *Pardes) void {
if (comptime pdf_enabled) if (p.pdf_hover_preview) |*preview| {
if (preview.pane < p.panes.len) if (p.panes[preview.pane]) |pane| {
if (pane.serial == preview.serial) if (pane.pdf) |*pv|
pv.invalidateRaster(preview.probe.page);
};
preview.deinit(p.pdf_gpa);
p.pdf_hover_preview = null;
};
p.look_hover_wait = null;
p.look_hover_preview = null;
}
fn lookHoverPane(p: *const Pardes) ?usize {
if (comptime pdf_enabled) if (p.pdf_hover_preview) |preview| return preview.pane;
if (p.look_hover_preview) |preview| return preview.pane;
if (p.look_hover_wait) |waiting| return waiting.pane;
return null;
}
/// Debounce by semantic grid cell rather than raw motion events. A host
/// may report the same pixel position every frame; those reports must not
/// postpone the preview forever.
fn noteLookHover(p: *Pardes, col: u16, row: u16) void {
const delay = config.look_preview_delay_frames orelse return;
_ = delay;
const id = p.paneAt(col, row) orelse return p.cancelLookHover();
const pane = p.panes[id] orelse return p.cancelLookHover();
_ = p.pointerTextSelection(id, col, row) orelse return p.cancelLookHover();
if (comptime pdf_enabled) if (p.pdf_hover_preview) |shown|
if (shown.col == col and shown.row == row and shown.pane == id and shown.serial == pane.serial) return;
if (p.look_hover_preview) |shown|
if (shown.col == col and shown.row == row and shown.pane == id and shown.serial == pane.serial) return;
if (p.look_hover_wait) |waiting|
if (waiting.col == col and waiting.row == row and waiting.pane == id and waiting.serial == pane.serial) return;
p.cancelLookHover();
p.look_hover_wait = .{ .col = col, .row = row, .pane = id, .serial = pane.serial };
}
/// Re-evaluate a stationary pointer against the frame the host just
/// presented. `noteLookHover` preserves an existing delay or preview only
/// when this still resolves to the same canonical cell and pane lifetime;
/// moving to another semantic target re-arms it, and an invisible panel
/// cell cancels it.
fn refreshLookHoverFromRaw(p: *Pardes) void {
if (!p.pointer_inside or !p.raw_hover_intent) return;
const mapped = p.presentedPointer(p.pointer_raw_col, p.pointer_raw_row) orelse
return p.cancelLookHover();
p.hover_col = mapped.col;
p.hover_row = mapped.row;
p.noteLookHover(mapped.col, mapped.row);
}
fn advanceLookHover(p: *Pardes) void {
const delay = config.look_preview_delay_frames orelse return;
const waiting = if (p.look_hover_wait) |*w| w else return;
waiting.frames +|= 1;
if (waiting.frames < delay) return;
const pane = p.panes[waiting.pane] orelse return p.cancelLookHover();
if (pane.serial != waiting.serial) return p.cancelLookHover();
const pointed = p.pointerTextSelection(waiting.pane, waiting.col, waiting.row) orelse
return p.cancelLookHover();
if (comptime pdf_enabled) if (!pointed.on_tag and pdf_pane.paneNativeReady(p, pane)) {
const probe = pdf_pane.probeAt(p, pane, waiting.col, waiting.row) orelse
return p.cancelLookHover();
const ready = waiting.*;
p.look_hover_wait = null;
p.pdf_hover_preview = .{
.col = ready.col,
.row = ready.row,
.pane = ready.pane,
.serial = ready.serial,
.probe = probe,
};
pane.pdf.?.invalidateRaster(probe.page);
return;
};
const operand = p.pointerOperand(pane, pointed.sel);
if (operand.text == null or operand.text.?.len == 0) return p.cancelLookHover();
var preview = operand.preview;
if (preview) |*sel| sel.state = .done;
p.look_hover_preview = .{
.col = waiting.col,
.row = waiting.row,
.pane = waiting.pane,
.serial = waiting.serial,
.sel = preview,
.file_word = operand.file_word,
};
p.look_hover_wait = null;
}
const PointerCell = struct { col: u16, row: u16 };
fn boxContainsCell(box: panel_animation.Box, col: u16, row: u16) bool {
const x = @as(f32, @floatFromInt(col)) + 0.5;
const y = @as(f32, @floatFromInt(row)) + 0.5;
return x >= box.x and x < box.x + box.w and y >= box.y and y < box.y + box.h;
}
/// Input follows the panel pixels the shaders/TTY compositor present.
/// Opening panels are drawn last, so they are probed first here too. A
/// cell in final geometry which has not appeared yet is deliberately not
/// clickable; otherwise a user could act on invisible content.
fn presentedPointer(p: *const Pardes, col: u16, row: u16) ?PointerCell {
if (p.panel_presentation_pending) return null;
// Closing pixels belong to a dead pane lifetime. They occlude the
// canonical survivor underneath while visible, but can never dispatch
// into either that survivor or a slot which reused the old pane id.
var closing = p.npresented_closing_panel_tracks;
while (closing > 0) {
closing -= 1;
const track = p.presented_closing_panel_tracks[closing];
if (!track.active()) continue;
if (boxContainsCell(track.contentBox(), col, row) and
boxContainsCell(track.presented(), col, row)) return null;
}
const phases = [_]panel_animation.Phase{ .opening, .moving };
for (phases) |phase| {
// Backends paint pane slots forward within a phase. Probe them in
// reverse so overlapping transition quads address the top pixel.
var index = p.presented_panel_tracks.len;
while (index > 0) {
index -= 1;
const track = p.presented_panel_tracks[index] orelse continue;
if (!track.active() or track.phase != phase) continue;
switch (track.effect) {
.slide, .zoom => {
const shown = track.presented();
if (shown.w <= 0 or shown.h <= 0 or !boxContainsCell(shown, col, row)) continue;
const x = @as(f32, @floatFromInt(col)) + 0.5;
const y = @as(f32, @floatFromInt(row)) + 0.5;
const u = std.math.clamp((x - shown.x) / shown.w, 0, 0.999_999);
const v = std.math.clamp((y - shown.y) / shown.h, 0, 0.999_999);
const logical_x: i32 = @intFromFloat(@floor(track.to.x + u * track.to.w));
const logical_y: i32 = @intFromFloat(@floor(track.to.y + v * track.to.h));
return .{
.col = @intCast(std.math.clamp(logical_x, 0, @as(i32, p.screen_w -| 1))),
.row = @intCast(std.math.clamp(logical_y, 0, @as(i32, p.screen_h -| 1))),
};
},
.vertical => {
const clip = track.contentBox();
if (!boxContainsCell(clip, col, row)) continue;
const shown = track.presented();
if (shown.w <= 0 or shown.h <= 0 or !boxContainsCell(shown, col, row))
return null;
const x = @as(f32, @floatFromInt(col)) + 0.5;
const y = @as(f32, @floatFromInt(row)) + 0.5;
const u = std.math.clamp((x - shown.x) / shown.w, 0, 0.999_999);
const v = std.math.clamp((y - shown.y) / shown.h, 0, 0.999_999);
return .{
.col = @intFromFloat(@floor(clip.x + u * clip.w)),
.row = @intFromFloat(@floor(clip.y + v * clip.h)),
};
},
.dissolve, .ascii => {
if (!boxContainsCell(track.to, col, row)) continue;
if (!p.panelCellChanged(col, row))
return .{ .col = col, .row = row };
const relative_col: u16 = @intFromFloat(@floor(
@as(f32, @floatFromInt(col)) + 0.5 - track.to.x,
));
const relative_row: u16 = @intFromFloat(@floor(
@as(f32, @floatFromInt(row)) + 0.5 - track.to.y,
));
const visible = switch (track.effect) {
.dissolve => panel_animation.dissolveRevealed(
track.serial,
relative_col,
relative_row,
track.amount(),
),
.ascii => switch (p.panelCellDiff(col, row)) {
.ascii => |diff| diff.complete(track.frame),
.unchanged, .visual => true,
},
else => unreachable,
};
return if (visible) .{ .col = col, .row = row } else null;
},
// Every glyph in a motion effect's pane is in flight,
// changed or not, so a cell becomes a truthful input target
// only once its own glyph has settled on the canonical one.
.edges, .fall, .wave, .curtain, .scramble, .typewriter => {
if (!boxContainsCell(track.to, col, row)) continue;
const area = panel_animation.CellArea.of(track.to);
const settled = std.meta.eql(
panel_animation.charSource(
track,
col -| area.x0,
row -| area.y0,
area,
),
panel_animation.CharSource.settled,
);
return if (settled) .{ .col = col, .row = row } else null;
},
.off => {},
}
}
}
for (p.presented_panel_tracks) |maybe| {
const track = maybe orelse continue;
if (!track.active() or (track.effect != .slide and track.effect != .zoom and
track.effect != .vertical)) continue;
if (boxContainsCell(track.to, col, row)) return null;
}
return .{ .col = col, .row = row };
}
/// Commit the exact panel samples a backend successfully presented. An
/// empty slice means that backend drew the canonical grid directly.
/// Records are keyed by pane slot so hit-test order stays identical to the
/// renderer even when a native ABI publishes them in paint order.
pub fn acknowledgePanelPresentation(p: *Pardes, tracks: []const panel_animation.Track) void {
var presented: [MAX_PANES]?panel_animation.Track = @splat(null);
var presented_closing: [MAX_PANES]panel_animation.Track = undefined;
var nclosing: usize = 0;
var layout: [MAX_PANES]?LayoutSnapshot = if (p.submitted_panel_layout_ready)
p.submitted_panel_layout
else
@splat(null);
if (!p.submitted_panel_layout_ready) for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
layout[id] = .{ .serial = pane.serial, .box = panelBox(p.rects[id]) };
};
for (&layout, 0..) |*snapshot, id| if (snapshot.*) |saved| {
const pane = p.panes[id] orelse {
snapshot.* = null;
continue;
};
if (pane.serial != saved.serial) snapshot.* = null;
};
for (tracks) |track| {
if (track.phase == .closing) {
const current = for (p.closing_panel_tracks[0..p.nclosing_panel_tracks]) |candidate| {
if (candidate.serial == track.serial and candidate.pane == track.pane and
candidate.effect == track.effect) break true;
} else false;
if (!current or !track.active() or nclosing == presented_closing.len) continue;
presented_closing[nclosing] = track;
nclosing += 1;
continue;
}
const id: usize = track.pane;
if (id >= p.panes.len or !track.active()) continue;
const pane = p.panes[id] orelse continue;
if (pane.serial != track.serial) continue;
presented[id] = track;
layout[id] = .{ .serial = track.serial, .box = track.visualBox() };
}
p.presented_panel_tracks = presented;
p.presented_closing_panel_tracks = presented_closing;
p.npresented_closing_panel_tracks = nclosing;
p.presented_panel_layout = layout;
p.panel_presentation_ready = true;
p.panel_presentation_pending = false;
// An empty acknowledgement means canonical cells, not an invisible
// transition. Retire any producer records a direct/headless fallback
// deliberately did not present, then make this exact frame the future
// old-grid baseline. Animated acknowledgements keep their baseline
// frozen until the canonical endpoint is actually presented.
if (tracks.len == 0) {
p.panel_tracks = @splat(null);
p.nclosing_panel_tracks = 0;
p.panel_diff_pending = false;
p.panel_diff_ready = false;
p.rememberPresentedCells();
}
// A held gesture follows the pixels just acknowledged even when the
// physical pointer stayed still. Its payload already is the last
// successfully mapped endpoint, so an invisible sample simply leaves
// that endpoint intact for a later frame or balanced release.
if (p.pointer_inside and p.drag != .none) {
if (p.presentedPointer(p.pointer_raw_col, p.pointer_raw_row)) |mapped| {
p.hover_col = mapped.col;
p.hover_row = mapped.row;
p.dragUpdate(mapped.col, mapped.row);
}
}
p.refreshLookHoverFromRaw();
}
fn rememberPresentedCells(p: *Pardes) void {
p.panel_diff_pending = false;
p.panel_diff_ready = false;
const cells = p.surface.cells;
if (cells.len == 0) {
p.presented_cells_valid = false;
p.presented_cells_layout = @splat(null);
return;
}
if (p.presented_cells.len != cells.len) {
const next = p.gpa.alloc(Cell, cells.len) catch {
p.presented_cells_valid = false;
p.presented_cells_layout = @splat(null);
return;
};
if (p.presented_cells.len > 0) p.gpa.free(p.presented_cells);
p.presented_cells = next;
}
@memcpy(p.presented_cells, cells);
p.presented_cells_cols = p.surface.cols;
p.presented_cells_rows = p.surface.rows;
p.presented_cells_valid = true;
p.presented_cells_layout = if (p.submitted_panel_layout_ready)
p.submitted_panel_layout
else
@splat(null);
}
fn panelCellChanged(p: *const Pardes, col: u16, row: u16) bool {
if (!p.panel_diff_ready or col >= p.screen_w or row >= p.screen_h or
p.panel_cell_diffs.len != @as(usize, p.screen_w) * p.screen_h) return false;
return p.panel_cell_diffs[@as(usize, row) * p.screen_w + col].changed();
}
fn panelCellDiff(p: *const Pardes, col: u16, row: u16) PanelCellDiff {
if (!p.panel_diff_ready or col >= p.screen_w or row >= p.screen_h or
p.panel_cell_diffs.len != @as(usize, p.screen_w) * p.screen_h) return .unchanged;
return p.panel_cell_diffs[@as(usize, row) * p.screen_w + col];
}
/// A backend is about to replace an unpresentable animated frame with the
/// canonical grid. Stop producer tracks too, so a later successful retry
/// cannot resume halfway through an animation after canonical was shown.
pub fn abandonPanelAnimations(p: *Pardes) void {
p.panel_tracks = @splat(null);
p.nclosing_panel_tracks = 0;
p.presented_panel_tracks = @splat(null);
p.npresented_closing_panel_tracks = 0;
p.panel_diff_pending = false;
p.panel_diff_ready = false;
p.panel_presentation_pending = p.panel_presentation_ready;
p.cancelLookHover();
}
/// A native scene pass proved unavailable. Config reads these exact bits,
/// and the idle-clock predicate stops immediately once they are clear.
pub fn disableSceneEffects(p: *Pardes) void {
p.settings.scene_effects = .{};
}
fn handleMouse(p: *Pardes, m: Mouse) void {
const raw_col = @min(m.col, p.screen_w -| 1);
const raw_row = @min(m.row, p.screen_h -| 1);
p.pointer_raw_col = raw_col;
p.pointer_raw_row = raw_row;
p.pointer_inside = true;
if (m.button == .none and m.kind == .motion) {
p.raw_hover_intent = true;
p.refreshLookHoverFromRaw();
return;
}
p.raw_hover_intent = false;
const mapped = p.presentedPointer(raw_col, raw_row) orelse {
p.cancelLookHover();
// A disappearing transition cell may hide the release, but the
// press it balances already has a last valid endpoint in Drag.
// End only the gesture owned by this exact physical button.
if (m.kind == .release) p.dragRelease(m.button);
return;
};
const mcol = mapped.col;
const mrow = mapped.row;
p.hover_col = mcol;
p.hover_row = mrow;
const hovered = p.paneAt(mcol, mrow);
// any press that is NOT the execute+select chord abandons a pending
// chord argument
if (m.kind == .press and
!(m.button == config.select_button and p.drag == .select and p.drag.select.button == config.exec_button))
{
if (p.chord_arg) |a| {
p.gpa.free(a);
p.chord_arg = null;
}
}
// ...and any press at all takes the keyboard back off the topbar: the
// mouse names where focus goes, so leaving a cursor parked on row 0
// while you click into a pane would just be a lie
if (m.kind == .press) p.topbar_col = null;
switch (m.button) {
.none => {}, // hover tracked above; motion has no other meaning
.wheel_up, .wheel_down => {
if (m.kind != .press) return;
// re-arms the drift guard below; vertical always scrolls, so
// the answer is never in doubt here
_ = config.wheelTick(&p.wheel_guard, true);
const id = hovered orelse return;
const pane = p.panes[id].?;
if (hasPdf(pane))
pdf_pane.verticalWheel(p, pane, if (m.button == .wheel_up) -1 else 1)
else
pane.scrollBy(if (m.button == .wheel_up) -config.wheel_rows else config.wheel_rows);
},
.wheel_left, .wheel_right => {
if (m.kind != .press) return;
// a mostly-vertical two-finger swipe's sideways drift dies
// here rather than sliding the view out from under a scroll.
// Charged against the gesture, not the pane, so it runs before
// we ask what is hovered.
if (!config.wheelTick(&p.wheel_guard, false)) return;
const id = hovered orelse return;
const pane = p.panes[id].?;
if (hasPdf(pane)) {
pdf_pane.horizontalWheel(p, pane, if (m.button == .wheel_right) 1 else -1);
// ponytail: no right clamp — overscroll shows blank and the
// next cursor move or left wheel pulls it back
} else if (pane.file != null and !p.settings.wrap) {
// wrapped there is nothing off to the right to reach
const line = file_pane.sourceLine(pane, pane.cur_row);
const visual = file_pane.rawDisplayCol(line, @intCast(@max(0, pane.hscroll)));
const next: usize = if (m.button == .wheel_right)
visual +| @as(usize, @intCast(config.wheel_cols))
else
visual -| @as(usize, @intCast(config.wheel_cols));
pane.hscroll = @intCast(file_pane.rawAtDisplay(line, next));
}
},
config.select_button => switch (m.kind) {
.press => {
// acme 2-1: a select press during an EXECUTE drag captures
// a selection (heldSelection) as the execute's argument;
// the execute drag keeps running to its release, which
// consumes it.
if (p.drag == .select and p.drag.select.button == config.exec_button) {
if (p.heldSelection(p.drag.select.id)) |tx| {
if (p.chord_arg) |old| p.gpa.free(old);
p.chord_arg = p.gpa.dupe(u8, tx) catch null;
}
return;
}
// acme 3-1: a select tap during a LOOK drag cancels the
// look; the rest of the gesture is inert
if (p.drag == .select and p.drag.select.button == config.look_button) {
if (p.panes[p.drag.select.id]) |t| {
t.sel[@intFromEnum(config.look_button)].state = .none;
if (comptime pdf_enabled)
pdf_pane.pointerCancel(t, p.drag.select.pdf);
}
p.drag = .none;
return;
}
if (mrow < TOPBAR_H) return; // topbar: a select click is deliberately inert
// the layout box (gutter cells of the tag row) wins over
// the resize handles: a tag-only pane's single row IS its
// pair's h-handle, and the box must stay grabbable to move
if (hovered) |mid| {
const mr = p.rects[mid];
const mtag = if (p.settings.tag_bottom) mr.y + mr.h -| BOX_H else mr.y;
if (mcol < mr.x + config.GUTTER and mrow >= mtag and mrow < mtag + BOX_H) {
p.drag = .{ .move = .{ .id = mid, .cur_x = mcol, .cur_y = mrow } };
return;
}
}
// resize handles next: a pane's own trailing edge (v: the
// left column's last col; h: the seam row between a stacked
// pair that is a BODY row — the upper pane's last, or with
// Tagbottom, where that one is the upper pane's tag, the
// lower pane's first).
// The v test still wins outright, but it now also asks
// whether this same cell is one of the adjoining columns' h
// handles — that cell is the corner where the two lines
// meet, and grabbing it drags both boundaries at once. Its
// OWN column is asked first, so a row where both are split
// is the gesture it always was (see Drag.border_v).
for (0..p.ncol -| 1) |c| {
if (mcol == p.col_x[c] + p.col_w[c] -| 1) {
const corner: @FieldType(@FieldType(Drag, "border_v"), "corner") = if (p.seamIdxAt(c, mrow)) |k|
.{ .col = c, .idx = k }
else if (p.seamIdxAt(c + 1, mrow)) |k|
.{ .col = c + 1, .idx = k }
else
null;
p.drag = .{ .border_v = .{ .left_col = c, .cur_x = mcol, .corner = corner, .cur_y = mrow } };
return;
}
}
for (0..p.ncol) |cc| {
if (mcol < p.col_x[cc] or mcol >= p.col_x[cc] + p.col_w[cc]) continue;
if (p.seamIdxAt(cc, mrow)) |k| {
p.drag = .{ .border_h = .{ .col = cc, .top_idx = k, .cur_y = mrow } };
return;
}
}
const id = hovered orelse return;
const r = p.rects[id];
const pane = p.panes[id] orelse return;
// the same two rows renderPane painted through (see there):
// the tag's, and the body's first. A Sel row is still 0 for
// the tag and BOX_H upward for the body whichever end they
// are at, so the mapping happens HERE and everything
// downstream of a Sel is untouched.
const tag_y = if (p.settings.tag_bottom) r.y + r.h -| BOX_H else r.y;
const body_y = if (p.settings.tag_bottom) r.y else r.y + BOX_H;
if (mcol < r.x + config.GUTTER) {
// gutter scrollbar: a left click scrolls UP to that row
p.active = id;
pane.scrollBy(-(@as(i32, mrow) - @as(i32, body_y)));
} else if (mrow >= tag_y and mrow < tag_y + BOX_H) {
// left press on the tag row: focus the tag AT that
// column (a rendered-tag column — the mouse and the tag
// agree, no clamp into the tail) and anchor a sweep, so
// dragging selects any span of it, path included
p.active = id;
p.enterTagEdit(pane, @as(i32, mcol) - @as(i32, r.x + config.GUTTER));
pane.tag_anchor = pane.tag_col;
p.drag = .{ .tag = .{ .id = id } };
} else {
p.active = id;
exitTagEdit(pane); // clicking the body leaves tag editing
const sc: i32 = @as(i32, mcol) - @as(i32, r.x + config.GUTTER);
const v: i32 = @as(i32, mrow) - @as(i32, body_y) + @as(i32, BOX_H);
pane.sel[sel_slot] = .{ .state = .dragging, .c0 = sc, .c1 = sc, .r0 = v, .r1 = v };
// Ctrl rides on the drag rather than firing here: the
// click does not place the modal cursor until RELEASE
// (dragRelease), and a goto asked at press time would
// answer about wherever the cursor happened to be.
p.drag = .{ .select = .{
.id = id,
.button = config.select_button,
.ctrl = m.ctrl,
.pdf = pdf_pane.pointerStart(
p,
pane,
config.select_button,
mcol,
mrow,
false,
),
} };
}
},
.drag => p.dragUpdate(mcol, mrow),
.release => p.dragRelease(config.select_button),
.motion => {},
},
config.exec_button, config.look_button => switch (m.kind) {
.press => {
// acme 1-2 / 1-3: the execute (Cut) or look (Paste) button
// tapped while the select button holds a selection drag
if (p.drag == .select and p.drag.select.button == config.select_button) {
p.chordCutPaste(m.button == config.exec_button);
return;
}
// acme 2-3 / 3-2: tapping the OTHER of execute/look during
// an execute or look drag cancels it (textselect23's mask)
if (p.drag == .select) {
if (p.panes[p.drag.select.id]) |t| {
t.sel[@intFromEnum(p.drag.select.button)].state = .none;
if (comptime pdf_enabled)
pdf_pane.pointerCancel(t, p.drag.select.pdf);
}
p.drag = .none;
return;
}
if (mrow < TOPBAR_H) {
// global tagbar: EXECUTE runs the command under the
// click (a stray select click must never Kill)
if (m.button == config.exec_button) {
var tb_buf: [1200]u8 = undefined;
const bar = p.topbar(&tb_buf);
const word = wordAtCol(bar, file_pane.rawAtDisplay(bar, mcol));
// a topbar word runs on the PRESS — there is no
// drag to chord into, so the argument is simply
// whatever is selected right now: select a word,
// ...but only for a builtin that HAS somewhere to
// put one (see takesArg): a word left selected in
// some pane an hour ago is not an argument to
// Kill, and splicing it made a name that matches
// no builtin and therefore went to a shell.
const named = std.meta.stringToEnum(Builtin, word);
const held = if (named) |b|
(if (builtins.registry.takesArg(b)) p.heldSelection(p.active) else null)
else
p.heldSelection(p.active); // not a builtin: an ordinary acme 2-1
if (word.len > 0) _ = p.execute(p.active, p.withArg(word, held));
}
return;
}
const id = hovered orelse return;
const r = p.rects[id];
const pane = p.panes[id] orelse return;
// the tag row and the body's first, exactly as the select
// arm above derives them
const tag_y = if (p.settings.tag_bottom) r.y + r.h -| BOX_H else r.y;
const body_y = if (p.settings.tag_bottom) r.y else r.y + BOX_H;
const on_tag = mrow >= tag_y and mrow < tag_y + BOX_H;
if (mcol < r.x + config.GUTTER and !on_tag) {
// gutter: right scrolls DOWN to here, mirroring left's up;
// middle matches left. Right focuses (look lands you
// there); middle does not.
const local = @as(i32, mrow) - @as(i32, body_y);
if (m.button == config.look_button) p.active = id;
pane.scrollBy(if (m.button == config.look_button) local else -local);
} else if (p.pointerTextSelection(id, mcol, mrow)) |pointed| {
if (m.button == config.look_button) p.active = id;
// Click and delayed hover enter through the same physical
// cell mapper. From here on both also share expandedSel;
// hover merely stores the result outside Pane.sel.
pane.sel[@intFromEnum(m.button)] = pointed.sel;
p.drag = .{
.select = .{
.id = id,
.button = m.button,
// A native body gesture stays native even when its
// point later misses a letterbox or selection.
.pdf = pdf_pane.pointerStart(
p,
pane,
m.button,
mcol,
mrow,
pointed.on_tag,
),
},
};
}
},
.drag => p.dragUpdate(mcol, mrow),
.release => p.dragRelease(m.button),
.motion => {},
},
}
}
/// Index of the pane pair in column `c` whose seam (see seamRowOf) is screen
/// row `mrow`. Out-of-range columns simply have no seam.
fn seamIdxAt(p: *const Pardes, c: usize, mrow: u16) ?usize {
if (c >= p.ncol) return null;
for (0..p.col_n[c] -| 1) |k| if (mrow == seamRowOf(p, c, k)) return k;
return null;
}
fn dragUpdate(p: *Pardes, mcol: u16, mrow: u16) void {
switch (p.drag) {
.border_v => |*d| {
const c = d.left_col;
d.cur_x = if (c + 1 < p.ncol)
clampBorderCol(p.col_x[c], p.col_w[c], p.col_w[c + 1], mcol)
else
mcol;
// a corner also drives its column's pane pair, off the SAME
// mouse position but through its own clamp — the geometry a
// clamp reads (widths for x, heights for y) is frozen for the
// whole drag and never crosses axes, so one edge parked at its
// stop leaves the other tracking the mouse
if (d.corner) |k| if (k.idx + 1 < p.col_n[k.col]) {
const a = p.rects[p.col_terms[k.col][k.idx]];
const b = p.rects[p.col_terms[k.col][k.idx + 1]];
d.cur_y = clampBorderRow(a.y, a.h, b.h, mrow, p.settings.tag_bottom);
} else {
d.cur_y = mrow;
};
},
.border_h => |*d| {
const cc = d.col;
const k = d.top_idx;
if (k + 1 < p.col_n[cc]) {
const a = p.rects[p.col_terms[cc][k]];
const b = p.rects[p.col_terms[cc][k + 1]];
d.cur_y = clampBorderRow(a.y, a.h, b.h, mrow, p.settings.tag_bottom);
} else d.cur_y = mrow;
},
.move => |*d| {
d.cur_x = mcol;
d.cur_y = mrow;
},
.select => |*s| {
if (p.panes[s.id]) |pane| {
const r = p.rects[s.id];
const b = @intFromEnum(s.button);
pane.sel[b].c1 = @as(i32, mcol) - @as(i32, r.x + config.GUTTER);
// A Tagbottom drag STAYS IN THE REGION ITS ANCHOR STARTED
// IN, which is the one place the two coordinate spaces
// genuinely disagree: Sel row 0 is the tag and the body
// counts up from BOX_H, but on screen the tag is now BELOW
// the body. Sweeping down past the last line onto the
// tagline — the ordinary "select to the end" gesture — would
// therefore drive r1 to the TOP of Sel space and invert the
// selection: the highlight jumps above the anchor, and a 1-2
// Cut on it deletes lines nobody swept. So a body-anchored
// drag is clamped to the body rows and a tag-anchored one
// (execute/look only; the left button's tag sweep is its own
// .tag drag) stays on the tag, which is one line anyway.
// The cost is that a body sweep can no longer be extended
// onto the bottom tagline to pick up the tag text.
if (p.settings.tag_bottom) {
const body_h = r.h -| BOX_H;
pane.sel[b].r1 = if (pane.sel[b].r0 < BOX_H or body_h == 0)
0
else
@as(i32, @min(@max(mrow, r.y), r.y + body_h - 1)) - @as(i32, r.y) + @as(i32, BOX_H);
} else pane.sel[b].r1 = @as(i32, mrow) - @as(i32, r.y);
if (comptime pdf_enabled)
pdf_pane.pointerUpdate(&s.pdf, p, pane, mcol, mrow);
}
},
.tag => |d| {
// the tag cursor follows the mouse across the rendered tag; the
// row is ignored (a tag is one line) and the anchor stays where
// the press put it, so this is the mouse's `v`
const pane = p.panes[d.id] orelse return;
const c = @as(i32, mcol) - @as(i32, p.rects[d.id].x + config.GUTTER);
const text = p.tagText(p.scratch.allocator(), pane) catch return;
pane.tag_col = @intCast(@min(text.len, file_pane.rawAtDisplay(text, @intCast(@max(0, c)))));
pane.tag_sel = pane.tag_col != pane.tag_anchor;
},
.none => {},
}
}
/// THE ACME INVERSION: while a script holds this pane's `event` file open,
/// buttons 2 and 3 in it belong to the script. The words in its tag are
/// ITS commands — `Step`, `Run`, `Clear` — and pardes has never heard of
/// them, so it reports the click and performs nothing. Returns true when
/// the caller must not run the builtin.
///
/// Keyboard Enter/Tab are deliberately NOT suppressed, unlike acme (which
/// has no keyboard equivalent to suppress): a scripted pane stays
/// editable, and a script that dies mid-run cannot leave you unable to
/// execute anything in it.
fn reportGesture(
p: *Pardes,
id: usize,
cmd: Builtin,
text: []const u8,
on_tag: bool,
operand: PointerOperand,
chorded: bool,
) bool {
if (!p.fs.scripted(id)) return false;
const is_look = cmd == config.look_cmd;
const action: acmefs.Action = if (is_look)
(if (on_tag) .tag_look else .body_look)
else
(if (on_tag) .tag_exec else .body_exec);
const named = std.meta.stringToEnum(Builtin, commandText(text)) != null;
const range = p.gestureRange(id, text, on_tag, operand);
// acme(4)'s two flag vocabularies at the same bit positions. For an
// exec, bit 1 is "this is a builtin"; for a look, it is "pardes can
// act on this without loading a file", which is the same fact plus a
// word that is not a path. Bit 2 is acme's "the text indicated is a
// null string that has a non-null expansion", which is exactly what an
// empty range plus text means here.
var flag: u32 = if (named) acmefs.flag_builtin else 0;
if (range.q0 == range.q1 and text.len > 0) flag |= acmefs.flag_expansion;
if (is_look) {
if (!named and std.mem.indexOfAny(u8, text, "/.:") != null) flag |= acmefs.flag_filename;
} else if (chorded) flag |= acmefs.flag_chorded;
return acmefs.noteAction(p, id, action, range.q0, range.q1, flag, text);
}
/// THE BYTE RANGE A GESTURE NAMES, in the coordinates `addr` and `data`
/// speak — and it must name the TEXT REPORTED WITH IT, because a script
/// that does not recognise a record writes it back and pardes then
/// re-derives the text from these two numbers. A range that started at the
/// pointer instead of at the operand would execute `l D` for a click on
/// the `l` of `Del`.
///
/// So the start comes from whatever the operand actually resolved: an
/// expanded word's own column, or the leading corner of the selection it
/// reused. When neither is available — a modal `v`/`x` selection, a
/// terminal's projected screen, a PDF — the answer is acme's null range at
/// the click, which its flag bit 2 already has a meaning for: the text
/// travels, the range does not claim to be it.
fn gestureRange(p: *Pardes, id: usize, text: []const u8, on_tag: bool, operand: PointerOperand) acmefs.PaneFs.Range {
const pane = p.panes[id] orelse return .{};
if (on_tag) {
const tag = p.tagText(p.scratch.allocator(), pane) catch return .{};
const sel = operand.expanded orelse operand.preview orelse return .{};
const lead = @min(sel.c0, sel.c1);
const at = file_pane.rawAtDisplay(tag, @intCast(@max(0, lead)));
const q0: u32 = @intCast(@min(at, tag.len));
return .{ .q0 = q0, .q1 = @intCast(@min(q0 + text.len, tag.len)) };
}
const f = if (pane.file) |*file| file else return .{};
const start: ?modal.Cursor = if (operand.file_word) |w|
.{ .row = @intCast(@max(0, w.row)), .col = @intCast(@max(0, w.lo)) }
else if (operand.expanded orelse operand.preview) |sel| lead: {
// A selection's leading corner in reading order, converted the way
// `pointerOperand` converts the click itself.
const top = @min(sel.r0, sel.r1) - @as(i32, BOX_H);
if (top < 0) break :lead null;
const w = pane.wrapAt(top);
const col = p.paneByteAtDisplay(pane, w.line, w.at, @min(sel.c0, sel.c1) - config.PREFIX_W);
break :lead .{
.row = @intCast(@max(0, w.line)),
.col = @intCast(@max(0, col)),
};
} else null;
const cursor = start orelse return .{};
const q0: u32 = @intCast(@min(modal.hxOff(f.content, cursor), f.content.len));
return .{ .q0 = q0, .q1 = @intCast(@min(q0 + text.len, f.content.len)) };
}
fn dispatchPointerBuiltin(
p: *Pardes,
id: usize,
cmd: Builtin,
text: ?[]const u8,
gesture: ?struct { on_tag: bool, operand: PointerOperand },
) void {
const arg = p.chord_arg;
p.chord_arg = null;
defer if (arg) |a| p.gpa.free(a);
const operand = text orelse {
// Nothing expanded — a click on `#`, `*`, `|`, a blank cell. A
// WATCHED pane still owns it: the script decides what a character
// pardes has no word for means, and life.py's grid is made of
// exactly those characters.
if (gesture) |g| _ = p.reportGesture(id, cmd, "", g.on_tag, g.operand, arg != null);
return;
};
if (gesture) |g| if (p.reportGesture(id, cmd, operand, g.on_tag, g.operand, arg != null)) return;
p.runBuiltin(cmd, id, "", p.withArg(operand, arg));
}
fn dragRelease(p: *Pardes, button: Mouse.Button) void {
// A different button's release belongs to a chord or another host
// stream; only the button which began this gesture may end it.
if (p.drag.button() != button) return;
defer p.drag = .none;
switch (p.drag) {
.border_v => |d| {
const c = d.left_col;
const old_seam = p.col_x[c] + p.col_w[c] -| 1;
if (c + 1 < p.ncol and d.cur_x != old_seam) {
const combined: u64 = p.col_w[c] + p.col_w[c + 1];
// the handle is the left pane's LAST column (inclusive), so
// the new width includes it — a no-drag click changes nothing
var nl: u64 = (d.cur_x + 1) -| p.col_x[c];
nl = std.math.clamp(nl, config.MINW, @max(@as(u64, config.MINW), combined -| config.MINW));
const pair = p.col_weight[c] + p.col_weight[c + 1];
if (pair > 1 and combined > 0) {
const numerator = @as(u128, pair) * nl + combined / 2;
const left = std.math.clamp(@as(u64, @intCast(numerator / combined)), 1, pair - 1);
p.col_weight[c] = left;
p.col_weight[c + 1] = pair - left;
}
}
// and the corner's other half. The two commits are independent
// — column weights are widths, pane vweights are heights, and
// neither reads the other — so the order here does not matter
// and a failed one cannot lose the other.
if (d.corner) |k| {
if (d.cur_y != seamRowOf(p, k.col, k.idx))
p.applyRowSplit(k.col, k.idx, d.cur_y);
}
},
.border_h => |d| if (d.cur_y != seamRowOf(p, d.col, d.top_idx))
p.applyRowSplit(d.col, d.top_idx, d.cur_y),
.move => |d| {
p.moveTerm(d.id, d.cur_x, d.cur_y);
// a file moved into the left column evicts a lone unused shell
if (p.panes[d.id]) |mt| if (mt.file != null) {
if (p.layoutFindTerm(d.id)) |f| if (f.col == 0)
p.evictLonePristineTty(0, d.id);
};
},
.select => |s| {
const pane = p.panes[s.id] orelse return;
if (comptime pdf_enabled) {
if (s.pdf.native) {
var release = pdf_pane.pointerRelease(
p,
pane,
s.pdf,
s.button,
s.chorded,
);
defer release.deinit(p.pdf_gpa);
// A native PDF page has no byte offsets of its own to
// report, so a scripted pane cannot intercept this one.
if (release.action) |action| p.dispatchPointerBuiltin(
s.id,
if (action == .look) config.look_cmd else config.exec_cmd,
release.text,
null,
);
return;
}
}
if (s.chorded) {
// a cut/paste chord consumed this drag; the release is inert
pane.sel[@intFromEnum(s.button)].state = .none;
return;
}
const b = @intFromEnum(s.button);
pane.sel[b].state = .done;
if (s.button == config.select_button) {
// keep a dragged selection highlighted; a plain click clears
// it. Either way pin the cursor; files also enter normal
// mode, terminals keep the mode they had (tty keeps the
// mouse usable, insert keeps typing where you clicked).
const sl = pane.sel[sel_slot];
const dragged = sl.c0 != sl.c1 or sl.r0 != sl.r1;
if (!dragged) pane.sel[sel_slot].state = .none;
const body_vis = sl.r1 - @as(i32, BOX_H);
if (body_vis >= 0 and pane.mode != .tty) {
// the row the user clicked, as the LAST FRAME drew it:
// which line it showed and the byte column it started
// at, so a click lands on the character under the
// pointer whether or not that row is a continuation
const w = pane.wrapAt(body_vis);
pane.cur_row = w.line;
pane.cur_col = p.paneByteAtDisplay(
pane,
w.line,
w.at,
sl.c1 - (if (pane.file != null) @as(i32, config.PREFIX_W) else 0),
);
pane.cur_pinned = true;
if (!pane.isTerminal()) pane.mode = .normal;
pane.msel.active = false;
pane.pending = 0;
// A fresh left gesture replaces every modal selection.
// Keeping an explicit v/x anchor made a plain click
// extend it, leaving no mouse-only way to dismiss it.
pane.vsel.active = false;
pane.nsel = 0; // a click says WHERE the one cursor is
// Ctrl-click IS `gd`, asked now that the cursor has
// landed — the mouse spelling of the keyboard motion,
// through the identical request. A ctrl-DRAG still
// selects and still asks, about where it started,
// which is the same thing `gd` would answer.
if (s.ctrl) p.lspRequest(s.id, .definition, "");
}
} else {
// acme execute (middle) / look (right): a no-drag click
// expands to the word under it first; a captured chord
// argument rides along and is consumed here.
// WHERE THE CLICK LANDED, before any expansion — as a body
// position, the way the left button converts its drag end.
const clk = pane.sel[b];
const operand = p.pointerOperand(pane, clk);
if (operand.expanded) |expanded|
pane.sel[b] = expanded
else if (operand.text == null)
pane.sel[b].state = .none;
// A look that names no file SEARCHES from where you are, so
// the click has to say where that is and the search walks
// forward from there. Not PINNED — a shell's cursor still
// belongs to the shell, and the search reads this in the
// same event.
if (s.button == config.look_button and clk.r0 >= BOX_H and pane.mode != .tty) {
pane.cur_row = operand.row;
pane.cur_col = operand.col;
}
const txt = operand.text;
const cmd = if (s.button == config.look_button) config.look_cmd else config.exec_cmd;
p.dispatchPointerBuiltin(s.id, cmd, txt, .{
.on_tag = clk.r0 < BOX_H,
.operand = operand,
});
}
},
.tag => {}, // dragUpdate already left the tag cursor + selection set
.none => {},
}
}
/// Commit a horizontal border to the pane weights: in column `cc`, the pane
/// at index `k` and the one under it split their combined height at row
/// `cur_y`. Shared by the plain h-drag and the h half of a corner drag —
/// the same gesture landing on the same boundary must settle identically
/// whether or not a column edge came along for the ride.
fn applyRowSplit(p: *Pardes, cc: usize, k: usize, cur_y: u16) void {
if (k + 1 >= p.col_n[cc]) return;
const a = p.panes[p.col_terms[cc][k]] orelse return;
const b = p.panes[p.col_terms[cc][k + 1]] orelse return;
const ra = p.rects[p.col_terms[cc][k]];
const rb = p.rects[p.col_terms[cc][k + 1]];
const combined: f32 = @floatFromInt(ra.h + rb.h);
// the handle is the upper pane's LAST row (inclusive, hence the +1), or
// with Tagbottom the lower pane's FIRST — which is that row's height
// already, with nothing to add. Either way a no-drag click hands back
// exactly ra.h and nothing moves.
var nt: f32 = @floatFromInt(if (p.settings.tag_bottom) cur_y -| ra.y else (cur_y + 1) -| ra.y);
nt = std.math.clamp(nt, @as(f32, BOX_H), @max(@as(f32, BOX_H), combined - BOX_H));
const pair = a.vweight + b.vweight;
a.vweight = pair * (nt / combined);
b.vweight = pair - a.vweight;
}
/// acme 1-2 (Cut) / 1-3 (Paste): middle or right tapped while the left
/// button holds a selection drag. The first tap converts the mouse
/// selection into the modal one (vsel anchored at the drag start, cursor
/// at its end; a plain click is a bare cursor). Cut yanks + deletes the
/// selection; Paste replaces it with the yank register, or splices the
/// register in literally at a bare cursor — so 1-2 then 1-3 in one hold
/// nets out to Snarf (copy: the text returns, the register keeps it).
/// In a tty-mode shell 1-3 instead pastes into the pty (forwarded click
/// + bracketed paste) and 1-2 is inert.
fn chordCutPaste(p: *Pardes, cut: bool) void {
const s = &p.drag.select;
const pane = p.panes[s.id] orelse return;
if (comptime pdf_enabled) if (pane.pdf) |pv| {
if (!s.chorded) {
s.chorded = true;
pane.sel[sel_slot].state = .none;
}
// A PDF is immutable: its Cut-side chord is Snarf (copy), while
// Paste has no document mutation to perform.
if (cut and pv.selection_text.len > 0) p.setYank(pv.selection_text);
return;
};
if (pane.mode == .tty) {
// tty: nothing can be cut — 1-2 stays inert; the pty owns the
// screen. 1-3 pastes like a terminal emulator: the click is
// forwarded first (only when the app listens for mouse) so
// mouse-aware programs put their cursor under it, then the
// register is typed — bracketed when the app set mode 2004
// (readline/vim/helix strip the markers), else with \n turned
// to \r like any unbracketed paste.
if (!s.chorded) {
s.chorded = true;
pane.sel[sel_slot].state = .none; // drop the sweep highlight
}
if (cut) return;
const y = p.yank orelse return;
if (y.len == 0) return;
if (term_pane.reportsMouse(pane)) {
// dragUpdate keeps sel[sel_slot] tracking the held select button, so
// the click lands where the mouse is at this tap; 1-based,
// body-relative (the tag row is ours, not the app's)
const col: u16 = @intCast(std.math.clamp(pane.sel[sel_slot].c1 + 1, 1, 9999));
const row: u16 = @intCast(std.math.clamp(pane.sel[sel_slot].r1 - @as(i32, BOX_H) + 1, 1, 9999));
var mb: [32]u8 = undefined;
if (term_pane.mouseFormatSgr(pane)) {
p.emitWrite(s.id, std.fmt.bufPrint(&mb, "\x1b[<0;{d};{d}M\x1b[<0;{d};{d}m", .{ col, row, col, row }) catch return);
} else {
// ponytail: legacy X10 bytes; add utf8/urxvt formats if an app ever wants them
const cb: u8 = @intCast(32 + @min(col, 222));
const rb: u8 = @intCast(32 + @min(row, 222));
p.emitWrite(s.id, &[_]u8{ 0x1b, '[', 'M', 32, cb, rb, 0x1b, '[', 'M', 35, cb, rb });
}
}
p.typeToTty(s.id, pane, y);
return;
}
if (!s.chorded) {
s.chorded = true;
const sl = pane.sel[sel_slot];
pane.sel[sel_slot].state = .none;
const pfx: i32 = if (pane.file != null) config.PREFIX_W else 0;
// both ends of the sweep through the same last-frame map, so a
// chord over wrapped rows cuts the text that was under it
const w0 = pane.wrapAt(@max(0, sl.r0 - @as(i32, BOX_H)));
const w1 = pane.wrapAt(@max(0, sl.r1 - @as(i32, BOX_H)));
const row0 = w0.line;
const row1 = w1.line;
const col0 = p.paneByteAtDisplay(pane, w0.line, w0.at, sl.c0 - pfx);
const col1 = p.paneByteAtDisplay(pane, w1.line, w1.at, sl.c1 - pfx);
pane.cur_row = row1;
pane.cur_col = col1;
pane.cur_pinned = true;
pane.msel.active = false;
pane.pending = 0;
if (!pane.isTerminal()) pane.mode = .normal;
pane.vsel = .{ .active = row0 != row1 or col0 != col1, .row = row0, .col = col0, .explicit = false };
pane.nsel = 0;
}
if (cut) {
if (pane.vsel.active) p.normalDelete(pane, true);
} else if (pane.vsel.active) {
p.normalReplaceYank(pane);
} else if (pane.file) |*f| {
// bare cursor: splice the register in literally (no linewise
// magic) so a paste right after a cut restores the text exactly
const y = p.yank orelse return;
if (y.len == 0) return;
const at = modal.Cursor{ .row = @intCast(@max(0, pane.cur_row)), .col = @intCast(@max(0, pane.cur_col)) };
p.pushUndo(pane);
const new = modal.insertAt(p.gpa, f.content, at, y) catch return;
file_pane.setContent(p, f, new);
pane.vsel = .{ .active = modal.nextGrapheme(y, 0) < y.len, .row = @intCast(at.row), .col = @intCast(at.col), .explicit = false };
const end = modal.advanceBy(at, y);
if (end.col > 0) {
pane.cur_row = @intCast(end.row);
pane.cur_col = @intCast(modal.prevGrapheme(modal.lineSlice(f.content, end.row), end.col));
} else {
// the register ended in '\n': the cursor lands ON that newline
pane.cur_row = @intCast(end.row -| 1);
pane.cur_col = @intCast(modal.lineSlice(f.content, end.row -| 1).len);
}
pane.cur_pinned = true;
pane.sticky_col = -1;
pane.ensureCursorVisible();
} else p.normalPaste(pane, true); // terminal: splice run text at the cursor
}
// ---- layout surgery ----
pub fn layoutFindTerm(p: *Pardes, id: usize) ?struct { col: usize, idx: usize } {
for (0..p.ncol) |c| {
for (0..p.col_n[c]) |k| {
if (p.col_terms[c][k] == id) return .{ .col = c, .idx = k };
}
}
return null;
}
fn layoutInsert(p: *Pardes, c: usize, idx: usize, id: usize) void {
var k = p.col_n[c];
while (k > idx) : (k -= 1) p.col_terms[c][k] = p.col_terms[c][k - 1];
p.col_terms[c][idx] = id;
p.col_n[c] += 1;
}
/// Remove from the layout. An emptied column hands its width to a neighbor
/// (else every surviving column reflows sideways) before shifting down.
pub fn layoutRemove(p: *Pardes, id: usize) void {
const f = p.layoutFindTerm(id) orelse return;
const c = f.col;
var k = f.idx;
while (k + 1 < p.col_n[c]) : (k += 1) p.col_terms[c][k] = p.col_terms[c][k + 1];
p.col_n[c] -= 1;
if (p.col_n[c] == 0) {
if (p.ncol > 1) p.col_weight[if (c > 0) c - 1 else c + 1] +|= p.col_weight[c];
var j = c;
while (j + 1 < p.ncol) : (j += 1) {
p.col_terms[j] = p.col_terms[j + 1];
p.col_n[j] = p.col_n[j + 1];
p.col_weight[j] = p.col_weight[j + 1];
}
p.ncol -= 1;
}
}
/// Newtty: a shell in the caller's directory, raw from the first frame,
/// stacked below the caller like Alt-n's new shell.
pub fn spawnTty(p: *Pardes, from: usize) void {
const src = p.panes[from] orelse return;
const free = p.freeSlot() orelse return;
const nt = p.newShell(free, paneDir(src)) catch return;
nt.greet = true;
nt.mode = .tty;
const parent = p.splitParent(from);
const f = p.layoutFindTerm(parent).?;
p.layoutInsert(f.col, f.idx + 1, free);
p.splitBelow(parent, nt);
p.active = free;
}
/// Joincol: fold the active pane's column into the one on its right,
/// carrying its panes and width across. Inert without a right neighbour.
pub fn joinCol(p: *Pardes) void {
const f = p.layoutFindTerm(p.active) orelse return;
const c = f.col;
if (c + 1 >= p.ncol) return;
const dst = c + 1;
p.col_weight[dst] +|= p.col_weight[c];
for (0..p.col_n[c]) |k| p.col_terms[dst][p.col_n[dst] + k] = p.col_terms[c][k];
p.col_n[dst] += p.col_n[c];
var j = c;
while (j + 1 < p.ncol) : (j += 1) {
p.col_terms[j] = p.col_terms[j + 1];
p.col_n[j] = p.col_n[j + 1];
p.col_weight[j] = p.col_weight[j + 1];
}
p.ncol -= 1;
}
/// Whether `source_id` can donate half its width to a new column. This is
/// public so callers that must create a pane first can reject before that
/// creation emits any native-side work.
pub fn layoutCanSplitColumn(p: *Pardes, source_id: usize) bool {
if (p.ncol >= MAX_COLS or source_id >= MAX_PANES or p.panes[source_id] == null) return false;
const source = p.layoutFindTerm(source_id) orelse return false;
// Refresh derived widths: public layout surgery may be chained between
// syncs, and a cached width must never admit a now-too-narrow split.
p.computeGeom();
if (p.col_w[source.col] < config.MINW * 2) return false;
const weight = p.col_weight[source.col];
if (weight >= 2 and weight % 2 == 0) return true;
for (0..p.ncol) |column| if (p.col_weight[column] > std.math.maxInt(u64) / 2)
return false;
return weight > 0;
}
/// Put `id` in a fresh column immediately beside `source_id`, taking the
/// new column's width only from the source column. `before` is used by a
/// first document, which belongs to the left of the shell that opened it;
/// Newcol and Alt-c put the new column on the right.
///
/// `id == source_id` moves one pane out of a stack. Its vertical weight is
/// absorbed before removal, while the column's horizontal weight remains
/// in place to be split. In either form the total column weight is exactly
/// unchanged, so every unrelated column keeps both its width and its x.
pub fn layoutSplitColumn(p: *Pardes, source_id: usize, id: usize, before: bool) bool {
if (id >= MAX_PANES or p.panes[id] == null) return false;
if (!p.layoutCanSplitColumn(source_id)) return false;
const source = p.layoutFindTerm(source_id) orelse return false;
const source_col = source.col;
var old_weight = p.col_weight[source_col];
const needs_rebase = old_weight < 2 or old_weight % 2 != 0;
if (needs_rebase) old_weight *= 2;
if (id == source_id) {
if (p.col_n[source_col] <= 1) return false;
p.absorbVWeight(id);
p.layoutRemove(id);
} else if (p.layoutFindTerm(id) != null) return false;
// A pathological hand-written dump can restore a positive proportion
// below one fixed-point quantum. Rebase every column together before
// splitting; ratios and therefore geometry remain identical.
if (needs_rebase) {
for (0..p.ncol) |column| p.col_weight[column] *= 2;
}
const source_weight = old_weight / 2;
const new_weight = old_weight - source_weight;
p.col_weight[source_col] = source_weight;
const c = source_col + @intFromBool(!before);
var j = p.ncol;
while (j > c) : (j -= 1) {
p.col_terms[j] = p.col_terms[j - 1];
p.col_n[j] = p.col_n[j - 1];
p.col_weight[j] = p.col_weight[j - 1];
}
p.col_weight[c] = new_weight;
p.col_terms[c][0] = id;
p.col_n[c] = 1;
p.ncol += 1;
return true;
}
/// Snap every pane in column `c` to its on-screen row count so later
/// weight edits move ONLY the panes they name: computeGeom rounds
/// round(avail*w/vsum) per pane, and with fractional weights a split or
/// absorb elsewhere in the column can jiggle a bystander by a row.
fn snapColWeights(p: *Pardes, c: usize) void {
for (0..p.col_n[c]) |k| {
const pid = p.col_terms[c][k];
if (p.panes[pid]) |pp| pp.vweight = @floatFromInt(@max(1, p.rects[pid].h));
}
}
/// Hand a dying pane's rows to ONE sibling (the pane above, or below for
/// the topmost) so the rest of the column keeps its sizes bit-identical —
/// the deletion mirror of splitBelow. Call while `id` is still in the
/// layout, with rects current.
pub fn absorbVWeight(p: *Pardes, id: usize) void {
const f = p.layoutFindTerm(id) orelse return;
if (p.col_n[f.col] <= 1) return;
p.snapColWeights(f.col);
// the pane above, but never a result list: walking past a stack of them
// lands on the pane that spawned it, so those keep their heights and
// only the spawner grows. The topmost pane has only what is below it.
var sib = if (f.idx > 0) p.col_terms[f.col][f.idx - 1] else p.col_terms[f.col][f.idx + 1];
var k = f.idx;
while (k > 0) : (k -= 1) {
sib = p.col_terms[f.col][k - 1];
if (p.panes[sib]) |pp| if (if (pp.file) |ff| output_pane.fileTraits(ff.output).doc else true) break;
}
if (p.panes[sib]) |s| s.vweight += @as(f32, @floatFromInt(@max(1, p.rects[id].h)));
}
/// The parent a new pane splits from must be tall enough that splitBelow
/// leaves the NEW pane at least 2 body rows (the parent keeps tag+1 row,
/// the new pane needs tag+2). A too-short choice is swapped for a
/// qualifying pane (same column first, keeping the split local), else the
/// tallest pane anywhere.
fn splitParent(p: *Pardes, want: usize) usize {
const need = 2 * BOX_H + 3;
if (p.rects[want].h >= need) return want;
if (p.layoutFindTerm(want)) |f| for (0..p.col_n[f.col]) |k| {
if (p.rects[p.col_terms[f.col][k]].h >= need) return p.col_terms[f.col][k];
};
var tallest = want;
for (0..p.ncol) |c| for (0..p.col_n[c]) |k| {
const pid = p.col_terms[c][k];
if (p.rects[pid].h >= need) return pid;
if (p.rects[pid].h > p.rects[tallest].h) tallest = pid;
};
return tallest;
}
/// Open a window BELOW `src` (acme-style) without rebalancing the column:
/// shrink ONLY src to its content height (cursor row kept visible) and hand
/// the freed rows to `nw` — together they fill src's old slot and the other
/// panes keep their sizes bit-identical (weights snap to row counts).
fn splitBelow(p: *Pardes, src_id: usize, nw: *Pane) void {
const src = p.panes[src_id] orelse return;
const src_h = p.rects[src_id].h;
const body: u16 = if (src_h > BOX_H) src_h - BOX_H else 1;
const cur: u16 = if (!src.isTerminal()) body / 2 else term_pane.gridCursor(src).y + 1;
// cap keep so a content-full source still leaves the new pane a tag +
// a few body rows (an Alt-n from a full shell was born 0 rows tall)
const keep = std.math.clamp(cur, 1, @max(1, body -| (BOX_H + 3)));
if (p.layoutFindTerm(src_id)) |f| for (0..p.col_n[f.col]) |k| {
const pid = p.col_terms[f.col][k];
if (p.panes[pid]) |pp| if (pp != nw) {
pp.vweight = @floatFromInt(@max(1, p.rects[pid].h));
};
};
src.vweight = @floatFromInt(BOX_H + keep);
nw.vweight = @floatFromInt(@max(1, src_h -| (BOX_H + keep)));
// a non-doc buffer is worth exactly its own text: a three-hit +Search
// is four rows, not half the source. Nothing else can want the rows,
// so they go straight back to the pane they were taken from.
if (nw.file) |f| if (!output_pane.fileTraits(f.output).doc) {
// trimmed: every row ends in a newline, and the empty line after
// the last one is not a result
const want: f32 = @floatFromInt(BOX_H + file_pane.lineCount(std.mem.trimEnd(u8, f.content, "\n")));
if (want < nw.vweight) {
src.vweight += nw.vweight - want;
nw.vweight = want;
}
};
}
/// when a doc lands in `col`, a lone pristine shell there is clutter — drop
/// it; absorbVWeight hands its space to the doc
fn evictLonePristineTty(p: *Pardes, col: usize, keep_id: usize) void {
var n_tty: usize = 0;
var tty_id: usize = 0;
for (0..p.col_n[col]) |k| {
const cid = p.col_terms[col][k];
if (p.panes[cid]) |ct| if (ct.isTerminal()) {
n_tty += 1;
tty_id = cid;
};
}
if (n_tty != 1) return;
const tt = p.panes[tty_id] orelse return;
// No typing, cursor on the first prompt line, no scrollback: this is
// the throwaway boot placeholder a document may replace.
if (tt.ovl != null or term_pane.gridCursor(tt).y != 0 or
term_pane.scrollbar(tt).total > tt.rows) return;
p.computeGeom(); // a just-stacked doc has no rect yet; absorb snaps to rows
p.absorbVWeight(tty_id);
p.layoutRemove(tty_id);
p.deinitPane(tt);
p.panes[tty_id] = null;
if (p.active == tty_id) p.active = keep_id;
}
/// a terminal already in `dir` and still at its prompt, else a fresh shell
/// there at the bottom of the rightmost column. Backs middle-click send
/// from a file pane. Does NOT focus (execute keeps you where you were; look
/// focuses).
///
/// A terminal whose tty is TAKEN (vim, a pager, an agent) is not a match for
/// its own cwd: it cannot run a command line, so the scan keeps going and
/// spawns rather than pretending it found somewhere to type. The directory
/// is compared FIRST because that comparison is free and the occupancy
/// question costs a walk through /proc — a window full of shells in other
/// directories is not worth one syscall.
fn ttyForDir(p: *Pardes, dir: []const u8) ?usize {
for (p.panes, 0..) |slot, i| if (slot) |tt| {
if (!std.mem.eql(u8, tt.cwdSlice(), dir)) continue;
if (p.takesCommandLine(i)) return i;
};
const free = p.freeSlot() orelse return null;
const nt = p.newShell(free, dir) catch return null;
nt.greet = false;
const rc = if (p.ncol > 0) p.ncol - 1 else 0;
if (p.col_n[rc] > 0) {
const src = p.splitParent(p.col_terms[rc][p.col_n[rc] - 1]);
const f = p.layoutFindTerm(src).?;
p.splitBelow(src, nt);
p.layoutInsert(f.col, f.idx + 1, free);
} else p.layoutInsert(rc, p.col_n[rc], free);
return free;
}
// ---- doc panes ----
pub fn openTutorView(p: *Pardes, id: usize) !*Pane {
const content = try p.gpa.dupe(u8, tutor_text);
errdefer p.gpa.free(content);
const path = try p.gpa.dupe(u8, "/Tutor");
errdefer p.gpa.free(path);
const pane = try p.newDocPane(id);
pane.file = .{ .path = path, .content = content };
pane.cur_pinned = true;
return pane;
}
/// TEST-ONLY, called by test/hxdiff.zig (the helix differential harness):
/// swap the tty_only boot pane for a file pane holding `content` verbatim
/// — file_pane.open minus the disk read (cases carry their buffer inline).
/// Unreachable from any shell; keep it dumb.
pub fn hxOpenFileContent(p: *Pardes, content: []const u8) !*Pane {
const copy = try p.gpa.dupe(u8, content);
errdefer p.gpa.free(copy);
const path = try p.gpa.dupe(u8, "/hxcase.txt");
errdefer p.gpa.free(path);
p.deinitPane(p.panes[0].?);
p.panes[0] = null;
const pane = try p.newDocPane(0);
pane.file = .{ .path = path, .content = copy };
pane.cur_pinned = true;
p.active = 0;
p.sync();
return pane;
}
fn handlePdfNormal(p: *Pardes, pane: *Pane, key: Key) void {
if (comptime !pdf_enabled) return;
if (pane.pdf == null) return;
var state = paneNormalState(pane);
// The way OUT of a PDF, because plain Escape below is the document's
// own cancel (selection, search overlay) and never moves focus. Before
// the parser: `config.escape` matches a shifted Escape too, since shift
// is consulted only where a binding asks for it.
if (hit(key, config.leave_pane)) {
state.clear();
putPaneNormalState(pane, state);
pane.select = false;
return p.runBuiltin(.Last, p.active, "", null);
}
// A PDF has no body character to find, so its bare `f` is the direct
// document-outline door. Prefix continuations still go through the
// shared parser, and text/terminal panes retain `f<char>` unchanged.
if (state.prefix == .none and isPrefix(key, 'f')) {
state.clear();
putPaneNormalState(pane, state);
return p.runBuiltin(.PdfSections, p.active, "", null);
}
const parsed = normal_input.parse(&state, normalInput(key));
putPaneNormalState(pane, state);
switch (parsed) {
.pending, .ignored, .unbound => {},
.action => |semantic| {
const result = pdf_pane.applyNormal(
&pane.pdf.?,
p.pdf_gpa,
semantic,
p.native_images,
.{ .w = p.cell_pixels.w, .h = p.cell_pixels.h },
pdf_pane.paneViewport(p, pane),
pdf_pane.paneGeometry(p, pane),
);
if (result.page_changed) pdf_pane.resetPageChrome(pane);
switch (result.host) {
.none => {},
.leader => {
p.leader_on = true;
p.leader_n = 0;
},
.command_line => {
p.enterTagEdit(pane, -1);
if (pane.tag_edit) pane.mode = .normal;
},
.search => p.startSearch(pane, config.search_marker),
.search_forward => p.lookWalk(1),
.search_backward => p.lookWalk(-1),
}
},
}
}
/// stack a fresh doc pane at the top of the LEFT column (acme convention:
/// files left, terminals right), halving ONLY the old top pane's slot so
/// the rest of the column keeps its sizes; then evict a leftover pristine
/// shell. The placement of last resort — a first doc normally takes a
/// column of its own (placeDoc), and this only runs when the column bar
/// is full.
fn stackDocLeft(p: *Pardes, free: usize, nt: *Pane) void {
const lc = 0;
if (p.col_n[lc] > 0) if (p.panes[p.col_terms[lc][0]]) |top| {
p.snapColWeights(lc);
const h = p.rects[p.col_terms[lc][0]].h;
nt.vweight = @floatFromInt(@max(1, h / 2));
top.vweight = @floatFromInt(@max(1, h -| h / 2));
};
p.layoutInsert(lc, 0, free);
p.active = free;
p.evictLonePristineTty(lc, free);
}
// ---- the ONE dispatcher: look (right/Enter) and execute (middle/Tab) ----
/// Focus pane `id` and, for a nonzero 1-based `at.line`, put its modal
/// cursor there (`at.col` likewise, 0 = line start). `landing` says how far
/// the view may MOVE to show it: `.center` recenters a file on the line and
/// reveals a PDF's page — a look target, a `:NN`, a search hit, where the
/// context around the destination is the whole point of going there — while
/// `.keep` leaves the view alone and lets `ensureCursorVisible` do the least
/// that shows the cursor, usually nothing at all. A terminal has no recenter
/// to skip, so `landing` does not gate it — but it is not therefore free of
/// movement: a modal cursor PINNED high in the scrollback still pulls the
/// view up to it, which is `ensureCursorVisible` keeping its promise and the
/// reason `Last` records `line = 0` for an unpinned shell. Both look targets
/// that name a live pane land here — a path a pane already holds, and
/// `@pN:LINE:COL`. A RANGED spot selects (selectSpan below).
pub fn focusPaneLine(p: *Pardes, id: usize, at: look.Spot, landing: enum { center, keep }) void {
if (id >= MAX_PANES) return;
const pane = p.panes[id] orelse return;
p.active = id;
if (hasPdf(pane)) {
// A page reveal IS this pane's view, so `.keep` is simply not doing
// it. Not a formality: a reveal of the page you are already on still
// sets `document_scroll_y` to `page_starts[page]`, so returning to a
// PDF threw away the offset WITHIN the page you were reading.
//
// Read that literally — under `.keep` a PDF's page is not restored
// AT ALL, and the spot's line is a page. That only shows when
// something moved the pane while you were away, and something can:
// the wheel scrolls the pane under the POINTER, not the active one.
// Then Esc leaves the PDF on the page the wheel reached rather than
// the one the jumplist recorded, which is the answer a RETURN wants
// and not the answer a jump wants — so Ctrl-o and Ctrl-i, which
// centre, are still how you reach the recorded page.
if (landing == .keep) return;
if (comptime pdf_enabled) {
const pv = &pane.pdf.?;
if (pv.focusLocation(p.pdf_gpa, at.line, at.col)) pdf_pane.resetPageChrome(pane);
}
return;
}
if (at.line == 0) return;
if (pane.file) |*f| {
// The clamp holds either way: a stale jump naming a line past the
// end must not land the cursor there just because the view is not
// moving.
if (at.line > file_pane.nlines(p.gpa, f)) return;
if (landing == .center) {
const next = (at.line - 1) -| pane.rows / 2; // center, clamp at top
if (next != f.scroll) {
f.scroll = next;
f.syntax_dirty = true;
}
}
}
// Land the modal cursor on the target line. Under `.center` that keeps
// ensureCursorVisible agreeing with the recenter — a stale cursor would
// yank the view right back. Under `.keep` it IS the whole policy: no
// recenter ran, so the nudge below is the only thing that can move the
// view, and it moves it only far enough to show the cursor.
pane.cur_row = @intCast(at.line - 1);
pane.cur_col = if (at.col > 0) @intCast(at.col - 1) else 0;
pane.cur_pinned = true;
if (at.end_line != 0) return p.selectSpan(pane, at);
pane.ensureCursorVisible();
}
/// Select the span a RANGED look word names (config.range_sep): the two
/// ends are block-cursor CELLS, so this is the same cellRange/setPaneRange
/// pair every motion writes back through — the cursor lands on the span's
/// last cell with the anchor on its first, which is where helix leaves you
/// after a search too.
///
/// EXPLICIT, so the acme chords act on it like a v/x selection: the whole
/// point of `n` selecting a hit is being able to chord the match straight
/// into the next command.
///
/// Everything clamps, because a range is a claim about a file that may
/// have changed underneath it: hxOff pins a row past the end to the last
/// line and a column past the end to that line's terminator, so a stale
/// row selects what is still there instead of crashing or highlighting
/// garbage. A whole-lines range (no end column) runs to the terminator by
/// asking for a column no line can have, which is helix's own `x`.
fn selectSpan(p: *Pardes, pane: *Pane, at: look.Spot) void {
const pl = p.paneCursorLines(pane) catch return;
const text = p.flatSurface(pane, pl) catch return;
// saturating, not `- 1`: `f.zig:0-5` is a legal thing to type and a
// 1-based zero is the same nothing an absent number is
const acol: i32 = @intCast(at.col -| 1);
const ecol: i32 = if (at.end_col > 0) @intCast(at.end_col - 1) else std.math.maxInt(i32);
const r = cellRange(text, @intCast(at.line -| 1), acol, @intCast(at.end_line -| 1), ecol);
setPaneRange(pane, pl, text, r, true);
}
/// focus the pane already loaded on `path` (exact match), if any: file
/// panes recenter on a :NN line like the look dedup always has, image
/// panes just focus. Returns false when no pane holds that path.
fn focusPaneByPath(p: *Pardes, path: []const u8, at: look.Spot) bool {
for (p.panes, 0..) |slot, i| {
const tt = slot orelse continue;
if (tt.image) |iv| if (std.mem.eql(u8, iv.path, path)) {
p.active = i;
return true;
};
if (comptime pdf_enabled) if (tt.pdf) |pv| if (std.mem.eql(u8, pv.path, path)) {
p.focusPaneLine(i, at, .center);
return true;
};
const ff = if (tt.file) |*f| f else continue;
if (!std.mem.eql(u8, ff.path, path)) continue;
p.focusPaneLine(i, at, .center);
return true;
}
return false;
}
/// LOOK — the Look builtin's body, and so what a right click, an Enter and
/// the word `Look` all end at. Resolve `txt` against the panes' directories
/// and open (or focus) whatever it names; a word that names nothing is a
/// search of the pane it came from, which is acme's button-3.
pub fn lookAt(p: *Pardes, id: usize, txt: []const u8) void {
const pane = p.panes[id] orelse return;
p.noteHaptic(.look);
// ...and this pane is now the head of the n/N walk. Recorded HERE, at
// the one dispatcher every look reaches, so a right click, an Enter, a
// stepped result row and the word `Look` all count alike.
p.noteLookSource(id);
const trimmed = std.mem.trim(u8, txt, " \t\r\n");
// `` @`ls -la` `` names a COMMAND, not a path: run it, and land in the
// pane that answers — looking at a thing means being SHOWN it, and a
// command's output is what there is to be shown. Looking at a
// DIRECTORY has always been exactly this (below: focus a shell there
// and make it `ls`); this is that rule spelled generally.
if (config.commandWord(trimmed)) |cmd| {
if (p.execute(id, cmd)) |dst| p.active = dst;
return;
}
var realbuf: [4096]u8 = undefined;
// an already-loaded pane wins BEFORE any filesystem resolve: the
// web build has no fs (a look would otherwise be inert even for
// panes sitting in the session), and native gets the same dedup
// it always did, just without touching disk. Pane paths are
// canonical (realpath'd or dump-given), so match the word as-is
// here and joined onto each directory below.
const pl = look.parsePathLine(trimmed);
if (comptime pdf_enabled) if (pdf_pane.lookSection(p, id, pl.path, pl.at)) return;
if (pl.path.len > 0 and p.focusPaneByPath(pl.path, pl.at)) return;
// The word is resolved against the pane DIRECTORIES in access
// order: the pane the click came from FIRST — its answer is the
// one taken, so nothing that resolves today moves — then every
// other live pane, most recently focused first (the jump stack runs
// least-recent -> active, so it is that array backwards; the
// clicked pane is not always `active`, a right click does not
// focus). Only when ALL of them fail does the word fall through to
// the search below: a name you can read in one window is openable
// from any of them. Each attempt is a realpath + an open and
// shells share cwds constantly, so a seen-list holds every
// directory to one try; an absolute word — and `@pN`, which reads
// no directory at all — answers the same everywhere and stops
// after the first pass.
var found: look.Target = .none;
var seen: [MAX_PANES][]const u8 = undefined;
var nseen: usize = 0;
var n: usize = 0;
cand: while (n <= p.njumps) : (n += 1) {
const k: usize = if (n == 0) id else p.jumps[p.njumps - n].pane;
if (n > 0 and k == id) continue; // tried first, skip the rerun
const op = p.panes[k] orelse continue;
const dir = paneDir(op);
for (seen[0..nseen]) |s| if (std.mem.eql(u8, s, dir)) continue :cand;
seen[nseen] = dir;
nseen += 1;
if (pl.path.len > 0 and pl.path[0] != '/') {
var joinbuf: [2048]u8 = undefined;
if (std.fmt.bufPrint(&joinbuf, "{s}/{s}", .{ dir, pl.path }) catch null) |j|
if (p.focusPaneByPath(j, pl.at)) return;
}
found = look.resolve(txt, dir, &realbuf);
if (found != .none or pl.path.len == 0 or pl.path[0] == '/') break;
}
switch (found) {
// acme button-3: a word that names no file/dir is a search of
// the pane it was clicked in — exactly what `/` runs, and then a
// step onto a hit, so a click GOES somewhere and clicking again
// goes to the next one. Paths (src/a/b.rs:100) still resolve above
// and open; only the non-file case falls through here. A shell
// searches its scrollback like anything else, EXCEPT in tty
// mode, where the click belongs to the program on the other
// end; an image pane has no text to search either way.
.none => {
const bmode = if (pane.tag_edit) pane.tag_mode else pane.mode;
if (pane.image != null or bmode == .tty) return;
// ...and then STEP it, which is the other half of button-3: a
// click does not merely LIST the hits, it goes to one — the
// one AFTER the word clicked, since runSearch armed the walk
// where the click put the cursor. Asking again is free: the
// same pattern refills its own list rather than opening a
// second, so clicking a word repeatedly walks its hits.
p.runSearch(id, trimmed, .text, .cursor) catch |err| {
p.reportError(id, "search", err);
return;
};
const at = pane.search_row;
_ = p.searchStep(id, 1);
// past the last hit, back to the first: acme's search is a
// RING, and a step that could not move left the row where it
// was (searchStep clamps rather than wrapping, because n/N are
// also how `]d`/`[d` walk to the end of a list and stop).
if (at != null and pane.search_row == at) {
pane.search_row = null;
_ = p.searchStep(id, 1);
}
},
// `@p7:10:5`: pane 7, line 10, column 5 — how a search result
// points at a terminal or an output buffer, neither of which
// has a path.
.pane => |t| p.focusPaneLine(t.id, t.at, .center),
.url => |u| if (u.len <= 256) p.emit(.{ .open_link = .from(u) }),
.dir => |dir| {
// focus an existing terminal on this dir, else fork one below.
// A terminal whose tty is taken is not that terminal: `ls\r`
// typed into vim is `ls\r` typed into vim.
for (p.panes, 0..) |slot, i| {
if (slot) |tt| if (std.mem.eql(u8, tt.cwdSlice(), dir) and p.takesCommandLine(i)) {
p.active = i;
p.emitWrite(i, "ls\r");
return;
};
}
const free = p.freeSlot() orelse return;
const nt = p.newShell(free, dir) catch return;
nt.greet = true;
const src = p.splitParent(id);
const f = p.layoutFindTerm(src).?;
p.layoutInsert(f.col, f.idx + 1, free);
p.splitBelow(src, nt);
p.active = free;
},
.file => |target| {
if (comptime pdf_enabled) if (target.kind == .pdf) {
if (p.focusPaneByPath(target.path, target.at)) return;
const free = p.freeSlot() orelse return;
const nt = pdf_pane.openPane(p, free, target.path, target.at.line) catch return;
p.placeDoc(id, free, nt);
return;
};
// focus an existing pane on this path (rescrolled), else open
if (p.focusPaneByPath(target.path, target.at)) return;
const free = p.freeSlot() orelse return;
const nt = file_pane.open(p, free, target.path, target.at.line) catch return;
if (target.at.col > 0) nt.cur_col = @intCast(target.at.col - 1);
p.placeDoc(id, free, nt);
// center the target line: the pane's real body height only
// exists after placement, so lay out now and pull the
// scroll up by half a body (line 0 opens stay at the top)
p.computeGeom();
nt.file.?.scroll -|= @max(1, p.rects[free].h -| BOX_H) / 2;
// ...and only THEN select a range, restoring that scroll:
// setPaneRange keeps its cursor visible, and a pane this fresh
// has no true geometry yet for it to judge against (pane.rows
// is only refreshed in sync), so the centering just computed is
// the answer and ensureCursorVisible's is not.
if (target.at.end_line != 0) {
const centered = nt.file.?.scroll;
p.selectSpan(nt, target.at);
nt.file.?.scroll = centered;
}
},
.image => |target| {
if (p.focusPaneByPath(target.path, .{})) return;
const free = p.freeSlot() orelse return;
const nt = image_pane.create(p, free, target.path, &.{}) catch return;
p.placeDoc(id, free, nt);
},
}
}
/// how deep `execute` may re-enter itself. Nothing can reach this today:
/// every door back in strips at least one word (`Exec X` -> `X`) or one
/// pair of delimiters (`` @`X` `` -> `X`), so the command line strictly
/// shrinks and a cycle cannot close — executing the bare word `Exec` runs
/// out of argument immediately. The counter is here so that a syntax added
/// later which does NOT shrink (an alias, a macro) stops instead of hanging
/// the editor, and the ceiling is small because a human nesting eight deep
/// has made a different mistake.
const max_exec_depth = 8;
/// EXECUTE — the Exec builtin's body, and so what a middle click, a Tab
/// and the word `Exec` all end at. A builtin's NAME runs the builtin;
/// anything else is a command line typed at a shell. Returns the pane it
/// was typed into, which is what Look focuses and an execute deliberately
/// does not.
pub fn execute(p: *Pardes, id: usize, txt: []const u8) ?usize {
const pane = p.panes[id] orelse return null;
const cmd = commandText(txt);
if (cmd.len == 0) return null;
// Before the builtin dispatch, and only at depth zero: `Exec ls` comes
// back through here as `ls` (executeBuiltinLine holds the depth), and
// one Tab is one thing the hand did, however many words it unwraps to.
if (p.exec_depth == 0) p.noteHaptic(.exec);
if (p.executeBuiltinLine(id, cmd)) return null;
if (p.exec_depth >= max_exec_depth) return null;
p.exec_depth += 1;
defer p.exec_depth -= 1;
// Anything not in the builtin vocabulary is a command line typed at
// a shell. Startup config calls executeBuiltinLine directly and never
// reaches this fallback.
// A terminal runs in itself — as long as its tty is still the prompt we
// forked. Every document kind — real/output file, image, or PDF — and a
// terminal currently held by a full-screen program run in a terminal for
// their directory (an existing prompt when possible, otherwise a freshly
// forked shell). In particular, never emit a PTY write addressed to an
// image's no-PTY pane slot, and never type a command line at vim.
const dst = (if (p.takesCommandLine(id)) id else p.ttyForDir(paneDir(pane))) orelse return null;
term_pane.padOutputBelowEdits(p, dst);
if (term_pane.queuePendingCommand(p.panes[dst].?, cmd) catch |err| {
p.reportError(id, "queue command", err);
return dst;
}) return dst;
p.emitWrite(dst, cmd);
p.emitWrite(dst, "\r");
return dst;
}
/// Trim and unwrap clickable command-word notation once for every command
/// consumer, so startup lines and interactive Exec speak the same syntax.
fn commandText(txt: []const u8) []const u8 {
var cmd = std.mem.trim(u8, txt, " \t\r\n");
while (config.commandWord(cmd)) |inner| cmd = std.mem.trim(u8, inner, " \t\r\n");
return cmd;
}
/// Parse and dispatch exactly one builtin command. This is the canonical
/// builtin path used both by ordinary Exec and by startup configuration;
/// unlike execute(), it deliberately has no external-shell fallback.
/// False means blank, malformed, unknown, or recursion-limited.
pub fn executeBuiltinLine(p: *Pardes, id: usize, txt: []const u8) bool {
const cmd = commandText(txt);
if (cmd.len == 0 or p.exec_depth >= max_exec_depth) return false;
// The builtins that take an ARGUMENT match their name with a TAIL:
// `Restore <path>`, `Find <pat>`, `Grep <pat>`, `Rename <name>`,
// `WsSymbols <sym>`, `Theme <name>`, `Font <name>` (gui only), and the
// two verbs themselves — `Look <word>`, `Exec <cmd>`, which is what
// makes `` @`Look .` `` nest (the tail goes straight back through
// here). Every other name must match WHOLE, so `Kill foo` is a shell
// command and not Kill.
const sp = std.mem.indexOfAny(u8, cmd, " \t");
const bi: ?Builtin = std.meta.stringToEnum(Builtin, cmd) orelse blk: {
const head = std.meta.stringToEnum(Builtin, cmd[0 .. sp orelse break :blk null]) orelse break :blk null;
break :blk if (builtins.registry.takesArg(head)) head else null;
};
const b = bi orelse return false;
p.exec_depth += 1;
defer p.exec_depth -= 1;
const typed = if (sp) |s| std.mem.trim(u8, cmd[s + 1 ..], " \t") else "";
p.runBuiltin(b, id, cmd, if (typed.len > 0) typed else null);
return true;
}
fn applyStartupConfig(p: *Pardes) void {
var lines = std.mem.splitScalar(u8, p.opts.startup_config orelse return, '\n');
while (lines.next()) |line| _ = p.executeBuiltinLine(p.active, line);
}
/// Run a builtin on pane `id`. `txt` is the executed text (Restore reads
/// its path back out of it) and `arg` the builtin's ARGUMENT — the tail
/// after the name, which is why Grep and Find run straight away when there
/// is one instead of asking, and which for Look and Exec is the whole
/// operand. A gesture that points at a word (a click, an Enter) passes it
/// as `arg` with no `txt`: it named no builtin, config.look_cmd did. The
/// leader passes "" and null: a key path names a builtin, never an
/// argument. The topbar builtins are global; the pane-scoped ones (Save,
/// Del, Delcol, the image toggles, and the window group, which moves focus
/// relative to `id`) act on `id`. The null-pane check is the one guard
/// every builtin used to share, so it stays here rather than in each.
fn runBuiltin(p: *Pardes, b: Builtin, id: usize, txt: []const u8, arg: ?[]const u8) void {
if (!p.multiOnce()) return; // a builtin is per-keystroke, never per-cursor
const pane = p.panes[id] orelse return;
const c: builtins.Ctx = .{ .p = p, .pane = pane, .id = id, .txt = txt, .arg = arg };
builtins.registry.dispatch(b, c);
}
/// Generated setting builtins converge here. The descriptor is compile-
/// time data but the state is ordinary owned data; no vtable or callback
/// layer sits between the command enum and these fields.
pub fn applySettingBuiltin(p: *Pardes, setting: runtime_cfg.Setting, arg: ?[]const u8) void {
const previous_transition = p.settings.panel_transition;
const previous_tagline_percent = p.settings.font.tagline_percent;
switch (setting.action) {
.theme => {
const want = std.mem.trim(u8, arg orelse return, " \t\r\n");
for (themes, 0..) |t, i| if (std.mem.eql(u8, t.name, want)) {
p.setThemeIndex(i);
return;
};
},
.font => {
if (comptime !font_picker) return;
const want = std.mem.trim(u8, arg orelse return, " \t\r\n");
const matches = fonts.list(p.scratch.allocator(), want);
if (matches.len == 0) return;
if (!runtime_cfg.requestFont(&p.settings, matches[0].path, matches[0].name)) return;
p.font_request_taken = false;
},
else => _ = runtime_cfg.applySimple(&p.settings, setting, arg),
}
const transition_changed = setting.action == .transition and
p.settings.panel_transition != previous_transition;
const tagline_metrics_changed = setting.action == .tagline_size and
p.settings.font.tagline_percent != previous_tagline_percent;
if (transition_changed or tagline_metrics_changed) {
// The backend may still show the last acknowledged sample. Keep
// input inert until it has replaced that sample with canonical
// pixels instead of merely forgetting the producer-side tracks.
// A tagline-size change also invalidates the raster metrics used
// by a frozen old frame; snapping is the only honest old/new pair.
p.abandonPanelAnimations();
}
}
/// place a fresh doc pane. An OUTPUT buffer (+Search/+Help) is NOT a
/// document: it is the result list belonging to the pane that asked for it,
/// so it never claims a column and is never anyone else's split parent — it
/// lands right below `from_id`, be that a shell, a file or another list,
/// and `from_id` alone pays the rows (several lists just stack there).
/// A real doc joins the docs: any doc already open is the split parent (the
/// source if it IS one, else the one most recently worked in) and the
/// newcomer lands right below it, so docs share a column. The FIRST doc of
/// the session instead gets a column of its own on the left (acme: files
/// left, shells right). Only the calling/source column donates half its
/// width; every other column keeps its boundary. A full column bar, or a
/// result list whose source died, stacks into the leftmost.
/// A new file opens a column only when the split leaves both sides wide
/// enough to read; otherwise it stacks as a pane. Halving is exact, so the
/// narrower side is floor(width/2) >= min_cells iff width >= 2*min_cells.
fn columnFitsHalves(p: *Pardes, source_id: usize, min_cells: u16) bool {
const f = p.layoutFindTerm(source_id) orelse return false;
p.computeGeom();
return p.col_w[f.col] >= min_cells * 2;
}
pub fn placeDoc(p: *Pardes, from_id: usize, free: usize, nt: *Pane) void {
const doc = if (nt.file) |f| output_pane.fileTraits(f.output).doc else true; // an image is a doc
var src_id: ?usize = null;
if (p.panes[from_id]) |src| if (if (src.file) |f| output_pane.fileTraits(f.output).doc else src.image != null or hasPdf(src)) {
src_id = from_id;
};
// Opened from somewhere that is NOT a doc (a shell, a results list):
// the file joins the column it was last being READ in, which is the
// newest doc on the jump stack. The stack already IS that record — it
// is where the keyboard has been — so nothing new is remembered here;
// asking it is the whole change. What this replaces was the first doc
// in slot order, i.e. pane-id ALLOCATION order, so which column your
// file landed in depended on how the session had handed out ids rather
// than on where you were working.
//
// The answer wanted is the COLUMN, and it stays right once the pane
// itself is closed: trackJump compacts dead entries out, so the walk
// falls through to the next doc remembered in that same column. The
// serial test is the one trackJump uses — slots are reused, so an entry
// whose pane has been replaced names a pane that is gone, not the
// newcomer sitting in its slot (`free`, this very pane, among them).
if (doc and src_id == null) {
var n = p.njumps;
while (n > 0) : (n -= 1) {
const j = p.jumps[n - 1];
const pp = p.panes[j.pane] orelse continue;
if (pp.serial != j.serial) continue;
if (if (pp.file) |f| output_pane.fileTraits(f.output).doc else pp.image != null or hasPdf(pp)) {
src_id = j.pane;
break;
}
}
}
// A doc no jump remembers is still a doc: a restored session focuses
// one pane, not each, and the stack is finite. The rule that a second
// doc never claims a second column outranks knowing where you were, so
// the old slot-order scan stays as the fallback.
if (doc and src_id == null) for (p.panes, 0..) |sl, i| {
if (sl) |pp| if (i != free and (if (pp.file) |f| output_pane.fileTraits(f.output).doc else pp.image != null or hasPdf(pp))) {
src_id = i;
break;
};
};
// A result list belongs to its spawner: it lands directly BELOW it —
// on top of the lists already there — and its rows come out of the
// SPAWNER, never a bystander, so opening another list (or deleting
// one, see absorbVWeight) leaves every other pane's height untouched.
if (!doc) if (p.layoutFindTerm(from_id)) |sf| {
p.layoutInsert(sf.col, sf.idx + 1, free);
p.splitBelow(from_id, nt); // NOT splitParent: no bystander pays
p.active = free;
return;
};
if (src_id) |sid| {
const src = p.splitParent(sid);
const sf = p.layoutFindTerm(src).?;
p.layoutInsert(sf.col, sf.idx + 1, free);
p.splitBelow(src, nt);
p.active = free;
return;
}
if (doc and p.ncol < MAX_COLS and p.columnFitsHalves(from_id, 100)) {
if (!p.layoutSplitColumn(from_id, free, true)) return p.stackDocLeft(free, nt);
p.active = free;
return;
}
p.stackDocLeft(free, nt);
}
// ---- dump / load (acme-style: `pardes -l state.zon` restores a session) ----
pub fn dumpState(p: *Pardes) !void {
const arena = p.scratch.allocator();
var slot_to_pane: [MAX_PANES]?usize = @splat(null);
var panes: [MAX_PANES]dump.Pane = undefined;
var panes_len: usize = 0;
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
slot_to_pane[id] = panes_len;
const tag = try p.tagText(arena, pane);
const body = try p.bodyText(arena, pane);
const scroll: usize = @intCast(@max(0, pane.scroll()));
// BY POINTER: `origin_arg` is a slice into the File's own inline
// buffer, and a by-value capture would leave it pointing at a
// stack copy that dies before the ZON is written.
var dp: dump.Pane = if (pane.file) |*f| try file_pane.dumpPane(
arena,
pane,
f,
tag,
body,
scroll,
if (f.output) |o| output_pane.word(o.from) else "",
if (f.output) |*o| o.arg() else "",
) else if (hasPdf(pane)) blk: {
if (comptime !pdf_enabled) unreachable;
const pv = &pane.pdf.?;
// Keep the dump schema backwards-compatible: a raster-backed
// document rides the existing binary image record, while its
// `scroll` field is the zero-based PDF page. Restore inspects
// the extension and reconstructs the semantic PDF pane.
break :blk try image_pane.dumpPane(arena, pane, tag, body, pv.page, pv.path, &.{});
} else if (pane.image) |iv|
try image_pane.dumpPane(arena, pane, tag, body, scroll, iv.path, iv.raw)
else
try term_pane.dumpPane(pane, arena, tag, body, scroll);
dp.tag_tail = if (pane.tag_init) pane.tagSlice() else null;
panes[panes_len] = dp;
panes_len += 1;
}
var columns: [MAX_COLS]dump.Column = undefined;
var columns_len: usize = 0;
var column_ids: [MAX_COLS][MAX_PANES]usize = undefined;
for (0..p.ncol) |c| {
var ids_len: usize = 0;
for (0..p.col_n[c]) |k| if (slot_to_pane[p.col_terms[c][k]]) |compact| {
column_ids[c][ids_len] = compact;
ids_len += 1;
};
if (ids_len > 0) {
columns[columns_len] = .{
.weight = @as(f32, @floatFromInt(p.col_weight[c])) / @as(f32, @floatFromInt(column_weight_unit)),
.panes = column_ids[c][0..ids_len],
};
columns_len += 1;
}
}
const state: dump.State = .{
.screen = .{ .cols = p.screen_w, .rows = p.screen_h },
.active = slot_to_pane[p.active] orelse 0,
.topbar = config.topbar_str,
.theme = p.theme().name,
.columns = columns[0..columns_len],
.panes = panes[0..panes_len],
};
try dump.validate(state);
var out: std.Io.Writer.Allocating = .init(p.gpa);
errdefer out.deinit();
try std.zon.stringify.serialize(state, .{ .whitespace = true }, &out.writer);
if (p.dump_out) |d| p.gpa.free(d);
p.dump_out = try out.toOwnedSlice();
p.emit(.write_dump);
}
/// Initialize from another instance's dump: panes reconstructed (terminals
/// by replaying their raw VT streams into fresh emulators), no spawns —
/// loaded terminals are dead replays, scrollable and selectable.
pub fn initFromDump(gpa: std.mem.Allocator, opts: Options, zon_bytes: []const u8) !*Pardes {
const image_gpa = opts.image_allocator orelse gpa;
const pdf_gpa = opts.pdf_allocator orelse gpa;
const tree_sitter_gpa = opts.tree_sitter_allocator orelse gpa;
const p = try gpa.create(Pardes);
p.* = .{
.gpa = gpa,
.image_gpa = image_gpa,
.pdf_gpa = pdf_gpa,
.tree_sitter_gpa = tree_sitter_gpa,
.opts = opts,
.screen_w = opts.cols,
.screen_h = opts.rows,
.scratch = .init(gpa),
.frame_arena = .init(opts.frame_allocator orelse gpa),
.fallback = .{ .gpa = gpa },
};
errdefer p.deinit();
const st = try dump.readZon(gpa, zon_bytes, "load");
defer dump.free(gpa, st);
for (themes, 0..) |t, i| {
if (std.mem.eql(u8, t.name, st.theme)) p.settings.theme = @intCast(i);
}
for (st.panes, 0..) |src, i| {
if (i >= MAX_PANES) break;
const pane: *Pane = switch (src.kind) {
.terminal => terminal: {
const t = src.terminal.?;
const restored = try term_pane.restore(p, src);
p.installPane(i, restored);
p.setCwd(i, t.cwd);
if (std.mem.startsWith(u8, src.tag, "TTY ")) restored.mode = .tty;
break :terminal restored;
},
.file => try file_pane.restore(p, i, src),
.image => restore_image: {
const im = src.image.?;
if (pdf_pane.isPath(im.path)) {
var raw: []u8 = if (im.bytes_b64.len > 0)
try dump.decodeBytes(gpa, im.bytes_b64)
else
&.{};
errdefer if (raw.len > 0) gpa.free(raw);
if (comptime pdf_enabled) {
if (pdf_pane.openPane(p, i, im.path, src.scroll + 1) catch null) |restored| {
if (raw.len > 0) gpa.free(raw);
raw = &.{};
restored.cols = @max(1, src.cols);
restored.rows = @max(1, src.rows);
break :restore_image restored;
}
}
// If the source path is unavailable, retain its bytes
// as an ordinary file rather than dropping the pane.
const path = try gpa.dupe(u8, im.path);
errdefer gpa.free(path);
const content = if (raw.len > 0) raw else try gpa.dupe(u8, "");
raw = &.{};
errdefer if (content.len > 0) gpa.free(content);
const restored = try p.newDocPane(i);
restored.file = .{ .path = path, .content = content };
restored.cur_pinned = true;
restored.cols = @max(1, src.cols);
restored.rows = @max(1, src.rows);
p.emit(.{ .watch = .{ .pane = @intCast(i), .on = true } });
break :restore_image restored;
}
break :restore_image try image_pane.restore(p, i, src);
},
};
p.restoreDumpTail(pane, src);
pane.vweight = src.vweight;
}
p.ncol = @min(st.columns.len, MAX_COLS);
for (st.columns[0..p.ncol], 0..) |col, c| {
const scaled = @as(f64, @floatCast(col.weight)) * @as(f64, @floatFromInt(column_weight_unit));
const bounded = @min(scaled, @as(f64, @floatFromInt(max_column_weight)));
p.col_weight[c] = @max(1, @as(u64, @intFromFloat(@round(bounded))));
p.col_n[c] = @min(col.panes.len, MAX_PANES);
for (col.panes[0..p.col_n[c]], 0..) |pid, k| p.col_terms[c][k] = pid;
}
p.active = @min(st.active, MAX_PANES - 1);
p.sync();
p.applyStartupConfig();
p.finishThemeInitialization();
p.sync();
p.panel_animation_enabled = true;
_ = p.takeHaptic(); // see init: a restored session is not a gesture
return p;
}
fn restoreDumpTail(p: *Pardes, pane: *Pane, src: dump.Pane) void {
if (src.tag_tail) |tail| {
if (!pane.appendTag(tail)) return;
pane.tag_init = true;
return;
}
const tail_class = tailClass(pane);
// Early dumps put tty mode in the live prefix itself. The cwd stored
// beside the replay stream is the stable half of that historical
// prefix; use it to recover both custom tails and defaults even though
// today's tag has only the mode box plus cwd. Check this before the
// current prefix because a not-yet-reported cwd is legitimately empty
// and therefore a prefix of every saved tag.
if (src.kind == .terminal and std.mem.startsWith(u8, src.tag, "TTY ")) {
const legacy = std.fmt.allocPrint(p.scratch.allocator(), "TTY {s}", .{src.terminal.?.cwd}) catch return;
if (std.mem.startsWith(u8, src.tag, legacy))
return p.restoreTailAt(pane, src.tag, legacy, .terminal);
}
const current = p.tagPrefix(pane) catch return;
if (std.mem.startsWith(u8, src.tag, current))
return p.restoreTailAt(pane, src.tag, savedPrefix(src.tag, current, tail_class), tail_class);
if (src.kind != .image) return;
const saved = src.image.?;
if (pane.image) |*state| if (image_pane.legacySavedPrefix(state, src.tag)) |legacy|
return p.restoreTailAt(pane, src.tag, legacy, .generic);
if (pdf_pane.isPath(saved.path)) if (pdf_pane.legacySavedPrefix(saved.path, src.tag)) |legacy|
p.restoreTailAt(pane, src.tag, legacy, .generic);
}
/// Compatibility path for dumps without explicit tag_tail: recover what
/// followed the rendered prefix, upgrading every historical default while
/// retaining genuinely edited bytes.
fn restoreTail(p: *Pardes, pane: *Pane, saved_tag: []const u8) void {
const pfx = p.tagPrefix(pane) catch return;
const class = tailClass(pane);
p.restoreTailAt(pane, saved_tag, savedPrefix(saved_tag, pfx, class), class);
}
/// Which family of historical defaults a saved tail is read against. An
/// output buffer is its own class rather than a file: it wears the file
/// tail today, but the tail it was DUMPED with was the generic one, and a
/// real file must not inherit that recognition (see restoreTailAt).
const TailClass = enum { generic, file, output, terminal };
fn tailClass(pane: *const Pane) TailClass {
if (pane.file) |f| return if (f.output == null) .file else .output;
if (pane.isTerminal()) return .terminal;
return .generic;
}
/// A dirty marker may be present in the rendered compatibility tag of an
/// untouched file. It is live prefix chrome, not a custom command tail;
/// consume it while recovering old dumps so it disappears after Save. Only
/// a pane with a file to be dirty AGAINST ever rendered one — a real file,
/// or the scratch that is becoming one.
fn savedPrefix(saved_tag: []const u8, live: []const u8, class: TailClass) []const u8 {
if (class == .generic or class == .terminal) return live;
if (!std.mem.startsWith(u8, saved_tag, live)) return live;
const marked_len = live.len + dirty_marker.len;
if (saved_tag.len >= marked_len and std.mem.eql(u8, saved_tag[live.len..marked_len], dirty_marker))
return saved_tag[0..marked_len];
return live;
}
fn restoreTailAt(
_: *Pardes,
pane: *Pane,
saved_tag: []const u8,
pfx: []const u8,
class: TailClass,
) void {
if (!std.mem.startsWith(u8, saved_tag, pfx)) return;
const rest = saved_tag[pfx.len..];
// A saved tag carries its layout gap, because the padding is real
// characters — and the pane it is restored into is very often a
// different width than the one it was dumped from. So compare what the
// tail SAYS and not where it sat: leading spaces are layout, never
// content, and a default that came back padded is still a default.
const said = std.mem.trimStart(u8, rest, " ");
const defaults: []const []const u8 = switch (class) {
.generic => &.{ pane_tail, prev_pane_tail, legacy_pane_tail },
.file => &.{ file_pane_tail, prev_file_pane_tail, legacy_file_pane_tail },
// An output buffer wore the GENERIC default until Save reached it,
// and a terminal's has now been through three shapes; both upgrade
// from that family. The scratch is an output buffer that wore the
// FILE defaults all along (it was the one that could Save), so its
// row carries both. Recognition stays scoped per class: the
// generic default sitting on a real FILE is still text its owner
// typed and is still kept.
.output => &.{
file_pane_tail, prev_file_pane_tail, legacy_file_pane_tail,
pane_tail, prev_pane_tail, legacy_pane_tail,
},
.terminal => &.{ terminal_pane_tail, prev_terminal_pane_tail, legacy_terminal_pane_tail, pane_tail, prev_pane_tail, legacy_pane_tail },
};
for (defaults) |default|
if (std.mem.eql(u8, said, std.mem.trimStart(u8, default, " "))) return;
if (!pane.appendTag(rest)) return;
pane.tag_init = true;
}
fn removePane(p: *Pardes, id: usize) void {
const pane = p.panes[id] orelse return;
p.absorbVWeight(id);
p.layoutRemove(id);
p.deinitPane(pane);
p.panes[id] = null;
if (p.active == id) p.active = p.prevFocus(id) orelse {
p.quit = true;
p.emit(.quit);
return;
};
}
/// where focus falls when the active pane closes: the most recently
/// focused pane still alive (else any live one). Null = nothing left.
/// Walks the jump stack newest-first, so it answers exactly what it always
/// did — a pane's newest entry sits where the old MRU put the pane.
pub fn prevFocus(p: *Pardes, closing: usize) ?usize {
var i = p.njumps;
while (i > 0) {
i -= 1;
const id = p.jumps[i].pane;
if (id != closing and p.panes[id] != null) return id;
}
for (p.panes, 0..) |slot, k| {
if (slot != null and k != closing) return k;
}
return null;
}
/// THE PUSH RULE, and the only place it is written down.
///
/// A location is worth remembering when you cannot see it any more: focus
/// ended this update in a DIFFERENT pane, or more than a bodyful of rows
/// away in the same one. Anything closer is the cursor strolling, and the
/// current entry just follows it — so h/j/k/w/b never grow the list, while
/// a goto-line, a search hit, a goto-definition and every focus change do.
/// (Vim's rule is a hand-kept list of "jump commands"; this one asks the
/// question those commands are a proxy for, and needs no list.)
///
/// It is read HERE, once per update, and nowhere else: what a call site
/// does transiently is invisible, which is what keeps n/N over a results
/// buffer — which focuses each hit and comes straight back — from pushing
/// two entries per keystroke. That transparency is the whole reason the
/// rule lives in sync() rather than at the sites that move focus, which is
/// where the heuristics used to be scattered.
/// The same PLACE, which is the one question the push rule asks: the same
/// live pane, and near enough within it that the cursor was only strolling.
/// Distance is a bodyful because that is what "you cannot see it any more"
/// means on a screen. A location with no line — an unpinned shell, whose
/// cursor belongs to the program — has no distance to be at.
fn samePlace(p: *const Pardes, a: Loc, b: Loc) bool {
if (a.pane != b.pane or a.serial != b.serial) return false;
if (a.line == 0 or b.line == 0) return true;
const body = @max(1, p.rects[b.pane].h -| BOX_H);
return @max(a.line, b.line) - @min(a.line, b.line) <= body;
}
fn trackJump(p: *Pardes) void {
// dead entries first, in one compacting pass. A slot is reused, so the
// test is the SERIAL: an entry whose pane has been replaced names a
// pane that no longer exists, not the newcomer sitting in its slot.
var w: usize = 0;
var cur: usize = 0;
for (p.jumps[0..p.njumps], 0..) |j, i| {
if (i == p.jcur) cur = w; // survives -> lands at w; dies -> the next one does
const pane = p.panes[j.pane] orelse continue;
if (pane.serial != j.serial) continue;
p.jumps[w] = j;
w += 1;
}
p.njumps = w;
p.jcur = @min(cur, w -| 1);
const pane = p.panes[p.active] orelse return;
// An UNPINNED cursor belongs to the program on the other end of the
// pty, not to you, so such a pane is remembered as a place and not as
// a spot: line 0 is the "no line" focusPaneLine already understands,
// and going back there focuses the shell without dragging its view up
// to scrollback row 0. It also has no line to be FAR from, which is
// what keeps the first keypress in a shell (which pins the cursor
// wherever the prompt is) from reading as a jump.
const now: Loc = .{
.pane = @intCast(p.active),
.serial = pane.serial,
.line = if (pane.pdfPage()) |page| @intCast(page + 1) else if (pane.cur_pinned) @intCast(@max(0, pane.cur_row) + 1) else 0,
.col = if (pane.pdfPage() != null) 0 else if (pane.cur_pinned) @intCast(@max(0, pane.cur_col) + 1) else 0,
};
if (p.njumps > 0 and p.samePlace(p.jumps[p.jcur], now)) {
p.jumps[p.jcur] = now; // same visit; the entry IS where you are
return;
}
// a new jump made from the middle of the list drops everything ahead of
// it, the way vim's does: the future you did not take is not history.
if (p.njumps > 0) p.njumps = p.jcur + 1;
// ...and neither is a hop STRAIGHT BACK to the entry under this one.
// That is not two jumps, it is the same two places again: Esc between a
// doc and its shell, `SPC w k` / `SPC w j`, clicking back and forth.
// Appending would grow the stack by one per press until the ping-pong
// is the only thing it remembers — sixty-four presses and every older
// place is gone.
//
// So SWAP the two instead of appending, rather than the other obvious
// move of leaving them alone and walking jcur back down onto the older
// one. The stack has a second job: it is also the focus history, and
// prevFocus, Last and the look order all read it backwards on the
// promise that it "runs least-recent -> active". Parking jcur mid-array
// leaves the pane you are IN somewhere other than the top and quietly
// breaks all three — a look would resolve against the directory of the
// pane you just left before the one you are in. Swapping keeps the
// promise, keeps the length, and leaves Ctrl-o stepping out past both.
if (p.njumps >= 2 and p.samePlace(p.jumps[p.njumps - 2], now)) {
p.jumps[p.njumps - 2] = p.jumps[p.njumps - 1];
p.jumps[p.njumps - 1] = now;
p.jcur = p.njumps - 1;
return;
}
if (p.njumps == MAX_JUMPS) {
std.mem.copyForwards(Loc, p.jumps[0 .. MAX_JUMPS - 1], p.jumps[1..]);
p.njumps -= 1;
}
p.jumps[p.njumps] = now;
p.jcur = p.njumps;
p.njumps += 1;
}
/// Ctrl-o / Ctrl-i (the Back and Forward builtins): move the CURSOR into
/// the stack and go to what it names. Nothing is pushed and nothing is
/// dropped — walking history is not making it — and trackJump agrees,
/// because after the move the live spot IS `jumps[jcur]` again.
///
/// `.center` where `Last` keeps the view, and the asymmetry is structural
/// rather than arbitrary: `Last` only ever CROSSES panes, so the pane it
/// lands on already holds the view you left it with. This may land in the
/// SAME pane, where there is no such view to keep — a long in-file jump
/// would arrive on the very top or bottom row with `scroll_off` lines of
/// context on one side. Helix splits the same pair the same way: its
/// jumplist centres, its buffer switch does not.
pub fn jumpBy(p: *Pardes, delta: i32) void {
const next = @as(i64, @intCast(p.jcur)) + delta;
if (p.njumps == 0 or next < 0 or next >= p.njumps) return;
p.jcur = @intCast(next);
const j = p.jumps[p.jcur];
p.focusPaneLine(j.pane, .{ .line = j.line, .col = j.col }, .center);
}
/// Recompute geometry, push grid-size changes to each emulator + pty, fire
/// deferred greetings. The mirror of the prototype's loop epilogue.
fn sync(p: *Pardes) void {
p.reapPanes();
p.computeGeom();
p.syncPanelAnimations();
p.trackJump();
for (&p.panes, 0..) |*slot, id| {
const pane = slot.* orelse continue;
if (comptime terminal_panes) if (pane.reply_len > 0) {
var off: u16 = 0;
while (off < pane.reply_len) {
const n = @min(pane.reply_len - off, 64);
p.emit(.{ .write = .{ .pane = @intCast(id), .bytes = .from(pane.reply[off .. off + n]) } });
off += n;
}
pane.reply_len = 0;
};
const r = p.rects[id];
const cols = @max(1, r.w -| config.GUTTER);
const rows = @max(1, r.h -| BOX_H); // the tag steals the top row
// a pane shrunk to just its tag keeps its last real grid: no
// pty/vt reflow while the body is hidden, so re-enlarging brings
// it back exactly as it was
if ((cols != pane.cols or rows != pane.rows) and r.h > BOX_H) {
// doc panes have no pty/emulator grid to reflow; just record
// the size so bodyText renders the right number of rows
if (pane.isTerminal()) {
term_pane.resizeGrid(pane, p.gpa, cols, rows);
p.shell_rows.markStale(pane); // reflow moved every row
p.emit(.{ .resize_pty = .{ .pane = @intCast(id), .cols = cols, .rows = rows } });
}
pane.cols = cols;
pane.rows = rows;
}
term_pane.releasePendingCommandIfReady(p, id, pane);
// Greet only after the real size AND OSC 133 B: arbitrary startup
// output (or OSC A plus a prompt drawn in pieces) does not prove
// readline owns echo, and injecting there leaves `ls` unmarked.
if (pane.greet and pane.isTerminal() and p.resize_count > 0 and term_pane.promptInputReady(pane)) {
p.emit(.{ .resize_pty = .{ .pane = @intCast(id), .cols = pane.cols, .rows = pane.rows } });
p.emit(.{ .write = .{ .pane = @intCast(id), .bytes = .from("ls\r") } });
pane.greet = false;
}
}
}
fn panelBox(rect: Rect) panel_animation.Box {
return .{
.x = @floatFromInt(rect.x),
.y = @floatFromInt(rect.y),
.w = @floatFromInt(rect.w),
.h = @floatFromInt(rect.h),
};
}
/// Turn one committed layout into backend-neutral transition records.
/// Layout remains authoritative and takes effect immediately; these tracks
/// are presentation data only, so disabling an effect cannot strand stale
/// geometry or alter hit testing.
fn syncPanelAnimations(p: *Pardes) void {
const initializing = !p.layout_snapshot_ready or !p.panel_animation_enabled;
if (initializing or p.snap_panel_layout_once) {
const had_presented_layout = p.layout_snapshot_ready;
p.layout_snapshot = @splat(null);
p.panel_tracks = @splat(null);
p.nclosing_panel_tracks = 0;
p.panel_diff_pending = false;
p.panel_diff_ready = false;
// Resize/direct-manipulation snaps still wait for their backend
// presentation acknowledgement. Clearing here would make input
// follow canonical geometry while the last submitted pixels were
// still animated. Initialization has no prior frame to preserve.
if (initializing) {
p.presented_panel_tracks = @splat(null);
p.npresented_closing_panel_tracks = 0;
}
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
p.layout_snapshot[id] = .{ .serial = pane.serial, .box = panelBox(p.rects[id]) };
}
p.layout_snapshot_ready = true;
p.snap_panel_layout_once = false;
if (had_presented_layout and p.panel_presentation_ready)
p.panel_presentation_pending = true;
return;
}
const effect = p.settings.panel_transition;
if (effect.needsPreviousGrid() and (p.panel_diff_pending or p.panel_diff_ready)) {
var second_change = false;
for (p.panes, p.layout_snapshot, 0..) |slot, snapshot, id| {
const pane = slot orelse {
second_change = second_change or snapshot != null;
continue;
};
const target = panelBox(p.rects[id]);
second_change = second_change or snapshot == null or
snapshot.?.serial != pane.serial or !snapshot.?.box.eql(target);
}
if (second_change) {
// One frozen old grid cannot honestly describe two overlapping
// generations. Snap rapid layout churn instead of rewinding a
// new opener or sliding stale survivor cells as a tombstone.
p.abandonPanelAnimations();
p.layout_snapshot = @splat(null);
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
p.layout_snapshot[id] = .{ .serial = pane.serial, .box = panelBox(p.rects[id]) };
}
return;
}
}
var changed = false;
var animated_change = false;
for (p.panes, 0..) |slot, id| {
const pane = slot orelse {
if (p.layout_snapshot[id]) |old| {
changed = true;
if (effect.lifecycleOnly()) {
if (p.appendClosingPanelTrack(.{
.serial = old.serial,
.pane = @intCast(id),
.phase = .closing,
.effect = effect,
.from = old.box,
.to = panel_animation.closingBox(effect, old.box),
})) animated_change = true;
}
}
p.layout_snapshot[id] = null;
p.panel_tracks[id] = null;
// Never let pixels from a dead pane address a reused slot.
p.presented_panel_tracks[id] = null;
continue;
};
const target = panelBox(p.rects[id]);
const previous = p.layout_snapshot[id];
p.layout_snapshot[id] = .{ .serial = pane.serial, .box = target };
if (effect == .off) {
changed = changed or previous == null or previous.?.serial != pane.serial or
!previous.?.box.eql(target);
p.panel_tracks[id] = null;
continue;
}
if (previous) |old| {
if (old.serial == pane.serial and old.box.eql(target)) continue;
const same_lifetime = old.serial == pane.serial;
const prior = if (p.panel_tracks[id]) |track|
if (track.serial == pane.serial and track.active()) track else null
else
null;
if (effect.lifecycleOnly() and same_lifetime) {
// A vertical lifecycle transition deliberately leaves
// every survivor at canonical geometry. A still-opening
// lifetime remains an opener when another layout commit
// retargets it; an established survivor gets no record.
if (prior) |active| if (active.phase == .opening) {
var next = active;
next.from = panel_animation.openingBox(effect, target, p.screen_w);
next.to = target;
p.panel_tracks[id] = next;
changed = true;
animated_change = true;
continue;
};
p.panel_tracks[id] = null;
changed = true;
continue;
}
if (effect.lifecycleOnly() and !same_lifetime) {
_ = p.appendClosingPanelTrack(.{
.serial = old.serial,
.pane = @intCast(id),
.phase = .closing,
.effect = effect,
.from = old.box,
.to = panel_animation.closingBox(effect, old.box),
});
}
const shown = if (p.presented_panel_layout[id]) |snapshot|
if (snapshot.serial == pane.serial) snapshot.box else null
else
null;
const from = if (!same_lifetime)
panel_animation.openingBox(effect, target, p.screen_w)
else if (shown) |box|
box
else if (p.panel_presentation_ready and prior != null)
prior.?.from
else
old.box;
const next: panel_animation.Track = .{
.serial = pane.serial,
.pane = @intCast(id),
.phase = if (!same_lifetime or
(prior != null and prior.?.phase == .opening)) .opening else .moving,
.effect = effect,
.from = from,
.to = target,
};
p.panel_tracks[id] = next;
changed = true;
animated_change = true;
} else {
const next: panel_animation.Track = .{
.serial = pane.serial,
.pane = @intCast(id),
.phase = .opening,
.effect = effect,
.from = panel_animation.openingBox(effect, target, p.screen_w),
.to = target,
};
p.panel_tracks[id] = next;
changed = true;
animated_change = true;
}
}
if (animated_change and effect.needsPreviousGrid()) {
p.panel_diff_pending = true;
p.panel_diff_ready = false;
}
if (changed and p.panel_presentation_ready) p.panel_presentation_pending = true;
}
fn appendClosingPanelTrack(p: *Pardes, track: panel_animation.Track) bool {
std.debug.assert(track.phase == .closing);
const baseline = p.presented_cells_layout[track.pane] orelse return false;
if (!p.presented_cells_valid or baseline.serial != track.serial or
!baseline.box.eql(track.from)) return false;
if (p.nclosing_panel_tracks == p.closing_panel_tracks.len) {
// Bounded presentation history: under pathological delete/reuse
// churn, retire the oldest (and therefore furthest-progressed)
// tombstone rather than retaining a pane or allocating per Del.
std.mem.copyForwards(
panel_animation.Track,
p.closing_panel_tracks[0 .. p.closing_panel_tracks.len - 1],
p.closing_panel_tracks[1..],
);
p.nclosing_panel_tracks -= 1;
}
p.closing_panel_tracks[p.nclosing_panel_tracks] = track;
p.nclosing_panel_tracks += 1;
return true;
}
fn advancePanelAnimations(p: *Pardes) void {
for (&p.panel_tracks) |*slot| {
const track = if (slot.*) |*track| track else continue;
track.frame +|= 1;
if (!track.active()) slot.* = null;
}
var out: usize = 0;
for (p.closing_panel_tracks[0..p.nclosing_panel_tracks]) |value| {
var track = value;
track.frame +|= 1;
if (!track.active()) continue;
p.closing_panel_tracks[out] = track;
out += 1;
}
p.nclosing_panel_tracks = out;
}
fn columnBoundary(width: u16, prefix: u128, total: u128) u16 {
if (total == 0) return 0;
const pixels = (@as(u128, width) * prefix + total / 2) / total;
return @intCast(@min(@as(u128, width), pixels));
}
pub fn computeGeom(p: *Pardes) void {
if (p.ncol == 0) return;
var wsum: u128 = 0;
for (0..p.ncol) |c| wsum += p.col_weight[c];
if (wsum == 0) wsum = 1;
// Round cumulative boundaries, not each width independently. Splitting
// one weight W into A+B=W then leaves every boundary before A and
// after B bit-identical, at every screen width; independent rounding
// can move a later column by one cell even though its own weight and
// the total did not change.
var prefix: u128 = 0;
for (0..p.ncol) |c| {
const last = c + 1 == p.ncol;
const x = columnBoundary(p.screen_w, prefix, wsum);
prefix += p.col_weight[c];
const end: u16 = if (last)
p.screen_w
else
columnBoundary(p.screen_w, prefix, wsum);
const cw = end -| x;
p.col_x[c] = x;
p.col_w[c] = cw;
var vsum: f32 = 0;
for (0..p.col_n[c]) |k| {
if (p.panes[p.col_terms[c][k]]) |pane| vsum += pane.vweight;
}
if (vsum <= 0) vsum = 1;
var y: u16 = TOPBAR_H;
const avail_h = p.screen_h -| TOPBAR_H;
for (0..p.col_n[c]) |k| {
const id = p.col_terms[c][k];
const pane = p.panes[id] orelse continue;
const lastk = k + 1 == p.col_n[c];
const fh = @as(f32, @floatFromInt(avail_h)) * pane.vweight / vsum;
// every pane wants at least one row, so a column with more
// panes than the window has rows would walk `y` off the bottom
// and hand renderPane a rect outside the surface (assert, then
// panic — shrink a window with a few stacked panes). Clamp to
// what is left: the panes past the edge get h = 0 and render
// nothing until the window grows back.
const room = p.screen_h -| y;
const ch: u16 = if (lastk) room else @min(room, @max(1, @as(u16, @intFromFloat(@round(fh)))));
p.rects[id] = .{ .x = x, .y = y, .w = cw, .h = ch };
y +|= ch;
}
}
}
pub fn theme(p: *const Pardes) *const Theme {
if (p.custom_theme_active) return &p.custom_theme.?;
return &themes[p.settings.theme];
}
/// Displayed colors for anchored UI chrome. Unlike `theme()`, this may be
/// between themes while a live transition is active.
pub fn chromeTheme(p: *const Pardes) *const ChromeTheme {
return &p.chrome_animation.displayed;
}
/// Whether an idle frontend should schedule another tick. All frame-based
/// core work belongs in this one predicate so TTY and GUI mature it alike.
pub fn animationActive(p: *const Pardes) bool {
if (p.chrome_animation.isActive() or p.look_hover_wait != null) return true;
const scene = p.settings.scene_effects;
if (scene.crt or scene.ripple or scene.glitch) return true;
for (p.panel_tracks) |track| if (track != null and track.?.active()) return true;
for (p.closing_panel_tracks[0..p.nclosing_panel_tracks]) |track|
if (track.active()) return true;
return false;
}
/// Arm the pulse. Look wins a tie because a Look that runs a command
/// (`` @`ls` ``, which is one gesture spelled as both) is felt as the
/// thing the user asked for, not as the shell it happened to need.
fn noteHaptic(p: *Pardes, pulse: Haptic) void {
if (comptime platform != .macos) return;
if (p.haptic == .look) return;
p.haptic = pulse;
}
/// Take the armed pulse and disarm. The shell calls this once per pump,
/// after the tick that may have set it.
pub fn takeHaptic(p: *Pardes) Haptic {
if (comptime platform != .macos) return .none;
defer p.haptic = .none;
return p.haptic;
}
fn finishThemeInitialization(p: *Pardes) void {
p.chrome_animation.snap(ChromeTheme.fromTheme(p.theme()));
p.animate_theme_changes = true;
}
fn invalidateThemeDependentRasters(p: *Pardes) void {
if (comptime pdf_enabled) for (p.panes) |slot| {
const pane = slot orelse continue;
const pv = &(pane.pdf orelse continue);
if (pv.tint != .disabled) pv.invalidateAllRasters();
};
}
/// The sole live-session theme mutation path. Target colors change now;
/// anchored chrome retargets from its currently displayed palette. Only
/// PDFs whose pixels depend on target theme colors are marked stale, once;
/// untinted source rasters remain byte-for-byte resident.
pub fn setThemeIndex(p: *Pardes, index: usize) void {
if (index >= themes.len or
(!p.custom_theme_active and p.theme_file_path.get().len == 0 and
index == @as(usize, p.settings.theme))) return;
const target_chrome = ChromeTheme.fromTheme(&themes[index]);
if (p.animate_theme_changes)
p.chrome_animation.retarget(target_chrome)
else
p.chrome_animation.snap(target_chrome);
if (p.custom_theme) |theme_value| {
p.custom_theme = null;
p.custom_theme_active = false;
std.zon.parse.free(p.gpa, theme_value);
}
if (p.theme_file_path.get().len > 0) {
p.theme_file_path.clear();
const generation = p.nextThemeFileGeneration();
p.emit(.{ .theme_file = .{ .generation = generation, .on = false } });
}
p.settings.theme = @intCast(index);
p.invalidateThemeDependentRasters();
}
// ---- render: build the canonical surface ----
pub fn render(p: *Pardes, arena: std.mem.Allocator) !*Surface {
file_pane.refreshHighlights(p);
const s = &p.surface;
const ncells = @as(usize, p.screen_w) * p.screen_h;
if (s.cells.len != ncells) {
p.gpa.free(s.cells);
s.cells = try p.gpa.alloc(Cell, ncells);
}
s.cols = p.screen_w;
s.rows = p.screen_h;
s.cursor = null;
s.nimages = 0;
s.npanel_tracks = 0;
s.previous_cells = &.{};
s.cell_diffs = &.{};
const chrome = p.chromeTheme();
const th = p.theme(); // the message row paints in the editor's colours
// gaps between panes read as chrome (scrollbar track), not raw default
s.fill(0, 0, s.cols, s.rows, .{ .bg = .{ .rgb = chrome.scroll_track } });
for (&p.panes, 0..) |*slot, id| {
const pane = slot.* orelse continue;
try p.renderPane(arena, pane, p.rects[id], id, id == p.active);
}
// ---- the transient message row: the pane's last body row ----
//
// An OVERLAY, not geometry: no rect moves, no pane shrinks, and a pane
// with neither a message nor an armed prompt is not touched at all.
// Drawn after every pane's body so it lands OVER whatever that row was
// showing, and painted across the whole row — it is the tagline's twin,
// and reading as one strip rather than a stamp on a body line is what
// keeps it from being mistaken for content. Out here rather than at the
// end of renderPane because renderPane returns early for a native PDF
// page and for an image, and a `/` on a PDF is a real search whose
// prompt has to be visible like any other.
//
// Exactly two things can occupy the row and an ARMED PROMPT beats a
// MESSAGE, because they are not the same kind of thing: a message is a
// report of what already happened and the next keystroke wipes it, a
// prompt is what that keystroke is being typed into and it lives until
// Enter or Esc.
//
// ponytail: the row is draw-only. A click on it lands wherever the body
// under it says (tag clicks map to tag_col on the TAG row), so a prompt
// that moved off the tagline cannot be clicked into or swept the way it
// could up there — the keyboard still edits it in full. Upgrade path
// is a hit test here that maps a press on this row to tag_col + the
// marker offset, i.e. the tag row's own mapping with a constant added.
for (&p.panes, 0..) |*slot, id| {
const pane = slot.* orelse continue;
const r = p.rects[id];
// no body row (a one-row pane, or one squeezed out entirely): the
// tag row is not ours to overwrite, so the message just waits. One
// guard for both placements, because the row picked below is the
// last BODY row either way — "the pane has a body row" is the whole
// condition, and it is what keeps r.h - 1 - BOX_H from underflowing
// or landing above the pane.
if (r.w <= config.GUTTER or r.h <= BOX_H) continue;
// the same one input model renderPane cut off the tagline; only one
// of the two can ever be armed (a body key arms one, exitTagEdit
// clears both)
const prompt_at = pane.promptAt();
const text = if (prompt_at) |at|
pane.tagSlice()[@min(at, pane.tag_tail_len)..]
else
pane.msg[0..pane.msg_len];
// The pending SPC path is the third thing that wants this row, and
// it can want it while the row is otherwise empty.
const leader_here = id == p.active and p.leader_on;
if (text.len == 0 and !leader_here) continue;
const tx = r.x + config.GUTTER;
const tw = r.w - config.GUTTER;
// the pane's last BODY row: its last row outright, or one up from
// that when Tagbottom has taken the last for the tagline. The first
// cut of Tagbottom sent this row to the pane's FIRST instead — the
// far end, symmetric with the tag — which put the prompt you are
// typing as far as the pane allows from the tag you are typing
// into. Beside the tagline is where it is read, so it stays there.
const row = if (p.settings.tag_bottom) r.y + r.h - 1 - BOX_H else r.y + r.h - 1;
// In the EDITOR's colours, not the tag bar's: this row is the one
// place the program talks back to you about the buffer you are in,
// and it reads as part of that buffer rather than as another strip
// of chrome. th and not chrome for the same reason a selection
// uses th — it is not attached to any geometry, so it arrives with
// the theme instead of sliding in over the chrome animation.
const msg_style: CellStyle = .{
.fg = if (th.fg) |c| .{ .rgb = c } else .default,
.bg = if (th.bg) |c| .{ .rgb = c } else .default,
};
// the WHOLE row, the way the tagline fills its own before printing:
// a message is a section and not a stamp, and print writes only the
// cells it needs — so without the fill the body row shows through
// to the right of a short message and reads as one garbled line.
s.fill(tx, row, tw, 1, .{ .bg = msg_style.bg });
if (text.len > 0) _ = s.print(tx, row, tw, text, msg_style);
// The pending SPC leader path, right-aligned. It used to sit on the
// active pane's tagline, where it had to fight the builtins in the
// tail for the same columns; down here it is beside the rest of the
// transient state, and printed AFTER the message so a long one
// loses its last columns rather than hiding what you are typing.
if (leader_here) {
var ibuf: [16]u8 = @splat(' ');
@memcpy(ibuf[1..4], "SPC");
var iw: usize = 4;
for (p.leader_keys[0..p.leader_n]) |ch| {
ibuf[iw + 1] = ch;
iw += 2;
}
const w: u16 = @intCast(iw);
if (w < tw) _ = s.print(tx + tw - w, row, w, ibuf[0..iw], msg_style);
}
// ...and the cursor follows the text it edits. tag_col is a byte
// offset, so the prompt maps its suffix through display widths; a
// cursor LEFT of the marker is still over the part
// of the tag that stayed on the tagline, and the tag cursor
// renderPane already placed there is the right one.
if (id != p.active) continue;
const at = prompt_at orelse continue;
const prompt0 = (p.tagPrefix(pane) catch continue).len + at;
const col = @as(usize, pane.tag_col);
if (col >= prompt0) {
const prompt_col = file_pane.displayWidth(text[0..@min(col - prompt0, text.len)]);
if (prompt_col < tw)
s.cursor = .{ .x = tx + @as(u16, @intCast(prompt_col)), .y = row, .bar = pane.mode == .insert };
}
}
// global tagbar: full width, top row
s.fill(0, 0, s.cols, TOPBAR_H, .{
.bg = .{ .rgb = chrome.tag_bg },
// The blank tail is the same visible band as the printed words.
// SDL used to repair this at draw time by special-casing row zero,
// but native hosts consume the role carried by each cell.
.font_role = .tagline,
});
var tb_buf: [1200]u8 = undefined;
_ = s.print(0, 0, s.cols, p.topbar(&tb_buf), .{
.fg = .{ .rgb = chrome.tag_fg },
.bg = .{ .rgb = chrome.tag_bg },
.font_role = .tagline,
});
// The topbar is executable chrome, just like a button row. Pane text
// already previews the exact operand a Look would use; row zero has
// no Pane and used to fall through that machinery without any pointer
// feedback at all. Paint the same word the click dispatcher resolves,
// immediately, while leaving whitespace inert.
if (p.pointer_inside and p.hover_row < TOPBAR_H) {
const bar = p.topbar(&tb_buf);
if (wordBoundsAtCol(bar, file_pane.rawAtDisplay(bar, p.hover_col))) |bounds| {
var col = file_pane.rawDisplayCol(bar, bounds.lo);
const hi = file_pane.rawDisplayCol(bar, bounds.hi);
while (col < hi and col < s.cols) : (col += 1) {
const cell = s.at(@intCast(col), 0);
cell.default = false;
cell.style.bg = .{ .rgb = th.sel_bg };
cell.style.fg = .{ .rgb = th.sel_fg };
}
}
}
// the topbar's cursor, if it has the keyboard. AFTER the pane loop on
// purpose: there is exactly one Surface cursor and the bar's must beat
// the active pane's. Always a block — the bar has no insert mode.
if (p.topbar_col) |c| {
const col = file_pane.rawDisplayCol(p.topbar(&tb_buf), c);
if (col < s.cols) s.cursor = .{ .x = @intCast(col), .y = 0, .bar = false };
}
// resize-handle hint / drag previews: a dash overlay that keeps the
// underlying colors (border drags + hover), or the move indicator. A
// drag holds the coordinates of the last mouse event, so a resize
// mid-drag (tiling WM, font-size change) can leave them off the new
// surface — every arm below checks before it draws.
switch (p.drag) {
.border_v => |d| {
if (d.cur_x < s.cols) {
var row: u16 = TOPBAR_H;
while (row < s.rows) : (row += 1) s.overlayDash(d.cur_x, row, "╎");
}
// a corner lights BOTH splits, which is the whole tell that you
// grabbed the crossing and not an edge. The horizontal half runs
// across ITS OWN column and stops at the vertical preview rather
// than at that column's current edge, so the two dashes stay
// joined at the cell under the mouse: through the handle for a
// left-column corner, butting into it from the right neighbour
// for a right-column one.
if (d.corner) |k| if (d.cur_y < s.rows) {
var col = if (k.col == d.left_col) p.col_x[k.col] else d.cur_x +| 1;
const end = if (k.col == d.left_col) d.cur_x else p.col_x[k.col] +| p.col_w[k.col] -| 1;
while (col <= end and col < s.cols) : (col += 1) s.overlayDash(col, d.cur_y, "╌");
};
},
.border_h => |d| if (d.cur_y < s.rows) {
var col = p.col_x[d.col];
while (col < p.col_x[d.col] + p.col_w[d.col]) : (col += 1) s.overlayDash(col, d.cur_y, "╌");
},
.move => |d| if (d.cur_x < s.cols) {
if (p.movePlacement(d.id, d.cur_x, d.cur_y)) |placement| {
var col: u16 = p.col_x[placement.preview_col];
while (col < p.col_x[placement.preview_col] + p.col_w[placement.preview_col]) : (col += 1) {
s.set(col, placement.row, "╌", .{ .fg = .{ .rgb = chrome.lineno } });
}
s.set(d.cur_x, placement.row, "▌", .{ .fg = .{ .rgb = chrome.lineno } });
}
},
.none, .select, .tag => if (p.pointer_inside) {
// hover hints on a pane's own trailing edge
var c: usize = 0;
while (c + 1 < p.ncol) : (c += 1) {
if (p.hover_col == p.col_x[c] + p.col_w[c] -| 1) {
var row: u16 = TOPBAR_H;
while (row < s.rows) : (row += 1) s.overlayDash(p.hover_col, row, "╎");
}
}
for (0..p.ncol) |cc| {
if (p.hover_col < p.col_x[cc] or p.hover_col >= p.col_x[cc] + p.col_w[cc]) continue;
// the same seam the h-handle hit test picks (see there)
if (p.seamIdxAt(cc, p.hover_row) != null) {
var col = p.col_x[cc];
while (col < p.col_x[cc] + p.col_w[cc]) : (col += 1) s.overlayDash(col, p.hover_row, "╌");
}
}
// the containment test above can only ever light the column the
// hovered cell is IN, and a v handle is its LEFT column's cell.
// So when that column has no seam here but its right neighbour
// does, light the neighbour's: that is the corner a press would
// take (Drag.border_v), and a grabbable crossing has to be
// visible before it is grabbed.
for (0..p.ncol -| 1) |cn| {
if (p.hover_col != p.col_x[cn] + p.col_w[cn] -| 1) continue;
if (p.seamIdxAt(cn, p.hover_row) != null) continue;
if (p.seamIdxAt(cn + 1, p.hover_row) == null) continue;
var col = p.col_x[cn + 1];
while (col < p.col_x[cn + 1] + p.col_w[cn + 1]) : (col += 1) s.overlayDash(col, p.hover_row, "╌");
}
},
}
// debug overlay: a small stats box drawn last, top-right ("Debug")
if (p.settings.debug) if (p.panes[p.active]) |at| {
var nlive: usize = 0;
for (p.panes) |slot| {
if (slot != null) nlive += 1;
}
var sb_off: usize = undefined;
var sb_total: usize = undefined;
if (at.file) |*f| {
sb_off = f.scroll;
sb_total = file_pane.nlines(p.gpa, f);
} else if (at.pdfPage()) |page| {
sb_off = page;
sb_total = if (comptime pdf_enabled) at.pdf.?.page_count else 0;
} else {
const sb = term_pane.scrollbar(at);
sb_off = sb.offset;
sb_total = sb.total;
}
// The face belongs to the SHELL, so the core can only name the one
// it was asked for; nothing has asked when this is empty and the
// shell is still in whatever it booted in. Clamped because a name
// is a file stem and a path component can be as long as a path.
const effective_font = p.settings.font.effective_name.get();
const font_name = if (effective_font.len == 0) "default" else effective_font;
var ov_buf: [256]u8 = undefined;
const text = std.fmt.bufPrint(
&ov_buf,
"pardes resizes={d}\ntheme {s}\nfont {s}\nterms {d} cols {d}\nactive #{d} {d}x{d}\nscroll {d}/{d}\npinch {d:6.4}\ntscroll {d:7.4}",
.{ p.resize_count, p.theme().name, font_name[0..@min(font_name.len, 64)], nlive, p.ncol, p.active, at.cols, at.rows, sb_off, sb_total, p.ov_pinch_scale, p.ov_touch_scroll_delta },
) catch "";
// wide enough for the longest theme name compiled in, which is the
// only row here whose width is not ours to choose
const ow: u16 = 38;
const oh: u16 = 10;
const ox: u16 = if (s.cols > ow) s.cols - ow else 0;
if (ox + ow <= s.cols and TOPBAR_H + oh <= s.rows) {
// vaxis single_rounded border ring, default style
s.set(ox, TOPBAR_H, "╭", .{});
s.set(ox + ow - 1, TOPBAR_H, "╮", .{});
s.set(ox, TOPBAR_H + oh - 1, "╰", .{});
s.set(ox + ow - 1, TOPBAR_H + oh - 1, "╯", .{});
var bx = ox + 1;
while (bx < ox + ow - 1) : (bx += 1) {
s.set(bx, TOPBAR_H, "─", .{});
s.set(bx, TOPBAR_H + oh - 1, "─", .{});
}
var by = TOPBAR_H + 1;
while (by < TOPBAR_H + oh - 1) : (by += 1) {
s.set(ox, by, "│", .{});
s.set(ox + ow - 1, by, "│", .{});
}
s.fill(ox + 1, TOPBAR_H + 1, ow - 2, oh - 2, .{ .bg = .{ .rgb = chrome.scroll_track } });
var lines = std.mem.splitScalar(u8, text, '\n');
var ly: u16 = TOPBAR_H + 1;
while (lines.next()) |line| : (ly += 1) {
if (ly >= TOPBAR_H + oh - 1) break;
_ = s.print(ox + 1, ly, ow - 2, line, .{ .fg = .{ .rgb = chrome.tag_fg } });
}
}
};
p.submitted_panel_layout = @splat(null);
for (p.panes, 0..) |slot, id| {
const pane = slot orelse continue;
p.submitted_panel_layout[id] = .{
.serial = pane.serial,
.box = panelBox(p.rects[id]),
};
}
p.submitted_panel_layout_ready = true;
// The old grid stays frozen for the transition, while terminals,
// watches, hover chrome, and other live data may change the new grid
// between samples. Rebuild the cheap byte mask every frame so the
// published (old, new, changed) triple is always coherent.
if ((p.panel_diff_pending or p.panel_diff_ready) and !try p.preparePanelDiff()) {
// There was no successfully presented same-sized old grid. A
// content effect cannot guess one: snap this transition rather
// than animating uninitialised/stale cells.
for (&p.panel_tracks) |*slot| {
const track = slot.* orelse continue;
if (track.effect.needsPreviousGrid()) slot.* = null;
}
p.nclosing_panel_tracks = 0;
p.panel_diff_pending = false;
p.panel_diff_ready = false;
}
if (p.panel_diff_ready) {
s.previous_cells = p.presented_cells;
s.cell_diffs = p.panel_cell_diffs;
}
// Moving panes first, then new panes, then inert closing tombstones on
// top. Native GUI paint planners may regroup by phase, but every host
// receives this same deterministic dense record set.
for ([_]panel_animation.Phase{ .moving, .opening }) |phase| for (p.panel_tracks) |maybe| {
const track = maybe orelse continue;
if (!track.active() or track.phase != phase) continue;
s.panel_tracks[s.npanel_tracks] = track;
s.npanel_tracks += 1;
};
for (p.closing_panel_tracks[0..p.nclosing_panel_tracks]) |track| {
if (!track.active()) continue;
s.panel_tracks[s.npanel_tracks] = track;
s.npanel_tracks += 1;
}
return p.composeAsciiTransitions(arena, s);
}
// EFFECT_CODE_ASCII_COMPOSITOR_BEGIN
/// Lazily copy the canonical grid only when an active core-composed
/// character track still shows something other than its final glyph. The
/// returned Surface is the sole backend boundary, so every shell rasterizes
/// the exact same intermediate characters and style-only/non-ASCII changes
/// pass through once.
fn composeAsciiTransitions(p: *Pardes, arena: std.mem.Allocator, canonical: *Surface) !*Surface {
_ = p;
if (!canonical.hasPanelDiff()) return canonical;
var presented: ?*Surface = null;
for (canonical.panelTracks()) |track| {
if (!track.effect.composedByCore() or track.phase == .closing) continue;
const area = panel_animation.CellArea.of(track.to);
const col_end = @min(canonical.cols, area.x0 +| area.cols);
const row_end = @min(canonical.rows, area.y0 +| area.rows);
var row: u16 = area.y0;
while (row < row_end) : (row += 1) {
var col: u16 = area.x0;
while (col < col_end) : (col += 1) {
const index = @as(usize, row) * canonical.cols + col;
const composed = composedCell(canonical, track, area, col, row, index) orelse
continue;
if (composed.visuallyEqual(&canonical.cells[index])) continue;
if (presented == null) {
const next = try arena.create(Surface);
next.* = canonical.*;
next.cells = try arena.dupe(Cell, canonical.cells);
presented = next;
}
presented.?.cells[index] = composed;
}
}
}
return presented orelse canonical;
}
/// The character one cell presents this frame, or null when the canonical
/// cell is already the honest answer. PanelAscii walks the semantic byte
/// distance of a *changed* cell; the motion effects carry every glyph in
/// the pane, because text flying in from a screen edge has to bring its
/// unchanged glyphs along with it.
fn composedCell(
canonical: *const Surface,
track: panel_animation.Track,
area: panel_animation.CellArea,
col: u16,
row: u16,
index: usize,
) ?Cell {
if (track.effect == .ascii) {
const diff = switch (canonical.cell_diffs[index]) {
.ascii => |diff| diff,
.unchanged, .visual => return null,
};
const byte = diff.byteAt(track.frame);
if (byte == diff.to) return null;
// Frame zero is the exact old cell. Once a byte is walking, the
// semantic destination owns presentation style, and at the endpoint
// the untouched canonical cell wins bit-for-bit instead.
if (track.frame == 0) return canonical.previous_cells[index];
return withByte(canonical.cells[index], byte);
}
return switch (panel_animation.charSource(track, col - area.x0, row - area.y0, area)) {
.old => canonical.previous_cells[index],
.byte => |byte| withByte(canonical.cells[index], byte),
// Churn belongs on the glyph, not on the pane's empty space, and it
// borrows whichever side of the diff actually has one.
.churn => |byte| blk: {
const new_cell = &canonical.cells[index];
if (hasGlyph(new_cell)) break :blk withByte(new_cell.*, byte);
const old_cell = &canonical.previous_cells[index];
if (hasGlyph(old_cell)) break :blk withByte(old_cell.*, byte);
break :blk old_cell.*;
},
.at => |offset| blk: {
const source_col = @as(i32, col) + offset.cols;
const source_row = @as(i32, row) + offset.rows;
// A glyph whose source lies outside the pane has not arrived
// yet: the frozen old cell is the only truthful thing under it.
if (source_col < area.x0 or source_row < area.y0 or
source_col >= @as(i32, area.x0) + area.cols or
source_row >= @as(i32, area.y0) + area.rows or
source_col >= canonical.cols or source_row >= canonical.rows)
break :blk canonical.previous_cells[index];
const source = @as(usize, @intCast(source_row)) * canonical.cols +
@as(usize, @intCast(source_col));
break :blk canonical.cells[source];
},
};
}
fn withByte(cell: Cell, byte: u8) Cell {
var out = cell;
out.text[0] = byte;
out.len = 1;
out.default = false;
return out;
}
/// Whether a cell shows a glyph a character effect can work on. An unpainted
/// cell and a space are both blank space, whatever style they carry.
fn hasGlyph(cell: *const Cell) bool {
return !cell.default and !(cell.len == 1 and cell.text[0] == ' ');
}
fn preparePanelDiff(p: *Pardes) !bool {
const count = p.surface.cells.len;
if (!p.presented_cells_valid or
p.presented_cells_cols != p.surface.cols or
p.presented_cells_rows != p.surface.rows or
p.presented_cells.len != count) return false;
if (p.panel_cell_diffs.len != count) {
const next = try p.gpa.alloc(PanelCellDiff, count);
if (p.panel_cell_diffs.len > 0) p.gpa.free(p.panel_cell_diffs);
p.panel_cell_diffs = next;
}
for (p.panel_cell_diffs, p.presented_cells, p.surface.cells) |*diff, *old, *new|
diff.* = PanelCellDiff.between(old, new);
// The fixed Track ABI already carried two padding bytes after frame.
// They now hold the core-computed ASCII duration: exactly one sample
// beyond the longest eased walk in this pane, so there is neither a
// forced endpoint jump nor a long invisible tail for nearby glyphs.
for (&p.panel_tracks) |*slot| {
const track = if (slot.*) |*track| track else continue;
if (track.effect != .ascii) continue;
var longest: u16 = 1;
var row: u16 = 0;
while (row < p.surface.rows) : (row += 1) {
var col: u16 = 0;
while (col < p.surface.cols) : (col += 1) {
if (!boxContainsCell(track.to, col, row)) continue;
const index = @as(usize, row) * p.surface.cols + col;
switch (p.panel_cell_diffs[index]) {
.ascii => |diff| longest = @max(longest, diff.frameCount()),
.unchanged, .visual => {},
}
}
}
track.frame_count = @max(track.frame_count, longest);
}
p.panel_diff_pending = false;
p.panel_diff_ready = true;
return true;
}
// EFFECT_CODE_ASCII_COMPOSITOR_END
/// Paint a selection expressed in the coordinate space used by pointer
/// gestures. Both the persistent mouse selections and the delayed Look
/// preview come through this one clipping/mapping path.
fn paintPointerSelection(
s: *Surface,
pane: *const Pane,
r: Rect,
tx: u16,
tw: u16,
tag_y: u16,
body_y: u16,
sl: Sel,
bg: [3]u8,
fg: ?[3]u8,
) void {
const r0 = @min(sl.r0, sl.r1);
const r1 = @max(sl.r0, sl.r1);
const c0 = @max(0, @min(sl.c0, sl.c1));
const c1 = @max(0, @max(sl.c0, sl.c1));
var row: u16 = 0;
while (row < r.h) : (row += 1) {
if (@as(i32, row) < r0 or @as(i32, row) > r1) continue;
// A Sel row is independent of Tagbottom: zero is the tag and
// BOX_H upward is the body. This is the render-side inverse of
// pointerTextSelection.
const sy = if (row < BOX_H) tag_y else body_y + row - BOX_H;
// File line numbers occupy PREFIX_W only in the body. The tag is
// row zero in Sel space and starts at its real first text cell.
var col: i32 = if (pane.file != null and row >= BOX_H) @max(c0, @as(i32, config.PREFIX_W)) else c0;
while (col <= c1 and col < tw) : (col += 1) {
const cell = s.at(tx + @as(u16, @intCast(col)), sy);
cell.default = false;
cell.style.bg = .{ .rgb = bg };
if (fg) |ink| cell.style.fg = .{ .rgb = ink };
}
}
}
fn renderPane(p: *Pardes, arena: std.mem.Allocator, pane: *Pane, r: Rect, id: usize, active: bool) !void {
const tz = tracy.zone(@src(), "renderPane");
defer tz.end();
if (r.w <= config.GUTTER or r.h == 0) return;
const s = &p.surface;
const th = p.theme();
const chrome = p.chromeTheme();
const tx = r.x + config.GUTTER; // text area (tag + body), right of the gutter
const tw = r.w - config.GUTTER;
// The pane's two anchor rows, computed once: the tagline's, and the
// body's first. The Tagbottom builtin swaps which end each is at and
// NOTHING else in here reads r.y — that is the whole of the feature on
// the render side. r.h == 0 returned above, so the bottom row exists.
const tag_y = if (p.settings.tag_bottom) r.y + r.h -| BOX_H else r.y;
const body_y = if (p.settings.tag_bottom) r.y else r.y + BOX_H;
// the pane's own background, for everything that has to read as "no
// chrome here": the body text, and the blank right half of the
// scrollbar's second column. `.default` means the host terminal's own
// background, which is what a themeless dark pane wants.
const pane_bg: Color = if (th.bg) |c| .{ .rgb = c } else .default;
// ...and the same background as a colour to do arithmetic on, which the
// dimmed selections below need. A theme with a null bg cannot say what
// the host's own cell looks like, so its tag bar stands in — the
// substitution pdf_pane.tintColors already makes.
const page_rgb = th.bg orelse th.tag_bg;
// text area resets to terminal-default cells (vaxis clear semantics);
// light themes paint the page over it.
s.clearRect(tx, r.y, tw, r.h);
if (th.bg) |bg| s.fill(tx, r.y, tw, r.h, .{ .bg = .{ .rgb = bg } });
// the layout box: the pane's MODE, one character, in the gutter cells
// of the tag row. Same box you drag a pane by — the whole GUTTER is
// still painted and the `.move` press hit-test in handleMouse is
// untouched — it just carries the one piece of state that used to cost
// four columns of every tagline.
// The glyph goes in column 0, directly above the scrollbar's ink
// column below it, so a pane's chrome reads as one line down its left
// edge; column 1 stays plain colour, and that blank half is what keeps
// the thing reading as a BOX rather than as a letter someone dropped
// in the gutter.
//
// The mode shown is the BODY's. A tag edit hijacks pane.mode to insert
// (tags are always insert; the real one is parked in tag_mode), and a
// badge that flipped every time you clicked a tagline would be
// reporting the tag's mode on the pane's box. Reading tag_mode also
// makes the parked value VISIBLE: a terminal being tag-edited still
// shows `$`, which is exactly the invariant ttyclick.snap exists for.
//
// The ink is picked off the box's own brightness instead of being
// named in the theme, because box/box_dim come from a generated
// theme's cursor and selection colours — light on a light theme — and
// a fixed white would vanish there. Rec.601-ish integer weights.
// ponytail: two colours, black or white, chosen at a fixed threshold.
// Upgrade to the theme's own fg/bg pair when a theme turns up whose
// box wants a tint rather than a contrast.
const box_bg = if (active) chrome.box else chrome.box_dim;
const box_lum = (@as(u16, box_bg[0]) * 3 + @as(u16, box_bg[1]) * 6 + @as(u16, box_bg[2])) / 10;
const box_ink: [3]u8 = if (box_lum > 140) .{ 0x00, 0x00, 0x00 } else .{ 0xff, 0xff, 0xff };
const box_style: CellStyle = .{
.fg = .{ .rgb = box_ink },
.bg = .{ .rgb = box_bg },
// The mode badge is the left end of the tagline, not body text.
// Carry the same role so every GUI backend scales the whole row.
.font_role = .tagline,
};
s.fill(r.x, tag_y, config.GUTTER, BOX_H, box_style);
const box_mode = if (pane.tag_edit) pane.tag_mode else pane.mode;
s.set(r.x, tag_y, switch (box_mode) {
.normal => config.tag_normal,
.insert => config.tag_insert,
.tty => config.tag_tty,
}, box_style);
// tag: live prefix (cwd/path) + editable tail, on a dim bar
const tag_style: CellStyle = .{ .fg = .{ .rgb = chrome.tag_fg }, .bg = .{ .rgb = chrome.tag_bg }, .font_role = .tagline };
// Padding belongs to the same font row but keeps its default ink: a
// role must not manufacture a foreground color for blank cells.
s.fill(tx, tag_y, tw, BOX_H, .{
.bg = .{ .rgb = chrome.tag_bg },
.font_role = .tagline,
});
const tag = try p.tagText(arena, pane);
// An armed input — `/`, Find, Grep, Rename, WsSymbols, Select/Split,
// `|` — is still TYPED INTO the tag tail: same buffer, same offsets,
// same one-line modal editor, same Enter and same Esc. Only where it is
// DRAWN moved. It is cut off the tagline here and printed on the pane's
// message row instead (see render), so the builtins in the tail stay
// readable while you type instead of being pushed off the right edge by
// a long pattern.
//
// The prompt offset is in the tail while tag_col is in the rendered
// tag, so add the live prefix length when clipping the editable span.
const prompt_at = pane.promptAt();
const tag_cut = if (prompt_at) |at|
@min(tag.len, tag.len - @min(tag.len, pane.tag_tail_len) + at)
else
tag.len;
_ = s.print(tx, tag_y, tw, tag[0..tag_cut], tag_style);
// Paint tag hover before every real tag selection. This common point
// is above the native-PDF/image early returns, so their tag operands
// are no longer hidden, while an explicit sweep remains authoritative.
if (p.look_hover_preview) |preview| {
if (preview.pane == id and preview.serial == pane.serial) if (preview.sel) |sel| if (@min(sel.r0, sel.r1) < BOX_H) {
const preview_bg = mix(page_rgb, mix(page_rgb, th.sel_bg));
paintPointerSelection(s, pane, r, tx, tw, tag_y, body_y, sel, preview_bg, null);
};
}
// tag char selection highlight (helix v/x, or a tagline sweep),
// inclusive [lo, hi], mapped from byte offsets to display cells.
//
// Every selection on screen paints in the LIVE theme (`th`) and not in
// `chrome`: a highlight is not attached to any geometry, it appears
// under the range you just swept, so it has to arrive with the theme
// the way syntax colours do rather than slide in over the chrome
// animation's frames.
if (pane.tag_edit and pane.tag_sel) {
const b = tagSelBounds(pane);
var col = file_pane.rawDisplayCol(tag, b.lo);
const hi = modal.nextGrapheme(tag, b.hi);
const end = file_pane.rawDisplayCol(tag, hi) -| 1;
while (col <= end and col < tw) : (col += 1) {
const cell = s.at(tx + @as(u16, @intCast(col)), tag_y);
cell.default = false;
cell.style.bg = .{ .rgb = th.sel_bg };
cell.style.fg = .{ .rgb = th.sel_fg };
}
}
// cursor while editing the tag: byte offset mapped to its display cell
if (active and pane.tag_edit) {
// bar while typing, block for `:` normal mode (same rule as a body)
const col = file_pane.rawDisplayCol(tag, pane.tag_col);
if (col < tw) s.cursor = .{ .x = tx + @as(u16, @intCast(col)), .y = tag_y, .bar = pane.mode == .insert };
}
// A native PDF page uses the same backend-neutral pixel attachment as
// an image. Without native pixels it deliberately falls through: its
// extracted text projection becomes an ordinary readable body.
if (comptime pdf_enabled)
if (hasPdf(pane) and pdf_pane.draw(p, pane, r, id, tx, tw)) return;
// image pane: the picture fills the body — petscii glyph art into the
// cells, or a pixel attachment the shell places (kitty). Plain
// thumbless gutter so it reads like any other pane.
if (pane.image) |*iv| {
image_pane.draw(p, iv, @intCast(id), pane.serial, tx, body_y, tw, r.h -| BOX_H);
// thumbless, but the same one column as the real scrollbar below —
// that is the whole point of drawing it
s.fill(r.x, body_y, 1, r.h -| BOX_H, .{ .bg = .{ .rgb = chrome.scroll_track } });
s.fill(r.x + 1, body_y, 1, r.h -| BOX_H, .{ .bg = pane_bg });
return;
}
// body: emulator rows, prompt rows hidden outside tty mode
const body_h = if (r.h > BOX_H) r.h - BOX_H else 0;
const body_style: CellStyle = .{
.fg = if (th.fg) |c| .{ .rgb = c } else .default,
.bg = pane_bg,
};
const tz_body = tracy.zone(@src(), "bodyText");
const body = try p.bodyText(arena, pane);
tz_body.end();
var it = std.mem.splitScalar(u8, body, '\n');
var i: u16 = 0;
while (it.next()) |line| : (i += 1) {
if (i >= body_h) break;
_ = s.print(tx, body_y + i, tw, line, body_style);
}
// Coloring is one algorithm per pane, chosen by title (colorAlgo): the
// terminal projects its own ANSI, a file lays tree-sitter or diff
// shading over its content. source and diff share this pass because
// both feed f.highlights, which refreshHighlights filled with whichever
// this same choice named. Order is load-bearing — gutter, recolor, then
// wrap markers; the selection/cursor passes below win over all three.
switch (pane.colorAlgo()) {
// Every mode, not just `.tty`: `recolorAnsi` translates a row's
// colour anchor through the same slide the edit buffer applied to
// its text, so leaving a shell for normal mode no longer drains
// the screen of colour. A row the user typed has no ANSI and is
// skipped there, which is why this needs no mode test.
// `body` is the very text printed above: `recolorAnsi` pairs its
// graphemes with the cells that spelled them, which is the only way
// to stay on the right glyph when the emulator and this surface
// disagree about how many columns a cluster is worth.
.tty => if (p.settings.colors) term_pane.recolorAnsi(p, pane, r, tx, tw, body_h, body),
.source, .diff => {
const f = &pane.file.?;
file_pane.drawGutter(p, pane, r, tx, tw, body_h, active);
if (p.settings.colors) file_pane.recolorSyntax(p, pane, f, r, tx, tw, body_h);
file_pane.drawWrapMarkers(p, pane, r, tx, tw, body_h, pane_bg);
},
.none => {},
}
// mouse selections (pane-local coords), one pass per button — later
// buttons win on overlap. A left .done stays highlighted after release;
// middle/right .done are transient (they fire their action on release).
//
// Which button drew a sweep is worth seeing, so each gets the theme's
// selection tinted toward one of the theme's own syntax accents: three
// colours that are visibly not each other on a dark theme and on a
// light one, without asking a theme to name three more. A QUARTER of
// the accent, which is the mix of a mix — at a half, an accent as
// bright as the theme's text lands on top of sel_fg and the selected
// text stops being readable on a couple of dozen generated themes.
// `num` gives way to `comment` when a theme paints numbers and strings
// alike — the shipped helix theme does, 24 of the generated ones do —
// because two buttons landing on one colour is the whole thing this
// avoids.
// ponytail: 20 of the 228 themes colour two of these three scopes the
// same anyway and still collapse two buttons. Upgrade path is to walk
// the theme for a third colour far enough from the other two, rather
// than naming the scopes here.
const accent2 = if (std.mem.eql(u8, &th.num, &th.str)) th.comment else th.num;
const sel_btn = [3][3]u8{
mix(th.sel_bg, mix(th.sel_bg, th.kw)),
mix(th.sel_bg, mix(th.sel_bg, th.str)),
mix(th.sel_bg, mix(th.sel_bg, accent2)),
};
if (p.look_hover_preview) |preview| {
if (preview.pane == id and preview.serial == pane.serial) {
// Preserve body ink, then let every real user selection below
// win over this quiet affordance.
const preview_bg = mix(page_rgb, mix(page_rgb, th.sel_bg));
if (preview.file_word) |word|
file_pane.paintWordSelection(p, pane, r, word.row, word.lo, word.hi, preview_bg)
else if (preview.sel) |sel|
if (@max(sel.r0, sel.r1) >= BOX_H)
paintPointerSelection(s, pane, r, tx, tw, tag_y, body_y, sel, preview_bg, null);
}
}
const modal_hover = if (p.look_hover_preview) |preview|
preview.pane == id and preview.serial == pane.serial and preview.sel == null and preview.file_word == null
else
false;
for (pane.sel, 0..) |sl, b| {
if (sl.state == .none) continue;
if (sl.state == .done and b != 0) continue;
paintPointerSelection(s, pane, r, tx, tw, tag_y, body_y, sl, sel_btn[b], th.sel_fg);
}
// modal line selection (helix `x`): whole body rows, normal mode only
if ((pane.mode == .normal or modal_hover) and pane.msel.active) {
const hover_only = modal_hover and pane.mode != .normal;
const modal_bg = if (hover_only)
mix(page_rgb, mix(page_rgb, th.sel_bg))
else
th.sel_bg;
const lo = @min(pane.msel.r0, pane.msel.r1);
const hi = @max(pane.msel.r0, pane.msel.r1);
var row: u16 = BOX_H; // never paint the tag row
while (row < r.h) : (row += 1) {
// walked by SCREEN row and asked what LINE each one shows,
// because a wrapped line is several rows. wrapAt degenerates to
// `off + row` when nothing wrapped, which is what this was.
const ar = pane.wrapAt(@as(i32, row) - @as(i32, BOX_H)).line;
if (ar < lo or ar > hi) continue;
var col: u16 = if (pane.file != null) config.PREFIX_W else 0;
while (col < tw) : (col += 1) {
const cell = s.at(tx + col, body_y + row - BOX_H);
cell.default = false;
cell.style.bg = .{ .rgb = modal_bg };
if (!hover_only) cell.style.fg = .{ .rgb = th.sel_fg };
}
}
}
// modal char selection (helix `v`): stream-shaped anchor..head
// highlight. The EXTRA cursors are the same shape drawn dimmer, and
// each of them also paints its own cursor cell bright: there is one
// hardware cursor and the primary owns it, so a secondary cursor has
// to be a cell colour or it is invisible.
// The extra cursors show in INSERT mode too — that is exactly when you
// need to see where your typing is landing — while the primary's
// selection highlight stays normal-mode-only, as it always was.
// ...and an armed `s`/`S` shows the primary WHATEVER shape it is, even
// though the pane is in insert mode for the tag and even when the match
// is a single cell: the hardware cursor is off in the tag, so a preview
// that leans on it shows every match except the one you are on.
const preview = selRegexArmed(pane) != null;
const show_prim = (pane.mode == .normal and pane.vsel.active) or preview or
(modal_hover and pane.vsel.active);
const show_extra = pane.mode != .tty and pane.nsel > 0;
if (show_prim or show_extra) {
const vpfx: i32 = if (pane.file != null) config.PREFIX_W else 0;
var si: usize = 0;
while (si <= pane.nsel) : (si += 1) {
const primary = si == pane.nsel;
if (if (primary) !show_prim else !show_extra) continue;
const sr = if (primary) SelRange{
.row = pane.cur_row,
.col = pane.cur_col,
.arow = if (pane.vsel.active) pane.vsel.row else pane.cur_row,
.acol = if (pane.vsel.active) pane.vsel.col else pane.cur_col,
} else pane.sels[si];
const bnd = cellBounds(sr);
const hover_only = primary and modal_hover and pane.mode != .normal and !preview;
// an extra cursor is the selection colour turned down: the
// highlight pulled halfway back to the page, so the primary is
// the one that reads as "here" at a glance. On a light theme
// that dims toward white rather than toward black, which is the
// same statement. The INK stays put — helix's two selection
// styles differ in their background too, and dimming both ends
// walks the text and its cell toward each other until neither
// is readable on the themes whose selection is already close to
// the page.
const bg = if (hover_only)
mix(page_rgb, mix(page_rgb, th.sel_bg))
else if (primary)
th.sel_bg
else
mix(th.sel_bg, page_rgb);
// ...and this walks SCREEN rows too, asking the map which line
// and which byte column of it each one shows. Unwrapped that is
// `off + vr` / `hscroll`, i.e. the arithmetic this was, and it
// is also the cheaper loop: a linewise selection over a whole
// file used to iterate once per LINE to reject all but a
// screenful of them.
var vr: i32 = 0;
while (vr + @as(i32, BOX_H) < @as(i32, r.h)) : (vr += 1) {
const w = pane.wrapAt(vr);
if (w.line < bnd.lo_row or w.line > bnd.hi_row) continue;
const visible_line = modal.lineSlice(body, @intCast(vr));
const cstart: i32 = if (w.line == bnd.lo_row)
(if (pane.file != null)
file_pane.displayOffset(pane, w.line, w.at, bnd.lo_col)
else
file_pane.lineDisplayOffset(visible_line, @intCast(@max(0, w.at)), @intCast(@max(0, bnd.lo_col)))) + vpfx
else
vpfx;
const cend: i32 = if (w.line == bnd.hi_row)
(if (pane.file != null)
file_pane.displayEndOffset(pane, w.line, w.at, bnd.hi_col)
else
file_pane.lineDisplayEndOffset(visible_line, @intCast(@max(0, w.at)), @intCast(@max(0, bnd.hi_col)))) + vpfx
else
@as(i32, tw) - 1;
var col: i32 = @max(cstart, vpfx);
while (col <= cend and col < tw) : (col += 1) {
const cell = s.at(tx + @as(u16, @intCast(col)), body_y + @as(u16, @intCast(vr)));
cell.default = false;
cell.style.bg = .{ .rgb = bg };
if (!hover_only) cell.style.fg = .{ .rgb = th.sel_fg };
}
}
if (primary and !preview and !hover_only) continue; // the hardware cursor IS the primary's
if (hover_only) continue; // quiet preview preserves the source ink
const cw = pane.wrapRow(sr.row, sr.col);
const crow = cw.row + @as(i32, BOX_H);
const ccol = (if (pane.file != null)
file_pane.displayOffset(pane, sr.row, cw.at, sr.col)
else
file_pane.lineDisplayOffset(
modal.lineSlice(body, @intCast(@max(0, cw.row))),
@intCast(@max(0, cw.at)),
@intCast(@max(0, sr.col)),
)) + vpfx;
if (crow >= BOX_H and crow < @as(i32, r.h) and ccol >= vpfx and ccol < tw) {
const cell = s.at(tx + @as(u16, @intCast(ccol)), body_y + @as(u16, @intCast(crow - BOX_H)));
cell.default = false;
cell.style.bg = .{ .rgb = th.sel_fg };
cell.style.fg = .{ .rgb = th.sel_bg };
}
}
}
// cursor: tracks the shell cursor until pinned by a click or a key
// (the tag cursor above wins while the tag is focused)
if (active and !pane.tag_edit) {
const cur = term_pane.gridCursor(pane);
if (pane.mode != .tty) {
const goff = term_pane.gridOffset(pane);
const crow = if (pane.cur_pinned) pane.cur_row else pane.surfRow(@as(i32, @intCast(cur.y)) + goff);
const ccol = if (pane.cur_pinned) pane.cur_col else @as(i32, @intCast(cur.x));
// which ROW of a wrapped line the cursor is on, and which byte
// column that row starts at — `off`/`hscroll` when nothing
// wrapped, so this is the same two lines it always was
const cwp = pane.wrapRow(crow, ccol);
const prow = cwp.row + @as(i32, BOX_H);
// Files store source-byte columns; the Surface stores display
// cells, so account for every expanded tab before the cursor.
const cx = if (pane.file != null)
@as(i32, config.PREFIX_W) + file_pane.displayOffset(pane, crow, cwp.at, ccol)
else if (pane.cur_pinned)
file_pane.lineDisplayOffset(
modal.lineSlice(body, @intCast(@max(0, cwp.row))),
@intCast(@max(0, cwp.at)),
@intCast(@max(0, ccol)),
)
else
ccol;
if (prow >= BOX_H and cx >= 0 and prow < r.h and cx < tw)
s.cursor = .{ .x = tx + @as(u16, @intCast(cx)), .y = body_y + @as(u16, @intCast(prow - BOX_H)), .bar = pane.mode == .insert };
} else if (cur.y + BOX_H < r.h and cur.x < tw) {
s.cursor = .{ .x = tx + cur.x, .y = body_y + cur.y, .bar = pane.mode == .insert };
}
}
// gutter below the tag row: scrollbar track + thumb. (The move box on
// the tag row itself is drawn up with the tag, since it now carries
// the mode and belongs with the rest of that row.)
//
// The bar is ONE column: column 1 is the track/thumb, column 2 is the
// pane's own background. That second fill is not optional — render()
// pre-fills the whole surface with scroll_track so the gaps between
// panes read as chrome, so a column left unpainted here keeps the
// track colour and the bar looks two wide again.
//
// The move box above stays the full GUTTER even though only half of it
// has ink in it. It is a target you drag, not a gauge you read, and its
// whole width is the affordance — the step where the box ends and the
// narrower bar begins is the one place on screen that says those are
// two different pieces of chrome.
//
// Nothing here touches layout or hit-testing: the gutter is still
// config.GUTTER columns and the click handlers still scroll on any of
// them, so the blank column is still live. Only the ink narrowed.
if (r.h > BOX_H) {
s.fill(r.x, body_y, 1, r.h - BOX_H, .{ .bg = .{ .rgb = chrome.scroll_track } });
s.fill(r.x + 1, body_y, 1, r.h - BOX_H, .{ .bg = pane_bg });
const sb: struct { total: usize, offset: usize, len: usize } = if (pane.file) |*f| .{
.total = file_pane.nlines(p.gpa, f),
.offset = f.scroll,
.len = pane.rows,
} else if (pane.pdfPage()) |page| .{
.total = if (comptime pdf_enabled) pane.pdf.?.page_count else 1,
.offset = page,
.len = 1,
} else blk: {
const gsb = term_pane.scrollbar(pane);
break :blk .{ .total = gsb.total, .offset = gsb.offset, .len = gsb.len };
};
const track_h: usize = r.h - BOX_H;
const total = if (sb.total == 0) 1 else sb.total;
const len = @max(1, (track_h * @max(1, sb.len)) / total);
const pos = (track_h * sb.offset) / total;
var sy: usize = pos;
while (sy < track_h and sy < pos + len) : (sy += 1) {
s.fill(r.x, body_y + @as(u16, @intCast(sy)), 1, 1, .{ .bg = .{ .rgb = chrome.scroll_thumb } });
}
}
}
pub fn appendImagePlace(p: *Pardes, place: ImagePlace) bool {
const s = &p.surface;
if (s.nimages == s.images.len) {
const old_len = s.images.len;
const new_len = @max(@as(usize, 4), std.math.mul(usize, @max(old_len, 1), 2) catch return false);
const grown = if (old_len == 0)
p.gpa.alloc(?ImagePlace, new_len) catch return false
else
p.gpa.realloc(s.images, new_len) catch return false;
@memset(grown[old_len..], null);
s.images = grown;
}
s.images[s.nimages] = place;
s.nimages += 1;
return true;
}
/// The pane body as text. Image: blank rows (the picture draws over it).
/// File: line-numbered content from f.scroll.
/// Terminal: viewport rows, padded to the grid height, prompt rows blanked
/// outside tty mode (OSC 133), the edit buffer standing in for the shell
/// rows it covers — which is where a buffer holding more lines than those
/// rows pushes the output below it down the screen.
fn bodyText(p: *Pardes, arena: std.mem.Allocator, pane: *Pane) ![]const u8 {
if (pane.image != null) {
const buf = try arena.alloc(u8, pane.rows -| 1);
@memset(buf, '\n');
return buf;
}
if (hasPdf(pane)) {
if (comptime pdf_enabled) return pdf_pane.visibleText(
&pane.pdf.?,
p.pdf_gpa,
arena,
pane.rows -| BOX_H,
);
unreachable;
}
if (pane.file) |*f| return file_pane.bodyText(arena, pane, f, p.settings.wrap);
return term_pane.bodyText(arena, pane);
}
};
test "Esc alternates between two panes of the SAME kind" {
if (platform == .web) return;
const gpa = std.testing.allocator;
// An ABSOLUTE boot path, the way main.zig resolves argv: a file pane's
// directory is its path's dirname, and a relative one leaves nothing for
// the look below to resolve against.
var cwdbuf: [4096]u8 = undefined;
const cwd = std.mem.span(@as([*:0]u8, @ptrCast(std.c.getcwd(&cwdbuf, cwdbuf.len) orelse return)));
var pathbuf: [4096]u8 = undefined;
const boot = try std.fmt.bufPrint(&pathbuf, "{s}/mise.toml", .{cwd});
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 40, .file = boot });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 40 } });
const a = p.active;
// A second FILE. This is the case the doc<->terminal hop Esc used to run
// could not do AT ALL: both panes are docs, so it had nothing of "the other
// kind" to reach and Esc did nothing.
p.runBuiltin(.Look, a, "", "build.zig");
p.sync();
const b = p.active;
try std.testing.expect(b != a);
try std.testing.expect(!p.panes[a].?.isTerminal() and !p.panes[b].?.isTerminal());
for (0..6) |_| {
const was = p.active;
p.update(.{ .key = .{ .cp = Key.escape } });
try std.testing.expectEqual(if (was == a) b else a, p.active);
}
}
test "Esc back into a tty leaves its view at the prompt" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell under the doc
const shell = p.active;
const sp = p.panes[shell].?;
try std.testing.expect(sp.isTerminal());
// A click pins the modal cursor — one of the several ordinary ways to get a
// pin, and the pin is what a shell's rows then scroll out from under.
const r = p.rects[shell];
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = r.x + config.GUTTER + 1, .row = r.y + BOX_H } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = r.x + config.GUTTER + 1, .row = r.y + BOX_H } });
try std.testing.expectEqual(shell, p.active);
p.update(.{ .key = .{ .cp = Key.escape, .shift = true } });
try std.testing.expectEqual(Mode.tty, sp.mode);
// tty mode follows output to the bottom, so a screenful and a half of it
// rides the view down and leaves that pin far up in the scrollback.
for (0..60) |i| {
var buf: [32]u8 = undefined;
p.update(.{ .output = .{ .pane = @intCast(shell), .bytes = std.fmt.bufPrint(&buf, "line {d}\r\n", .{i}) catch unreachable } });
}
p.sync();
const live = sp.vt.screens.active.pages.scrollbar().offset;
try std.testing.expect(live > 0);
p.update(.{ .key = .{ .cp = Key.escape, .shift = true } }); // out to the doc
try std.testing.expect(p.active != shell);
p.update(.{ .key = .{ .cp = Key.escape } }); // ...and back in
p.sync();
try std.testing.expectEqual(shell, p.active);
// The prompt is still on screen. Restoring the stale pin used to yank the
// view up to scrollback row 0, where it sat until the next keystroke's echo
// scrolled it back down — "type something and the tty jumps to the prompt".
try std.testing.expectEqual(live, sp.vt.screens.active.pages.scrollbar().offset);
}
test "Esc back into a file leaves its view where it was" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "src/allocators.zig" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell under the doc
const shell = p.active;
p.update(.{ .key = .{ .cp = Key.escape } }); // back onto the doc
p.sync();
const doc = p.active;
try std.testing.expect(doc != shell);
const dp = p.panes[doc].?;
try std.testing.expect(dp.file != null);
// Ride the cursor down until the view has scrolled: it now sits in the
// bottom band, which is exactly where a recenter is visible.
for (0..20) |_| p.update(.{ .key = .{ .cp = 'j' } });
p.sync();
const view = dp.file.?.scroll;
const row = dp.cur_row;
try std.testing.expect(view > 0);
p.update(.{ .key = .{ .cp = Key.escape } }); // out to the shell
p.sync();
try std.testing.expectEqual(shell, p.active);
p.update(.{ .key = .{ .cp = Key.escape } }); // ...and back
p.sync();
try std.testing.expectEqual(doc, p.active);
// Nothing moved. The old landing recentred the line under the cursor, so
// coming back repainted the whole screen to show what was already on it.
try std.testing.expectEqual(view, dp.file.?.scroll);
try std.testing.expectEqual(row, dp.cur_row);
// ...and the cursor is still on screen, which is all `.nearest` promises.
try std.testing.expect(dp.cur_row >= @as(i32, @intCast(view)));
try std.testing.expect(dp.cur_row < @as(i32, @intCast(view)) + @as(i32, dp.rows));
// The other arm still centres: a look target, a `:NN`, a search hit.
p.focusPaneLine(doc, .{ .line = @intCast(row + 1), .col = 1 }, .center);
try std.testing.expect(dp.file.?.scroll != view);
try std.testing.expectEqual(@as(usize, @intCast(row)) -| @as(usize, dp.rows) / 2, dp.file.?.scroll);
}
test "Shift-Esc in tty hops to the doc and leaves the shell in tty" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell under the doc
const shell = p.active;
const shell_pane = p.panes[shell].?;
try std.testing.expect(shell_pane.isTerminal());
// Shift-Esc still gets you IN, exactly as the configured Ctrl-key does.
const shift_esc: Key = .{ .cp = Key.escape, .shift = true };
p.update(.{ .key = shift_esc });
try std.testing.expectEqual(Mode.tty, shell_pane.mode);
// ...and out of tty it is Escape-in-normal-mode instead of a toggle: the
// doc takes focus and the shell KEEPS its tty mode, so coming back lands
// in the program you left rather than in normal mode on top of it.
p.update(.{ .key = shift_esc });
try std.testing.expect(p.active != shell);
try std.testing.expect(!p.panes[p.active].?.isTerminal());
try std.testing.expectEqual(Mode.tty, shell_pane.mode);
// The configured Ctrl-key is now the only thing that leaves tty in place.
p.update(.{ .key = .{ .cp = Key.escape, .shift = true } }); // back to the shell
try std.testing.expectEqual(shell, p.active);
p.update(.{ .key = .{ .cp = p.opts.tty_toggle, .ctrl = true } });
try std.testing.expectEqual(Mode.normal, shell_pane.mode);
try std.testing.expectEqual(shell, p.active);
}
test "hopping between two panes does not grow the jump stack" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell under the doc
const doc = 0;
const shell = p.active;
try std.testing.expect(shell != doc);
const depth = p.njumps;
// Esc is Last — the everyday two-pane hop. Each press used to
// append, so sixty-four of them left the stack remembering nothing else.
for (0..8) |_| {
const was = p.active;
p.update(.{ .key = .{ .cp = Key.escape } });
try std.testing.expect(p.active != was);
}
try std.testing.expectEqual(depth, p.njumps);
// ...and so are the other two ways to switch panes.
for (0..8) |_| {
const want = if (p.active == doc) shell else doc;
const dir: u21 = if (p.active == doc) 'j' else 'k';
p.update(.{ .key = .{ .cp = ' ' } });
p.update(.{ .key = .{ .cp = 'w' } });
p.update(.{ .key = .{ .cp = dir } });
try std.testing.expectEqual(want, p.active);
}
try std.testing.expectEqual(depth, p.njumps);
for (0..8) |_| {
const other = if (p.active == doc) shell else doc;
const r = p.rects[other];
p.update(.{ .mouse = .{ .button = .left, .kind = .press, .col = r.x + config.GUTTER + 1, .row = r.y + BOX_H + 1 } });
p.update(.{ .mouse = .{ .button = .left, .kind = .release, .col = r.x + config.GUTTER + 1, .row = r.y + BOX_H + 1 } });
try std.testing.expectEqual(other, p.active);
}
try std.testing.expectEqual(depth, p.njumps);
// The collapse must not eat history: Back still walks OUT of the ping-pong
// to the place before it, which is what makes the entry a cursor move
// rather than a deletion.
const before = p.active;
p.runBuiltin(.Back, p.active, "", null);
p.sync();
try std.testing.expect(p.active != before);
try std.testing.expectEqual(depth, p.njumps);
}
/// Drain the queue and say whether the shell was asked to do `want`.
fn drainedEffect(p: *Pardes, want: std.meta.Tag(Effect)) bool {
var seen = false;
while (p.nextEffect()) |effect| {
if (std.meta.activeTag(effect) == want) seen = true;
}
return seen;
}
test "only the SPC clipboard commands cross to the system clipboard" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
const pane = p.panes[0].?;
// An ordinary yank fills the DEFAULT REGISTER and asks the shell for
// nothing. This is the whole helix split, and the bug it closes: before
// it, every y/d/c mirrored out, so deleting one character threw away
// whatever the desktop was holding.
_ = drainedEffect(p, .set_clipboard);
p.update(.{ .key = .{ .cp = 'y' } });
try std.testing.expect(p.yank != null and p.yank.?.len > 0);
try std.testing.expect(!drainedEffect(p, .set_clipboard));
p.update(.{ .key = .{ .cp = 'd' } });
try std.testing.expect(!drainedEffect(p, .set_clipboard));
// `SPC y` is the one that does, and it puts the SAME text there that `y`
// put in the register — it is the ordinary yank path plus the mirror.
p.update(.{ .key = .{ .cp = ' ' } });
p.update(.{ .key = .{ .cp = 'y' } });
const yanked = p.yank orelse return error.MissingYank;
try std.testing.expect(drainedEffect(p, .set_clipboard));
// `SPC p` cannot read the clipboard itself: it ASKS, and the answer comes
// back as an ordinary paste event whenever (or never — a terminal may
// refuse the OSC 52 read, which is a no-op and not a hang).
const before = pane.file.?.content.len;
p.update(.{ .key = .{ .cp = ' ' } });
p.update(.{ .key = .{ .cp = 'p' } });
try std.testing.expect(p.clip_pending != null);
try std.testing.expect(drainedEffect(p, .read_clipboard));
try std.testing.expectEqual(before, pane.file.?.content.len); // nothing yet
p.update(.{ .paste = "PASTED" });
try std.testing.expect(p.clip_pending == null);
try std.testing.expect(std.mem.indexOf(u8, pane.file.?.content, "PASTED") != null);
// ...and it did NOT land in the register on its way past, nor echo back
// out to the clipboard it came from.
try std.testing.expectEqualStrings(yanked, p.yank orelse "");
try std.testing.expect(!drainedEffect(p, .set_clipboard));
// An UNSOLICITED paste — the outer terminal's bracketed paste, a Cmd-V —
// is the same event with no request behind it, and means paste after.
p.update(.{ .paste = "UNASKED" });
try std.testing.expect(std.mem.indexOf(u8, pane.file.?.content, "UNASKED") != null);
try std.testing.expectEqualStrings(yanked, p.yank orelse "");
// A request the shell never answers dies at the next keystroke rather
// than firing late into whatever pane is focused by then.
p.update(.{ .key = .{ .cp = ' ' } });
p.update(.{ .key = .{ .cp = 'P' } });
try std.testing.expect(p.clip_pending != null);
p.update(.{ .key = .{ .cp = 'l' } });
try std.testing.expect(p.clip_pending == null);
}
/// Every `.write` a keystroke produced, joined — what the pane's program would
/// actually have read off its pty.
fn drainWrites(p: *Pardes, buf: []u8) []const u8 {
var n: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |w| {
const b = w.bytes.slice();
if (n + b.len > buf.len) break;
@memcpy(buf[n..][0..b.len], b);
n += b.len;
},
else => {},
};
return buf[0..n];
}
test "Ctrl-V and Ctrl-Shift-V paste into the program a tty pane is running" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 80, .rows = 24 });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
var buf: [256]u8 = undefined;
_ = drainWrites(p, &buf);
const pane = p.panes[0].?;
term_pane.enterTty(p, 0);
try std.testing.expectEqual(Mode.tty, pane.mode);
p.setYank("one\ntwo");
// Ctrl-V types the DEFAULT REGISTER at the program. Unbracketed, so the
// newline becomes Enter's \r — a raw \n would run `one` and leave `two`
// half-typed.
p.update(.{ .key = .{ .cp = 'v', .ctrl = true } });
try std.testing.expectEqualStrings("one\rtwo", drainWrites(p, &buf));
// and it asked the desktop for nothing on the way
try std.testing.expect(p.clip_pending == null);
// Under mode 2004 the same keystroke brackets instead, which is what stops
// readline from RUNNING a multi-line paste.
pane.vt.modes.set(.bracketed_paste, true);
p.update(.{ .key = .{ .cp = 'v', .ctrl = true } });
try std.testing.expectEqualStrings("\x1b[200~one\ntwo\x1b[201~", drainWrites(p, &buf));
// Ctrl-Shift-V is the other store: it ASKS, types nothing yet, and the
// answer lands at the program rather than in an edit buffer.
pane.vt.modes.set(.bracketed_paste, false);
p.update(.{ .key = .{ .cp = 'v', .ctrl = true, .shift = true } });
try std.testing.expect(p.clip_pending != null);
try std.testing.expectEqualStrings("", drainWrites(p, &buf));
p.update(.{ .paste = "from-desktop" });
try std.testing.expectEqualStrings("from-desktop", drainWrites(p, &buf));
// the clipboard did not clobber the register on its way through
try std.testing.expectEqualStrings("one\ntwo", p.yank orelse "");
}
test "an unasked desktop paste reaches a tty pane's program, not its buffer" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 80, .rows = 24 });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
var buf: [256]u8 = undefined;
_ = drainWrites(p, &buf);
const pane = p.panes[0].?;
term_pane.enterTty(p, 0);
// No request behind it: the window manager's own paste, or SDL answering a
// Ctrl-Shift-V the desktop handled. It still has to reach the shell.
p.update(.{ .paste = "ls -la" });
try std.testing.expectEqualStrings("ls -la", drainWrites(p, &buf));
// and nothing was typed into an overlay the pty does not know about
try std.testing.expect(pane.ovl == null);
}
test "a paste larger than the effect ring reaches the program whole and in order" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 80, .rows = 24 });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
const buf = try gpa.alloc(u8, 1 << 20);
defer gpa.free(buf);
_ = drainWrites(p, buf);
term_pane.enterTty(p, 0);
// Bigger than `effect_cap * 64` (256 KiB), which is where the ring stops
// taking chunks: the tail used to be refused and the program saw 256 KiB of
// a 300 KiB paste with nothing said. Position-dependent bytes, so a
// reordered or duplicated chunk fails as loudly as a missing one.
const text = try gpa.alloc(u8, 300 * 1024);
defer gpa.free(text);
for (text, 0..) |*c, i| c.* = 'a' + @as(u8, @intCast(i % 26));
p.update(.{ .paste = text });
try std.testing.expectEqualSlices(u8, text, drainWrites(p, buf));
// ...and the core is not still holding a copy afterwards
try std.testing.expectEqual(@as(usize, 0), p.pending_write_bytes);
}
test "a bracketed paste larger than the ring still closes its bracket" {
if (platform == .web) return;
if (comptime !term_pane.enabled) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 80, .rows = 24 });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
const buf = try gpa.alloc(u8, 1 << 20);
defer gpa.free(buf);
_ = drainWrites(p, buf);
term_pane.enterTty(p, 0);
// The program asks for brackets, so `typeToTty` emits marker, text, marker.
// The CLOSING one is queued last and was therefore the first casualty of a
// full ring: the program stayed in paste mode and read every later
// keystroke as pasted text. Worse than losing the bytes.
p.update(.{ .output = .{ .pane = 0, .bytes = "\x1b[?2004h" } });
try std.testing.expect(term_pane.bracketedPaste(p.panes[0].?));
const text = try gpa.alloc(u8, 300 * 1024);
defer gpa.free(text);
@memset(text, 'z');
p.update(.{ .paste = text });
const got = drainWrites(p, buf);
try std.testing.expect(std.mem.startsWith(u8, got, "\x1b[200~"));
try std.testing.expect(std.mem.endsWith(u8, got, "\x1b[201~"));
try std.testing.expectEqualSlices(u8, text, got["\x1b[200~".len .. got.len - "\x1b[201~".len]);
}
test "pasted bytes still queued at shutdown are freed, not leaked" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .tty_only = true, .cols = 80, .rows = 24 });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
const buf = try gpa.alloc(u8, 1 << 20);
defer gpa.free(buf);
_ = drainWrites(p, buf);
term_pane.enterTty(p, 0);
const text = try gpa.alloc(u8, 300 * 1024);
defer gpa.free(text);
@memset(text, 'q');
p.update(.{ .paste = text });
// Parked and deliberately NOT drained — a session killed mid-paste. The
// copy is the core's, so `std.testing.allocator` fails this test through
// the `deinit` above if shutdown forgets it.
try std.testing.expect(p.pending_write_bytes > 0);
}
test "leaving tty hides the prompt and keeps the command typed at it" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } }); // a shell under the doc
const shell = p.active;
const sp = p.panes[shell].?;
try std.testing.expect(sp.isTerminal());
// Exactly what an OSC 133 shell draws: prompt, then the marker that says
// the rest of this row is the user's, then what they typed. One grid row.
p.update(.{ .output = .{
.pane = @intCast(shell),
.bytes = "\x1b]133;A\x1b\\user@box ~/src $ \x1b]133;B\x1b\\grep -rn TODO src/",
} });
p.sync();
const rowOf = struct {
fn at(pp: *Pardes, pane: *Pane, needle: []const u8) ?[]const u8 {
const rows = term_pane.shellRows(pp, pane) catch return null;
for (rows) |r| if (std.mem.indexOf(u8, r, needle) != null) return r;
return null;
}
}.at;
const bodyRowOf = struct {
fn at(pp: *Pardes, pane: *Pane, needle: []const u8) ?[]const u8 {
const body = term_pane.bodyText(pp.scratch.allocator(), pane) catch return null;
var it = std.mem.splitScalar(u8, body, '\n');
while (it.next()) |r| if (std.mem.indexOf(u8, r, needle) != null) return r;
return null;
}
}.at;
// The BODY is what you look at, and it follows the mode: in tty the pane
// is the program's own screen, so the prompt is there.
sp.mode = .tty;
try std.testing.expectEqualStrings(
"user@box ~/src $ grep -rn TODO src/",
bodyRowOf(p, sp, "grep") orelse return error.MissingPromptRow,
);
// Out of tty the prompt goes and the command stays — LEFT-HUGGED, so it
// lines up with the output below instead of sitting in a bay of blanks
// where the prompt used to be.
sp.mode = .normal;
try std.testing.expectEqualStrings(
"grep -rn TODO src/",
bodyRowOf(p, sp, "grep") orelse return error.MissingPromptRow,
);
// The MOTION SURFACE cuts either way, and deliberately: it is what the
// cursor moves over, and in tty mode nothing moves over it — the keys all
// belong to the program.
p.shell_rows.stale = true;
try std.testing.expectEqualStrings(
"grep -rn TODO src/",
rowOf(p, sp, "grep") orelse return error.MissingPromptRow,
);
// ...and a prompt with nothing typed at it yet is all chrome, so the whole
// row goes, which is what it has always done.
p.update(.{ .output = .{
.pane = @intCast(shell),
.bytes = "\r\n\x1b]133;A\x1b\\user@box ~/src $ \x1b]133;B\x1b\\",
} });
p.sync();
p.shell_rows.stale = true;
try std.testing.expect(rowOf(p, sp, "user@box") == null);
}
test "entering tty walks the shell cursor to the column clicked past the prompt" {
if (platform == .web) return;
const gpa = std.testing.allocator;
const p = try Pardes.init(gpa, .{ .cols = 80, .rows = 24, .file = "mise.toml" });
defer p.deinit();
p.update(.{ .resize = .{ .cols = 80, .rows = 24 } });
p.update(.{ .key = .{ .cp = 'n', .alt = true } });
const shell = p.active;
const sp = p.panes[shell].?;
p.update(.{ .output = .{
.pane = @intCast(shell),
.bytes = "\x1b]133;A;cl=line\x1b\\prompt> \x1b]133;B\x1b\\0123456789",
} });
p.sync();
sp.mode = .normal;
p.shell_rows.stale = true;
// The command shows LEFT-HUGGED, so its column 3 is the '3'...
const rows = try term_pane.shellRows(p, sp);
var row: i32 = 0;
const at = for (rows, 0..) |r, i| {
if (std.mem.indexOf(u8, r, "0123456789") != null) break i;
} else return error.MissingInputRow;
row = @intCast(at);
try std.testing.expectEqualStrings("0123456789", rows[at]);
// ...but the shell's own cursor lives on the real grid, eight cells
// further right, behind the prompt this pane is not showing.
sp.cur_row = row;
sp.cur_col = 3;
sp.cur_pinned = true;
while (p.nextEffect()) |_| {}
term_pane.enterTty(p, shell);
// The walk is arrow keys the shell understands. Seven lefts: readline's
// cursor sits past the '9' and the click was on the '3'.
var lefts: usize = 0;
var rights: usize = 0;
while (p.nextEffect()) |effect| switch (effect) {
.write => |wr| {
if (std.mem.eql(u8, wr.bytes.slice(), "\x1b[D")) lefts += 1;
if (std.mem.eql(u8, wr.bytes.slice(), "\x1b[C")) rights += 1;
},
else => {},
};
try std.testing.expectEqual(@as(usize, 0), rights);
try std.testing.expectEqual(@as(usize, 7), lefts);
}
// THE BOARD'S MEMORY PRESSURE, REPRODUCED ON AN ORDINARY NATIVE TARGET.
//
// These live in pardes.zig and not in limits.zig because every one of them
// drives `Pardes.init`: the table alone cannot say what a boot costs. The one
// test that needs nothing but the numbers — the desktop-capacity regression
// guard — stays in src/limits.zig.
//
// All three use the FixedBufferAllocator (or the accounting FailingAllocator)
// as the CORE'S OWN gpa and hand the same allocator to every `Options` arena,
// mirroring src/esp32p4.zig's `allocators.init(a)`: on the board every tier is a
// `StackFallbackAllocator` with a 4 KiB or zero buffer, so effectively all of
// it spills onto the single heap. Calling `allocators.init` here instead would
// hand a desktop build its 32 MiB static `.bss` tier and serve every request
// out of that, making a 384 KiB budget mean nothing.
/// The board grid. These mirror `pardes_config.esp32p4_cols/esp32p4_rows` (build.zig
/// defaults, read at src/esp32p4.zig:235) rather than reading them, because a
/// native build does not set the P4 options at all.
const board_cols: u16 = 56;
const board_rows: u16 = 14;
fn boardBudgetOptions(gpa: std.mem.Allocator, cols: u16, rows: u16) Options {
return .{
.cols = cols,
.rows = rows,
// No pty is spawned by a test host, but `tty_only` is the one-pane boot
// and therefore the closest a hosted build gets to the board's
// single-output-buffer boot.
.tty_only = true,
.frame_allocator = gpa,
.image_allocator = gpa,
.pdf_allocator = gpa,
.tree_sitter_allocator = gpa,
};
}
/// A boot and its teardown as one `!void` call. `checkAllAllocationFailures`
/// requires exactly that shape and `Pardes.init` returns `*Pardes` with a
/// `deinit` obligation, so the harness cannot call it directly.
fn bootAndTearDown(gpa: std.mem.Allocator, cols: u16, rows: u16) !void {
const p = try Pardes.init(gpa, boardBudgetOptions(gpa, cols, rows));
p.deinit();
}
// WHAT THE BOARD'S 384 KiB BUYS, CHECKED FROM A DESKTOP.
//
// What a hosted build CANNOT do is boot in 384 KiB, and the reason is not a
// capacity: `@sizeOf(Pane)` carries the ghostty-vt Terminal, 1.1 MiB of it, and
// what removes that on the board is `terminal_panes` — a CAPABILITY keyed on
// the platform (src/limits.zig says why it is not in the table). So there is no
// build option that turns a desktop into the board, and a test that pretended
// otherwise would be asserting a FixedBufferAllocator refuses a 2.2 MiB
// request. That was written, it asserted nothing, and it is gone.
//
// What a hosted build CAN check is every product the board's budget is spent
// on, because both factors are visible here: the board's CAPS are literals in
// src/limits.zig, and the ELEMENT SIZES are the same structs this target
// compiles (`Effect`, `Snapshot`, `Cell` and `PanelCellDiff` hold no pointers,
// so riscv32 and x86_64 agree about all four). That is the product a code
// change actually moves: nobody shrinks the board's heap, but somebody adds a
// `Buf(512)` arm to `Effect` and costs it 49 KiB it does not have.
//
// The caps are spelled as LITERALS rather than read from `limits`, because on
// this build `limits` holds the desktop numbers; these are the board's, they
// are its contract, and a derivation would agree with itself.
//
// MEASURED on x86_64-linux Debug at this commit: `@sizeOf(Effect)` 272,
// `@sizeOf(term_pane.Snapshot)` 56, `@sizeOf(Cell)` 26, `@sizeOf(PanelCellDiff)` 3 —
// so the three products are 34,816 + 1,792 + 43,120 = 79,728 bytes, a fifth of
// the heap, against bounds of 49,152 / 12,288 / 49,152 and a total of 196,608.
test "board heap: every inline ring the board pays for still fits its budget" {
const heap = limits.board_heap_bytes;
// THE EFFECT RING, the largest single inline cost in `Pardes` — 4096
// entries on a desktop is 1.09 MiB of the 1.14 MiB the struct occupies.
// The board holds 128 (src/limits.zig `effect_cap`).
const effect_ring = 128 * @sizeOf(Effect);
// ...and the undo history, the largest in `Pane` once the terminal is out:
// 16 snapshots on the board against 256 on a desktop.
const undo_history = 2 * 16 * @sizeOf(term_pane.Snapshot);
// ...and the three per-cell arrays the core owns at the board's own grid,
// which the next test pins the SHAPE of; this one pins the COST.
const grid = @as(usize, board_cols) * board_rows * (2 * @sizeOf(Cell) + @sizeOf(PanelCellDiff));
// Each of the three separately, so a failure names the one that grew
// instead of reporting a total nobody can attribute.
try std.testing.expect(effect_ring <= heap / 8);
try std.testing.expect(undo_history <= heap / 32);
try std.testing.expect(grid <= heap / 8);
// ...and together, against the half of the heap the firmware measured as
// available after its own .bss, stack and vaxis's two grids. Three eighths
// is what the individual bounds already allow; asserting the sum as well is
// what catches two of them growing a little each.
try std.testing.expect(effect_ring + undo_history + grid <= heap / 2);
}
// EVERY CELL IS PAID FOR FOUR TIMES on the board — vaxis's `Screen` and
// `InternalScreen`, and the core's `Surface.cells` and `presented_cells` — plus
// the core's per-cell diff classification. Two of those four are vaxis's and
// invisible from here; what this pins is the three buffers the CORE owns, so
// that adding a fourth core-owned per-cell array fails loudly instead of
// quietly costing the board another 20 KiB.
//
// MEASURED at this commit: `@sizeOf(Cell)` is 26 and `@sizeOf(PanelCellDiff)`
// is 3, so the core spends 55 bytes per cell — 43,120 bytes at the board's
// 56x14 grid, an eighth of the whole heap and the largest single grid-scaled
// cost in the program.
test "board heap: the core owns exactly three per-cell arrays" {
const per_cell = 2 * @sizeOf(Cell) + @sizeOf(PanelCellDiff);
// Five NAMES, three BUFFERS: `Surface.previous_cells` and
// `Surface.cell_diffs` are views published onto the two the core owns (see
// `render`), so they cost nothing. Counted by reflection because a fifth
// name is exactly the change this test exists to catch.
const grid_slices = comptime blk: {
var n: usize = 0;
for (@typeInfo(Pardes).@"struct".fields ++ @typeInfo(Surface).@"struct".fields) |f| {
const info = @typeInfo(f.type);
if (info != .pointer or info.pointer.size != .slice) continue;
if (info.pointer.child == Cell or info.pointer.child == PanelCellDiff) n += 1;
}
break :blk n;
};
try std.testing.expectEqual(@as(usize, 5), grid_slices);
// The diff array is only allocated for a transition that needs the previous
// grid, so the sequence here is the shortest one that makes all three real:
// boot, acknowledge, split with `vertical` armed, render.
const p = try Pardes.init(std.testing.allocator, .{ .cols = 60, .rows = 16, .tty_only = true });
defer p.deinit();
var frame: std.heap.ArenaAllocator = .init(std.testing.allocator);
defer frame.deinit();
const boot = try p.render(frame.allocator());
p.acknowledgePanelPresentation(boot.panelTracks());
p.settings.panel_transition = .vertical;
_ = try p.newShell(1, "");
try std.testing.expect(p.layoutSplitColumn(0, 1, false));
p.sync();
_ = frame.reset(.retain_capacity);
_ = try p.render(frame.allocator());
const cells = @as(usize, p.screen_w) * p.screen_h;
try std.testing.expectEqual(cells, p.surface.cells.len);
try std.testing.expectEqual(cells, p.presented_cells.len);
try std.testing.expectEqual(cells, p.panel_cell_diffs.len);
const owned = p.surface.cells.len * @sizeOf(Cell) +
p.presented_cells.len * @sizeOf(Cell) +
p.panel_cell_diffs.len * @sizeOf(PanelCellDiff);
try std.testing.expectEqual(cells * per_cell, owned);
// ...and the board's own grid has to leave the other seven eighths of the
// heap for everything else. 43,120 of 49,152 at the numbers above; a cell
// that grew by two bytes would spend the margin.
try std.testing.expect(@as(usize, board_cols) * board_rows * per_cell <=
limits.board_heap_bytes / 8);
}
// EVERY ALLOCATION IN A BOOT, FAILED IN TURN. Eight of them at this commit, so
// the sweep is eight boots and costs milliseconds. `checkAllAllocationFailures`
// is the whole test because it asserts precisely the three things that matter:
// a failed allocation surfaces `error.OutOfMemory` rather than being swallowed
// into a half-built instance, `allocated_bytes == freed_bytes` at that point
// (so the failure path needs no `deinit` and leaves nothing dangling), and the
// allocation count is deterministic.
test "board heap: every allocation failure during boot is a clean OutOfMemory" {
try std.testing.checkAllAllocationFailures(
std.testing.allocator,
bootAndTearDown,
.{ board_cols, board_rows },
);
}
|