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
|
/*
* tkTreeItem.c --
*
* This module implements items for treectrl widgets.
*
* Copyright (c) 2002-2005 Tim Baker
*
* RCS: @(#) $Id: tkTreeItem.c,v 1.36 2005/05/24 23:44:41 treectrl Exp $
*/
#include "tkTreeCtrl.h"
typedef struct Column Column;
typedef struct Item Item;
struct Column {
int cstate;
int neededWidth;
int neededHeight;
TreeStyle style;
Column *next;
};
struct Item {
int id; /* unique id */
int depth; /* tree depth (-1 for the unique root item) */
int neededHeight; /* miniumum height of this item (max of all columns) */
int fixedHeight; /* desired height of this item (0 for no-such-value) */
int numChildren;
int index; /* "row" in flattened tree */
int indexVis; /* visible "row" in flattened tree, -1 if invisible */
int state; /* STATE_xxx */
int isVisible; /* -visible option */
int hasButton; /* -button option */
Item *parent;
Item *firstChild;
Item *lastChild;
Item *prevSibling;
Item *nextSibling;
TreeItemDInfo dInfo; /* display info, or NULL */
TreeItemRInfo rInfo; /* range info, or NULL */
Column *columns;
};
#define ISROOT(i) ((i)->depth == -1)
#define ITEM_CONF_BUTTON 0x0001
#define ITEM_CONF_VISIBLE 0x0002
static Tk_OptionSpec itemOptionSpecs[] = {
{TK_OPTION_BOOLEAN, "-button", (char *) NULL, (char *) NULL,
"0", -1, Tk_Offset(Item, hasButton),
0, (ClientData) NULL, ITEM_CONF_BUTTON},
{TK_OPTION_BOOLEAN, "-visible", (char *) NULL, (char *) NULL,
"1", -1, Tk_Offset(Item, isVisible),
0, (ClientData) NULL, ITEM_CONF_VISIBLE},
{TK_OPTION_END, (char *) NULL, (char *) NULL, (char *) NULL,
(char *) NULL, 0, -1, 0, 0, 0}
};
/*****/
static Column *Column_Alloc(TreeCtrl *tree)
{
#ifdef ALLOC_HAX
Column *column = (Column *) AllocHax_Alloc(tree->allocData, sizeof(Column));
#else
Column *column = (Column *) ckalloc(sizeof(Column));
#endif
memset(column, '\0', sizeof(Column));
return column;
}
void TreeItemColumn_InvalidateSize(TreeCtrl *tree, TreeItemColumn column_)
{
Column *column = (Column *) column_;
column->neededWidth = column->neededHeight = -1;
}
int TreeItemColumn_NeededWidth(TreeCtrl *tree, TreeItem item_,
TreeItemColumn column_)
{
Item *item = (Item *) item_;
Column *self = (Column *) column_;
if (self->style != NULL)
return TreeStyle_NeededWidth(tree, self->style,
item->state | self->cstate);
return 0;
}
TreeStyle TreeItemColumn_GetStyle(TreeCtrl *tree, TreeItemColumn column)
{
return ((Column *) column)->style;
}
int TreeItemColumn_Index(TreeCtrl *tree, TreeItem item_, TreeItemColumn column_)
{
Item *item = (Item *) item_;
Column *column;
int i = 0;
column = item->columns;
while ((column != NULL) && (column != (Column *) column_)) {
i++;
column = column->next;
}
if (column == NULL)
panic("TreeItemColumn_Index: couldn't find the column\n");
return i;
}
void TreeItemColumn_ForgetStyle(TreeCtrl *tree, TreeItemColumn column_)
{
Column *self = (Column *) column_;
if (self->style != NULL) {
TreeStyle_FreeResources(tree, self->style);
self->style = NULL;
self->neededWidth = self->neededHeight = 0;
}
}
TreeItemColumn TreeItemColumn_GetNext(TreeCtrl *tree, TreeItemColumn column)
{
return (TreeItemColumn) ((Column *) column)->next;
}
Column *Column_FreeResources(TreeCtrl *tree, Column *self)
{
Column *next = self->next;
if (self->style != NULL)
TreeStyle_FreeResources(tree, self->style);
#ifdef ALLOC_HAX
AllocHax_Free(tree->allocData, (char *) self, sizeof(Column));
#else
WFREE(self, Column);
#endif
return next;
}
/*****/
static void Item_UpdateIndex(TreeCtrl *tree, Item *item, int *index,
int *indexVis)
{
Item *child;
int parentVis, parentOpen;
/* Also track max depth */
if (item->parent != NULL)
item->depth = item->parent->depth + 1;
else
item->depth = 0;
if (item->depth > tree->depth)
tree->depth = item->depth;
item->index = (*index)++;
item->indexVis = -1;
if (item->parent != NULL) {
parentOpen = (item->parent->state & STATE_OPEN) != 0;
parentVis = item->parent->indexVis != -1;
if (ISROOT(item->parent) && !tree->showRoot) {
parentOpen = TRUE;
parentVis = item->parent->isVisible;
}
if (parentVis && parentOpen && item->isVisible)
item->indexVis = (*indexVis)++;
}
child = item->firstChild;
while (child != NULL) {
Item_UpdateIndex(tree, child, index, indexVis);
child = child->nextSibling;
}
}
void Tree_UpdateItemIndex(TreeCtrl *tree)
{
Item *item = (Item *) tree->root;
int index = 1, indexVis = 0;
if (tree->debug.enable && tree->debug.data)
dbwin("Tree_UpdateItemIndex %s\n", Tk_PathName(tree->tkwin));
/* Also track max depth */
tree->depth = -1;
item->index = 0;
item->indexVis = -1;
if (tree->showRoot && item->isVisible)
item->indexVis = indexVis++;
item = item->firstChild;
while (item != NULL) {
Item_UpdateIndex(tree, item, &index, &indexVis);
item = item->nextSibling;
}
tree->itemVisCount = indexVis;
tree->updateIndex = 0;
}
static Item *Item_Alloc(TreeCtrl *tree)
{
#ifdef ALLOC_HAX
Item *item = (Item *) AllocHax_Alloc(tree->allocData, sizeof(Item));
#else
Item *item = (Item *) ckalloc(sizeof(Item));
#endif
memset(item, '\0', sizeof(Item));
if (Tk_InitOptions(tree->interp, (char *) item,
tree->itemOptionTable, tree->tkwin) != TCL_OK)
panic("Tk_InitOptions() failed in Item_Alloc()");
item->state =
STATE_OPEN |
STATE_ENABLED;
if (tree->gotFocus)
item->state |= STATE_FOCUS;
item->indexVis = -1;
Tree_AddItem(tree, (TreeItem) item);
return item;
}
static Item *Item_AllocRoot(TreeCtrl *tree)
{
Item *item;
item = Item_Alloc(tree);
item->depth = -1;
item->state |= STATE_ACTIVE;
return item;
}
TreeItemColumn TreeItem_GetFirstColumn(TreeCtrl *tree, TreeItem item)
{
return (TreeItemColumn) ((Item *) item)->columns;
}
int TreeItem_GetState(TreeCtrl *tree, TreeItem item_)
{
return ((Item *) item_)->state;
}
static int Column_ChangeState(TreeCtrl *tree, Item *item, Column *column,
int columnIndex, int stateOff, int stateOn)
{
int cstate, state;
int sMask, iMask = 0;
cstate = column->cstate;
cstate &= ~stateOff;
cstate |= stateOn;
if (cstate == column->cstate)
return 0;
state = item->state | column->cstate;
state &= ~stateOff;
state |= stateOn;
if (column->style != NULL) {
sMask = TreeStyle_ChangeState(tree, column->style,
item->state | column->cstate, state);
if (sMask) {
if (sMask & CS_LAYOUT)
Tree_InvalidateColumnWidth(tree, columnIndex);
iMask |= sMask;
}
if (iMask & CS_LAYOUT) {
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
}
if (iMask & CS_DISPLAY)
Tree_InvalidateItemDInfo(tree, (TreeItem) item, NULL);
}
column->cstate = cstate;
return iMask;
}
int TreeItem_ChangeState(TreeCtrl *tree, TreeItem item_, int stateOff,
int stateOn)
{
Item *item = (Item *) item_;
Column *column;
int columnIndex = 0, state, cstate;
int sMask, iMask = 0;
state = item->state;
state &= ~stateOff;
state |= stateOn;
if (state == item->state)
return 0;
column = item->columns;
while (column != NULL) {
if (column->style != NULL) {
cstate = item->state | column->cstate;
cstate &= ~stateOff;
cstate |= stateOn;
sMask = TreeStyle_ChangeState(tree, column->style,
item->state | column->cstate, cstate);
if (sMask) {
if (sMask & CS_LAYOUT)
Tree_InvalidateColumnWidth(tree, columnIndex);
iMask |= sMask;
}
}
columnIndex++;
column = column->next;
}
/* This item has a button */
if (item->hasButton && tree->showButtons
&& (!ISROOT(item) || tree->showRootButton)) {
Tk_Image image1, image2;
Pixmap bitmap1, bitmap2;
int butOpen, butClosed;
int themeOpen, themeClosed;
int w1, h1, w2, h2;
void *ptr1 = NULL, *ptr2 = NULL;
/*
* Compare the image/bitmap/theme/xlib button for the old state
* to the image/bitmap/theme/xlib button for the new state. Figure
* out if the size or appearance has changed.
*/
/* image > bitmap > theme > draw */
image1 = PerStateImage_ForState(tree, &tree->buttonImage, item->state, NULL);
if (image1 != NULL) {
Tk_SizeOfImage(image1, &w1, &h1);
ptr1 = image1;
}
if (ptr1 == NULL) {
bitmap1 = PerStateBitmap_ForState(tree, &tree->buttonBitmap, item->state, NULL);
if (bitmap1 != None) {
Tk_SizeOfBitmap(tree->display, bitmap1, &w1, &h1);
ptr1 = (void *) bitmap1;
}
}
if (ptr1 == NULL) {
if (tree->useTheme &&
TreeTheme_GetButtonSize(tree, Tk_WindowId(tree->tkwin),
(item->state & STATE_OPEN) != 0, &w1, &h1) == TCL_OK) {
ptr1 = (item->state & STATE_OPEN) ? &themeOpen : &themeClosed;
}
}
if (ptr1 == NULL) {
w1 = h1 = tree->buttonSize;
ptr1 = (item->state & STATE_OPEN) ? &butOpen : &butClosed;
}
/* image > bitmap > theme > draw */
image2 = PerStateImage_ForState(tree, &tree->buttonImage, state, NULL);
if (image2 != NULL) {
Tk_SizeOfImage(image2, &w2, &h2);
ptr2 = image2;
}
if (ptr2 == NULL) {
bitmap2 = PerStateBitmap_ForState(tree, &tree->buttonBitmap, state, NULL);
if (bitmap2 != None) {
Tk_SizeOfBitmap(tree->display, bitmap2, &w2, &h2);
ptr2 = (void *) bitmap2;
}
}
if (ptr2 == NULL) {
if (tree->useTheme &&
TreeTheme_GetButtonSize(tree, Tk_WindowId(tree->tkwin),
(state & STATE_OPEN) != 0, &w2, &h2) == TCL_OK) {
ptr2 = (state & STATE_OPEN) ? &themeOpen : &themeClosed;
}
}
if (ptr2 == NULL) {
w2 = h2 = tree->buttonSize;
ptr2 = (state & STATE_OPEN) ? &butOpen : &butClosed;
}
if ((w1 != w2) || (h1 != h2)) {
iMask |= CS_LAYOUT | CS_DISPLAY;
} else if (ptr1 != ptr2) {
iMask |= CS_DISPLAY;
}
}
if (iMask & CS_LAYOUT) {
TreeItem_InvalidateHeight(tree, item_);
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
}
if (iMask & CS_DISPLAY)
Tree_InvalidateItemDInfo(tree, item_, NULL);
item->state = state;
return iMask;
}
void TreeItem_Undefine(TreeCtrl *tree, TreeItem item_, int state)
{
Item *item = (Item *) item_;
Column *column = item->columns;
while (column != NULL) {
column->cstate &= ~state;
column = column->next;
}
item->state &= ~state;
}
int TreeItem_GetButton(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return item->hasButton;
}
int TreeItem_SetButton(TreeCtrl *tree, TreeItem item_, int hasButton)
{
Item *item = (Item *) item_;
return item->hasButton = hasButton;
}
int TreeItem_GetDepth(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
#if 0
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
#endif
return item->depth;
}
int TreeItem_SetDepth(TreeCtrl *tree, TreeItem item_, int depth)
{
Item *item = (Item *) item_;
return item->depth = depth;
}
int TreeItem_GetID(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return item->id;
}
int TreeItem_SetID(TreeCtrl *tree, TreeItem item_, int id)
{
Item *item = (Item *) item_;
return item->id = id;
}
int TreeItem_GetOpen(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (item->state & STATE_OPEN) != 0;
}
int TreeItem_SetOpen(TreeCtrl *tree, TreeItem item_, int isOpen)
{
Item *item = (Item *) item_;
if (isOpen)
item->state |= STATE_OPEN;
else
item->state &= ~STATE_OPEN;
return isOpen;
}
int TreeItem_GetSelected(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (item->state & STATE_SELECTED) != 0;
}
int TreeItem_SetSelected(TreeCtrl *tree, TreeItem item_, int isSelected)
{
Item *item = (Item *) item_;
if (isSelected)
item->state |= STATE_SELECTED;
else
item->state &= ~STATE_SELECTED;
return isSelected;
}
TreeItem TreeItem_SetFirstChild(TreeCtrl *tree, TreeItem item_,
TreeItem firstChild)
{
Item *item = (Item *) item_;
return (TreeItem) (item->firstChild = (Item *) firstChild);
}
TreeItem TreeItem_GetFirstChild(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (TreeItem) item->firstChild;
}
TreeItem TreeItem_SetLastChild(TreeCtrl *tree, TreeItem item_,
TreeItem lastChild)
{
Item *item = (Item *) item_;
return (TreeItem) (item->lastChild = (Item *) lastChild);
}
TreeItem TreeItem_GetLastChild(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (TreeItem) item->lastChild;
}
TreeItem TreeItem_SetParent(TreeCtrl *tree, TreeItem item_,
TreeItem parent)
{
Item *item = (Item *) item_;
return (TreeItem) (item->parent = (Item *) parent);
}
TreeItem TreeItem_GetParent(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (TreeItem) item->parent;
}
TreeItem TreeItem_SetNextSibling(TreeCtrl *tree, TreeItem item_,
TreeItem nextSibling)
{
Item *item = (Item *) item_;
return (TreeItem) (item->nextSibling = (Item *) nextSibling);
}
TreeItem TreeItem_GetNextSibling(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (TreeItem) item->nextSibling;
}
TreeItem TreeItem_NextSiblingVisible(TreeCtrl *tree, TreeItem item)
{
item = TreeItem_GetNextSibling(tree, item);
while (item != NULL) {
if (TreeItem_ReallyVisible(tree, item))
return item;
item = TreeItem_GetNextSibling(tree, item);
}
return NULL;
}
TreeItem TreeItem_SetPrevSibling(TreeCtrl *tree, TreeItem item_,
TreeItem prevSibling)
{
Item *item = (Item *) item_;
return (TreeItem) (item->prevSibling = (Item *) prevSibling);
}
TreeItem TreeItem_GetPrevSibling(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return (TreeItem) item->prevSibling;
}
void TreeItem_SetDInfo(TreeCtrl *tree, TreeItem item_, TreeItemDInfo dInfo)
{
Item *item = (Item *) item_;
item->dInfo = dInfo;
}
TreeItemDInfo TreeItem_GetDInfo(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return item->dInfo;
}
void TreeItem_SetRInfo(TreeCtrl *tree, TreeItem item_, TreeItemRInfo rInfo)
{
Item *item = (Item *) item_;
item->rInfo = rInfo;
}
TreeItemRInfo TreeItem_GetRInfo(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
return item->rInfo;
}
TreeItem TreeItem_Next(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
if (item->firstChild != NULL)
return (TreeItem) item->firstChild;
if (item->nextSibling != NULL)
return (TreeItem) item->nextSibling;
while (1) {
item = item->parent;
if (item == NULL)
break;
if (item->nextSibling != NULL)
return (TreeItem) item->nextSibling;
}
return NULL;
}
TreeItem TreeItem_NextVisible(TreeCtrl *tree, TreeItem item)
{
item = TreeItem_Next(tree, item);
while (item != NULL) {
if (TreeItem_ReallyVisible(tree, item))
return item;
item = TreeItem_Next(tree, item);
}
return NULL;
}
TreeItem TreeItem_Prev(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
Item *walk;
if (item->parent == NULL) /* root */
return NULL;
walk = item->parent;
if (item->prevSibling) {
walk = item->prevSibling;
while (walk->lastChild != NULL)
walk = walk->lastChild;
}
return (TreeItem) walk;
}
TreeItem TreeItem_PrevVisible(TreeCtrl *tree, TreeItem item)
{
item = TreeItem_Prev(tree, item);
while (item != NULL) {
if (TreeItem_ReallyVisible(tree, item))
return item;
item = TreeItem_Prev(tree, item);
}
return NULL;
}
void TreeItem_ToIndex(TreeCtrl *tree, TreeItem item_, int *index,
int *indexVis)
{
Item *item = (Item *) item_;
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
if (index != NULL) (*index) = item->index;
if (indexVis != NULL) (*indexVis) = item->indexVis;
}
static int IndexFromList(int listIndex, int objc, Tcl_Obj **objv,
CONST char **indexNames)
{
Tcl_Obj *elemPtr;
int index;
if (listIndex >= objc)
return -1;
elemPtr = objv[listIndex];
if (Tcl_GetIndexFromObj(NULL, elemPtr, indexNames, NULL, 0, &index)
!= TCL_OK)
return -1;
return index;
}
/*
%W index all
%W index "active MODIFIERS"
%W index "anchor MODIFIERS"
%W index "nearest x y MODIFIERS"
%W index "root MODIFIERS"
%W index "first ?visible? MODIFIERS"
%W index "last ?visible? MODIFIERS"
%W index "rnc row col MODIFIERS"
%W index "ID MODIFIERS"
MODIFIERS:
above
below
left
right
top
bottom
leftmost
rightmost
next ?visible?
prev ?visible?
parent
firstchild ?visible?
lastchild ?visible?
child N ?visible?
nextsibling ?visible?
prevsibling ?visible?
sibling N ?visible?
Examples:
%W index "first visible firstchild"
%W index "first visible firstchild visible"
%W index "nearest x y nextsibling visible"
*/
int TreeItem_FromObj(TreeCtrl *tree, Tcl_Obj *objPtr, TreeItem *itemPtr,
int flags)
{
Tcl_Interp *interp = tree->interp;
int objc;
int index, listIndex, id;
Tcl_HashEntry *hPtr;
Tcl_Obj **objv, *elemPtr;
Item *item = NULL;
static CONST char *indexName[] = {
"active", "all", "anchor", "first", "last",
"nearest", "rnc", "root", (char *) NULL
};
enum indexEnum {
INDEX_ACTIVE, INDEX_ALL, INDEX_ANCHOR, INDEX_FIRST, INDEX_LAST,
INDEX_NEAREST, INDEX_RNC, INDEX_ROOT
} ;
static CONST char *modifiers[] = {
"above", "below", "bottom", "child",
"firstchild", "lastchild", "left", "leftmost", "next", "nextsibling",
"parent", "prev", "prevsibling", "right", "rightmost", "sibling",
"top", "visible", (char *) NULL
};
enum modEnum {
TMOD_ABOVE, TMOD_BELOW, TMOD_BOTTOM, TMOD_CHILD, TMOD_FIRSTCHILD,
TMOD_LASTCHILD, TMOD_LEFT, TMOD_LEFTMOST, TMOD_NEXT, TMOD_NEXTSIBLING,
TMOD_PARENT, TMOD_PREV, TMOD_PREVSIBLING, TMOD_RIGHT, TMOD_RIGHTMOST,
TMOD_SIBLING, TMOD_TOP, TMOD_VISIBLE
};
static int modArgs[] = {
1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1
};
if (Tcl_ListObjGetElements(NULL, objPtr, &objc, &objv) != TCL_OK)
goto baditem;
if (objc == 0)
goto baditem;
listIndex = 0;
elemPtr = objv[listIndex++];
if (Tcl_GetIndexFromObj(NULL, elemPtr, indexName, NULL, 0, &index)
== TCL_OK) {
switch ((enum indexEnum) index) {
case INDEX_ACTIVE:
{
item = (Item *) tree->activeItem;
break;
}
case INDEX_ALL:
{
if (!(flags & IFO_ALLOK)) {
Tcl_AppendResult(interp,
"can't specify \"all\" for this command", NULL);
return TCL_ERROR;
}
if (objc > 1)
goto baditem;
(*itemPtr) = ITEM_ALL;
return TCL_OK;
}
case INDEX_ANCHOR:
{
item = (Item *) tree->anchorItem;
break;
}
case INDEX_FIRST:
{
item = (Item *) tree->root;
if (IndexFromList(listIndex, objc, objv,
modifiers) == TMOD_VISIBLE) {
if (!item->isVisible)
item = NULL;
else if (!tree->showRoot)
item = (Item *) TreeItem_NextVisible(tree, (TreeItem) item);
listIndex++;
}
break;
}
case INDEX_LAST:
{
item = (Item *) tree->root;
while (item->lastChild) {
item = item->lastChild;
}
if (IndexFromList(listIndex, objc, objv,
modifiers) == TMOD_VISIBLE) {
if (!((Item *) tree->root)->isVisible)
item = NULL; /* nothing is visible */
else if (item == (Item *) tree->root && !tree->showRoot)
item = NULL; /* no item but root, not visible */
else if (!TreeItem_ReallyVisible(tree, (TreeItem) item))
item = (Item *) TreeItem_PrevVisible(tree,
(TreeItem) item);
listIndex++;
}
break;
}
case INDEX_NEAREST:
{
int x, y;
if (objc < 3)
goto baditem;
if (Tcl_GetIntFromObj(NULL, objv[listIndex++], &x) != TCL_OK)
goto baditem;
if (Tcl_GetIntFromObj(NULL, objv[listIndex++], &y) != TCL_OK)
goto baditem;
item = (Item *) Tree_ItemUnderPoint(tree, &x, &y, TRUE);
break;
}
case INDEX_RNC:
{
int row, col;
if (objc < 3)
goto baditem;
if (Tcl_GetIntFromObj(NULL, objv[listIndex++], &row) != TCL_OK)
goto baditem;
if (Tcl_GetIntFromObj(NULL, objv[listIndex++], &col) != TCL_OK)
goto baditem;
item = (Item *) Tree_RNCToItem(tree, row, col);
break;
}
case INDEX_ROOT:
{
item = (Item *) tree->root;
break;
}
}
} else if (tree->itemPrefixLen) {
char *end, *t = Tcl_GetString(elemPtr);
if (strncmp(t, tree->itemPrefix, tree->itemPrefixLen) != 0)
goto baditem;
t += tree->itemPrefixLen;
id = strtoul(t, &end, 10);
if ((end == t) || (*end != '\0'))
goto baditem;
hPtr = Tcl_FindHashEntry(&tree->itemHash, (char *) id);
if (!hPtr) {
if (!(flags & IFO_NULLOK))
goto noitem;
(*itemPtr) = NULL;
return TCL_OK;
}
item = (Item *) Tcl_GetHashValue(hPtr);
} else if (Tcl_GetIntFromObj(NULL, elemPtr, &id) == TCL_OK) {
hPtr = Tcl_FindHashEntry(&tree->itemHash, (char *) id);
if (!hPtr) {
if (!(flags & IFO_NULLOK))
goto noitem;
(*itemPtr) = NULL;
return TCL_OK;
}
item = (Item *) Tcl_GetHashValue(hPtr);
} else {
goto baditem;
}
/* This means a valid specification was given, but there is no such item */
if (item == NULL) {
if (!(flags & IFO_NULLOK))
goto noitem;
(*itemPtr) = (TreeItem) item;
return TCL_OK;
}
for (; listIndex < objc; /* nothing */) {
int nextIsVisible = FALSE;
elemPtr = objv[listIndex];
if (Tcl_GetIndexFromObj(interp, elemPtr, modifiers, "modifier", 0,
&index) != TCL_OK)
return TCL_ERROR;
if (objc - listIndex < modArgs[index])
goto baditem;
if (IndexFromList(listIndex + modArgs[index], objc, objv,
modifiers) == TMOD_VISIBLE)
nextIsVisible = TRUE;
switch ((enum modEnum) index) {
case TMOD_ABOVE:
{
item = (Item *) Tree_ItemAbove(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_BELOW:
{
item = (Item *) Tree_ItemBelow(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_BOTTOM:
{
item = (Item *) Tree_ItemBottom(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_CHILD:
{
int n;
if (Tcl_GetIntFromObj(interp, objv[listIndex + 1],
&n) != TCL_OK)
return TCL_ERROR;
item = item->firstChild;
if (nextIsVisible) {
while (item != NULL) {
if (TreeItem_ReallyVisible(tree, (TreeItem) item))
if (n-- <= 0)
break;
item = item->nextSibling;
}
} else {
while ((n-- > 0) && (item != NULL))
item = item->nextSibling;
}
break;
}
case TMOD_FIRSTCHILD:
{
item = item->firstChild;
if (nextIsVisible) {
while ((item != NULL)
&& !TreeItem_ReallyVisible(tree, (TreeItem) item))
item = item->nextSibling;
}
break;
}
case TMOD_LASTCHILD:
{
item = item->lastChild;
if (nextIsVisible) {
while ((item != NULL)
&& !TreeItem_ReallyVisible(tree, (TreeItem) item))
item = item->prevSibling;
}
break;
}
case TMOD_LEFT:
{
item = (Item *) Tree_ItemLeft(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_LEFTMOST:
{
item = (Item *) Tree_ItemLeftMost(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_NEXT:
{
if (nextIsVisible)
item = (Item *) TreeItem_NextVisible(tree, (TreeItem) item);
else
item = (Item *) TreeItem_Next(tree, (TreeItem) item);
break;
}
case TMOD_NEXTSIBLING:
{
item = item->nextSibling;
if (nextIsVisible) {
while ((item != NULL) && !TreeItem_ReallyVisible(tree, (TreeItem) item)) {
item = item->nextSibling;
}
}
break;
}
case TMOD_PARENT:
{
item = item->parent;
nextIsVisible = FALSE;
break;
}
case TMOD_PREV:
{
if (nextIsVisible)
item = (Item *) TreeItem_PrevVisible(tree, (TreeItem) item);
else
item = (Item *) TreeItem_Prev(tree, (TreeItem) item);
break;
}
case TMOD_PREVSIBLING:
{
item = item->prevSibling;
if (nextIsVisible) {
while ((item != NULL) && !TreeItem_ReallyVisible(tree, (TreeItem) item)) {
item = item->prevSibling;
}
}
break;
}
case TMOD_RIGHT:
{
item = (Item *) Tree_ItemRight(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_RIGHTMOST:
{
item = (Item *) Tree_ItemRightMost(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_SIBLING:
{
int n;
if (Tcl_GetIntFromObj(interp, objv[listIndex + 1], &n) != TCL_OK)
return TCL_ERROR;
item = item->parent;
if (item == NULL)
break;
item = item->firstChild;
if (nextIsVisible) {
while (item != NULL) {
if (TreeItem_ReallyVisible(tree, (TreeItem) item))
if (n-- <= 0)
break;
item = item->nextSibling;
}
} else {
while ((n-- > 0) && (item != NULL))
item = item->nextSibling;
}
break;
}
case TMOD_TOP:
{
item = (Item *) Tree_ItemTop(tree, (TreeItem) item);
nextIsVisible = FALSE;
break;
}
case TMOD_VISIBLE:
{
goto baditem;
}
}
if (item == NULL) {
if (!(flags & IFO_NULLOK))
goto noitem;
(*itemPtr) = (TreeItem) item;
return TCL_OK;
}
listIndex += modArgs[index];
if (nextIsVisible)
listIndex++;
}
if (ISROOT(item)) {
if ((flags & IFO_NOTROOT)) {
Tcl_AppendResult(interp,
"can't specify \"root\" for this command", NULL);
return TCL_ERROR;
}
}
(*itemPtr) = (TreeItem) item;
return TCL_OK;
baditem:
Tcl_AppendResult(interp, "bad item description \"", Tcl_GetString(objPtr),
"\"", NULL);
return TCL_ERROR;
noitem:
Tcl_AppendResult(interp, "item \"", Tcl_GetString(objPtr),
"\" doesn't exist", NULL);
return TCL_ERROR;
}
static void Item_Toggle(TreeCtrl *tree, Item *item, int stateOff, int stateOn)
{
int mask;
mask = TreeItem_ChangeState(tree, (TreeItem) item, stateOff, stateOn);
if (ISROOT(item) && !tree->showRoot)
return;
#if 0
/* Don't affect display if we weren't visible */
if (!TreeItem_ReallyVisible(tree, (TreeItem) item))
return;
/* Invalidate display info for this item, so it is redrawn later. */
Tree_InvalidateItemDInfo(tree, (TreeItem) item, NULL);
#endif
if (item->numChildren > 0) {
/* indexVis needs updating for all items after this one, if we
* have any visible children */
tree->updateIndex = 1;
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
/* Hiding/showing children may change the width of any column */
Tree_InvalidateColumnWidth(tree, -1);
}
/* If this item was previously onscreen, this call is repetitive. */
Tree_EventuallyRedraw(tree);
}
void TreeItem_OpenClose(TreeCtrl *tree, TreeItem item_, int mode, int recurse)
{
Item *item = (Item *) item_;
Item *child;
int stateOff = 0, stateOn = 0;
if (mode == -1) {
if (item->state & STATE_OPEN)
stateOff = STATE_OPEN;
else
stateOn = STATE_OPEN;
} else if (!mode && (item->state & STATE_OPEN))
stateOff = STATE_OPEN;
else if (mode && !(item->state & STATE_OPEN))
stateOn = STATE_OPEN;
if (stateOff != stateOn) {
TreeNotify_OpenClose(tree, item_, stateOn, TRUE);
Item_Toggle(tree, item, stateOff, stateOn);
TreeNotify_OpenClose(tree, item_, stateOn, FALSE);
}
if (recurse) {
for (child = item->firstChild; child != NULL; child = child->nextSibling)
TreeItem_OpenClose(tree, (TreeItem) child, mode, recurse);
}
}
void TreeItem_Delete(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
if (TreeItem_ReallyVisible(tree, item_))
Tree_InvalidateColumnWidth(tree, -1);
while (self->numChildren > 0)
TreeItem_Delete(tree, (TreeItem) self->firstChild);
TreeItem_RemoveFromParent(tree, item_);
Tree_RemoveItem(tree, item_);
TreeItem_FreeResources(tree, item_);
if (tree->activeItem == item_) {
tree->activeItem = tree->root;
TreeItem_ChangeState(tree, tree->activeItem, 0, STATE_ACTIVE);
}
if (tree->anchorItem == item_)
tree->anchorItem = tree->root;
if (tree->debug.enable && tree->debug.data)
Tree_Debug(tree);
}
void TreeItem_UpdateDepth(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Item *child;
if (ISROOT(self))
return;
if (self->parent != NULL)
self->depth = self->parent->depth + 1;
else
self->depth = 0;
child = self->firstChild;
while (child != NULL) {
TreeItem_UpdateDepth(tree, (TreeItem) child);
child = child->nextSibling;
}
}
void TreeItem_AddToParent(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Item *last;
/* If this is the new last child, redraw the lines of the previous
* sibling and all of its descendants so the line from the previous
* sibling reaches this item */
if ((self->prevSibling != NULL) &&
(self->nextSibling == NULL) &&
tree->showLines) {
last = self->prevSibling;
while (last->lastChild != NULL)
last = last->lastChild;
Tree_InvalidateItemDInfo(tree, (TreeItem) self->prevSibling,
(TreeItem) last);
}
tree->updateIndex = 1;
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
/* Tree_UpdateItemIndex() also recalcs depth, but in one of my demos
* I retrieve item depth during list creation. Since Tree_UpdateItemIndex()
* is slow I will keep depth up-to-date here. */
TreeItem_UpdateDepth(tree, item_);
Tree_InvalidateColumnWidth(tree, -1);
if (tree->debug.enable && tree->debug.data)
Tree_Debug(tree);
}
static void RemoveFromParentAux(TreeCtrl *tree, Item *self, int *index)
{
Item *child;
/* Invalidate display info. Don't free it because we may just be
* moving the item to a new parent. FIXME: if it is being moved,
* it might not actually need to be redrawn (just copied) */
if (self->dInfo != NULL)
Tree_InvalidateItemDInfo(tree, (TreeItem) self, NULL);
if (self->parent != NULL)
self->depth = self->parent->depth + 1;
else
self->depth = 0;
self->index = (*index)++;
self->indexVis = -1;
child = self->firstChild;
while (child != NULL) {
RemoveFromParentAux(tree, child, index);
child = child->nextSibling;
}
}
void TreeItem_RemoveFromParent(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Item *parent = self->parent;
Item *last;
int index = 0;
if (parent == NULL)
return;
/* If this is the last child, redraw the lines of the previous
* sibling and all of its descendants because the line from
* the previous sibling to us is now gone */
if ((self->prevSibling != NULL) &&
(self->nextSibling == NULL) &&
tree->showLines) {
last = self->prevSibling;
while (last->lastChild != NULL)
last = last->lastChild;
Tree_InvalidateItemDInfo(tree, (TreeItem) self->prevSibling,
(TreeItem) last);
}
tree->updateIndex = 1;
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
if (self->prevSibling)
self->prevSibling->nextSibling = self->nextSibling;
if (self->nextSibling)
self->nextSibling->prevSibling = self->prevSibling;
if (parent->firstChild == self) {
parent->firstChild = self->nextSibling;
if (!parent->firstChild)
parent->lastChild = NULL;
}
if (parent->lastChild == self)
parent->lastChild = self->prevSibling;
self->prevSibling = self->nextSibling = NULL;
self->parent = NULL;
parent->numChildren--;
/* Update depth, index and indexVis. Index is needed for some operations
* that use a range of items, such as delete. */
RemoveFromParentAux(tree, self, &index);
}
void TreeItem_RemoveColumn(TreeCtrl *tree, TreeItem item_, TreeItemColumn column_)
{
Item *self = (Item *) item_;
Column *column, *prev;
column = self->columns;
prev = NULL;
while (column != NULL) {
if (column == (Column *) column_) {
if (prev != NULL)
prev->next = column->next;
else
self->columns = column->next;
Column_FreeResources(tree, column);
break;
}
prev = column;
column = column->next;
}
if (column == NULL)
panic("TreeItem_RemoveColumn: can't find column");
}
void TreeItem_RemoveAllColumns(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Column *column = self->columns;
while (column != NULL) {
Column *next = column->next;
Column_FreeResources(tree, column);
column = next;
}
self->columns = NULL;
}
static Column *Item_CreateColumn(TreeCtrl *tree, Item *self, int columnIndex, int *isNew)
{
Column *column;
int i;
if (isNew != NULL) (*isNew) = FALSE;
column = self->columns;
if (column == NULL) {
column = Column_Alloc(tree);
column->neededWidth = column->neededHeight = -1;
self->columns = column;
if (isNew != NULL) (*isNew) = TRUE;
}
for (i = 0; i < columnIndex; i++) {
if (column->next == NULL) {
column->next = Column_Alloc(tree);
column->next->neededWidth = column->next->neededHeight = -1;
if (isNew != NULL) (*isNew) = TRUE;
}
column = column->next;
}
return column;
}
void TreeItem_MoveColumn(TreeCtrl *tree, TreeItem item, int columnIndex, int beforeIndex)
{
Item *self = (Item *) item;
Column *before = NULL, *move = NULL;
Column *prevM = NULL, *prevB = NULL;
Column *last = NULL, *prev, *walk;
int index = 0;
prev = NULL;
walk = self->columns;
while (walk != NULL) {
if (index == columnIndex) {
prevM = prev;
move = walk;
}
if (index == beforeIndex) {
prevB = prev;
before = walk;
}
prev = walk;
if (walk->next == NULL)
last = walk;
index++;
walk = walk->next;
}
if (move == NULL && before == NULL)
return;
if (move == NULL)
move = Column_Alloc(tree);
else {
if (before == NULL) {
prevB = Item_CreateColumn(tree, self, beforeIndex - 1, NULL);
last = prevB;
}
if (prevM == NULL)
self->columns = move->next;
else
prevM->next = move->next;
}
if (before == NULL) {
last->next = move;
move->next = NULL;
} else {
if (prevB == NULL)
self->columns = move;
else
prevB->next = move;
move->next = before;
}
}
void TreeItem_FreeResources(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Column *column;
column = self->columns;
while (column != NULL)
column = Column_FreeResources(tree, column);
if (self->dInfo != NULL)
Tree_FreeItemDInfo(tree, item_, NULL);
if (self->rInfo != NULL)
Tree_FreeItemRInfo(tree, item_);
#ifdef ALLOC_HAX
AllocHax_Free(tree->allocData, (char *) self, sizeof(Item));
#else
WFREE(self, Item);
#endif
}
int TreeItem_NeededHeight(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Column *column;
self->neededHeight = 0;
for (column = self->columns; column != NULL; column = column->next) {
if (column->style != NULL) {
self->neededHeight = MAX(self->neededHeight,
TreeStyle_NeededHeight(tree, column->style,
self->state | column->cstate));
}
}
return self->neededHeight;
}
int TreeItem_UseHeight(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
Column *column = item->columns;
TreeColumn treeColumn = tree->columns;
StyleDrawArgs drawArgs;
int height = 0;
drawArgs.tree = tree;
while (column != NULL) {
if (TreeColumn_Visible(treeColumn) && (column->style != NULL)) {
drawArgs.state = item->state | column->cstate;
drawArgs.style = column->style;
#ifdef LAYOUTHAX
drawArgs.indent = (treeColumn == tree->columnTree) ?
TreeItem_Indent(tree, item_) : 0;
#endif
if ((TreeColumn_FixedWidth(treeColumn) != -1) ||
TreeColumn_Squeeze(treeColumn)) {
drawArgs.width = TreeColumn_UseWidth(treeColumn);
#ifdef LAYOUTHAX
#else
if (treeColumn == tree->columnTree)
drawArgs.width -= TreeItem_Indent(tree, item_);
#endif
} else
drawArgs.width = -1;
height = MAX(height, TreeStyle_UseHeight(&drawArgs));
}
treeColumn = TreeColumn_Next(treeColumn);
column = column->next;
}
return height;
}
int TreeItem_Height(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
int buttonHeight = 0;
int useHeight;
if (!self->isVisible || (ISROOT(self) && !tree->showRoot))
return 0;
/* Update column + style + element sizes */
useHeight = TreeItem_UseHeight(tree, item_);
/* Can't have less height than our button */
if (tree->showButtons && self->hasButton && (!ISROOT(self) || tree->showRootButton)) {
buttonHeight = ButtonHeight(tree, self->state);
}
/* User specified a fixed height for this item */
if (self->fixedHeight > 0)
return MAX(self->fixedHeight, buttonHeight);
/* Fixed height of all items */
if (tree->itemHeight > 0)
return MAX(tree->itemHeight, buttonHeight);
/* Minimum height of all items */
if (tree->minItemHeight > 0)
useHeight = MAX(useHeight, tree->minItemHeight);
/* No fixed height specified */
return MAX(useHeight, buttonHeight);
}
void TreeItem_InvalidateHeight(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
if (self->neededHeight < 0)
return;
self->neededHeight = -1;
}
static Column *Item_FindColumn(TreeCtrl *tree, Item *self, int columnIndex)
{
Column *column;
int i = 0;
column = self->columns;
if (!column)
return NULL;
while (column != NULL && i < columnIndex) {
column = column->next;
i++;
}
return column;
}
static int Item_FindColumnFromObj(TreeCtrl *tree, Item *item, Tcl_Obj *obj,
Column **column, int *indexPtr)
{
TreeColumn treeColumn;
int columnIndex;
if (TreeColumn_FromObj(tree, obj, &treeColumn, CFO_NOT_ALL | CFO_NOT_NULL | CFO_NOT_TAIL) != TCL_OK)
return TCL_ERROR;
columnIndex = TreeColumn_Index(treeColumn);
(*column) = Item_FindColumn(tree, item, columnIndex);
if ((*column) == NULL) {
FormatResult(tree->interp,
"item %s%d doesn't have column %s%d",
tree->itemPrefix, item->id, tree->columnPrefix, columnIndex);
return TCL_ERROR;
}
if (indexPtr != NULL)
(*indexPtr) = columnIndex;
return TCL_OK;
}
TreeItemColumn TreeItem_FindColumn(TreeCtrl *tree, TreeItem item, int columnIndex)
{
return (TreeItemColumn) Item_FindColumn(tree, (Item *) item, columnIndex);
}
int TreeItem_ColumnFromObj(TreeCtrl *tree, TreeItem item, Tcl_Obj *obj, TreeItemColumn *columnPtr, int *indexPtr)
{
return Item_FindColumnFromObj(tree, (Item *) item, obj, (Column **) columnPtr, indexPtr);
}
static int Item_CreateColumnFromObj(TreeCtrl *tree, Item *item, Tcl_Obj *obj, Column **column, int *indexPtr)
{
TreeColumn treeColumn;
int columnIndex;
if (TreeColumn_FromObj(tree, obj, &treeColumn, CFO_NOT_ALL | CFO_NOT_NULL | CFO_NOT_TAIL) != TCL_OK)
return TCL_ERROR;
columnIndex = TreeColumn_Index(treeColumn);
(*column) = Item_CreateColumn(tree, item, columnIndex, NULL);
if (indexPtr != NULL)
(*indexPtr) = columnIndex;
return TCL_OK;
}
int TreeItem_Indent(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
int indent;
if (ISROOT(self))
return (tree->showRoot && tree->showButtons && tree->showRootButton) ? tree->useIndent : 0;
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
indent = tree->useIndent * self->depth;
if (tree->showRoot || tree->showButtons || tree->showLines)
indent += tree->useIndent;
if (tree->showRoot && tree->showButtons && tree->showRootButton)
indent += tree->useIndent;
return indent;
}
static void ItemDrawBackground(TreeCtrl *tree, TreeColumn treeColumn,
Item *item, Column *column, Drawable drawable, int x, int y, int width,
int height, int index)
{
GC gc = None;
gc = TreeColumn_BackgroundGC(treeColumn, index);
if (gc == None)
gc = Tk_3DBorderGC(tree->tkwin, tree->border, TK_3D_FLAT_GC);
XFillRectangle(tree->display, drawable, gc, x, y, width, height);
if (tree->backgroundImage != NULL) {
Tree_DrawTiledImage(tree, drawable, tree->backgroundImage, x, y,
x + width, y + height);
}
}
void TreeItem_Draw(TreeCtrl *tree, TreeItem item_, int x, int y,
int width, int height, Drawable drawable, int minX, int maxX, int index)
{
Item *self = (Item *) item_;
int indent, columnWidth, totalWidth;
Column *column;
StyleDrawArgs drawArgs;
TreeColumn treeColumn;
drawArgs.tree = tree;
drawArgs.drawable = drawable;
totalWidth = 0;
treeColumn = tree->columns;
column = self->columns;
while (treeColumn != NULL) {
if (!TreeColumn_Visible(treeColumn))
columnWidth = 0;
else if (tree->columnCountVis == 1)
columnWidth = width;
else
columnWidth = TreeColumn_UseWidth(treeColumn);
if (columnWidth > 0) {
if (treeColumn == tree->columnTree) {
indent = TreeItem_Indent(tree, item_);
#if 0
/* This means the tree lines/buttons don't share the item background color */
if ((x + totalWidth < maxX) &&
(x + totalWidth + indent > minX)) {
GC gc = Tk_3DBorderGC(tree->tkwin, tree->border, TK_3D_FLAT_GC);
XFillRectangle(tree->display, drawable, gc,
x + totalWidth, y, indent, height);
}
#endif
} else
indent = 0;
if ((x /* + indent */ + totalWidth < maxX) &&
(x + totalWidth + columnWidth > minX)) {
ItemDrawBackground(tree, treeColumn, self, column, drawable,
x + totalWidth /* + indent*/ , y,
columnWidth /* - indent */, height,
index);
if ((column != NULL) && (column->style != NULL)) {
drawArgs.state = self->state | column->cstate;
drawArgs.style = column->style;
#ifdef LAYOUTHAX
drawArgs.indent = indent;
drawArgs.x = x + totalWidth;
#else
drawArgs.x = x + indent + totalWidth;
#endif
drawArgs.y = y;
#ifdef LAYOUTHAX
drawArgs.width = columnWidth;
#else
drawArgs.width = columnWidth - indent;
#endif
drawArgs.height = height;
drawArgs.justify = TreeColumn_Justify(treeColumn);
TreeStyle_Draw(&drawArgs);
}
if (treeColumn == tree->columnTree) {
if (tree->showLines)
TreeItem_DrawLines(tree, item_, x, y, width, height,
drawable);
if (tree->showButtons)
TreeItem_DrawButton(tree, item_, x, y, width, height,
drawable);
}
}
totalWidth += columnWidth;
}
treeColumn = TreeColumn_Next(treeColumn);
if (column != NULL)
column = column->next;
}
}
void TreeItem_DrawLines(TreeCtrl *tree, TreeItem item_, int x, int y, int width, int height, Drawable drawable)
{
Item *self = (Item *) item_;
Item *item, *parent;
int indent, left, lineLeft, lineTop;
int hasPrev, hasNext;
int i, vert = 0;
indent = TreeItem_Indent(tree, item_);
/* Left edge of button/line area */
left = x + tree->columnTreeLeft + indent - tree->useIndent;
/* Left edge of vertical line */
lineLeft = left + (tree->useIndent - tree->lineThickness) / 2;
/* Top edge of horizontal line */
lineTop = y + (height - tree->lineThickness) / 2;
/* NOTE: The next three checks do not call TreeItem_ReallyVisible()
* since 'self' is ReallyVisible */
/* Check for ReallyVisible previous sibling */
item = self->prevSibling;
while ((item != NULL) && !item->isVisible)
item = item->prevSibling;
hasPrev = (item != NULL);
/* Check for ReallyVisible parent */
if ((self->parent != NULL) && (!ISROOT(self->parent) || tree->showRoot))
hasPrev = TRUE;
/* Check for ReallyVisible next sibling */
item = self->nextSibling;
while ((item != NULL) && !item->isVisible)
item = item->nextSibling;
hasNext = (item != NULL);
/* Option: Don't connect children of root item */
if ((self->parent != NULL) && ISROOT(self->parent) && !tree->showRootLines)
hasPrev = hasNext = FALSE;
/* Vertical line to parent and/or previous/next sibling */
if (hasPrev || hasNext) {
int top = y, bottom = y + height;
if (!hasPrev)
top = lineTop;
if (!hasNext)
bottom = lineTop + tree->lineThickness;
if (tree->lineStyle == LINE_STYLE_DOT) {
for (i = 0; i < tree->lineThickness; i++)
VDotLine(tree, drawable, tree->lineGC,
lineLeft + i,
top,
bottom);
} else
XFillRectangle(tree->display, drawable, tree->lineGC,
lineLeft,
top,
tree->lineThickness,
bottom - top);
/* Don't overlap horizontal line */
vert = tree->lineThickness;
}
/* Horizontal line to self */
if (hasPrev || hasNext) {
if (tree->lineStyle == LINE_STYLE_DOT) {
for (i = 0; i < tree->lineThickness; i++)
HDotLine(tree, drawable, tree->lineGC,
lineLeft + vert,
lineTop + i,
x + tree->columnTreeLeft + indent);
} else
XFillRectangle(tree->display, drawable, tree->lineGC,
lineLeft + vert,
lineTop,
left + tree->useIndent - (lineLeft + vert),
tree->lineThickness);
}
/* Vertical lines from ancestors to their next siblings */
for (parent = self->parent;
parent != NULL;
parent = parent->parent) {
lineLeft -= tree->useIndent;
/* Option: Don't connect children of root item */
if ((parent->parent != NULL) && ISROOT(parent->parent) && !tree->showRootLines)
continue;
/* Check for ReallyVisible next sibling */
item = parent->nextSibling;
while ((item != NULL) && !item->isVisible)
item = item->nextSibling;
if (item != NULL) {
if (tree->lineStyle == LINE_STYLE_DOT) {
for (i = 0; i < tree->lineThickness; i++)
VDotLine(tree, drawable, tree->lineGC,
lineLeft + i,
y,
y + height);
} else
XFillRectangle(tree->display, drawable, tree->lineGC,
lineLeft,
y,
tree->lineThickness,
height);
}
}
}
void TreeItem_DrawButton(TreeCtrl *tree, TreeItem item_, int x, int y, int width, int height, Drawable drawable)
{
Item *self = (Item *) item_;
int indent, left, lineLeft, lineTop;
int buttonLeft, buttonTop, w1;
int macoffset = 0;
Tk_Image image;
Pixmap bitmap;
if (!self->hasButton)
return;
if (ISROOT(self) && !tree->showRootButton)
return;
#if defined(MAC_TCL) || defined(MAC_OSX_TK)
/* QuickDraw on Mac is offset by one pixel in both x and y. */
macoffset = 1;
#endif
indent = TreeItem_Indent(tree, item_);
/* Left edge of button/line area */
left = x + tree->columnTreeLeft + indent - tree->useIndent;
image = PerStateImage_ForState(tree, &tree->buttonImage, self->state, NULL);
if (image != NULL) {
int imgW, imgH;
Tk_SizeOfImage(image, &imgW, &imgH);
Tk_RedrawImage(image, 0, 0, imgW, imgH, drawable,
left + (tree->useIndent - imgW) / 2,
y + (height - imgH) / 2);
return;
}
bitmap = PerStateBitmap_ForState(tree, &tree->buttonBitmap, self->state, NULL);
if (bitmap != None) {
int bmpW, bmpH;
int bx, by;
Tk_SizeOfBitmap(tree->display, bitmap, &bmpW, &bmpH);
bx = left + (tree->useIndent - bmpW) / 2;
by = y + (height - bmpH) / 2;
Tree_DrawBitmap(tree, bitmap, drawable, NULL, NULL,
0, 0, (unsigned int) bmpW, (unsigned int) bmpH,
bx, by);
return;
}
if (tree->useTheme) {
int bw, bh;
if (TreeTheme_GetButtonSize(tree, drawable, self->state & STATE_OPEN,
&bw, &bh) == TCL_OK) {
if (TreeTheme_DrawButton(tree, drawable, self->state & STATE_OPEN,
left + (tree->useIndent - bw) / 2, y + (height - bh) / 2,
bw, bh) == TCL_OK) {
return;
}
}
}
w1 = tree->buttonThickness / 2;
/* Left edge of vertical line */
/* Make sure this matches TreeItem_DrawLines() */
lineLeft = left + (tree->useIndent - tree->buttonThickness) / 2;
/* Top edge of horizontal line */
/* Make sure this matches TreeItem_DrawLines() */
lineTop = y + (height - tree->buttonThickness) / 2;
buttonLeft = left + (tree->useIndent - tree->buttonSize) / 2;
buttonTop = y + (height - tree->buttonSize) / 2;
/* Erase button background */
XFillRectangle(tree->display, drawable,
Tk_3DBorderGC(tree->tkwin, tree->border, TK_3D_FLAT_GC),
buttonLeft + tree->buttonThickness,
buttonTop + tree->buttonThickness,
tree->buttonSize - tree->buttonThickness,
tree->buttonSize - tree->buttonThickness);
/* Draw button outline */
XDrawRectangle(tree->display, drawable, tree->buttonGC,
buttonLeft + w1,
buttonTop + w1,
tree->buttonSize - tree->buttonThickness + macoffset,
tree->buttonSize - tree->buttonThickness + macoffset);
/* Horizontal '-' */
XFillRectangle(tree->display, drawable, tree->buttonGC,
buttonLeft + tree->buttonThickness * 2,
lineTop,
tree->buttonSize - tree->buttonThickness * 4,
tree->buttonThickness);
if (!(self->state & STATE_OPEN)) {
/* Finish '+' */
XFillRectangle(tree->display, drawable, tree->buttonGC,
lineLeft,
buttonTop + tree->buttonThickness * 2,
tree->buttonThickness,
tree->buttonSize - tree->buttonThickness * 4);
}
}
void TreeItem_UpdateWindowPositions(TreeCtrl *tree, TreeItem item_,
int x, int y, int width, int height)
{
Item *self = (Item *) item_;
int indent, columnWidth, totalWidth;
Column *column;
StyleDrawArgs drawArgs;
TreeColumn treeColumn;
drawArgs.tree = tree;
drawArgs.drawable = None;
totalWidth = 0;
treeColumn = tree->columns;
column = self->columns;
while ((column != NULL) && (treeColumn != NULL)) {
if (!TreeColumn_Visible(treeColumn))
columnWidth = 0;
else if (tree->columnCountVis == 1)
columnWidth = width;
else
columnWidth = TreeColumn_UseWidth(treeColumn);
if (columnWidth > 0) {
if (treeColumn == tree->columnTree)
indent = TreeItem_Indent(tree, item_);
else
indent = 0;
if ((column != NULL) && (column->style != NULL)) {
drawArgs.state = self->state | column->cstate;
drawArgs.style = column->style;
#ifdef LAYOUTHAX
drawArgs.indent = indent;
drawArgs.x = x + totalWidth;
#else
drawArgs.x = x + indent + totalWidth;
#endif
drawArgs.y = y;
#ifdef LAYOUTHAX
drawArgs.width = columnWidth;
#else
drawArgs.width = columnWidth - indent;
#endif
drawArgs.height = height;
drawArgs.justify = TreeColumn_Justify(treeColumn);
TreeStyle_UpdateWindowPositions(&drawArgs);
}
totalWidth += columnWidth;
}
treeColumn = TreeColumn_Next(treeColumn);
column = column->next;
}
}
void TreeItem_HideWindows(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
Column *column = self->columns;
while (column != NULL) {
if (column->style != NULL) {
TreeStyle_HideWindows(tree, column->style);
}
column = column->next;
}
}
int TreeItem_ReallyVisible(TreeCtrl *tree, TreeItem item_)
{
Item *self = (Item *) item_;
#if 0
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
return self->indexVis != -1;
#else
if (!tree->updateIndex)
return self->indexVis != -1;
if (!self->isVisible)
return 0;
if (self->parent == NULL)
return ISROOT(self) ? tree->showRoot : 0;
if (ISROOT(self->parent)) {
if (!self->parent->isVisible)
return 0;
if (!tree->showRoot)
return 1;
if (!(self->parent->state & STATE_OPEN))
return 0;
}
if (!self->parent->isVisible || !(self->parent->state & STATE_OPEN))
return 0;
return TreeItem_ReallyVisible(tree, (TreeItem) self->parent);
#endif
}
TreeItem TreeItem_RootAncestor(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
while (item->parent != NULL)
item = item->parent;
return (TreeItem) item;
}
int TreeItem_IsAncestor(TreeCtrl *tree, TreeItem item1, TreeItem item2)
{
if (item1 == item2)
return 0;
while (item2 && item2 != item1)
item2 = (TreeItem) ((Item *) item2)->parent;
return item2 != NULL;
}
Tcl_Obj *TreeItem_ToObj(TreeCtrl *tree, TreeItem item_)
{
if (tree->itemPrefixLen) {
char buf[100 + TCL_INTEGER_SPACE];
(void) sprintf(buf, "%s%d", tree->itemPrefix, ((Item *) item_)->id);
return Tcl_NewStringObj(buf, -1);
}
return Tcl_NewIntObj(((Item *) item_)->id);
}
static int Item_Configure(TreeCtrl *tree, Item *item, int objc,
Tcl_Obj *CONST objv[])
{
Tk_SavedOptions savedOptions;
int error;
Tcl_Obj *errorResult = NULL;
int mask;
for (error = 0; error <= 1; error++) {
if (error == 0) {
if (Tk_SetOptions(tree->interp, (char *) item, tree->itemOptionTable,
objc, objv, tree->tkwin, &savedOptions, &mask) != TCL_OK) {
mask = 0;
continue;
}
/* xxx */
Tk_FreeSavedOptions(&savedOptions);
break;
} else {
errorResult = Tcl_GetObjResult(tree->interp);
Tcl_IncrRefCount(errorResult);
Tk_RestoreSavedOptions(&savedOptions);
/* xxx */
Tcl_SetObjResult(tree->interp, errorResult);
Tcl_DecrRefCount(errorResult);
return TCL_ERROR;
}
}
if (mask & ITEM_CONF_BUTTON)
Tree_InvalidateItemDInfo(tree, (TreeItem) item, NULL);
if (mask & ITEM_CONF_VISIBLE) {
/* May change the width of any column */
Tree_InvalidateColumnWidth(tree, -1);
/* If this is the last child, redraw the lines of the previous
* sibling and all of its descendants because the line from
* the previous sibling to us is appearing/disappearing */
if ((item->prevSibling != NULL) &&
(item->nextSibling == NULL) &&
tree->showLines) {
Item *last = item->prevSibling;
while (last->lastChild != NULL)
last = last->lastChild;
Tree_InvalidateItemDInfo(tree,
(TreeItem) item->prevSibling,
(TreeItem) last);
}
tree->updateIndex = 1;
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
}
return TCL_OK;
}
static int ItemElementCmd(ClientData clientData, Tcl_Interp *interp, int objc,
Tcl_Obj *CONST objv[])
{
TreeCtrl *tree = (TreeCtrl *) clientData;
static CONST char *commandNames[] = { "actual", "cget", "configure", (char *) NULL };
enum { COMMAND_ACTUAL, COMMAND_CGET, COMMAND_CONFIGURE };
int index;
int columnIndex;
Column *column;
Item *item;
if (Tcl_GetIndexFromObj(interp, objv[3], commandNames, "command", 0,
&index) != TCL_OK)
return TCL_ERROR;
if (TreeItem_FromObj(tree, objv[4], (TreeItem *) &item, 0) != TCL_OK)
return TCL_ERROR;
if (Item_FindColumnFromObj(tree, item, objv[5], &column, &columnIndex) != TCL_OK)
return TCL_ERROR;
if (column->style == NULL) {
FormatResult(interp,
"item %s%d column %s%d has no style",
tree->itemPrefix, item->id,
tree->columnPrefix, TreeColumn_GetID(Tree_FindColumn(tree, columnIndex)));
return TCL_ERROR;
}
switch (index) {
/* T item element actual I C E option */
case COMMAND_ACTUAL:
{
if (objc != 8) {
Tcl_WrongNumArgs(tree->interp, 4, objv,
"item column element option");
return TCL_ERROR;
}
return TreeStyle_ElementActual(tree, column->style,
item->state | column->cstate,
objv[6], objv[7]);
}
/* T item element cget I C E option */
case COMMAND_CGET:
{
if (objc != 8) {
Tcl_WrongNumArgs(tree->interp, 4, objv,
"item column element option");
return TCL_ERROR;
}
return TreeStyle_ElementCget(tree, (TreeItem) item,
(TreeItemColumn) column, column->style, objv[6], objv[7]);
}
/* T item element configure I C E ... */
case COMMAND_CONFIGURE:
{
int result, eMask;
result = TreeStyle_ElementConfigure(tree, (TreeItem) item,
(TreeItemColumn) column, column->style, objv[6],
objc - 7, (Tcl_Obj **) objv + 7, &eMask);
if (eMask != 0) {
if (eMask & CS_DISPLAY)
Tree_FreeItemDInfo(tree, (TreeItem) item, NULL);
if (eMask & CS_LAYOUT) {
column->neededWidth = column->neededHeight = -1;
Tree_InvalidateColumnWidth(tree, columnIndex);
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
}
}
return result;
}
}
return TCL_OK;
}
static int ItemStyleCmd(ClientData clientData, Tcl_Interp *interp, int objc,
Tcl_Obj *CONST objv[])
{
TreeCtrl *tree = (TreeCtrl *) clientData;
static CONST char *commandNames[] = { "elements", "map", "set", (char *) NULL };
enum { COMMAND_ELEMENTS, COMMAND_MAP, COMMAND_SET };
int index;
Item *item;
if (Tcl_GetIndexFromObj(interp, objv[3], commandNames, "command", 0,
&index) != TCL_OK) {
return TCL_ERROR;
}
if (TreeItem_FromObj(tree, objv[4], (TreeItem *) &item, 0) != TCL_OK) {
return TCL_ERROR;
}
switch (index) {
/* T item style elements I C */
case COMMAND_ELEMENTS:
{
Column *column;
int columnIndex;
if (objc != 6) {
Tcl_WrongNumArgs(interp, 4, objv, "item column");
return TCL_ERROR;
}
if (Item_FindColumnFromObj(tree, item, objv[5], &column, &columnIndex) != TCL_OK) {
return TCL_ERROR;
}
if (column->style == NULL) {
FormatResult(interp,
"item %s%d column %s%d has no style",
tree->itemPrefix, item->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, columnIndex)));
return TCL_ERROR;
}
TreeStyle_ListElements(tree, column->style);
break;
}
/* T item style map I C S map */
case COMMAND_MAP:
{
TreeStyle style;
Column *column;
int columnIndex;
int objcM;
Tcl_Obj **objvM;
if (objc != 8) {
Tcl_WrongNumArgs(interp, 4, objv, "item column style map");
return TCL_ERROR;
}
if (Item_CreateColumnFromObj(tree, item, objv[5], &column, &columnIndex) != TCL_OK)
return TCL_ERROR;
if (TreeStyle_FromObj(tree, objv[6], &style) != TCL_OK)
return TCL_ERROR;
if (column->style != NULL) {
if (Tcl_ListObjGetElements(interp, objv[7], &objcM, &objvM) != TCL_OK)
return TCL_ERROR;
if (objcM & 1) {
FormatResult(interp, "list must contain even number of elements");
return TCL_ERROR;
}
if (TreeStyle_Remap(tree, column->style, style, objcM, objvM) != TCL_OK)
return TCL_ERROR;
} else
column->style = TreeStyle_NewInstance(tree, style);
Tree_InvalidateColumnWidth(tree, columnIndex);
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_FreeItemDInfo(tree, (TreeItem) item, NULL);
break;
}
/* T item style set I ?C? ?S? ?C S ...?*/
case COMMAND_SET:
{
TreeStyle style;
Column *column;
int i, columnIndex, length;
if (objc < 5) {
Tcl_WrongNumArgs(interp, 4, objv, "item ?column? ?style? ?column style ...?");
return TCL_ERROR;
}
if (objc == 5) {
Tcl_Obj *listObj = Tcl_NewListObj(0, NULL);
column = item->columns;
while (column != NULL) {
if (column->style != NULL)
Tcl_ListObjAppendElement(interp, listObj,
TreeStyle_ToObj(column->style));
else
Tcl_ListObjAppendElement(interp, listObj,
Tcl_NewObj());
column = column->next;
}
Tcl_SetObjResult(interp, listObj);
break;
}
if (objc == 6) {
if (Item_FindColumnFromObj(tree, item, objv[5], &column, NULL) != TCL_OK)
return TCL_ERROR;
if (column->style != NULL)
Tcl_SetObjResult(interp, TreeStyle_ToObj(column->style));
break;
}
if ((objc - 5) & 1)
return TCL_ERROR;
for (i = 5; i < objc; i += 2) {
if (Item_CreateColumnFromObj(tree, item, objv[i], &column, &columnIndex) != TCL_OK)
return TCL_ERROR;
(void) Tcl_GetStringFromObj(objv[i + 1], &length);
if (length == 0) {
if (column->style == NULL)
continue;
TreeItemColumn_ForgetStyle(tree, (TreeItemColumn) column);
} else {
if (TreeStyle_FromObj(tree, objv[i + 1], &style) != TCL_OK)
return TCL_ERROR;
TreeItemColumn_ForgetStyle(tree, (TreeItemColumn) column);
column->style = TreeStyle_NewInstance(tree, style);
}
Tree_InvalidateColumnWidth(tree, columnIndex);
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_FreeItemDInfo(tree, (TreeItem) item, NULL);
}
break;
}
}
return TCL_OK;
}
/* one per column per SortItem */
struct SortItem1
{
long longValue;
double doubleValue;
char *string;
};
/* one per Item */
struct SortItem
{
Item *item;
struct SortItem1 *item1;
Tcl_Obj *obj; /* TreeItem_ToObj() */
};
typedef struct SortData SortData;
/* Used to process -element option */
struct SortElement
{
TreeStyle style;
TreeElement elem;
int elemIndex;
};
/* One per TreeColumn */
struct SortColumn
{
int (*proc)(SortData *, struct SortItem *, struct SortItem *, int);
int sortBy;
int column;
int order;
Tcl_Obj *command;
struct SortElement elems[20];
int elemCount;
};
/* Data for sort as a whole */
struct SortData
{
TreeCtrl *tree;
struct SortItem *items;
struct SortItem1 *item1s; /* SortItem.item1 points in here */
#define MAX_SORT_COLUMNS 40
struct SortColumn columns[MAX_SORT_COLUMNS];
int count; /* max number of columns to compare */
int result;
};
/* from Tcl 8.4.0 */
static int DictionaryCompare(char *left, char *right)
{
Tcl_UniChar uniLeft, uniRight, uniLeftLower, uniRightLower;
int diff, zeros;
int secondaryDiff = 0;
while (1) {
if (isdigit(UCHAR(*right)) && isdigit(UCHAR(*left))) { /* INTL: digit */
/*
* There are decimal numbers embedded in the two
* strings. Compare them as numbers, rather than
* strings. If one number has more leading zeros than
* the other, the number with more leading zeros sorts
* later, but only as a secondary choice.
*/
zeros = 0;
while ((*right == '0') && (isdigit(UCHAR(right[1])))) {
right++;
zeros--;
}
while ((*left == '0') && (isdigit(UCHAR(left[1])))) {
left++;
zeros++;
}
if (secondaryDiff == 0) {
secondaryDiff = zeros;
}
/*
* The code below compares the numbers in the two
* strings without ever converting them to integers. It
* does this by first comparing the lengths of the
* numbers and then comparing the digit values.
*/
diff = 0;
while (1) {
if (diff == 0) {
diff = UCHAR(*left) - UCHAR(*right);
}
right++;
left++;
if (!isdigit(UCHAR(*right))) { /* INTL: digit */
if (isdigit(UCHAR(*left))) { /* INTL: digit */
return 1;
} else {
/*
* The two numbers have the same length. See
* if their values are different.
*/
if (diff != 0) {
return diff;
}
break;
}
} else if (!isdigit(UCHAR(*left))) { /* INTL: digit */
return -1;
}
}
continue;
}
/*
* Convert character to Unicode for comparison purposes. If either
* string is at the terminating null, do a byte-wise comparison and
* bail out immediately.
*/
if ((*left != '\0') && (*right != '\0')) {
left += Tcl_UtfToUniChar(left, &uniLeft);
right += Tcl_UtfToUniChar(right, &uniRight);
/*
* Convert both chars to lower for the comparison, because
* dictionary sorts are case insensitve. Covert to lower, not
* upper, so chars between Z and a will sort before A (where most
* other interesting punctuations occur)
*/
uniLeftLower = Tcl_UniCharToLower(uniLeft);
uniRightLower = Tcl_UniCharToLower(uniRight);
} else {
diff = UCHAR(*left) - UCHAR(*right);
break;
}
diff = uniLeftLower - uniRightLower;
if (diff) {
return diff;
} else if (secondaryDiff == 0) {
if (Tcl_UniCharIsUpper(uniLeft) &&
Tcl_UniCharIsLower(uniRight)) {
secondaryDiff = -1;
} else if (Tcl_UniCharIsUpper(uniRight) &&
Tcl_UniCharIsLower(uniLeft)) {
secondaryDiff = 1;
}
}
}
if (diff == 0) {
diff = secondaryDiff;
}
return diff;
}
static int
CompareAscii(SortData *sortData, struct SortItem *a, struct SortItem *b, int n)
{
char *left = a->item1[n].string;
char *right = b->item1[n].string;
/* make sure to handle case where no string value has been set */
if (left == NULL) {
return ((right == NULL) ? 0 : (0 - UCHAR(*right)));
} else if (right == NULL) {
return UCHAR(*left);
} else {
return strcmp(left, right);
}
}
static int
CompareDict(SortData *sortData, struct SortItem *a, struct SortItem *b, int n)
{
char *left = a->item1[n].string;
char *right = b->item1[n].string;
/* make sure to handle case where no string value has been set */
if (left == NULL) {
return ((right == NULL) ? 0 : (0 - UCHAR(*right)));
} else if (right == NULL) {
return UCHAR(*left);
} else {
return DictionaryCompare(left, right);
}
}
static int
CompareDouble(SortData *sortData, struct SortItem *a, struct SortItem *b, int n)
{
return (a->item1[n].doubleValue < b->item1[n].doubleValue) ? -1 :
((a->item1[n].doubleValue == b->item1[n].doubleValue) ? 0 : 1);
}
static int
CompareLong(SortData *sortData, struct SortItem *a, struct SortItem *b, int n)
{
return (a->item1[n].longValue < b->item1[n].longValue) ? -1 :
((a->item1[n].longValue == b->item1[n].longValue) ? 0 : 1);
}
static int
CompareCmd(SortData *sortData, struct SortItem *a, struct SortItem *b, int n)
{
Tcl_Interp *interp = sortData->tree->interp;
Tcl_Obj **objv, *paramObjv[2];
int objc, v;
paramObjv[0] = a->obj;
paramObjv[1] = b->obj;
Tcl_ListObjLength(interp, sortData->columns[n].command, &objc);
Tcl_ListObjReplace(interp, sortData->columns[n].command, objc - 2,
2, 2, paramObjv);
Tcl_ListObjGetElements(interp, sortData->columns[n].command,
&objc, &objv);
sortData->result = Tcl_EvalObjv(interp, objc, objv, 0);
if (sortData->result != TCL_OK) {
Tcl_AddErrorInfo(interp, "\n (evaluating item sort -command)");
return 0;
}
sortData->result = Tcl_GetIntFromObj(interp, Tcl_GetObjResult(interp), &v);
if (sortData->result != TCL_OK) {
Tcl_ResetResult(interp);
Tcl_AppendToObj(Tcl_GetObjResult(interp),
"-command returned non-numeric result", -1);
return 0;
}
return v;
}
static int CompareProc(SortData *sortData, struct SortItem *a, struct SortItem *b)
{
int i, v;
for (i = 0; i < sortData->count; i++) {
v = (*sortData->columns[i].proc)(sortData, a, b, i);
/* -command returned error */
if (sortData->result != TCL_OK)
return 0;
if (v != 0) {
if (i && (sortData->columns[i].order != sortData->columns[0].order))
v *= -1;
return v;
}
}
return 0;
}
/* BEGIN custom quicksort() */
static int find_pivot(SortData *sortData, struct SortItem *left, struct SortItem *right, struct SortItem *pivot)
{
struct SortItem *a, *b, *c, *p;
int v;
a = left;
b = (left + (right - left) / 2);
c = right;
v = CompareProc(sortData, a, b);
if (sortData->result != TCL_OK)
return 0;
if (v < 0) { p = a; a = b; b = p; }
v = CompareProc(sortData, a, c);
if (sortData->result != TCL_OK)
return 0;
if (v < 0) { p = a; a = c; c = p; }
v = CompareProc(sortData, b, c);
if (sortData->result != TCL_OK)
return 0;
if (v < 0) { p = b; b = c; c = p; }
v = CompareProc(sortData, a, b);
if (sortData->result != TCL_OK)
return 0;
if (v < 0) {
(*pivot) = *b;
return 1;
}
v = CompareProc(sortData, b, c);
if (sortData->result != TCL_OK)
return 0;
if (v < 0) {
(*pivot) = *c;
return 1;
}
for (p = left + 1; p <= right; p++) {
int v = CompareProc(sortData, p, left);
if (sortData->result != TCL_OK)
return 0;
if (v != 0) {
(*pivot) = (v < 0) ? *left : *p;
return 1;
}
}
return 0;
}
/* If the user provides a -command which does not properly compare two
* elements, quicksort may go into an infinite loop or access illegal memory.
* This #define indicates parts of the code which are not part of a normal
* quicksort, but are present to detect the aforementioned bugs. */
#define BUGGY_COMMAND
static struct SortItem *partition(SortData *sortData, struct SortItem *left, struct SortItem *right, struct SortItem *pivot)
{
int v;
#ifdef BUGGY_COMMAND
struct SortItem *min = left, *max = right;
#endif
while (left <= right) {
/*
while (*left < *pivot)
++left;
*/
while (1) {
v = CompareProc(sortData, left, pivot);
if (sortData->result != TCL_OK)
return NULL;
if (v >= 0)
break;
#ifdef BUGGY_COMMAND
/* If -command always returns < 0, 'left' becomes invalid */
if (left == max)
goto buggy;
#endif
left++;
}
/*
while (*right >= *pivot)
--right;
*/
while (1) {
v = CompareProc(sortData, right, pivot);
if (sortData->result != TCL_OK)
return NULL;
if (v < 0)
break;
#ifdef BUGGY_COMMAND
/* If -command always returns >= 0, 'right' becomes invalid */
if (right == min)
goto buggy;
#endif
right--;
}
if (left < right) {
struct SortItem tmp = *left;
*left = *right;
*right = tmp;
left++;
right--;
}
}
return left;
#ifdef BUGGY_COMMAND
buggy:
FormatResult(sortData->tree->interp, "buggy item sort -command detected");
sortData->result = TCL_ERROR;
return NULL;
#endif
}
static void quicksort(SortData *sortData, struct SortItem *left, struct SortItem *right)
{
struct SortItem *p, pivot;
if (sortData->result != TCL_OK)
return;
if (find_pivot(sortData, left, right, &pivot) == 1) {
p = partition(sortData, left, right, &pivot);
if (sortData->result != TCL_OK)
return;
quicksort(sortData, left, p - 1);
if (sortData->result != TCL_OK)
return;
quicksort(sortData, p, right);
}
}
/* END custom quicksort() */
int ItemSortCmd(ClientData clientData, Tcl_Interp *interp, int objc,
Tcl_Obj *CONST objv[])
{
TreeCtrl *tree = (TreeCtrl *) clientData;
Item *item, *first, *last, *walk, *lastChild;
Column *column;
int i, j, count, elemIndex, index, indexF = 0, indexL = 0;
int sawColumn = FALSE, sawCmd = FALSE;
static int (*sortProc[5])(SortData *, struct SortItem *, struct SortItem *, int) =
{ CompareAscii, CompareDict, CompareDouble, CompareLong, CompareCmd };
SortData sortData;
TreeColumn treeColumn;
struct SortElement *elemPtr;
int notReally = FALSE;
int result = TCL_OK;
if (TreeItem_FromObj(tree, objv[3], (TreeItem *) &item, 0) != TCL_OK)
return TCL_ERROR;
/* If the item has no children, then nothing is done and no error
* is generated. */
if (item->numChildren < 1)
return TCL_OK;
/* Defaults: sort ascii strings in column 0 only */
sortData.tree = tree;
sortData.count = 1;
sortData.columns[0].column = 0;
sortData.columns[0].sortBy = SORT_ASCII;
sortData.columns[0].order = 1;
sortData.columns[0].elemCount = 0;
sortData.result = TCL_OK;
first = item->firstChild;
last = item->lastChild;
for (i = 4; i < objc; ) {
static CONST char *optionName[] = { "-ascii", "-column", "-command",
"-decreasing", "-dictionary", "-element", "-first", "-increasing",
"-integer", "-last", "-notreally", "-real", NULL };
int numArgs[] = { 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1 };
enum { OPT_ASCII, OPT_COLUMN, OPT_COMMAND, OPT_DECREASING, OPT_DICT,
OPT_ELEMENT, OPT_FIRST, OPT_INCREASING, OPT_INTEGER, OPT_LAST,
OPT_NOT_REALLY, OPT_REAL };
if (Tcl_GetIndexFromObj(interp, objv[i], optionName, "option", 0,
&index) != TCL_OK)
return TCL_ERROR;
if (objc - i < numArgs[index]) {
FormatResult(interp, "missing value for \"%s\" option",
optionName[index]);
return TCL_ERROR;
}
switch (index) {
case OPT_ASCII:
sortData.columns[sortData.count - 1].sortBy = SORT_ASCII;
break;
case OPT_COLUMN:
if (TreeColumn_FromObj(tree, objv[i + 1], &treeColumn,
CFO_NOT_ALL | CFO_NOT_NULL | CFO_NOT_TAIL) != TCL_OK)
return TCL_ERROR;
/* The first -column we see is the first column we compare */
if (sawColumn) {
if (sortData.count + 1 > MAX_SORT_COLUMNS) {
FormatResult(interp,
"can't compare more than %d columns",
MAX_SORT_COLUMNS);
return TCL_ERROR;
}
sortData.count++;
/* Defaults for this column */
sortData.columns[sortData.count - 1].sortBy = SORT_ASCII;
sortData.columns[sortData.count - 1].order = 1;
sortData.columns[sortData.count - 1].elemCount = 0;
}
sortData.columns[sortData.count - 1].column = TreeColumn_Index(treeColumn);
sawColumn = TRUE;
break;
case OPT_COMMAND:
sortData.columns[sortData.count - 1].command = objv[i + 1];
sortData.columns[sortData.count - 1].sortBy = SORT_COMMAND;
sawCmd = TRUE;
break;
case OPT_DECREASING:
sortData.columns[sortData.count - 1].order = 0;
break;
case OPT_DICT:
sortData.columns[sortData.count - 1].sortBy = SORT_DICT;
break;
case OPT_ELEMENT:
{
int listObjc;
Tcl_Obj **listObjv;
if (Tcl_ListObjGetElements(interp, objv[i + 1], &listObjc,
&listObjv) != TCL_OK)
return TCL_ERROR;
elemPtr = sortData.columns[sortData.count - 1].elems;
sortData.columns[sortData.count - 1].elemCount = 0;
if (listObjc == 0) {
} else if (listObjc == 1) {
if (TreeElement_FromObj(tree, listObjv[0], &elemPtr->elem)
!= TCL_OK) {
Tcl_AddErrorInfo(interp,
"\n (processing -element option)");
return TCL_ERROR;
}
if (!TreeElement_IsType(tree, elemPtr->elem, "text")) {
FormatResult(interp,
"element %s is not of type \"text\"",
Tcl_GetString(listObjv[0]));
Tcl_AddErrorInfo(interp,
"\n (processing -element option)");
return TCL_ERROR;
}
elemPtr->style = NULL;
elemPtr->elemIndex = -1;
sortData.columns[sortData.count - 1].elemCount++;
} else {
if (listObjc & 1) {
FormatResult(interp,
"list must have even number of elements");
Tcl_AddErrorInfo(interp,
"\n (processing -element option)");
return TCL_ERROR;
}
for (j = 0; j < listObjc; j += 2) {
if ((TreeStyle_FromObj(tree, listObjv[j],
&elemPtr->style) != TCL_OK) ||
(TreeElement_FromObj(tree, listObjv[j + 1],
&elemPtr->elem) != TCL_OK) ||
(TreeStyle_FindElement(tree, elemPtr->style,
elemPtr->elem, &elemPtr->elemIndex) != TCL_OK)) {
Tcl_AddErrorInfo(interp,
"\n (processing -element option)");
return TCL_ERROR;
}
if (!TreeElement_IsType(tree, elemPtr->elem, "text")) {
FormatResult(interp,
"element %s is not of type \"text\"",
Tcl_GetString(listObjv[j + 1]));
Tcl_AddErrorInfo(interp,
"\n (processing -element option)");
return TCL_ERROR;
}
sortData.columns[sortData.count - 1].elemCount++;
elemPtr++;
}
}
break;
}
case OPT_FIRST:
if (TreeItem_FromObj(tree, objv[i + 1], (TreeItem *) &first, 0) != TCL_OK)
return TCL_ERROR;
if (first->parent != item) {
FormatResult(interp,
"item %s%d is not a child of item %s%d",
tree->itemPrefix, first->id, tree->itemPrefix, item->id);
return TCL_ERROR;
}
break;
case OPT_INCREASING:
sortData.columns[sortData.count - 1].order = 1;
break;
case OPT_INTEGER:
sortData.columns[sortData.count - 1].sortBy = SORT_LONG;
break;
case OPT_LAST:
if (TreeItem_FromObj(tree, objv[i + 1], (TreeItem *) &last, 0) != TCL_OK)
return TCL_ERROR;
if (last->parent != item) {
FormatResult(interp,
"item %s%d is not a child of item %s%d",
tree->itemPrefix, last->id, tree->itemPrefix, item->id);
return TCL_ERROR;
}
break;
case OPT_NOT_REALLY:
notReally = TRUE;
break;
case OPT_REAL:
sortData.columns[sortData.count - 1].sortBy = SORT_DOUBLE;
break;
}
i += numArgs[index];
}
/* If there are no columns, we cannot perform a sort unless -command
* is specified. */
if ((tree->columnCount < 1) && (sortData.columns[0].sortBy != SORT_COMMAND)) {
FormatResult(interp, "there are no columns");
return TCL_ERROR;
}
if (first == last) {
if (notReally)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) first));
return TCL_OK;
}
for (i = 0; i < sortData.count; i++) {
sortData.columns[i].proc = sortProc[sortData.columns[i].sortBy];
if (sortData.columns[i].sortBy == SORT_COMMAND) {
Tcl_Obj *obj = Tcl_DuplicateObj(sortData.columns[i].command);
Tcl_Obj *obj2 = Tcl_NewObj();
Tcl_IncrRefCount(obj);
if (Tcl_ListObjAppendElement(interp, obj, obj2) != TCL_OK) {
Tcl_DecrRefCount(obj);
Tcl_IncrRefCount(obj2);
Tcl_DecrRefCount(obj2);
/* FIXME: free other .command[] */
return TCL_ERROR;
}
(void) Tcl_ListObjAppendElement(interp, obj, obj2);
sortData.columns[i].command = obj;
}
}
index = 0;
walk = item->firstChild;
while (walk != NULL) {
if (walk == first)
indexF = index;
if (walk == last)
indexL = index;
index++;
walk = walk->nextSibling;
}
if (indexF > indexL) {
walk = last;
last = first;
first = walk;
index = indexL;
indexL = indexF;
indexF = index;
}
count = indexL - indexF + 1;
sortData.item1s = (struct SortItem1 *) ckalloc(sizeof(struct SortItem1) * count * sortData.count);
sortData.items = (struct SortItem *) ckalloc(sizeof(struct SortItem) * count);
for (i = 0; i < count; i++) {
sortData.items[i].item1 = sortData.item1s + i * sortData.count;
sortData.items[i].obj = NULL;
}
index = 0;
walk = first;
while (walk != last->nextSibling) {
struct SortItem *sortItem = &sortData.items[index];
sortItem->item = walk;
if (sawCmd) {
Tcl_Obj *obj = TreeItem_ToObj(tree, (TreeItem) walk);
Tcl_IncrRefCount(obj);
sortData.items[index].obj = obj;
}
for (i = 0; i < sortData.count; i++) {
struct SortItem1 *sortItem1 = sortItem->item1 + i;
if (sortData.columns[i].sortBy == SORT_COMMAND)
continue;
column = Item_FindColumn(tree, walk, sortData.columns[i].column);
if (column == NULL) {
FormatResult(interp, "item %s%d doesn't have column %s%d",
tree->itemPrefix, walk->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, sortData.columns[i].column)));
result = TCL_ERROR;
goto done;
}
if (column->style == NULL) {
FormatResult(interp, "item %s%d column %s%d has no style",
tree->itemPrefix, walk->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, sortData.columns[i].column)));
result = TCL_ERROR;
goto done;
}
/* -element was empty. Find the first text element in the style */
if (sortData.columns[i].elemCount == 0)
elemIndex = -1;
/* -element was element name. Find the element in the style */
else if ((sortData.columns[i].elemCount == 1) &&
(sortData.columns[i].elems[0].style == NULL)) {
if (TreeStyle_FindElement(tree, column->style,
sortData.columns[i].elems[0].elem, &elemIndex) != TCL_OK) {
result = TCL_ERROR;
goto done;
}
}
/* -element was style/element pair list */
else {
TreeStyle masterStyle = TreeStyle_GetMaster(tree, column->style);
/* If the item style does not match any in the -element list,
* we will use the first text element in the item style. */
elemIndex = -1;
/* Match a style from the -element list. Look in reverse order
* to handle duplicates. */
for (j = sortData.columns[i].elemCount - 1; j >= 0; j--) {
if (sortData.columns[i].elems[j].style == masterStyle) {
elemIndex = sortData.columns[i].elems[j].elemIndex;
break;
}
}
}
if (TreeStyle_GetSortData(tree, column->style, elemIndex,
sortData.columns[i].sortBy,
&sortItem1->longValue,
&sortItem1->doubleValue,
&sortItem1->string) != TCL_OK) {
result = TCL_ERROR;
goto done;
}
}
index++;
walk = walk->nextSibling;
}
quicksort(&sortData, sortData.items, sortData.items + count - 1);
if (sortData.result != TCL_OK) {
result = sortData.result;
goto done;
}
if (sawCmd)
Tcl_ResetResult(interp);
if (notReally) {
Tcl_Obj *listObj = Tcl_NewListObj(0, NULL);
Tcl_Obj *itemObj;
/* Smallest to largest */
if (sortData.columns[0].order == 1) {
for (i = 0; i < count; i++) {
itemObj = sortData.items[i].obj;
if (itemObj == NULL)
itemObj = TreeItem_ToObj(tree,
(TreeItem) sortData.items[i].item);
Tcl_ListObjAppendElement(interp, listObj, itemObj);
}
}
/* Largest to smallest */
else {
for (i = count - 1; i >= 0; i--) {
itemObj = sortData.items[i].obj;
if (itemObj == NULL)
itemObj = TreeItem_ToObj(tree,
(TreeItem) sortData.items[i].item);
Tcl_ListObjAppendElement(interp, listObj, itemObj);
}
}
Tcl_SetObjResult(interp, listObj);
goto done;
}
first = first->prevSibling;
last = last->nextSibling;
/* Smallest to largest */
if (sortData.columns[0].order == 1) {
for (i = 0; i < count - 1; i++) {
sortData.items[i].item->nextSibling = sortData.items[i + 1].item;
sortData.items[i + 1].item->prevSibling = sortData.items[i].item;
}
indexF = 0;
indexL = count - 1;
}
/* Largest to smallest */
else {
for (i = count - 1; i > 0; i--) {
sortData.items[i].item->nextSibling = sortData.items[i - 1].item;
sortData.items[i - 1].item->prevSibling = sortData.items[i].item;
}
indexF = count - 1;
indexL = 0;
}
lastChild = item->lastChild;
sortData.items[indexF].item->prevSibling = first;
if (first)
first->nextSibling = sortData.items[indexF].item;
else
item->firstChild = sortData.items[indexF].item;
sortData.items[indexL].item->nextSibling = last;
if (last)
last->prevSibling = sortData.items[indexL].item;
else
item->lastChild = sortData.items[indexL].item;
/* Redraw the lines of the old/new lastchild */
if ((item->lastChild != lastChild) && tree->showLines) {
if (lastChild->dInfo != NULL)
Tree_InvalidateItemDInfo(tree, (TreeItem) lastChild,
(TreeItem) NULL);
if (item->lastChild->dInfo != NULL)
Tree_InvalidateItemDInfo(tree, (TreeItem) item->lastChild,
(TreeItem) NULL);
}
tree->updateIndex = 1;
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
done:
for (i = 0; i < count; i++)
if (sortData.items[i].obj != NULL)
Tcl_DecrRefCount(sortData.items[i].obj);
for (i = 0; i < sortData.count; i++)
if (sortData.columns[i].sortBy == SORT_COMMAND)
Tcl_DecrRefCount(sortData.columns[i].command);
ckfree((char *) sortData.item1s);
ckfree((char *) sortData.items);
if (tree->debug.enable && tree->debug.data)
Tree_Debug(tree);
return result;
}
static int ItemStateCmd(ClientData clientData, Tcl_Interp *interp, int objc,
Tcl_Obj *CONST objv[])
{
TreeCtrl *tree = (TreeCtrl *) clientData;
static CONST char *commandNames[] = {
"forcolumn", "get", "set", (char *) NULL
};
enum {
COMMAND_FORCOLUMN, COMMAND_GET, COMMAND_SET
};
int index;
Item *item;
if (Tcl_GetIndexFromObj(interp, objv[3], commandNames, "command", 0,
&index) != TCL_OK)
return TCL_ERROR;
switch (index) {
/* T item state forcolumn I C ?stateList? */
case COMMAND_FORCOLUMN:
{
Tcl_Obj *listObj;
Column *column;
int columnIndex;
int i, states[3], stateOn, stateOff;
int listObjc;
Tcl_Obj **listObjv;
if (objc < 6 || objc > 7) {
Tcl_WrongNumArgs(interp, 5, objv, "column ?stateList?");
return TCL_ERROR;
}
if (TreeItem_FromObj(tree, objv[4], (TreeItem *) &item, 0)
!= TCL_OK)
return TCL_ERROR;
if (Item_FindColumnFromObj(tree, item, objv[5], &column,
&columnIndex) != TCL_OK)
return TCL_ERROR;
if (objc == 6) {
listObj = Tcl_NewListObj(0, NULL);
for (i = 0; i < 32; i++) {
if (tree->stateNames[i] == NULL)
continue;
if (column->cstate & (1L << i)) {
Tcl_ListObjAppendElement(interp, listObj,
Tcl_NewStringObj(tree->stateNames[i], -1));
}
}
Tcl_SetObjResult(interp, listObj);
break;
}
states[0] = states[1] = states[2] = 0;
if (Tcl_ListObjGetElements(interp, objv[6], &listObjc, &listObjv)
!= TCL_OK)
return TCL_ERROR;
if (listObjc == 0)
break;
for (i = 0; i < listObjc; i++) {
if (Tree_StateFromObj(tree, listObjv[i], states, NULL,
SFO_NOT_STATIC) != TCL_OK)
return TCL_ERROR;
}
stateOn = states[STATE_OP_ON];
stateOff = states[STATE_OP_OFF];
stateOn |= ~column->cstate & states[STATE_OP_TOGGLE];
stateOff |= column->cstate & states[STATE_OP_TOGGLE];
Column_ChangeState(tree, item, column, columnIndex,
stateOff, stateOn);
break;
}
/* T item state get I ?state? */
case COMMAND_GET:
{
Tcl_Obj *listObj;
int i, states[3];
if (objc > 6) {
Tcl_WrongNumArgs(interp, 5, objv, "?state?");
return TCL_ERROR;
}
if (TreeItem_FromObj(tree, objv[4], (TreeItem *) &item, 0) != TCL_OK)
return TCL_ERROR;
if (objc == 6) {
states[STATE_OP_ON] = 0;
if (Tree_StateFromObj(tree, objv[5], states, NULL,
SFO_NOT_OFF | SFO_NOT_TOGGLE) != TCL_OK)
return TCL_ERROR;
Tcl_SetObjResult(interp,
Tcl_NewBooleanObj((item->state & states[STATE_OP_ON]) != 0));
break;
}
listObj = Tcl_NewListObj(0, NULL);
for (i = 0; i < 32; i++) {
if (tree->stateNames[i] == NULL)
continue;
if (item->state & (1L << i)) {
Tcl_ListObjAppendElement(interp, listObj,
Tcl_NewStringObj(tree->stateNames[i], -1));
}
}
Tcl_SetObjResult(interp, listObj);
break;
}
/* T item state set I ?I? {state ...} */
case COMMAND_SET:
{
TreeItem item, itemFirst, itemLast;
int i, states[3], stateOn, stateOff;
int listObjc;
Tcl_Obj **listObjv;
if (objc < 6 || objc > 7) {
Tcl_WrongNumArgs(interp, 5, objv, "?last? stateList");
return TCL_ERROR;
}
if (TreeItem_FromObj(tree, objv[4], &itemFirst, IFO_ALLOK) != TCL_OK)
return TCL_ERROR;
if (objc == 6) {
itemLast = itemFirst;
}
if (objc == 7) {
if (TreeItem_FromObj(tree, objv[5], &itemLast, IFO_ALLOK) != TCL_OK)
return TCL_ERROR;
}
states[0] = states[1] = states[2] = 0;
if (Tcl_ListObjGetElements(interp, objv[objc - 1],
&listObjc, &listObjv) != TCL_OK)
return TCL_ERROR;
if (listObjc == 0)
break;
for (i = 0; i < listObjc; i++) {
if (Tree_StateFromObj(tree, listObjv[i], states, NULL,
SFO_NOT_STATIC) != TCL_OK)
return TCL_ERROR;
}
if ((itemFirst == ITEM_ALL) || (itemLast == ITEM_ALL)) {
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
hPtr = Tcl_FirstHashEntry(&tree->itemHash, &search);
while (hPtr != NULL) {
item = (TreeItem) Tcl_GetHashValue(hPtr);
stateOn = states[STATE_OP_ON];
stateOff = states[STATE_OP_OFF];
stateOn |= ~((Item *) item)->state & states[STATE_OP_TOGGLE];
stateOff |= ((Item *) item)->state & states[STATE_OP_TOGGLE];
TreeItem_ChangeState(tree, item, stateOff, stateOn);
hPtr = Tcl_NextHashEntry(&search);
}
break;
}
if (objc == 7) {
int indexFirst, indexLast;
if (TreeItem_RootAncestor(tree, itemFirst) !=
TreeItem_RootAncestor(tree,itemLast)) {
FormatResult(interp,
"item %s%d and item %s%d don't share a common ancestor",
tree->itemPrefix, TreeItem_GetID(tree, itemFirst),
tree->itemPrefix, TreeItem_GetID(tree, itemLast));
return TCL_ERROR;
}
TreeItem_ToIndex(tree, itemFirst, &indexFirst, NULL);
TreeItem_ToIndex(tree, itemLast, &indexLast, NULL);
if (indexFirst > indexLast) {
item = itemFirst;
itemFirst = itemLast;
itemLast = item;
}
}
item = itemFirst;
while (item != NULL) {
stateOn = states[STATE_OP_ON];
stateOff = states[STATE_OP_OFF];
stateOn |= ~((Item *) item)->state & states[STATE_OP_TOGGLE];
stateOff |= ((Item *) item)->state & states[STATE_OP_TOGGLE];
TreeItem_ChangeState(tree, item, stateOff, stateOn);
if (item == itemLast)
break;
item = TreeItem_Next(tree, item);
}
break;
}
}
return TCL_OK;
}
/* Basically same as "selection clear" */
static void ItemDeleteDeselect(TreeCtrl *tree, TreeItem itemFirst, TreeItem itemLast)
{
int i, indexFirst, indexLast, count;
TreeItem staticItems[STATIC_SIZE], *items = staticItems;
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
TreeItem item;
if ((itemFirst == ITEM_ALL) || (itemLast == ITEM_ALL)) {
count = tree->selectCount;
STATIC_ALLOC(items, TreeItem, count + 1);
count = 0;
hPtr = Tcl_FirstHashEntry(&tree->selection, &search);
while (hPtr != NULL) {
item = (TreeItem) Tcl_GetHashKey(&tree->selection, hPtr);
if (item == tree->root) {
hPtr = Tcl_NextHashEntry(&search);
if (hPtr == NULL)
break;
item = (TreeItem) Tcl_GetHashKey(&tree->selection, hPtr);
}
items[count++] = item;
hPtr = Tcl_NextHashEntry(&search);
}
for (i = 0; i < count; i++)
Tree_RemoveFromSelection(tree, items[i]);
goto doneCLEAR;
}
if (itemFirst == itemLast) {
count = 1;
} else {
TreeItem_ToIndex(tree, itemFirst, &indexFirst, NULL);
TreeItem_ToIndex(tree, itemLast, &indexLast, NULL);
count = indexLast - indexFirst + 1;
}
STATIC_ALLOC(items, TreeItem, count + 1);
count = 0;
item = itemFirst;
while (item != NULL) {
if (TreeItem_GetSelected(tree, item)) {
Tree_RemoveFromSelection(tree, item);
items[count++] = item;
}
if (item == itemLast)
break;
item = TreeItem_Next(tree, item);
}
doneCLEAR:
if (count) {
items[count] = NULL;
TreeNotify_Selection(tree, NULL, items);
}
STATIC_FREE2(items, staticItems);
}
static void ItemDeleteNotify(TreeCtrl *tree, TreeItem itemFirst, TreeItem itemLast)
{
int staticItemIds[256], *itemIds = staticItemIds;
int itemIdCnt = 0;
TreeItem item;
if (itemFirst == ITEM_ALL || itemLast == ITEM_ALL) {
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
itemIdCnt = tree->itemCount - 1;
if (itemIdCnt > sizeof(staticItemIds) / sizeof(int))
itemIds = (int *) ckalloc(sizeof(int) * itemIdCnt);
itemIdCnt = 0;
/* TreeItem_Delete() deletes child items, so we must iterate
* over each individually. Plus we need to process orphans */
hPtr = Tcl_FirstHashEntry(&tree->itemHash, &search);
while (hPtr != NULL) {
item = (TreeItem) Tcl_GetHashValue(hPtr);
if (item != tree->root)
itemIds[itemIdCnt++] = ((Item *) item)->id;
hPtr = Tcl_NextHashEntry(&search);
}
goto doNotify;
}
if (itemFirst == itemLast) {
itemIdCnt = 1;
} else {
int indexFirst, indexLast;
TreeItem_ToIndex(tree, itemFirst, &indexFirst, NULL);
TreeItem_ToIndex(tree, itemLast, &indexLast, NULL);
itemIdCnt = indexLast - indexFirst + 1;
}
if (itemIdCnt > sizeof(staticItemIds) / sizeof(int))
itemIds = (int *) ckalloc(sizeof(int) * itemIdCnt);
itemIdCnt = 0;
item = itemFirst;
while (item != NULL) {
itemIds[itemIdCnt++] = ((Item *) item)->id;
if (item == itemLast)
break;
item = TreeItem_Next(tree, item);
}
doNotify:
if (itemIdCnt)
TreeNotify_ItemDeleted(tree, itemIds, itemIdCnt);
if (itemIds != staticItemIds)
ckfree((char *) itemIds);
}
#ifdef SELECTION_VISIBLE
/* FIXME: optimize all calls to this routine */
void Tree_DeselectHidden(TreeCtrl *tree)
{
TreeItem staticItems[STATIC_SIZE], *items = staticItems;
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
TreeItem item;
int i, count;
if (tree->selectCount < 1)
return;
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
count = tree->selectCount;
STATIC_ALLOC(items, TreeItem, count + 1);
count = 0;
hPtr = Tcl_FirstHashEntry(&tree->selection, &search);
while (hPtr != NULL) {
item = (TreeItem) Tcl_GetHashKey(&tree->selection, hPtr);
if (!TreeItem_ReallyVisible(tree, item))
items[count++] = item;
hPtr = Tcl_NextHashEntry(&search);
}
for (i = 0; i < count; i++)
Tree_RemoveFromSelection(tree, items[i]);
if (count) {
items[count] = NULL;
TreeNotify_Selection(tree, NULL, items);
}
STATIC_FREE2(items, staticItems);
}
#endif /* SELECTION_VISIBLE */
int TreeItemCmd(ClientData clientData, Tcl_Interp *interp, int objc,
Tcl_Obj *CONST objv[])
{
TreeCtrl *tree = (TreeCtrl *) clientData;
static CONST char *commandNames[] = {
"ancestors",
"children",
"create",
"delete",
"firstchild",
"lastchild",
"nextsibling",
"numchildren",
"parent",
"prevsibling",
"remove",
"bbox",
"cget",
"collapse",
"compare",
"complex",
"configure",
"count",
"dump",
"element",
"expand",
"id",
"isancestor",
"isopen",
"order",
"rnc",
"sort",
"state",
"style",
"text",
"toggle",
(char *) NULL
};
enum {
COMMAND_ANCESTORS,
COMMAND_CHILDREN,
COMMAND_CREATE,
COMMAND_DELETE,
COMMAND_FIRSTCHILD,
COMMAND_LASTCHILD,
COMMAND_NEXTSIBLING,
COMMAND_NUMCHILDREN,
COMMAND_PARENT,
COMMAND_PREVSIBLING,
COMMAND_REMOVE,
COMMAND_BBOX,
COMMAND_CGET,
COMMAND_COLLAPSE,
COMMAND_COMPARE,
COMMAND_COMPLEX,
COMMAND_CONFIGURE,
COMMAND_COUNT,
COMMAND_DUMP,
COMMAND_ELEMENT,
COMMAND_EXPAND,
COMMAND_ID,
COMMAND_ISANCESTOR,
COMMAND_ISOPEN,
COMMAND_ORDER,
COMMAND_RNC,
COMMAND_SORT,
COMMAND_STATE,
COMMAND_STYLE,
COMMAND_TEXT,
COMMAND_TOGGLE
};
#define AF_NOTANCESTOR 0x00010000 /* item can't be ancestor of other item */
#define AF_PARENT 0x00020000 /* item must have a parent */
#define AF_NOT_EQUAL 0x00040000 /* second item can't be same as first */
#define AF_SAMEROOT 0x00080000 /* both items must be descendants of a common ancestor */
#define AF_NOT_ITEM 0x00100000 /* arg is not an Item */
struct {
int minArgs;
int maxArgs;
int flags;
int flags2;
char *argString;
} argInfo[] = {
{ 1, 1, 0, 0, "item" }, /* ancestors */
{ 1, 1, 0, 0, "item" }, /* children */
{ 0, 10000, AF_NOT_ITEM, AF_NOT_ITEM, "?option value...?" }, /* create */
{ 1, 2, IFO_ALLOK, IFO_ALLOK | AF_SAMEROOT, "first ?last?" }, /* delete */
{ 1, 2, 0, IFO_NOTROOT | AF_NOTANCESTOR | AF_NOT_EQUAL, "item ?newFirstChild?" }, /* firstchild */
{ 1, 2, 0, IFO_NOTROOT | AF_NOTANCESTOR | AF_NOT_EQUAL, "item ?newLastChild?" }, /* lastchild */
{ 1, 2, IFO_NOTROOT | AF_PARENT, IFO_NOTROOT | AF_NOTANCESTOR | AF_NOT_EQUAL, "item ?newNextSibling?" }, /* nextsibling */
{ 1, 1, 0, 0, "item" }, /* numchildren */
{ 1, 1, 0, 0, "item" }, /* parent */
{ 1, 2, IFO_NOTROOT | AF_PARENT, IFO_NOTROOT | AF_NOTANCESTOR | AF_NOT_EQUAL, "item ?newPrevSibling?" }, /* prevsibling */
{ 1, 1, IFO_NOTROOT, 0, "item" }, /* remove */
{ 1, 3, 0, AF_NOT_ITEM, "item ?column? ?element?" }, /* bbox */
{ 2, 2, 0, AF_NOT_ITEM, "item option" }, /* cget */
{ 1, 2, IFO_ALLOK, AF_NOT_ITEM, "item ?-recurse?"}, /* collapse */
{ 3, 3, 0, AF_NOT_ITEM, "item1 op item2" }, /* compare */
{ 2, 100000, 0, AF_NOT_ITEM, "item list..." }, /* complex */
{ 1, 100000, 0, AF_NOT_ITEM, "item ?option? ?value? ?option value...?" }, /* configure */
{ 0, 0, 0, 0, NULL }, /* count */
{ 1, 1, 0, 0, "item" }, /* dump */
{ 4, 100000, AF_NOT_ITEM, AF_NOT_ITEM, "command item column element ?arg ...?" }, /* element */
{ 1, 2, IFO_ALLOK, AF_NOT_ITEM, "item ?-recurse?"}, /* expand */
{ 1, 1, IFO_NULLOK, 0, "item" }, /* id */
{ 2, 2, 0, 0, "item item2" }, /* isancestor */
{ 1, 1, 0, 0, "item" }, /* isopen */
{ 1, 2, 0, AF_NOT_ITEM, "item ?-visible?" }, /* order */
{ 1, 1, 0, 0, "item" }, /* rnc */
{ 1, 100000, 0, AF_NOT_ITEM, "item ?option ...?" }, /* sort */
{ 2, 100000, AF_NOT_ITEM, AF_NOT_ITEM, "command item ?arg ...?" }, /* state */
{ 2, 100000, AF_NOT_ITEM, AF_NOT_ITEM, "command item ?arg ...?" }, /* style */
{ 2, 100000, 0, AF_NOT_ITEM, "item column ?text? ?column text ...?" }, /* text */
{ 1, 2, IFO_ALLOK, AF_NOT_ITEM, "item ?-recurse?"}, /* toggle */
};
int index;
int numArgs = objc - 3;
Item *item = NULL, *item2 = NULL, *child;
if (objc < 3) {
Tcl_WrongNumArgs(interp, 2, objv, "command ?arg arg...?");
return TCL_ERROR;
}
if (Tcl_GetIndexFromObj(interp, objv[2], commandNames, "command", 0,
&index) != TCL_OK) {
return TCL_ERROR;
}
if ((numArgs < argInfo[index].minArgs) ||
(numArgs > argInfo[index].maxArgs)) {
Tcl_WrongNumArgs(interp, 3, objv, argInfo[index].argString);
return TCL_ERROR;
}
if ((numArgs >= 1) && !(argInfo[index].flags & AF_NOT_ITEM)) {
if (TreeItem_FromObj(tree, objv[3], (TreeItem *) &item,
argInfo[index].flags & 0xFFFF) != TCL_OK) {
return TCL_ERROR;
}
if ((argInfo[index].flags & AF_PARENT) && (item->parent == NULL)) {
FormatResult(interp, "item %s%d must have a parent", tree->itemPrefix,
item->id);
return TCL_ERROR;
}
}
if ((numArgs >= 2) && !(argInfo[index].flags2 & AF_NOT_ITEM)) {
if (TreeItem_FromObj(tree, objv[4], (TreeItem *) &item2,
argInfo[index].flags2 & 0xFFFF) != TCL_OK) {
return TCL_ERROR;
}
if ((argInfo[index].flags2 & AF_NOT_EQUAL) && (item == item2)) {
FormatResult(interp, "item %s%d same as second item", tree->itemPrefix,
item->id);
return TCL_ERROR;
}
if ((argInfo[index].flags2 & AF_PARENT) && (item2->parent == NULL)) {
FormatResult(interp, "item %s%d must have a parent", tree->itemPrefix,
item2->id);
return TCL_ERROR;
}
if ((argInfo[index].flags & AF_NOTANCESTOR) &&
TreeItem_IsAncestor(tree, (TreeItem) item, (TreeItem) item2)) {
FormatResult(interp, "item %s%d is ancestor of item %s%d",
tree->itemPrefix, item->id, tree->itemPrefix, item2->id);
return TCL_ERROR;
}
if ((argInfo[index].flags2 & AF_NOTANCESTOR) &&
TreeItem_IsAncestor(tree, (TreeItem) item2, (TreeItem) item)) {
FormatResult(interp, "item %s%d is ancestor of item %s%d",
tree->itemPrefix, item2->id, tree->itemPrefix, item->id);
return TCL_ERROR;
}
if ((argInfo[index].flags2 & AF_SAMEROOT) &&
TreeItem_RootAncestor(tree, (TreeItem) item) !=
TreeItem_RootAncestor(tree, (TreeItem) item2)) {
FormatResult(interp,
"item %s%d and item %s%d don't share a common ancestor",
tree->itemPrefix, item->id, tree->itemPrefix, item2->id);
return TCL_ERROR;
}
}
switch (index) {
case COMMAND_ANCESTORS:
{
Tcl_Obj *listObj;
Item *parent = item->parent;
listObj = Tcl_NewListObj(0, NULL);
while (parent != NULL) {
Tcl_ListObjAppendElement(interp, listObj,
TreeItem_ToObj(tree, (TreeItem) parent));
parent = parent->parent;
}
Tcl_SetObjResult(interp, listObj);
break;
}
/* T item bbox I ?C? ?E? */
case COMMAND_BBOX:
{
int x, y, w, h;
int i, columnIndex, indent, totalWidth;
TreeColumn treeColumn;
TreeItemColumn itemColumn;
StyleDrawArgs drawArgs;
TreeItem item_ = (TreeItem) item;
XRectangle rect;
if (Tree_ItemBbox(tree, item_, &x, &y, &w, &h) < 0)
break;
if (objc > 4) {
if (TreeItem_ColumnFromObj(tree, item_, objv[4],
&itemColumn, &columnIndex) != TCL_OK)
return TCL_ERROR;
totalWidth = 0;
treeColumn = tree->columns;
for (i = 0; i < columnIndex; i++) {
totalWidth += TreeColumn_UseWidth(treeColumn);
treeColumn = TreeColumn_Next(treeColumn);
}
if (treeColumn == tree->columnTree)
indent = TreeItem_Indent(tree, item_);
else
indent = 0;
if (objc == 5) {
FormatResult(interp, "%d %d %d %d",
x + totalWidth + indent - tree->xOrigin,
y - tree->yOrigin,
x + totalWidth + TreeColumn_UseWidth(treeColumn) - tree->xOrigin,
y + h - tree->yOrigin);
break;
}
drawArgs.style = TreeItemColumn_GetStyle(tree, itemColumn);
if (drawArgs.style == NULL) {
FormatResult(interp,
"item %s%d column %s%d has no style",
tree->itemPrefix, TreeItem_GetID(tree, item_),
tree->columnPrefix, TreeColumn_GetID(treeColumn));
return TCL_ERROR;
}
drawArgs.tree = tree;
drawArgs.drawable = None;
drawArgs.state = TreeItem_GetState(tree, item_);
#ifdef LAYOUTHAX
drawArgs.indent = indent;
drawArgs.x = x + totalWidth;
drawArgs.y = y;
drawArgs.width = TreeColumn_UseWidth(treeColumn);
#else
drawArgs.x = x + indent + totalWidth;
drawArgs.y = y;
drawArgs.width = TreeColumn_UseWidth(treeColumn) - indent;
#endif
drawArgs.height = h;
drawArgs.justify = TreeColumn_Justify(treeColumn);
if (TreeStyle_GetElemRects(&drawArgs, objc - 5, objv + 5,
&rect) == -1)
return TCL_ERROR;
x = rect.x;
y = rect.y;
w = rect.width;
h = rect.height;
}
FormatResult(interp, "%d %d %d %d",
x - tree->xOrigin,
y - tree->yOrigin,
x - tree->xOrigin + w,
y - tree->yOrigin + h);
break;
}
case COMMAND_CGET:
{
Tcl_Obj *resultObjPtr;
resultObjPtr = Tk_GetOptionValue(interp, (char *) item,
tree->itemOptionTable, objv[4], tree->tkwin);
if (resultObjPtr == NULL)
return TCL_ERROR;
Tcl_SetObjResult(interp, resultObjPtr);
break;
}
case COMMAND_CHILDREN:
{
if (item->numChildren != 0) {
Tcl_Obj *listObj;
listObj = Tcl_NewListObj(0, NULL);
child = item->firstChild;
while (child != NULL) {
Tcl_ListObjAppendElement(interp, listObj,
TreeItem_ToObj(tree, (TreeItem) child));
child = child->nextSibling;
}
Tcl_SetObjResult(interp, listObj);
}
break;
}
case COMMAND_COLLAPSE:
case COMMAND_EXPAND:
case COMMAND_TOGGLE:
{
int recurse = 0;
int mode = 0; /* lint */
if (numArgs == 2) {
char *s = Tcl_GetString(objv[4]);
if (strcmp(s, "-recurse")) {
FormatResult(interp, "bad option \"%s\": must be -recurse",
s);
return TCL_ERROR;
}
recurse = 1;
}
switch (index) {
case COMMAND_COLLAPSE:
mode = 0;
break;
case COMMAND_EXPAND:
mode = 1;
break;
case COMMAND_TOGGLE:
mode = -1;
break;
}
if (item == (Item *) ITEM_ALL) {
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
hPtr = Tcl_FirstHashEntry(&tree->itemHash, &search);
while (hPtr != NULL) {
item = (Item *) Tcl_GetHashValue(hPtr);
TreeItem_OpenClose(tree, (TreeItem) item, mode, 0);
hPtr = Tcl_NextHashEntry(&search);
}
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
break;
}
TreeItem_OpenClose(tree, (TreeItem) item, mode, recurse);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
break;
}
/* T item compare I op I */
case COMMAND_COMPARE:
{
static CONST char *opName[] = { "<", "<=", "==", ">=", ">", "!=", NULL };
int op, compare = 0, index1, index2;
if (Tcl_GetIndexFromObj(interp, objv[4], opName, "comparison operator", 0,
&op) != TCL_OK)
return TCL_ERROR;
if (TreeItem_FromObj(tree, objv[5], (TreeItem *) &item2, 0) != TCL_OK)
return TCL_ERROR;
if (TreeItem_RootAncestor(tree, (TreeItem) item) !=
TreeItem_RootAncestor(tree, (TreeItem) item2)) {
FormatResult(interp,
"item %s%d and item %s%d don't share a common ancestor",
tree->itemPrefix, item->id,
tree->itemPrefix, item2->id);
return TCL_ERROR;
}
TreeItem_ToIndex(tree, (TreeItem) item, &index1, NULL);
TreeItem_ToIndex(tree, (TreeItem) item2, &index2, NULL);
switch (op) {
case 0: compare = index1 < index2; break;
case 1: compare = index1 <= index2; break;
case 2: compare = index1 == index2; break;
case 3: compare = index1 >= index2; break;
case 4: compare = index1 > index2; break;
case 5: compare = index1 != index2; break;
}
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(compare));
break;
}
case COMMAND_COMPLEX:
{
int i, j, columnIndex;
int objc1, objc2;
Tcl_Obj **objv1, **objv2;
Column *column;
int eMask, cMask, iMask = 0;
int result = TCL_OK;
if (objc <= 4)
break;
columnIndex = 0;
for (i = 4; i < objc; i++, columnIndex++) {
column = Item_FindColumn(tree, item, columnIndex);
if (column == NULL) {
FormatResult(interp, "item %s%d doesn't have column %s%d",
tree->itemPrefix, item->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, columnIndex)));
result = TCL_ERROR;
goto doneComplex;
}
/* List of element-configs per column */
if (Tcl_ListObjGetElements(interp, objv[i],
&objc1, &objv1) != TCL_OK) {
result = TCL_ERROR;
goto doneComplex;
}
if (objc1 == 0)
continue;
if (column->style == NULL) {
FormatResult(interp, "item %s%d column %s%d has no style",
tree->itemPrefix, item->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, columnIndex)));
result = TCL_ERROR;
goto doneComplex;
}
cMask = 0;
for (j = 0; j < objc1; j++) {
/* elem option value... */
if (Tcl_ListObjGetElements(interp, objv1[j],
&objc2, &objv2) != TCL_OK) {
result = TCL_ERROR;
goto doneComplex;
}
if (objc2 < 3) {
FormatResult(interp,
"wrong # args: should be \"element option value...\"");
result = TCL_ERROR;
goto doneComplex;
}
if (TreeStyle_ElementConfigure(tree, (TreeItem) item,
(TreeItemColumn) column, column->style,
objv2[0], objc2 - 1, objv2 + 1, &eMask) != TCL_OK) {
result = TCL_ERROR;
goto doneComplex;
}
cMask |= eMask;
iMask |= eMask;
}
if (cMask & CS_LAYOUT)
column->neededWidth = column->neededHeight = -1;
}
doneComplex:
if (iMask & CS_DISPLAY)
Tree_FreeItemDInfo(tree, (TreeItem) item, NULL);
if (iMask & CS_LAYOUT) {
Tree_InvalidateColumnWidth(tree, -1);
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
}
return result;
}
case COMMAND_CONFIGURE:
{
if (objc <= 5) {
Tcl_Obj *resultObjPtr;
resultObjPtr = Tk_GetOptionInfo(interp, (char *) item,
tree->itemOptionTable,
(objc == 4) ? (Tcl_Obj *) NULL : objv[4],
tree->tkwin);
if (resultObjPtr == NULL)
return TCL_ERROR;
Tcl_SetObjResult(interp, resultObjPtr);
break;
}
return Item_Configure(tree, item, objc - 4, objv + 4);
}
case COMMAND_COUNT:
{
if (objc != 3) {
Tcl_WrongNumArgs(interp, 2, objv, (char *) NULL);
return TCL_ERROR;
}
Tcl_SetObjResult(interp, Tcl_NewIntObj(tree->itemCount));
break;
}
case COMMAND_CREATE:
{
item = Item_Alloc(tree);
if (objc > 3) {
if (Item_Configure(tree, item, objc - 3, objv + 3) != TCL_OK) {
TreeItem_Delete(tree, (TreeItem) item);
return TCL_ERROR;
}
}
/* Apply default styles */
if (tree->defaultStyle.numStyles) {
int i, n = MIN(tree->columnCount, tree->defaultStyle.numStyles);
for (i = 0; i < n; i++) {
Column *column = Item_CreateColumn(tree, item, i, NULL);
if (tree->defaultStyle.styles[i] != NULL) {
column->style = TreeStyle_NewInstance(tree,
tree->defaultStyle.styles[i]);
}
}
}
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item));
break;
}
case COMMAND_DELETE:
{
Item *itemFirst, *itemLast;
int index1, index2;
/* Exclude root from the range */
if (item == item2)
item2 = NULL;
if ((item != (Item *) ITEM_ALL) && (item2 != (Item *) ITEM_ALL)) {
if (item2 == NULL) {
if (ISROOT(item))
break;
} else {
if (ISROOT(item))
item = (Item *) TreeItem_Next(tree, (TreeItem) item);
if (ISROOT(item2))
item2 = (Item *) TreeItem_Next(tree, (TreeItem) item2);
if (item == item2)
item2 = NULL;
}
}
if (item == (Item *) ITEM_ALL || item2 == (Item *) ITEM_ALL) {
itemFirst = (Item *) ITEM_ALL;
itemLast = NULL;
} else if ((item2 != NULL) && (item != item2)) {
int indexFirst;
Item *ancestor;
TreeItem_ToIndex(tree, (TreeItem) item, &index1, NULL);
TreeItem_ToIndex(tree, (TreeItem) item2, &index2, NULL);
if (index1 < index2) {
itemFirst = item;
itemLast = item2;
indexFirst = index1;
} else {
itemFirst = item2;
itemLast = item;
indexFirst = index2;
}
ancestor = itemLast;
while (ancestor->parent != NULL) {
int index;
TreeItem_ToIndex(tree, (TreeItem) ancestor, &index, NULL);
if (index >= indexFirst)
itemLast = ancestor;
else
break;
ancestor = ancestor->parent;
}
while (itemLast->lastChild != NULL)
itemLast = itemLast->lastChild;
} else {
itemFirst = item;
itemLast = item;
while (itemLast->lastChild != NULL)
itemLast = itemLast->lastChild;
}
/* Generate <Selection> event for selected items being deleted */
if (tree->selectCount)
ItemDeleteDeselect(tree, (TreeItem) itemFirst, (TreeItem) itemLast);
ItemDeleteNotify(tree, (TreeItem) itemFirst, (TreeItem) itemLast);
if (item == (Item *) ITEM_ALL || item2 == (Item *) ITEM_ALL) {
/* Do it this way so any detached items are deleted */
while (1) {
Tcl_HashEntry *hPtr;
Tcl_HashSearch search;
hPtr = Tcl_FirstHashEntry(&tree->itemHash, &search);
item = (Item *) Tcl_GetHashValue(hPtr);
if (item == (Item *) tree->root) {
hPtr = Tcl_NextHashEntry(&search);
if (hPtr == NULL)
break;
item = (Item *) Tcl_GetHashValue(hPtr);
}
TreeItem_Delete(tree, (TreeItem) item);
}
} else if ((item2 != NULL) && (item != item2)) {
TreeItem_ToIndex(tree, (TreeItem) item, &index1, NULL);
TreeItem_ToIndex(tree, (TreeItem) item2, &index2, NULL);
if (index1 > index2) {
Item *swap = item;
item = item2;
item2 = swap;
}
while (1) {
Item *prev = (Item *) TreeItem_Prev(tree, (TreeItem) item2);
if (!ISROOT(item2))
TreeItem_Delete(tree, (TreeItem) item2);
if (item2 == item)
break;
item2 = prev;
}
} else {
if (!ISROOT(item))
TreeItem_Delete(tree, (TreeItem) item);
}
break;
}
case COMMAND_DUMP:
{
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
FormatResult(interp, "index %d indexVis %d neededHeight %d",
item->index, item->indexVis, item->neededHeight);
break;
}
case COMMAND_ELEMENT:
{
return ItemElementCmd(clientData, interp, objc, objv);
}
case COMMAND_FIRSTCHILD:
{
if (item2 != NULL && item2 != item->firstChild) {
TreeItem_RemoveFromParent(tree, (TreeItem) item2);
item2->nextSibling = item->firstChild;
if (item->firstChild != NULL)
item->firstChild->prevSibling = item2;
else
item->lastChild = item2;
item->firstChild = item2;
item2->parent = item;
item->numChildren++;
TreeItem_AddToParent(tree, (TreeItem) item2);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
}
if (item->firstChild != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item->firstChild));
break;
}
case COMMAND_ID:
{
if (item != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item));
break;
}
case COMMAND_ISANCESTOR:
{
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(
TreeItem_IsAncestor(tree, (TreeItem) item, (TreeItem) item2)));
break;
}
case COMMAND_ISOPEN:
{
Tcl_SetObjResult(interp, Tcl_NewBooleanObj(item->state & STATE_OPEN));
break;
}
case COMMAND_LASTCHILD:
{
if (item2 != NULL && item2 != item->lastChild) {
TreeItem_RemoveFromParent(tree, (TreeItem) item2);
item2->prevSibling = item->lastChild;
if (item->lastChild != NULL)
item->lastChild->nextSibling = item2;
else
item->firstChild = item2;
item->lastChild = item2;
item2->parent = item;
item->numChildren++;
TreeItem_AddToParent(tree, (TreeItem) item2);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
}
if (item->lastChild != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item->lastChild));
break;
}
case COMMAND_NEXTSIBLING:
{
if (item2 != NULL && item2 != item->nextSibling) {
TreeItem_RemoveFromParent(tree, (TreeItem) item2);
item2->prevSibling = item;
if (item->nextSibling != NULL) {
item->nextSibling->prevSibling = item2;
item2->nextSibling = item->nextSibling;
} else
item->parent->lastChild = item2;
item->nextSibling = item2;
item2->parent = item->parent;
item->parent->numChildren++;
TreeItem_AddToParent(tree, (TreeItem) item2);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
}
if (item->nextSibling != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item->nextSibling));
break;
}
case COMMAND_NUMCHILDREN:
{
Tcl_SetObjResult(interp, Tcl_NewIntObj(item->numChildren));
break;
}
/* T item order I ?-visible? */
case COMMAND_ORDER:
{
int visible = FALSE;
if (objc == 5) {
int len;
char *s = Tcl_GetStringFromObj(objv[4], &len);
if ((s[0] == '-') && (strncmp(s, "-visible", len) == 0))
visible = TRUE;
else {
FormatResult(interp, "bad switch \"%s\": must be -visible",
s);
return TCL_ERROR;
}
}
if (tree->updateIndex)
Tree_UpdateItemIndex(tree);
Tcl_SetObjResult(interp,
Tcl_NewIntObj(visible ? item->indexVis : item->index));
break;
}
case COMMAND_PARENT:
{
if (item->parent != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item->parent));
break;
}
case COMMAND_PREVSIBLING:
{
if (item2 != NULL && item2 != item->prevSibling) {
TreeItem_RemoveFromParent(tree, (TreeItem) item2);
item2->nextSibling = item;
if (item->prevSibling != NULL) {
item->prevSibling->nextSibling = item2;
item2->prevSibling = item->prevSibling;
} else
item->parent->firstChild = item2;
item->prevSibling = item2;
item2->parent = item->parent;
item->parent->numChildren++;
TreeItem_AddToParent(tree, (TreeItem) item2);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
}
if (item->prevSibling != NULL)
Tcl_SetObjResult(interp, TreeItem_ToObj(tree, (TreeItem) item->prevSibling));
break;
}
case COMMAND_REMOVE:
{
if (item->parent == NULL)
break;
TreeItem_RemoveFromParent(tree, (TreeItem) item);
if (tree->debug.enable && tree->debug.data)
Tree_Debug(tree);
Tree_InvalidateColumnWidth(tree, -1);
Tree_FreeItemDInfo(tree, (TreeItem) item, NULL);
#ifdef SELECTION_VISIBLE
Tree_DeselectHidden(tree);
#endif
break;
}
case COMMAND_RNC:
{
int row,col;
if (Tree_ItemToRNC(tree, (TreeItem) item, &row, &col) == TCL_OK)
FormatResult(interp, "%d %d", row, col);
break;
}
case COMMAND_SORT:
{
return ItemSortCmd(clientData, interp, objc, objv);
}
case COMMAND_STATE:
{
return ItemStateCmd(clientData, interp, objc, objv);
}
case COMMAND_STYLE:
{
return ItemStyleCmd(clientData, interp, objc, objv);
}
/* T item text I C ?text? ?C text ...? */
case COMMAND_TEXT:
{
Column *column;
Tcl_Obj *textObj;
int i, columnIndex;
if (objc == 5) {
if (Item_FindColumnFromObj(tree, item, objv[4], &column, NULL) != TCL_OK) {
return TCL_ERROR;
}
if (column->style != NULL) {
textObj = TreeStyle_GetText(tree, column->style);
if (textObj != NULL)
Tcl_SetObjResult(interp, textObj);
}
break;
}
if ((objc - 4) & 1) {
FormatResult(interp, "wrong # args: should be \"column text column text...\"");
return TCL_ERROR;
}
TreeItem_InvalidateHeight(tree, (TreeItem) item);
Tree_InvalidateItemDInfo(tree, (TreeItem) item, NULL);
Tree_DInfoChanged(tree, DINFO_REDO_RANGES);
for (i = 4; i < objc; i += 2) {
if (Item_CreateColumnFromObj(tree, item, objv[i], &column, &columnIndex) != TCL_OK)
return TCL_ERROR;
if (column->style == NULL) {
FormatResult(interp, "item %s%d column %s%d has no style",
tree->itemPrefix, item->id,
tree->columnPrefix,
TreeColumn_GetID(Tree_FindColumn(tree, columnIndex)));
return TCL_ERROR;
}
TreeStyle_SetText(tree, (TreeItem) item, (TreeItemColumn) column, column->style, objv[i + 1]);
column->neededWidth = column->neededHeight = -1;
Tree_InvalidateColumnWidth(tree, columnIndex);
}
break;
}
}
return TCL_OK;
}
int TreeItem_Debug(TreeCtrl *tree, TreeItem item_)
{
Item *item = (Item *) item_;
Item *child;
Tcl_Interp *interp = tree->interp;
int count;
if (item->parent == item) {
FormatResult(interp,
"parent of %d is itself", item->id);
return TCL_ERROR;
}
if (item->parent == NULL) {
if (item->prevSibling != NULL) {
FormatResult(interp,
"parent of %d is nil, prevSibling is not nil",
item->id);
return TCL_ERROR;
}
if (item->nextSibling != NULL) {
FormatResult(interp,
"parent of %d is nil, nextSibling is not nil",
item->id);
return TCL_ERROR;
}
}
if (item->prevSibling != NULL) {
if (item->prevSibling == item) {
FormatResult(interp,
"prevSibling of %d is itself",
item->id);
return TCL_ERROR;
}
if (item->prevSibling->nextSibling != item) {
FormatResult(interp,
"item%d.prevSibling.nextSibling is not it",
item->id);
return TCL_ERROR;
}
}
if (item->nextSibling != NULL) {
if (item->nextSibling == item) {
FormatResult(interp,
"nextSibling of %d is itself",
item->id);
return TCL_ERROR;
}
if (item->nextSibling->prevSibling != item) {
FormatResult(interp,
"item%d.nextSibling->prevSibling is not it",
item->id);
return TCL_ERROR;
}
}
if (item->numChildren < 0) {
FormatResult(interp,
"numChildren of %d is %d",
item->id, item->numChildren);
return TCL_ERROR;
}
if (item->numChildren == 0) {
if (item->firstChild != NULL) {
FormatResult(interp,
"item%d.numChildren is zero, firstChild is not nil",
item->id);
return TCL_ERROR;
}
if (item->lastChild != NULL) {
FormatResult(interp,
"item%d.numChildren is zero, lastChild is not nil",
item->id);
return TCL_ERROR;
}
}
if (item->numChildren > 0) {
if (item->firstChild == NULL) {
FormatResult(interp,
"item%d.firstChild is nil",
item->id);
return TCL_ERROR;
}
if (item->firstChild == item) {
FormatResult(interp,
"item%d.firstChild is itself",
item->id);
return TCL_ERROR;
}
if (item->firstChild->parent != item) {
FormatResult(interp,
"item%d.firstChild.parent is not it",
item->id);
return TCL_ERROR;
}
if (item->firstChild->prevSibling != NULL) {
FormatResult(interp,
"item%d.firstChild.prevSibling is not nil",
item->id);
return TCL_ERROR;
}
if (item->lastChild == NULL) {
FormatResult(interp,
"item%d.lastChild is nil",
item->id);
return TCL_ERROR;
}
if (item->lastChild == item) {
FormatResult(interp,
"item%d.lastChild is itself",
item->id);
return TCL_ERROR;
}
if (item->lastChild->parent != item) {
FormatResult(interp,
"item%d.lastChild.parent is not it",
item->id);
return TCL_ERROR;
}
if (item->lastChild->nextSibling != NULL) {
FormatResult(interp,
"item%d.lastChild.nextSibling is not nil",
item->id);
return TCL_ERROR;
}
/* Count number of children */
count = 0;
child = item->firstChild;
while (child != NULL) {
count++;
child = child->nextSibling;
}
if (count != item->numChildren) {
FormatResult(interp,
"item%d.numChildren is %d, but counted %d",
item->id, item->numChildren, count);
return TCL_ERROR;
}
/* Debug each child recursively */
child = item->firstChild;
while (child != NULL) {
if (child->parent != item) {
FormatResult(interp,
"child->parent of %d is not it",
item->id);
return TCL_ERROR;
}
if (TreeItem_Debug(tree, (TreeItem) child) != TCL_OK)
return TCL_ERROR;
child = child->nextSibling;
}
}
return TCL_OK;
}
char *TreeItem_Identify(TreeCtrl *tree, TreeItem item_, int x, int y)
{
Item *self = (Item *) item_;
int left, top, width, height;
int indent, columnWidth, totalWidth;
Column *column;
StyleDrawArgs drawArgs;
TreeColumn treeColumn;
if (Tree_ItemBbox(tree, item_, &left, &top, &width, &height) < 0)
return NULL;
#if 0
if (y >= Tk_Height(tree->tkwin) || y + height <= 0)
return NULL;
#endif
drawArgs.tree = tree;
drawArgs.drawable = None;
totalWidth = 0;
treeColumn = tree->columns;
column = self->columns;
while (column != NULL) {
if (!TreeColumn_Visible(treeColumn))
columnWidth = 0;
else if (tree->columnCountVis == 1)
columnWidth = width;
else
columnWidth = TreeColumn_UseWidth(treeColumn);
if (columnWidth > 0) {
if (treeColumn == tree->columnTree)
indent = TreeItem_Indent(tree, item_);
else
indent = 0;
if ((x >= totalWidth + indent) && (x < totalWidth + columnWidth)) {
if (column->style != NULL) {
drawArgs.state = self->state | column->cstate;
drawArgs.style = column->style;
#ifdef LAYOUTHAX
drawArgs.indent = indent;
drawArgs.x = totalWidth;
drawArgs.y = 0;
drawArgs.width = columnWidth;
#else
drawArgs.x = indent + totalWidth;
drawArgs.y = 0;
drawArgs.width = columnWidth - indent;
#endif
drawArgs.height = height;
drawArgs.justify = TreeColumn_Justify(treeColumn);
return TreeStyle_Identify(&drawArgs, x, y);
}
return NULL;
}
totalWidth += columnWidth;
}
treeColumn = TreeColumn_Next(treeColumn);
column = column->next;
}
return NULL;
}
void TreeItem_Identify2(TreeCtrl *tree, TreeItem item_,
int x1, int y1, int x2, int y2, Tcl_Obj *listObj)
{
Item *self = (Item *) item_;
int indent, columnWidth, totalWidth;
int x, y, w, h;
Column *column;
StyleDrawArgs drawArgs;
TreeColumn treeColumn;
if (Tree_ItemBbox(tree, item_, &x, &y, &w, &h) < 0)
return;
drawArgs.tree = tree;
drawArgs.drawable = None;
totalWidth = 0;
treeColumn = tree->columns;
column = self->columns;
while (treeColumn != NULL) {
if (!TreeColumn_Visible(treeColumn))
columnWidth = 0;
else if (tree->columnCountVis == 1)
columnWidth = w;
else
columnWidth = TreeColumn_UseWidth(treeColumn);
if (columnWidth > 0) {
if (treeColumn == tree->columnTree)
indent = TreeItem_Indent(tree, item_);
else
indent = 0;
if ((x2 >= x + totalWidth + indent) && (x1 < x + totalWidth + columnWidth)) {
Tcl_Obj *subListObj = Tcl_NewListObj(0, NULL);
Tcl_ListObjAppendElement(tree->interp, subListObj,
TreeColumn_ToObj(tree, treeColumn));
if ((column != NULL) && (column->style != NULL)) {
drawArgs.state = self->state | column->cstate;
drawArgs.style = column->style;
#ifdef LAYOUTHAX
drawArgs.indent = indent;
drawArgs.x = x + totalWidth;
drawArgs.y = y;
drawArgs.width = columnWidth;
#else
drawArgs.x = x + totalWidth + indent;
drawArgs.y = y;
drawArgs.width = columnWidth - indent;
#endif
drawArgs.height = h;
drawArgs.justify = TreeColumn_Justify(treeColumn);
TreeStyle_Identify2(&drawArgs, x1, y1, x2, y2, subListObj);
}
Tcl_ListObjAppendElement(tree->interp, listObj, subListObj);
}
totalWidth += columnWidth;
}
treeColumn = TreeColumn_Next(treeColumn);
if (column != NULL)
column = column->next;
}
}
int TreeItem_Init(TreeCtrl *tree)
{
tree->itemOptionTable = Tk_CreateOptionTable(tree->interp, itemOptionSpecs);
tree->root = (TreeItem) Item_AllocRoot(tree);
tree->activeItem = tree->root; /* always non-null */
tree->anchorItem = tree->root; /* always non-null */
return TCL_OK;
}
|