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
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>LibOFX: tree.hh Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
<ul>
<li><a href="main.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>tree.hh</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* </span>
<a name="l00002"></a>00002 <span class="comment"></span>
<a name="l00003"></a>00003 <span class="comment"> $Id: tree.hh,v 1.6 2006/07/20 04:41:16 benoitg Exp $</span>
<a name="l00004"></a>00004 <span class="comment"></span>
<a name="l00005"></a>00005 <span class="comment"> STL-like templated tree class.</span>
<a name="l00006"></a>00006 <span class="comment"> Copyright (C) 2001-2005 Kasper Peeters <kasper.peeters@aei.mpg.de>.</span>
<a name="l00007"></a>00007 <span class="comment"></span>
<a name="l00008"></a>00008 <span class="comment">*/</span>
<a name="l00009"></a>00009
<a name="l00026"></a>00026 <span class="comment">/*</span>
<a name="l00027"></a>00027 <span class="comment"> This program is free software; you can redistribute it and/or modify</span>
<a name="l00028"></a>00028 <span class="comment"> it under the terms of the GNU General Public License as published by</span>
<a name="l00029"></a>00029 <span class="comment"> the Free Software Foundation; version 2.</span>
<a name="l00030"></a>00030 <span class="comment"> </span>
<a name="l00031"></a>00031 <span class="comment"> This program is distributed in the hope that it will be useful,</span>
<a name="l00032"></a>00032 <span class="comment"> but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00033"></a>00033 <span class="comment"> MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00034"></a>00034 <span class="comment"> GNU General Public License for more details.</span>
<a name="l00035"></a>00035 <span class="comment"> </span>
<a name="l00036"></a>00036 <span class="comment"> You should have received a copy of the GNU General Public License</span>
<a name="l00037"></a>00037 <span class="comment"> along with this program; if not, write to the Free Software</span>
<a name="l00038"></a>00038 <span class="comment"> Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
<a name="l00039"></a>00039 <span class="comment">*/</span>
<a name="l00040"></a>00040
<a name="l00058"></a>00058 <span class="preprocessor">#ifndef tree_hh_</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span><span class="preprocessor">#define tree_hh_</span>
<a name="l00060"></a>00060 <span class="preprocessor"></span>
<a name="l00061"></a>00061 <span class="preprocessor">#include <cassert></span>
<a name="l00062"></a>00062 <span class="preprocessor">#include <memory></span>
<a name="l00063"></a>00063 <span class="preprocessor">#include <stdexcept></span>
<a name="l00064"></a>00064 <span class="preprocessor">#include <iterator></span>
<a name="l00065"></a>00065 <span class="preprocessor">#include <set></span>
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="comment">// HP-style construct/destroy have gone from the standard,</span>
<a name="l00068"></a>00068 <span class="comment">// so here is a copy.</span>
<a name="l00069"></a>00069
<a name="l00070"></a><a class="code" href="namespacekp.html">00070</a> <span class="keyword">namespace </span>kp {
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keyword">template</span> <<span class="keyword">class</span> T1, <span class="keyword">class</span> T2>
<a name="l00073"></a><a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">00073</a> <span class="keywordtype">void</span> <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">constructor</a>(T1* p, T2& val)
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075 <span class="keyword">new</span> ((<span class="keywordtype">void</span> *) p) T1(val);
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077
<a name="l00078"></a>00078 <span class="keyword">template</span> <<span class="keyword">class</span> T1>
<a name="l00079"></a><a class="code" href="namespacekp.html#b625db515f044b7ddaa92769e2e6d745">00079</a> <span class="keywordtype">void</span> <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">constructor</a>(T1* p)
<a name="l00080"></a>00080 {
<a name="l00081"></a>00081 <span class="keyword">new</span> ((<span class="keywordtype">void</span> *) p) T1;
<a name="l00082"></a>00082 }
<a name="l00083"></a>00083
<a name="l00084"></a>00084 <span class="keyword">template</span> <<span class="keyword">class</span> T1>
<a name="l00085"></a><a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">00085</a> <span class="keywordtype">void</span> <a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">destructor</a>(T1* p)
<a name="l00086"></a>00086 {
<a name="l00087"></a>00087 p->~T1();
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089
<a name="l00090"></a>00090 };
<a name="l00091"></a>00091
<a name="l00093"></a>00093 <span class="keyword">template</span><<span class="keyword">class</span> T>
<a name="l00094"></a><a class="code" href="classtree__node__.html">00094</a> <span class="keyword">class </span><a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node_</a> { <span class="comment">// size: 5*4=20 bytes (on 32 bit arch), can be reduced by 8.</span>
<a name="l00095"></a>00095 <span class="keyword">public</span>:
<a name="l00096"></a><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">00096</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node_<T></a> *<a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l00097"></a><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">00097</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node_<T></a> *<a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>, *<a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l00098"></a><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">00098</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node_<T></a> *<a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>, *<a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00099"></a><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">00099</a> T <a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>;
<a name="l00100"></a>00100 }; <span class="comment">// __attribute__((packed));</span>
<a name="l00101"></a>00101
<a name="l00102"></a>00102 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator = std::allocator<tree_node_<T> > >
<a name="l00103"></a><a class="code" href="classtree.html">00103</a> <span class="keyword">class </span><a class="code" href="classtree.html">tree</a> {
<a name="l00104"></a>00104 <span class="keyword">protected</span>:
<a name="l00105"></a><a class="code" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">00105</a> <span class="keyword">typedef</span> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node_<T></a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>;
<a name="l00106"></a>00106 <span class="keyword">public</span>:
<a name="l00108"></a><a class="code" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa">00108</a> <span class="keyword">typedef</span> T <a class="code" href="classOfxGenericContainer.html" title="A generic container for an OFX SGML element. Every container inherits from OfxGenericContainer...">value_type</a>;
<a name="l00109"></a>00109
<a name="l00110"></a>00110 <span class="keyword">class </span>iterator_base;
<a name="l00111"></a>00111 <span class="keyword">class </span>pre_order_iterator;
<a name="l00112"></a>00112 <span class="keyword">class </span>post_order_iterator;
<a name="l00113"></a>00113 <span class="keyword">class </span>sibling_iterator;
<a name="l00114"></a>00114
<a name="l00115"></a>00115 <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree</a>();
<a name="l00116"></a>00116 <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree</a>(<span class="keyword">const</span> T&);
<a name="l00117"></a>00117 <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree</a>(<span class="keyword">const</span> iterator_base&);
<a name="l00118"></a>00118 <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree</a>(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>&);
<a name="l00119"></a>00119 <a class="code" href="classtree.html#f0169b515c95f4299fd2d984137b7868">~tree</a>();
<a name="l00120"></a>00120 <span class="keywordtype">void</span> <a class="code" href="classtree.html#9561c0c73b0605f32bf82a026eaf216a">operator=</a>(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>&);
<a name="l00121"></a>00121
<a name="l00123"></a>00123 <span class="preprocessor">#ifdef __SGI_STL_PORT</span>
<a name="l00124"></a>00124 <span class="preprocessor"></span> <span class="keyword">class </span>iterator_base : <span class="keyword">public</span> stlport::bidirectional_iterator<T, ptrdiff_t> {
<a name="l00125"></a>00125 <span class="preprocessor">#else</span>
<a name="l00126"></a><a class="code" href="classtree_1_1iterator__base.html">00126</a> <span class="preprocessor"></span> <span class="keyword">class </span><a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> {
<a name="l00127"></a>00127 <span class="preprocessor">#endif</span>
<a name="l00128"></a>00128 <span class="preprocessor"></span> <span class="keyword">public</span>:
<a name="l00129"></a><a class="code" href="classtree_1_1iterator__base.html#ab430bec9e607ae24cdd2bdffe3faf70">00129</a> <span class="keyword">typedef</span> T <a class="code" href="classtree_1_1iterator__base.html#ab430bec9e607ae24cdd2bdffe3faf70">value_type</a>;
<a name="l00130"></a><a class="code" href="classtree_1_1iterator__base.html#0665bed45269b6f7b97809ea9920008e">00130</a> <span class="keyword">typedef</span> T* <a class="code" href="classtree_1_1iterator__base.html#0665bed45269b6f7b97809ea9920008e">pointer</a>;
<a name="l00131"></a><a class="code" href="classtree_1_1iterator__base.html#063faf883017de195e7e72cf55be6914">00131</a> <span class="keyword">typedef</span> T& <a class="code" href="classtree_1_1iterator__base.html#063faf883017de195e7e72cf55be6914">reference</a>;
<a name="l00132"></a><a class="code" href="classtree_1_1iterator__base.html#a2b239ac4db713d5b191e696584a9076">00132</a> <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> <a class="code" href="classtree_1_1iterator__base.html#a2b239ac4db713d5b191e696584a9076">size_type</a>;
<a name="l00133"></a><a class="code" href="classtree_1_1iterator__base.html#eff66472181aa05d50c7ffe4a91dc4c0">00133</a> <span class="keyword">typedef</span> ptrdiff_t <a class="code" href="classtree_1_1iterator__base.html#eff66472181aa05d50c7ffe4a91dc4c0">difference_type</a>;
<a name="l00134"></a><a class="code" href="classtree_1_1iterator__base.html#7d0ace14418254eaab7526f1d0aabf40">00134</a> <span class="keyword">typedef</span> std::bidirectional_iterator_tag <a class="code" href="classtree_1_1iterator__base.html#7d0ace14418254eaab7526f1d0aabf40">iterator_category</a>;
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <a class="code" href="classtree_1_1iterator__base.html#1be2e6802acca5f281ddc7e5d67bd61c">iterator_base</a>();
<a name="l00137"></a>00137 <a class="code" href="classtree_1_1iterator__base.html#1be2e6802acca5f281ddc7e5d67bd61c">iterator_base</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *);
<a name="l00138"></a>00138
<a name="l00139"></a>00139 T& <a class="code" href="classtree_1_1iterator__base.html#ada7cbe4d4f9a5ec29db78d10712edc6">operator*</a>() <span class="keyword">const</span>;
<a name="l00140"></a>00140 T* <a class="code" href="classtree_1_1iterator__base.html#bd9c59569df7d8be5a50c835c180f4dc">operator-></a>() <span class="keyword">const</span>;
<a name="l00141"></a>00141
<a name="l00143"></a>00143 <span class="keywordtype">void</span> <a class="code" href="classtree_1_1iterator__base.html#a0be7989b9dd4c5bcdcc0d47a56d11fb" title="When called, the next increment/decrement skips children of this node.">skip_children</a>();
<a name="l00145"></a>00145 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree_1_1iterator__base.html#435004214270928d106dd4c8f6a36f17" title="Number of children of the node pointed to by the iterator.">number_of_children</a>() <span class="keyword">const</span>;
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>() <span class="keyword">const</span>;
<a name="l00148"></a>00148 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>() <span class="keyword">const</span>;
<a name="l00149"></a>00149
<a name="l00150"></a><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">00150</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l00151"></a>00151 <span class="keyword">protected</span>:
<a name="l00152"></a><a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">00152</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>;
<a name="l00153"></a>00153 };
<a name="l00154"></a>00154
<a name="l00156"></a><a class="code" href="classtree_1_1pre__order__iterator.html">00156</a> <span class="keyword">class </span><a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> : <span class="keyword">public</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> {
<a name="l00157"></a>00157 <span class="keyword">public</span>:
<a name="l00158"></a>00158 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>();
<a name="l00159"></a>00159 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *);
<a name="l00160"></a>00160 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&);
<a name="l00161"></a>00161 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&);
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>&) <span class="keyword">const</span>;
<a name="l00164"></a>00164 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>&) <span class="keyword">const</span>;
<a name="l00165"></a>00165 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& operator++();
<a name="l00166"></a>00166 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& operator--();
<a name="l00167"></a>00167 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> operator++(<span class="keywordtype">int</span>);
<a name="l00168"></a>00168 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> operator--(<span class="keywordtype">int</span>);
<a name="l00169"></a>00169 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& operator+=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00170"></a>00170 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& operator-=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00171"></a>00171 };
<a name="l00172"></a>00172
<a name="l00174"></a><a class="code" href="classtree_1_1post__order__iterator.html">00174</a> <span class="keyword">class </span><a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> : <span class="keyword">public</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> {
<a name="l00175"></a>00175 <span class="keyword">public</span>:
<a name="l00176"></a>00176 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>();
<a name="l00177"></a>00177 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *);
<a name="l00178"></a>00178 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&);
<a name="l00179"></a>00179 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&);
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>&) <span class="keyword">const</span>;
<a name="l00182"></a>00182 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>&) <span class="keyword">const</span>;
<a name="l00183"></a>00183 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& operator++();
<a name="l00184"></a>00184 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& operator--();
<a name="l00185"></a>00185 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> operator++(<span class="keywordtype">int</span>);
<a name="l00186"></a>00186 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> operator--(<span class="keywordtype">int</span>);
<a name="l00187"></a>00187 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& operator+=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00188"></a>00188 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& operator-=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00189"></a>00189
<a name="l00191"></a>00191 <span class="keywordtype">void</span> descend_all();
<a name="l00192"></a>00192 };
<a name="l00193"></a>00193
<a name="l00195"></a><a class="code" href="classtree.html#2079982538b88d21fe1ccea34fe7ce0e">00195</a> <span class="keyword">typedef</span> pre_order_iterator <a class="code" href="classtree.html#2079982538b88d21fe1ccea34fe7ce0e" title="The default iterator type throughout the tree class.">iterator</a>;
<a name="l00196"></a>00196
<a name="l00198"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html">00198</a> <span class="keyword">class </span><a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> : <span class="keyword">public</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> {
<a name="l00199"></a>00199 <span class="keyword">public</span>:
<a name="l00200"></a>00200 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>();
<a name="l00201"></a>00201 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *);
<a name="l00202"></a>00202 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&);
<a name="l00203"></a>00203 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&);
<a name="l00204"></a>00204 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>&);
<a name="l00205"></a>00205
<a name="l00206"></a>00206 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>&) <span class="keyword">const</span>;
<a name="l00207"></a>00207 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>&) <span class="keyword">const</span>;
<a name="l00208"></a>00208 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>& operator++();
<a name="l00209"></a>00209 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>& operator--();
<a name="l00210"></a>00210 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> operator++(<span class="keywordtype">int</span>);
<a name="l00211"></a>00211 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> operator--(<span class="keywordtype">int</span>);
<a name="l00212"></a>00212 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>& operator+=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00213"></a>00213 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>& operator-=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00214"></a>00214
<a name="l00215"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">00215</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *first_parent_;
<a name="l00216"></a>00216 <span class="keyword">private</span>:
<a name="l00217"></a>00217 <span class="keywordtype">void</span> set_first_parent_();
<a name="l00218"></a>00218 <span class="keywordtype">void</span> find_leftmost_parent_();
<a name="l00219"></a>00219 };
<a name="l00220"></a>00220
<a name="l00222"></a><a class="code" href="classtree_1_1sibling__iterator.html">00222</a> <span class="keyword">class </span><a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> : <span class="keyword">public</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> {
<a name="l00223"></a>00223 <span class="keyword">public</span>:
<a name="l00224"></a>00224 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>();
<a name="l00225"></a>00225 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *);
<a name="l00226"></a>00226 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&);
<a name="l00227"></a>00227 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&);
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&) <span class="keyword">const</span>;
<a name="l00230"></a>00230 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>&) <span class="keyword">const</span>;
<a name="l00231"></a>00231 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& operator++();
<a name="l00232"></a>00232 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& operator--();
<a name="l00233"></a>00233 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> operator++(<span class="keywordtype">int</span>);
<a name="l00234"></a>00234 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> operator--(<span class="keywordtype">int</span>);
<a name="l00235"></a>00235 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& operator+=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00236"></a>00236 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& operator-=(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>);
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *range_first() <span class="keyword">const</span>;
<a name="l00239"></a>00239 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *range_last() <span class="keyword">const</span>;
<a name="l00240"></a><a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">00240</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *parent_;
<a name="l00241"></a>00241 <span class="keyword">private</span>:
<a name="l00242"></a>00242 <span class="keywordtype">void</span> set_parent_();
<a name="l00243"></a>00243 };
<a name="l00244"></a>00244
<a name="l00246"></a>00246 <span class="keyword">inline</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>() <span class="keyword">const</span>;
<a name="l00248"></a>00248 <span class="keyword">inline</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>() <span class="keyword">const</span>;
<a name="l00250"></a>00250 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> <a class="code" href="classtree.html#73c673d39fe46db7ca4e1533841cdbc0" title="Return post-order iterator to the beginning of the tree.">begin_post</a>() <span class="keyword">const</span>;
<a name="l00252"></a>00252 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> <a class="code" href="classtree.html#d339ab550fc2718e84506e91960a177f" title="Return post-order iterator to the end of the tree.">end_post</a>() <span class="keyword">const</span>;
<a name="l00254"></a>00254 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> <a class="code" href="classtree.html#3e7ee34b9582cb6f0bd5b25f501a1057" title="Return fixed-depth iterator to the first node at a given depth.">begin_fixed</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) <span class="keyword">const</span>;
<a name="l00256"></a>00256 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> <a class="code" href="classtree.html#bab26c0edd25cc836ed768e32c034165" title="Return fixed-depth iterator to end of the nodes at given depth.">end_fixed</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) <span class="keyword">const</span>;
<a name="l00258"></a>00258 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00260"></a>00260 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00261"></a>00261
<a name="l00263"></a>00263 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28" title="Return iterator to the parent of a node.">parent</a>(iter) <span class="keyword">const</span>;
<a name="l00265"></a>00265 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#6d38ef0b2b73266cbc39ab021482bb50" title="Return iterator to the previous sibling of a node.">previous_sibling</a>(iter) <span class="keyword">const</span>;
<a name="l00267"></a>00267 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#4e3ea50e0949bd05e27ecb9c6b7162ff" title="Return iterator to the next sibling of a node.">next_sibling</a>(iter) <span class="keyword">const</span>;
<a name="l00269"></a>00269 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#ce3b299e157ec177230a0144771b2a7e" title="Return iterator to the next node at a given depth.">next_at_same_depth</a>(iter) <span class="keyword">const</span>;
<a name="l00270"></a>00270
<a name="l00272"></a>00272 <span class="keywordtype">void</span> <a class="code" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a" title="Erase all nodes of the tree.">clear</a>();
<a name="l00274"></a>00274 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b" title="Erase element at position pointed to by iterator, return incremented iterator.">erase</a>(iter);
<a name="l00276"></a>00276 <span class="keywordtype">void</span> <a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc" title="Erase all children of the node pointed to by iterator.">erase_children</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&);
<a name="l00277"></a>00277
<a name="l00279"></a>00279 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>);
<a name="l00281"></a>00281 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x);
<a name="l00283"></a>00283 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter other_position);
<a name="l00285"></a>00285 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#92ab22e0a98d8899c0d1b6c9d0a85465" title="Append the nodes in the from-to range (plus their children) as children of position...">append_children</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to);
<a name="l00286"></a>00286
<a name="l00288"></a>00288 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> <a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">set_head</a>(<span class="keyword">const</span> T& x);
<a name="l00290"></a>00290 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">insert</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x);
<a name="l00292"></a>00292 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">insert</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x);
<a name="l00294"></a>00294 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5" title="Insert node (with children) pointed to by subtree as previous sibling of node pointed...">insert_subtree</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">subtree</a>);
<a name="l00296"></a>00296 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#215ab56bd13f59c661eb2298e373ff3e" title="Insert node as next sibling of node pointed to by position.">insert_after</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x);
<a name="l00297"></a>00297
<a name="l00299"></a>00299 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x);
<a name="l00301"></a>00301 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& from);
<a name="l00303"></a>00303 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> orig_begin, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> orig_end,
<a name="l00304"></a>00304 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> new_begin, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> new_end);
<a name="l00305"></a>00305
<a name="l00307"></a>00307 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#479c8e3f748608a9b9fb91e58e18998c" title="Move all children of node at &#39;position&#39; to be siblings, returns position...">flatten</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>);
<a name="l00309"></a>00309 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e" title="Move nodes in range to be children of &#39;position&#39;.">reparent</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>);
<a name="l00311"></a>00311 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e" title="Move nodes in range to be children of &#39;position&#39;.">reparent</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter from);
<a name="l00312"></a>00312
<a name="l00314"></a>00314 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#e7f72ba46cd061f71720c731b4a9bf63" title="Move &#39;source&#39; node (plus its children) to become the next sibling of &#39;target&#39;...">move_after</a>(iter target, iter source);
<a name="l00316"></a>00316 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#b45aa15042445a81b13873d3ef4a2e86" title="Move &#39;source&#39; node (plus its children) to become the previous sibling of...">move_before</a>(iter target, iter source);
<a name="l00318"></a>00318 <span class="keyword">template</span><<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#a4f8b906b2758eec530e28387b819284" title="Move &#39;source&#39; node (plus its children) to become the node at &#39;target&#39;...">move_ontop</a>(iter target, iter source);
<a name="l00319"></a>00319
<a name="l00321"></a>00321 <span class="keywordtype">void</span> <a class="code" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1" title="Merge with other tree, creating new branches and leaves only if they are not already...">merge</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>,
<a name="l00322"></a>00322 <span class="keywordtype">bool</span> duplicate_leaves=<span class="keyword">false</span>);
<a name="l00324"></a>00324 <span class="keywordtype">void</span> <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">sort</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to, <span class="keywordtype">bool</span> deep=<span class="keyword">false</span>);
<a name="l00325"></a>00325 <span class="keyword">template</span><<span class="keyword">class</span> StrictWeakOrdering>
<a name="l00326"></a>00326 <span class="keywordtype">void</span> <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">sort</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to, StrictWeakOrdering comp, <span class="keywordtype">bool</span> deep=<span class="keyword">false</span>);
<a name="l00328"></a>00328 <span class="keyword">template</span><<span class="keyword">typename</span> iter>
<a name="l00329"></a>00329 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">equal</a>(<span class="keyword">const</span> iter& one, <span class="keyword">const</span> iter& two, <span class="keyword">const</span> iter& three) <span class="keyword">const</span>;
<a name="l00330"></a>00330 <span class="keyword">template</span><<span class="keyword">typename</span> iter, <span class="keyword">class</span> BinaryPredicate>
<a name="l00331"></a>00331 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">equal</a>(<span class="keyword">const</span> iter& one, <span class="keyword">const</span> iter& two, <span class="keyword">const</span> iter& three, BinaryPredicate) <span class="keyword">const</span>;
<a name="l00332"></a>00332 <span class="keyword">template</span><<span class="keyword">typename</span> iter>
<a name="l00333"></a>00333 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">equal_subtree</a>(<span class="keyword">const</span> iter& one, <span class="keyword">const</span> iter& two) <span class="keyword">const</span>;
<a name="l00334"></a>00334 <span class="keyword">template</span><<span class="keyword">typename</span> iter, <span class="keyword">class</span> BinaryPredicate>
<a name="l00335"></a>00335 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">equal_subtree</a>(<span class="keyword">const</span> iter& one, <span class="keyword">const</span> iter& two, BinaryPredicate) <span class="keyword">const</span>;
<a name="l00337"></a>00337 <a class="code" href="classtree.html">tree</a> <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">subtree</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to) <span class="keyword">const</span>;
<a name="l00338"></a>00338 <span class="keywordtype">void</span> <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">subtree</a>(<a class="code" href="classtree.html">tree</a>&, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to) <span class="keyword">const</span>;
<a name="l00340"></a>00340 <span class="keywordtype">void</span> <a class="code" href="classtree.html#e842f9b70235bc2412b3c43bca759448" title="Exchange the node (plus subtree) with its sibling node (do nothing if no sibling...">swap</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> it);
<a name="l00341"></a>00341
<a name="l00343"></a>00343 <span class="keywordtype">int</span> <a class="code" href="classtree.html#219ff1bfc99f78fd9a2db71f41891523" title="Count the total number of nodes.">size</a>() <span class="keyword">const</span>;
<a name="l00345"></a>00345 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#e9f7fd30c51443d46ca8941d5bc06da2" title="Check if tree is empty.">empty</a>() <span class="keyword">const</span>;
<a name="l00347"></a>00347 <span class="keywordtype">int</span> <a class="code" href="classtree.html#16c66be75ca89c999a9c4a68497b05a1" title="Compute the depth to the root.">depth</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00349"></a>00349 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree_1_1iterator__base.html#435004214270928d106dd4c8f6a36f17" title="Number of children of the node pointed to by the iterator.">number_of_children</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00351"></a>00351 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree.html#3cddce970c4d44af57cf9ec0d7c3d009" title="Count the number of &#39;next&#39; siblings of node at iterator.">number_of_siblings</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00353"></a>00353 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#825e2106781e846bdd8732c117dc21db" title="Determine whether node at position is in the subtrees with root in the range.">is_in_subtree</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>,
<a name="l00354"></a>00354 <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>) <span class="keyword">const</span>;
<a name="l00356"></a>00356 <span class="keywordtype">bool</span> <a class="code" href="classtree.html#9605b028195248894dc8cf506cd256e3" title="Determine whether the iterator is an &#39;end&#39; iterator and thus not actually...">is_valid</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>&) <span class="keyword">const</span>;
<a name="l00357"></a>00357
<a name="l00359"></a>00359 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree.html#de5ec1ba55f94165062e50d01ec35d86" title="Determine the index of a node in the range of siblings to which it belongs.">index</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> it) <span class="keyword">const</span>;
<a name="l00361"></a>00361 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree.html#446c722c82607f8b3243a9153b665d19" title="Inverse of &#39;index&#39;: return the n-th child of the node at position.">child</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span>) <span class="keyword">const</span>;
<a name="l00362"></a>00362
<a name="l00364"></a><a class="code" href="classtree_1_1iterator__base__less.html">00364</a> <span class="keyword">class </span><a class="code" href="classtree_1_1iterator__base__less.html" title="Comparator class for iterators (compares the actual node content, not pointer values)...">iterator_base_less</a> {
<a name="l00365"></a>00365 <span class="keyword">public</span>:
<a name="l00366"></a><a class="code" href="classtree_1_1iterator__base__less.html#3dc4cb0c8b9a2e3ad5ed7852dd9b6a3b">00366</a> <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::iterator_base</a>& one,
<a name="l00367"></a>00367 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::iterator_base</a>& two)<span class="keyword"> const</span>
<a name="l00368"></a>00368 <span class="keyword"> </span>{
<a name="l00369"></a>00369 <span class="keywordflow">return</span> one.node < two.node;
<a name="l00370"></a>00370 }
<a name="l00371"></a>00371 };
<a name="l00372"></a><a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">00372</a> <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>, *<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>; <span class="comment">// head/feet are always dummy; if an iterator points to them it is invalid</span>
<a name="l00373"></a>00373 <span class="keyword">private</span>:
<a name="l00374"></a>00374 tree_node_allocator alloc_;
<a name="l00375"></a>00375 <span class="keywordtype">void</span> head_initialise_();
<a name="l00376"></a>00376 <span class="keywordtype">void</span> copy_(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>& other);
<a name="l00377"></a>00377
<a name="l00379"></a>00379 <span class="keyword">template</span><<span class="keyword">class</span> StrictWeakOrdering>
<a name="l00380"></a>00380 <span class="keyword">class </span>compare_nodes {
<a name="l00381"></a>00381 <span class="keyword">public</span>:
<a name="l00382"></a>00382 compare_nodes(StrictWeakOrdering comp) : comp_(comp) {};
<a name="l00383"></a>00383
<a name="l00384"></a>00384 <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> <a class="code" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">tree_node</a> *a, <span class="keyword">const</span> <a class="code" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">tree_node</a> *b)
<a name="l00385"></a>00385 {
<a name="l00386"></a>00386 <span class="keyword">static</span> StrictWeakOrdering comp;
<a name="l00387"></a>00387 <span class="keywordflow">return</span> comp(a->data, b->data);
<a name="l00388"></a>00388 }
<a name="l00389"></a>00389 <span class="keyword">private</span>:
<a name="l00390"></a>00390 StrictWeakOrdering comp_;
<a name="l00391"></a>00391 };
<a name="l00392"></a>00392 };
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="comment">//template <class T, class tree_node_allocator></span>
<a name="l00395"></a>00395 <span class="comment">//class iterator_base_less {</span>
<a name="l00396"></a>00396 <span class="comment">// public:</span>
<a name="l00397"></a>00397 <span class="comment">// bool operator()(const typename tree<T, tree_node_allocator>::iterator_base& one,</span>
<a name="l00398"></a>00398 <span class="comment">// const typename tree<T, tree_node_allocator>::iterator_base& two) const</span>
<a name="l00399"></a>00399 <span class="comment">// {</span>
<a name="l00400"></a>00400 <span class="comment">// txtout << "operatorclass<" << one.node < two.node << std::endl;</span>
<a name="l00401"></a>00401 <span class="comment">// return one.node < two.node;</span>
<a name="l00402"></a>00402 <span class="comment">// }</span>
<a name="l00403"></a>00403 <span class="comment">//};</span>
<a name="l00404"></a>00404
<a name="l00405"></a>00405 <span class="comment">//template <class T, class tree_node_allocator></span>
<a name="l00406"></a>00406 <span class="comment">//bool operator<(const typename tree<T, tree_node_allocator>::iterator& one,</span>
<a name="l00407"></a>00407 <span class="comment">// const typename tree<T, tree_node_allocator>::iterator& two)</span>
<a name="l00408"></a>00408 <span class="comment">// {</span>
<a name="l00409"></a>00409 <span class="comment">// txtout << "operator< " << one.node < two.node << std::endl;</span>
<a name="l00410"></a>00410 <span class="comment">// if(one.node < two.node) return true;</span>
<a name="l00411"></a>00411 <span class="comment">// return false;</span>
<a name="l00412"></a>00412 <span class="comment">// }</span>
<a name="l00413"></a>00413
<a name="l00414"></a>00414 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00415"></a>00415 <span class="keywordtype">bool</span> operator>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::iterator_base</a>& one,
<a name="l00416"></a>00416 <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::iterator_base</a>& two)
<a name="l00417"></a>00417 {
<a name="l00418"></a>00418 <span class="keywordflow">if</span>(one.node > two.node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00419"></a>00419 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00420"></a>00420 }
<a name="l00421"></a>00421
<a name="l00422"></a>00422
<a name="l00423"></a>00423
<a name="l00424"></a>00424 <span class="comment">// Tree</span>
<a name="l00425"></a>00425
<a name="l00426"></a>00426 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00427"></a><a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">00427</a> <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree<T, tree_node_allocator>::tree</a>()
<a name="l00428"></a>00428 {
<a name="l00429"></a>00429 head_initialise_();
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431
<a name="l00432"></a>00432 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00433"></a><a class="code" href="classtree.html#5925c012af64fe91a3a5ed39e3ba9d9a">00433</a> <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree<T, tree_node_allocator>::tree</a>(<span class="keyword">const</span> T& x)
<a name="l00434"></a>00434 {
<a name="l00435"></a>00435 head_initialise_();
<a name="l00436"></a>00436 <a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">set_head</a>(x);
<a name="l00437"></a>00437 }
<a name="l00438"></a>00438
<a name="l00439"></a>00439 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00440"></a><a class="code" href="classtree.html#b72378e7a772a82f90d91ef7493f27bc">00440</a> <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree<T, tree_node_allocator>::tree</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& other)
<a name="l00441"></a>00441 {
<a name="l00442"></a>00442 head_initialise_();
<a name="l00443"></a>00443 <a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">set_head</a>((*other));
<a name="l00444"></a>00444 <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), other);
<a name="l00445"></a>00445 }
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00448"></a><a class="code" href="classtree.html#f0169b515c95f4299fd2d984137b7868">00448</a> <a class="code" href="classtree.html#f0169b515c95f4299fd2d984137b7868">tree<T, tree_node_allocator>::~tree</a>()
<a name="l00449"></a>00449 {
<a name="l00450"></a>00450 <a class="code" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a" title="Erase all nodes of the tree.">clear</a>();
<a name="l00451"></a>00451 alloc_.deallocate(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>,1);
<a name="l00452"></a>00452 alloc_.deallocate(<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>,1);
<a name="l00453"></a>00453 }
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00456"></a>00456 <span class="keywordtype">void</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::head_initialise_</a>()
<a name="l00457"></a>00457 {
<a name="l00458"></a>00458 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a> = alloc_.allocate(1,0); <span class="comment">// MSVC does not have default second argument </span>
<a name="l00459"></a>00459 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a> = alloc_.allocate(1,0);
<a name="l00460"></a>00460
<a name="l00461"></a>00461 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=0;
<a name="l00462"></a>00462 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00463"></a>00463 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00464"></a>00464 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=0; <span class="comment">//head;</span>
<a name="l00465"></a>00465 <a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>; <span class="comment">//head;</span>
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=0;
<a name="l00468"></a>00468 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00469"></a>00469 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00470"></a>00470 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>;
<a name="l00471"></a>00471 <a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=0;
<a name="l00472"></a>00472 }
<a name="l00473"></a>00473
<a name="l00474"></a>00474 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00475"></a><a class="code" href="classtree.html#9561c0c73b0605f32bf82a026eaf216a">00475</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#9561c0c73b0605f32bf82a026eaf216a">tree<T, tree_node_allocator>::operator=</a>(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>& other)
<a name="l00476"></a>00476 {
<a name="l00477"></a>00477 copy_(other);
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479
<a name="l00480"></a>00480 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00481"></a><a class="code" href="classtree.html#e9e06b40929dfd33a1024bd422beedb6">00481</a> <a class="code" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree<T, tree_node_allocator>::tree</a>(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>& other)
<a name="l00482"></a>00482 {
<a name="l00483"></a>00483 head_initialise_();
<a name="l00484"></a>00484 copy_(other);
<a name="l00485"></a>00485 }
<a name="l00486"></a>00486
<a name="l00487"></a>00487 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00488"></a>00488 <span class="keywordtype">void</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::copy_</a>(<span class="keyword">const</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a>& other)
<a name="l00489"></a>00489 {
<a name="l00490"></a>00490 <a class="code" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a" title="Erase all nodes of the tree.">clear</a>();
<a name="l00491"></a>00491 pre_order_iterator it=other.<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), to=<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>();
<a name="l00492"></a>00492 <span class="keywordflow">while</span>(it!=other.<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>()) {
<a name="l00493"></a>00493 to=<a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">insert</a>(to, (*it));
<a name="l00494"></a>00494 it.skip_children();
<a name="l00495"></a>00495 ++it;
<a name="l00496"></a>00496 }
<a name="l00497"></a>00497 to=<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>();
<a name="l00498"></a>00498 it=other.<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>();
<a name="l00499"></a>00499 <span class="keywordflow">while</span>(it!=other.<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>()) {
<a name="l00500"></a>00500 to=<a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(to, it);
<a name="l00501"></a>00501 to.skip_children();
<a name="l00502"></a>00502 it.skip_children();
<a name="l00503"></a>00503 ++to;
<a name="l00504"></a>00504 ++it;
<a name="l00505"></a>00505 }
<a name="l00506"></a>00506 }
<a name="l00507"></a>00507
<a name="l00508"></a>00508 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00509"></a><a class="code" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a">00509</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a" title="Erase all nodes of the tree.">tree<T, tree_node_allocator>::clear</a>()
<a name="l00510"></a>00510 {
<a name="l00511"></a>00511 <span class="keywordflow">if</span>(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>)
<a name="l00512"></a>00512 <span class="keywordflow">while</span>(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>)
<a name="l00513"></a>00513 <a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b" title="Erase element at position pointed to by iterator, return incremented iterator.">erase</a>(<a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>));
<a name="l00514"></a>00514 }
<a name="l00515"></a>00515
<a name="l00516"></a>00516 <span class="keyword">template</span><<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00517"></a><a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc">00517</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc" title="Erase all children of the node pointed to by iterator.">tree<T, tree_node_allocator>::erase_children</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it)
<a name="l00518"></a>00518 {
<a name="l00519"></a>00519 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *cur=it.node->first_child;
<a name="l00520"></a>00520 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *prev=0;
<a name="l00521"></a>00521
<a name="l00522"></a>00522 <span class="keywordflow">while</span>(cur!=0) {
<a name="l00523"></a>00523 prev=cur;
<a name="l00524"></a>00524 cur=cur-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00525"></a>00525 <a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc" title="Erase all children of the node pointed to by iterator.">erase_children</a>(<a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(prev));
<a name="l00526"></a>00526 <a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">kp::destructor</a>(&prev-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00527"></a>00527 alloc_.deallocate(prev,1);
<a name="l00528"></a>00528 }
<a name="l00529"></a>00529 it.node->first_child=0;
<a name="l00530"></a>00530 it.node->last_child=0;
<a name="l00531"></a>00531 }
<a name="l00532"></a>00532
<a name="l00533"></a>00533 <span class="keyword">template</span><<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00534"></a>00534 <span class="keyword">template</span><<span class="keyword">class</span> iter>
<a name="l00535"></a><a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b">00535</a> iter <a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b" title="Erase element at position pointed to by iterator, return incremented iterator.">tree<T, tree_node_allocator>::erase</a>(iter it)
<a name="l00536"></a>00536 {
<a name="l00537"></a>00537 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *cur=it.node;
<a name="l00538"></a>00538 assert(cur!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>);
<a name="l00539"></a>00539 iter ret=it;
<a name="l00540"></a>00540 ret.skip_children();
<a name="l00541"></a>00541 ++ret;
<a name="l00542"></a>00542 <a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc" title="Erase all children of the node pointed to by iterator.">erase_children</a>(it);
<a name="l00543"></a>00543 <span class="keywordflow">if</span>(cur-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>==0) {
<a name="l00544"></a>00544 cur-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=cur-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00545"></a>00545 }
<a name="l00546"></a>00546 <span class="keywordflow">else</span> {
<a name="l00547"></a>00547 cur-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=cur-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00548"></a>00548 }
<a name="l00549"></a>00549 <span class="keywordflow">if</span>(cur-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==0) {
<a name="l00550"></a>00550 cur-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=cur-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l00551"></a>00551 }
<a name="l00552"></a>00552 <span class="keywordflow">else</span> {
<a name="l00553"></a>00553 cur-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=cur-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555
<a name="l00556"></a>00556 <a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">kp::destructor</a>(&cur-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00557"></a>00557 alloc_.deallocate(cur,1);
<a name="l00558"></a>00558 <span class="keywordflow">return</span> ret;
<a name="l00559"></a>00559 }
<a name="l00560"></a>00560
<a name="l00561"></a>00561 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00562"></a><a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e">00562</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a> <a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">tree<T, tree_node_allocator>::begin</a>()<span class="keyword"> const</span>
<a name="l00563"></a>00563 <span class="keyword"> </span>{
<a name="l00564"></a>00564 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>);
<a name="l00565"></a>00565 }
<a name="l00566"></a>00566
<a name="l00567"></a>00567 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00568"></a><a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e">00568</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a> <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">tree<T, tree_node_allocator>::end</a>()<span class="keyword"> const</span>
<a name="l00569"></a>00569 <span class="keyword"> </span>{
<a name="l00570"></a>00570 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>);
<a name="l00571"></a>00571 }
<a name="l00572"></a>00572
<a name="l00573"></a>00573 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00574"></a><a class="code" href="classtree.html#73c673d39fe46db7ca4e1533841cdbc0">00574</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a> <a class="code" href="classtree.html#73c673d39fe46db7ca4e1533841cdbc0" title="Return post-order iterator to the beginning of the tree.">tree<T, tree_node_allocator>::begin_post</a>()<span class="keyword"> const</span>
<a name="l00575"></a>00575 <span class="keyword"> </span>{
<a name="l00576"></a>00576 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00577"></a>00577 <span class="keywordflow">if</span>(tmp!=<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>) {
<a name="l00578"></a>00578 <span class="keywordflow">while</span>(tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>)
<a name="l00579"></a>00579 tmp=tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l00580"></a>00580 }
<a name="l00581"></a>00581 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>(tmp);
<a name="l00582"></a>00582 }
<a name="l00583"></a>00583
<a name="l00584"></a>00584 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00585"></a><a class="code" href="classtree.html#d339ab550fc2718e84506e91960a177f">00585</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a> <a class="code" href="classtree.html#d339ab550fc2718e84506e91960a177f" title="Return post-order iterator to the end of the tree.">tree<T, tree_node_allocator>::end_post</a>()<span class="keyword"> const</span>
<a name="l00586"></a>00586 <span class="keyword"> </span>{
<a name="l00587"></a>00587 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>(<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>);
<a name="l00588"></a>00588 }
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00591"></a><a class="code" href="classtree.html#3e7ee34b9582cb6f0bd5b25f501a1057">00591</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a> <a class="code" href="classtree.html#3e7ee34b9582cb6f0bd5b25f501a1057" title="Return fixed-depth iterator to the first node at a given depth.">tree<T, tree_node_allocator>::begin_fixed</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& pos, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dp)<span class="keyword"> const</span>
<a name="l00592"></a>00592 <span class="keyword"> </span>{
<a name="l00593"></a>00593 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=pos.node;
<a name="l00594"></a>00594 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> curdepth=0;
<a name="l00595"></a>00595 <span class="keywordflow">while</span>(curdepth<dp) { <span class="comment">// go down one level</span>
<a name="l00596"></a>00596 <span class="keywordflow">while</span>(tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>==0) {
<a name="l00597"></a>00597 tmp=tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00598"></a>00598 <span class="keywordflow">if</span>(tmp==0)
<a name="l00599"></a>00599 <span class="keywordflow">throw</span> std::range_error(<span class="stringliteral">"tree: begin_fixed out of range"</span>);
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601 tmp=tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l00602"></a>00602 ++curdepth;
<a name="l00603"></a>00603 }
<a name="l00604"></a>00604 <span class="keywordflow">return</span> tmp;
<a name="l00605"></a>00605 }
<a name="l00606"></a>00606
<a name="l00607"></a>00607 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00608"></a><a class="code" href="classtree.html#bab26c0edd25cc836ed768e32c034165">00608</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a> <a class="code" href="classtree.html#bab26c0edd25cc836ed768e32c034165" title="Return fixed-depth iterator to end of the nodes at given depth.">tree<T, tree_node_allocator>::end_fixed</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& pos, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dp)<span class="keyword"> const</span>
<a name="l00609"></a>00609 <span class="keyword"> </span>{
<a name="l00610"></a>00610 assert(1==0); <span class="comment">// FIXME: not correct yet</span>
<a name="l00611"></a>00611 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=pos.node;
<a name="l00612"></a>00612 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> curdepth=1;
<a name="l00613"></a>00613 <span class="keywordflow">while</span>(curdepth<dp) { <span class="comment">// go down one level</span>
<a name="l00614"></a>00614 <span class="keywordflow">while</span>(tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>==0) {
<a name="l00615"></a>00615 tmp=tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00616"></a>00616 <span class="keywordflow">if</span>(tmp==0)
<a name="l00617"></a>00617 <span class="keywordflow">throw</span> std::range_error(<span class="stringliteral">"tree: end_fixed out of range"</span>);
<a name="l00618"></a>00618 }
<a name="l00619"></a>00619 tmp=tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l00620"></a>00620 ++curdepth;
<a name="l00621"></a>00621 }
<a name="l00622"></a>00622 <span class="keywordflow">return</span> tmp;
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624
<a name="l00625"></a>00625 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00626"></a><a class="code" href="classtree.html#a784ffa6dec85f52754dde8bd6a99aeb">00626</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">tree<T, tree_node_allocator>::begin</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& pos)<span class="keyword"> const</span>
<a name="l00627"></a>00627 <span class="keyword"> </span>{
<a name="l00628"></a>00628 <span class="keywordflow">if</span>(pos.node->first_child==0) {
<a name="l00629"></a>00629 <span class="keywordflow">return</span> <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(pos);
<a name="l00630"></a>00630 }
<a name="l00631"></a>00631 <span class="keywordflow">return</span> pos.node->first_child;
<a name="l00632"></a>00632 }
<a name="l00633"></a>00633
<a name="l00634"></a>00634 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00635"></a><a class="code" href="classtree.html#a6aa8b0c6af0f50bfc86592847759127">00635</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">tree<T, tree_node_allocator>::end</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& pos)<span class="keyword"> const</span>
<a name="l00636"></a>00636 <span class="keyword"> </span>{
<a name="l00637"></a>00637 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> ret(0);
<a name="l00638"></a>00638 ret.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>=pos.node;
<a name="l00639"></a>00639 <span class="keywordflow">return</span> ret;
<a name="l00640"></a>00640 }
<a name="l00641"></a>00641
<a name="l00642"></a>00642 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00643"></a>00643 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l00644"></a><a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28">00644</a> iter <a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28" title="Return iterator to the parent of a node.">tree<T, tree_node_allocator>::parent</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)<span class="keyword"> const</span>
<a name="l00645"></a>00645 <span class="keyword"> </span>{
<a name="l00646"></a>00646 assert(position.node!=0);
<a name="l00647"></a>00647 <span class="keywordflow">return</span> iter(position.node->parent);
<a name="l00648"></a>00648 }
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00651"></a>00651 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l00652"></a><a class="code" href="classtree.html#6d38ef0b2b73266cbc39ab021482bb50">00652</a> iter <a class="code" href="classtree.html#6d38ef0b2b73266cbc39ab021482bb50" title="Return iterator to the previous sibling of a node.">tree<T, tree_node_allocator>::previous_sibling</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)<span class="keyword"> const</span>
<a name="l00653"></a>00653 <span class="keyword"> </span>{
<a name="l00654"></a>00654 assert(position.node!=0);
<a name="l00655"></a>00655 iter ret(position);
<a name="l00656"></a>00656 ret.node=position.node->prev_sibling;
<a name="l00657"></a>00657 <span class="keywordflow">return</span> ret;
<a name="l00658"></a>00658 }
<a name="l00659"></a>00659
<a name="l00660"></a>00660 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00661"></a>00661 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l00662"></a><a class="code" href="classtree.html#4e3ea50e0949bd05e27ecb9c6b7162ff">00662</a> iter <a class="code" href="classtree.html#4e3ea50e0949bd05e27ecb9c6b7162ff" title="Return iterator to the next sibling of a node.">tree<T, tree_node_allocator>::next_sibling</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)<span class="keyword"> const</span>
<a name="l00663"></a>00663 <span class="keyword"> </span>{
<a name="l00664"></a>00664 assert(position.node!=0);
<a name="l00665"></a>00665 iter ret(position);
<a name="l00666"></a>00666 ret.node=position.node->next_sibling;
<a name="l00667"></a>00667 <span class="keywordflow">return</span> ret;
<a name="l00668"></a>00668 }
<a name="l00669"></a>00669
<a name="l00670"></a>00670 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00671"></a>00671 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l00672"></a><a class="code" href="classtree.html#ce3b299e157ec177230a0144771b2a7e">00672</a> iter <a class="code" href="classtree.html#ce3b299e157ec177230a0144771b2a7e" title="Return iterator to the next node at a given depth.">tree<T, tree_node_allocator>::next_at_same_depth</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)<span class="keyword"> const</span>
<a name="l00673"></a>00673 <span class="keyword"> </span>{
<a name="l00674"></a>00674 assert(position.node!=0);
<a name="l00675"></a>00675 iter ret(position);
<a name="l00676"></a>00676
<a name="l00677"></a>00677 <span class="keywordflow">if</span>(position.node->next_sibling) {
<a name="l00678"></a>00678 ret.node=position.node->next_sibling;
<a name="l00679"></a>00679 }
<a name="l00680"></a>00680 <span class="keywordflow">else</span> {
<a name="l00681"></a>00681 <span class="keywordtype">int</span> relative_depth=0;
<a name="l00682"></a>00682 upper:
<a name="l00683"></a>00683 <span class="keywordflow">do</span> {
<a name="l00684"></a>00684 ret.node=ret.node->parent;
<a name="l00685"></a>00685 <span class="keywordflow">if</span>(ret.node==0) <span class="keywordflow">return</span> ret;
<a name="l00686"></a>00686 --relative_depth;
<a name="l00687"></a>00687 } <span class="keywordflow">while</span>(ret.node->next_sibling==0);
<a name="l00688"></a>00688 lower:
<a name="l00689"></a>00689 ret.node=ret.node->next_sibling;
<a name="l00690"></a>00690 <span class="keywordflow">while</span>(ret.node->first_child==0) {
<a name="l00691"></a>00691 <span class="keywordflow">if</span>(ret.node->next_sibling==0)
<a name="l00692"></a>00692 <span class="keywordflow">goto</span> upper;
<a name="l00693"></a>00693 ret.node=ret.node->next_sibling;
<a name="l00694"></a>00694 <span class="keywordflow">if</span>(ret.node==0) <span class="keywordflow">return</span> ret;
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696 <span class="keywordflow">while</span>(relative_depth<0 && ret.node->first_child!=0) {
<a name="l00697"></a>00697 ret.node=ret.node->first_child;
<a name="l00698"></a>00698 ++relative_depth;
<a name="l00699"></a>00699 }
<a name="l00700"></a>00700 <span class="keywordflow">if</span>(relative_depth<0) {
<a name="l00701"></a>00701 <span class="keywordflow">if</span>(ret.node->next_sibling==0) <span class="keywordflow">goto</span> upper;
<a name="l00702"></a>00702 <span class="keywordflow">else</span> <span class="keywordflow">goto</span> lower;
<a name="l00703"></a>00703 }
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705 <span class="keywordflow">return</span> ret;
<a name="l00706"></a>00706 }
<a name="l00707"></a>00707
<a name="l00708"></a>00708 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00709"></a>00709 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l00710"></a><a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0">00710</a> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">tree<T, tree_node_allocator>::append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712 assert(position.node!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>);
<a name="l00713"></a>00713
<a name="l00714"></a>00714 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00715"></a>00715 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00716"></a>00716 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00717"></a>00717 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00718"></a>00718
<a name="l00719"></a>00719 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node;
<a name="l00720"></a>00720 <span class="keywordflow">if</span>(position.node->last_child!=0) {
<a name="l00721"></a>00721 position.node->last_child->next_sibling=tmp;
<a name="l00722"></a>00722 }
<a name="l00723"></a>00723 <span class="keywordflow">else</span> {
<a name="l00724"></a>00724 position.node-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=tmp;
<a name="l00725"></a>00725 }
<a name="l00726"></a>00726 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.node->last_child;
<a name="l00727"></a>00727 position.node->last_child=tmp;
<a name="l00728"></a>00728 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=0;
<a name="l00729"></a>00729 <span class="keywordflow">return</span> tmp;
<a name="l00730"></a>00730 }
<a name="l00731"></a>00731
<a name="l00732"></a>00732 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00733"></a>00733 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00734"></a><a class="code" href="classtree.html#9318fa77c4e10ec0a9a26a0d08f182a2">00734</a> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">tree<T, tree_node_allocator>::append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x)
<a name="l00735"></a>00735 {
<a name="l00736"></a>00736 <span class="comment">// If your program fails here you probably used 'append_child' to add the top</span>
<a name="l00737"></a>00737 <span class="comment">// node to an empty tree. From version 1.45 the top element should be added</span>
<a name="l00738"></a>00738 <span class="comment">// using 'insert'. See the documentation for further information, and sorry about</span>
<a name="l00739"></a>00739 <span class="comment">// the API change.</span>
<a name="l00740"></a>00740 assert(position.node!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>);
<a name="l00741"></a>00741
<a name="l00742"></a>00742 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00743"></a>00743 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>, x);
<a name="l00744"></a>00744 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00745"></a>00745 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00746"></a>00746
<a name="l00747"></a>00747 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node;
<a name="l00748"></a>00748 <span class="keywordflow">if</span>(position.node->last_child!=0) {
<a name="l00749"></a>00749 position.node->last_child->next_sibling=tmp;
<a name="l00750"></a>00750 }
<a name="l00751"></a>00751 <span class="keywordflow">else</span> {
<a name="l00752"></a>00752 position.node-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=tmp;
<a name="l00753"></a>00753 }
<a name="l00754"></a>00754 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.node->last_child;
<a name="l00755"></a>00755 position.node->last_child=tmp;
<a name="l00756"></a>00756 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=0;
<a name="l00757"></a>00757 <span class="keywordflow">return</span> tmp;
<a name="l00758"></a>00758 }
<a name="l00759"></a>00759
<a name="l00760"></a>00760 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00761"></a>00761 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00762"></a><a class="code" href="classtree.html#1fb4734b783fed4a66c24130af67316e">00762</a> iter <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">tree<T, tree_node_allocator>::append_child</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter other)
<a name="l00763"></a>00763 {
<a name="l00764"></a>00764 assert(position.node!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>);
<a name="l00765"></a>00765
<a name="l00766"></a>00766 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> aargh=<a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(position, <a class="code" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa" title="Value of the data stored at a node.">value_type</a>());
<a name="l00767"></a>00767 <span class="keywordflow">return</span> <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(aargh, other);
<a name="l00768"></a>00768 }
<a name="l00769"></a>00769
<a name="l00770"></a>00770 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00771"></a>00771 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00772"></a><a class="code" href="classtree.html#92ab22e0a98d8899c0d1b6c9d0a85465">00772</a> iter <a class="code" href="classtree.html#92ab22e0a98d8899c0d1b6c9d0a85465" title="Append the nodes in the from-to range (plus their children) as children of position...">tree<T, tree_node_allocator>::append_children</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to)
<a name="l00773"></a>00773 {
<a name="l00774"></a>00774 iter ret=from;
<a name="l00775"></a>00775
<a name="l00776"></a>00776 <span class="keywordflow">while</span>(from!=to) {
<a name="l00777"></a>00777 <a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5" title="Insert node (with children) pointed to by subtree as previous sibling of node pointed...">insert_subtree</a>(position.end(), from);
<a name="l00778"></a>00778 ++from;
<a name="l00779"></a>00779 }
<a name="l00780"></a>00780 <span class="keywordflow">return</span> ret;
<a name="l00781"></a>00781 }
<a name="l00782"></a>00782
<a name="l00783"></a>00783 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00784"></a><a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535">00784</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a> <a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">tree<T, tree_node_allocator>::set_head</a>(<span class="keyword">const</span> T& x)
<a name="l00785"></a>00785 {
<a name="l00786"></a>00786 assert(<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>);
<a name="l00787"></a>00787 <span class="keywordflow">return</span> <a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">insert</a>(<a class="code" href="classtree.html#2079982538b88d21fe1ccea34fe7ce0e" title="The default iterator type throughout the tree class.">iterator</a>(<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>), x);
<a name="l00788"></a>00788 }
<a name="l00789"></a>00789
<a name="l00790"></a>00790 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00791"></a>00791 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00792"></a><a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9">00792</a> iter <a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">tree<T, tree_node_allocator>::insert</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x)
<a name="l00793"></a>00793 {
<a name="l00794"></a>00794 <span class="keywordflow">if</span>(position.node==0) {
<a name="l00795"></a>00795 position.node=<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>; <span class="comment">// Backward compatibility: when calling insert on a null node,</span>
<a name="l00796"></a>00796 <span class="comment">// insert before the feet.</span>
<a name="l00797"></a>00797 }
<a name="l00798"></a>00798 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00799"></a>00799 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>, x);
<a name="l00800"></a>00800 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00801"></a>00801 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00802"></a>00802
<a name="l00803"></a>00803 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node->parent;
<a name="l00804"></a>00804 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=position.node;
<a name="l00805"></a>00805 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.node->prev_sibling;
<a name="l00806"></a>00806 position.node->prev_sibling=tmp;
<a name="l00807"></a>00807
<a name="l00808"></a>00808 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>==0) {
<a name="l00809"></a>00809 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>) <span class="comment">// when inserting nodes at the head, there is no parent</span>
<a name="l00810"></a>00810 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=tmp;
<a name="l00811"></a>00811 }
<a name="l00812"></a>00812 <span class="keywordflow">else</span>
<a name="l00813"></a>00813 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=tmp;
<a name="l00814"></a>00814 <span class="keywordflow">return</span> tmp;
<a name="l00815"></a>00815 }
<a name="l00816"></a>00816
<a name="l00817"></a>00817 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00818"></a><a class="code" href="classtree.html#429bbd485078981ef83b59a779d9f947">00818</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">tree<T, tree_node_allocator>::insert</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x)
<a name="l00819"></a>00819 {
<a name="l00820"></a>00820 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00821"></a>00821 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>, x);
<a name="l00822"></a>00822 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00823"></a>00823 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00824"></a>00824
<a name="l00825"></a>00825 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=position.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l00826"></a>00826 <span class="keywordflow">if</span>(position.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>==0) { <span class="comment">// iterator points to end of a subtree</span>
<a name="l00827"></a>00827 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>;
<a name="l00828"></a>00828 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">range_last</a>();
<a name="l00829"></a>00829 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=tmp;
<a name="l00830"></a>00830 }
<a name="l00831"></a>00831 <span class="keywordflow">else</span> {
<a name="l00832"></a>00832 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l00833"></a>00833 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l00834"></a>00834 position.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=tmp;
<a name="l00835"></a>00835 }
<a name="l00836"></a>00836
<a name="l00837"></a>00837 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>==0) {
<a name="l00838"></a>00838 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>) <span class="comment">// when inserting nodes at the head, there is no parent</span>
<a name="l00839"></a>00839 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=tmp;
<a name="l00840"></a>00840 }
<a name="l00841"></a>00841 <span class="keywordflow">else</span>
<a name="l00842"></a>00842 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=tmp;
<a name="l00843"></a>00843 <span class="keywordflow">return</span> tmp;
<a name="l00844"></a>00844 }
<a name="l00845"></a>00845
<a name="l00846"></a>00846 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00847"></a>00847 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00848"></a><a class="code" href="classtree.html#215ab56bd13f59c661eb2298e373ff3e">00848</a> iter <a class="code" href="classtree.html#215ab56bd13f59c661eb2298e373ff3e" title="Insert node as next sibling of node pointed to by position.">tree<T, tree_node_allocator>::insert_after</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x)
<a name="l00849"></a>00849 {
<a name="l00850"></a>00850 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00851"></a>00851 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>, x);
<a name="l00852"></a>00852 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00853"></a>00853 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00854"></a>00854
<a name="l00855"></a>00855 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node->parent;
<a name="l00856"></a>00856 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.node;
<a name="l00857"></a>00857 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=position.node->next_sibling;
<a name="l00858"></a>00858 position.node->next_sibling=tmp;
<a name="l00859"></a>00859
<a name="l00860"></a>00860 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==0) {
<a name="l00861"></a>00861 <span class="keywordflow">if</span>(tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>) <span class="comment">// when inserting nodes at the head, there is no parent</span>
<a name="l00862"></a>00862 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=tmp;
<a name="l00863"></a>00863 }
<a name="l00864"></a>00864 <span class="keywordflow">else</span> {
<a name="l00865"></a>00865 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=tmp;
<a name="l00866"></a>00866 }
<a name="l00867"></a>00867 <span class="keywordflow">return</span> tmp;
<a name="l00868"></a>00868 }
<a name="l00869"></a>00869
<a name="l00870"></a>00870 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00871"></a>00871 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00872"></a><a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5">00872</a> iter <a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5" title="Insert node (with children) pointed to by subtree as previous sibling of node pointed...">tree<T, tree_node_allocator>::insert_subtree</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">subtree</a>)
<a name="l00873"></a>00873 {
<a name="l00874"></a>00874 <span class="comment">// insert dummy</span>
<a name="l00875"></a>00875 iter it=<a class="code" href="classtree.html#c3d19d3a42f91618267674f2c236aad9" title="Insert node as previous sibling of node pointed to by position.">insert</a>(position, <a class="code" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa" title="Value of the data stored at a node.">value_type</a>());
<a name="l00876"></a>00876 <span class="comment">// replace dummy with subtree</span>
<a name="l00877"></a>00877 <span class="keywordflow">return</span> <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(it, subtree);
<a name="l00878"></a>00878 }
<a name="l00879"></a>00879
<a name="l00880"></a>00880 <span class="comment">// template <class T, class tree_node_allocator></span>
<a name="l00881"></a>00881 <span class="comment">// template <class iter></span>
<a name="l00882"></a>00882 <span class="comment">// iter tree<T, tree_node_allocator>::insert_subtree(sibling_iterator position, iter subtree)</span>
<a name="l00883"></a>00883 <span class="comment">// {</span>
<a name="l00884"></a>00884 <span class="comment">// // insert dummy</span>
<a name="l00885"></a>00885 <span class="comment">// iter it(insert(position, value_type()));</span>
<a name="l00886"></a>00886 <span class="comment">// // replace dummy with subtree</span>
<a name="l00887"></a>00887 <span class="comment">// return replace(it, subtree);</span>
<a name="l00888"></a>00888 <span class="comment">// }</span>
<a name="l00889"></a>00889
<a name="l00890"></a>00890 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00891"></a>00891 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00892"></a><a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4">00892</a> iter <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">tree<T, tree_node_allocator>::replace</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> T& x)
<a name="l00893"></a>00893 {
<a name="l00894"></a>00894 <a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">kp::destructor</a>(&position.node->data);
<a name="l00895"></a>00895 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&position.node->data, x);
<a name="l00896"></a>00896 <span class="keywordflow">return</span> position;
<a name="l00897"></a>00897 }
<a name="l00898"></a>00898
<a name="l00899"></a>00899 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00900"></a>00900 <span class="keyword">template</span> <<span class="keyword">class</span> iter>
<a name="l00901"></a><a class="code" href="classtree.html#5d2ad4532598f26c84b1ab0ec84a5d62">00901</a> iter <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">tree<T, tree_node_allocator>::replace</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& from)
<a name="l00902"></a>00902 {
<a name="l00903"></a>00903 assert(position.node!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>);
<a name="l00904"></a>00904 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *current_from=from.node;
<a name="l00905"></a>00905 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *start_from=from.node;
<a name="l00906"></a>00906 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *current_to =position.node;
<a name="l00907"></a>00907
<a name="l00908"></a>00908 <span class="comment">// replace the node at position with head of the replacement tree at from</span>
<a name="l00909"></a>00909 <a class="code" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc" title="Erase all children of the node pointed to by iterator.">erase_children</a>(position);
<a name="l00910"></a>00910 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* tmp = alloc_.allocate(1,0);
<a name="l00911"></a>00911 <a class="code" href="namespacekp.html#d1c6c23984a78bfc8336c7ca244d6f1c">kp::constructor</a>(&tmp-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>, (*from));
<a name="l00912"></a>00912 tmp-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=0;
<a name="l00913"></a>00913 tmp-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=0;
<a name="l00914"></a>00914 <span class="keywordflow">if</span>(current_to-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>==0) {
<a name="l00915"></a>00915 current_to-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=tmp;
<a name="l00916"></a>00916 }
<a name="l00917"></a>00917 <span class="keywordflow">else</span> {
<a name="l00918"></a>00918 current_to-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=tmp;
<a name="l00919"></a>00919 }
<a name="l00920"></a>00920 tmp-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=current_to-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l00921"></a>00921 <span class="keywordflow">if</span>(current_to-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==0) {
<a name="l00922"></a>00922 current_to-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=tmp;
<a name="l00923"></a>00923 }
<a name="l00924"></a>00924 <span class="keywordflow">else</span> {
<a name="l00925"></a>00925 current_to-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=tmp;
<a name="l00926"></a>00926 }
<a name="l00927"></a>00927 tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=current_to-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00928"></a>00928 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=current_to-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l00929"></a>00929 <a class="code" href="namespacekp.html#a6813c11eeb1c091cdd1eff62de70914">kp::destructor</a>(&current_to-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00930"></a>00930 alloc_.deallocate(current_to,1);
<a name="l00931"></a>00931 current_to=tmp;
<a name="l00932"></a>00932
<a name="l00933"></a>00933 <span class="comment">// only at this stage can we fix 'last'</span>
<a name="l00934"></a>00934 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *last=from.node->next_sibling;
<a name="l00935"></a>00935
<a name="l00936"></a>00936 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> toit=tmp;
<a name="l00937"></a>00937 <span class="comment">// copy all children</span>
<a name="l00938"></a>00938 <span class="keywordflow">do</span> {
<a name="l00939"></a>00939 assert(current_from!=0);
<a name="l00940"></a>00940 <span class="keywordflow">if</span>(current_from-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a> != 0) {
<a name="l00941"></a>00941 current_from=current_from-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l00942"></a>00942 toit=<a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(toit, current_from-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00943"></a>00943 }
<a name="l00944"></a>00944 <span class="keywordflow">else</span> {
<a name="l00945"></a>00945 <span class="keywordflow">while</span>(current_from-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==0 && current_from!=start_from) {
<a name="l00946"></a>00946 current_from=current_from-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l00947"></a>00947 toit=<a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28" title="Return iterator to the parent of a node.">parent</a>(toit);
<a name="l00948"></a>00948 assert(current_from!=0);
<a name="l00949"></a>00949 }
<a name="l00950"></a>00950 current_from=current_from-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00951"></a>00951 <span class="keywordflow">if</span>(current_from!=last) {
<a name="l00952"></a>00952 toit=<a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(<a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28" title="Return iterator to the parent of a node.">parent</a>(toit), current_from-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l00953"></a>00953 }
<a name="l00954"></a>00954 }
<a name="l00955"></a>00955 } <span class="keywordflow">while</span>(current_from!=last);
<a name="l00956"></a>00956
<a name="l00957"></a>00957 <span class="keywordflow">return</span> current_to;
<a name="l00958"></a>00958 }
<a name="l00959"></a>00959
<a name="l00960"></a>00960 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l00961"></a><a class="code" href="classtree.html#fc5bef13996f2fd939d83837aa8e090d">00961</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">tree<T, tree_node_allocator>::replace</a>(
<a name="l00962"></a>00962 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> orig_begin,
<a name="l00963"></a>00963 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> orig_end,
<a name="l00964"></a>00964 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> new_begin,
<a name="l00965"></a>00965 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> new_end)
<a name="l00966"></a>00966 {
<a name="l00967"></a>00967 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *orig_first=orig_begin.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l00968"></a>00968 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *new_first=new_begin.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l00969"></a>00969 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *orig_last=orig_first;
<a name="l00970"></a>00970 <span class="keywordflow">while</span>((++orig_begin)!=orig_end)
<a name="l00971"></a>00971 orig_last=orig_last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00972"></a>00972 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *new_last=new_first;
<a name="l00973"></a>00973 <span class="keywordflow">while</span>((++new_begin)!=new_end)
<a name="l00974"></a>00974 new_last=new_last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00975"></a>00975
<a name="l00976"></a>00976 <span class="comment">// insert all siblings in new_first..new_last before orig_first</span>
<a name="l00977"></a>00977 <span class="keywordtype">bool</span> first=<span class="keyword">true</span>;
<a name="l00978"></a>00978 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> ret;
<a name="l00979"></a>00979 <span class="keywordflow">while</span>(1==1) {
<a name="l00980"></a>00980 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> tt=<a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5" title="Insert node (with children) pointed to by subtree as previous sibling of node pointed...">insert_subtree</a>(<a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(orig_first), <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>(new_first));
<a name="l00981"></a>00981 <span class="keywordflow">if</span>(first) {
<a name="l00982"></a>00982 ret=tt;
<a name="l00983"></a>00983 first=<span class="keyword">false</span>;
<a name="l00984"></a>00984 }
<a name="l00985"></a>00985 <span class="keywordflow">if</span>(new_first==new_last)
<a name="l00986"></a>00986 <span class="keywordflow">break</span>;
<a name="l00987"></a>00987 new_first=new_first-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00988"></a>00988 }
<a name="l00989"></a>00989
<a name="l00990"></a>00990 <span class="comment">// erase old range of siblings</span>
<a name="l00991"></a>00991 <span class="keywordtype">bool</span> last=<span class="keyword">false</span>;
<a name="l00992"></a>00992 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *next=orig_first;
<a name="l00993"></a>00993 <span class="keywordflow">while</span>(1==1) {
<a name="l00994"></a>00994 <span class="keywordflow">if</span>(next==orig_last)
<a name="l00995"></a>00995 last=<span class="keyword">true</span>;
<a name="l00996"></a>00996 next=next-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l00997"></a>00997 <a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b" title="Erase element at position pointed to by iterator, return incremented iterator.">erase</a>((<a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>)orig_first);
<a name="l00998"></a>00998 <span class="keywordflow">if</span>(last)
<a name="l00999"></a>00999 <span class="keywordflow">break</span>;
<a name="l01000"></a>01000 orig_first=next;
<a name="l01001"></a>01001 }
<a name="l01002"></a>01002 <span class="keywordflow">return</span> ret;
<a name="l01003"></a>01003 }
<a name="l01004"></a>01004
<a name="l01005"></a>01005 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01006"></a>01006 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l01007"></a><a class="code" href="classtree.html#479c8e3f748608a9b9fb91e58e18998c">01007</a> iter <a class="code" href="classtree.html#479c8e3f748608a9b9fb91e58e18998c" title="Move all children of node at &#39;position&#39; to be siblings, returns position...">tree<T, tree_node_allocator>::flatten</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)
<a name="l01008"></a>01008 {
<a name="l01009"></a>01009 <span class="keywordflow">if</span>(position.node->first_child==0)
<a name="l01010"></a>01010 <span class="keywordflow">return</span> position;
<a name="l01011"></a>01011
<a name="l01012"></a>01012 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=position.node->first_child;
<a name="l01013"></a>01013 <span class="keywordflow">while</span>(tmp) {
<a name="l01014"></a>01014 tmp-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node->parent;
<a name="l01015"></a>01015 tmp=tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01016"></a>01016 }
<a name="l01017"></a>01017 <span class="keywordflow">if</span>(position.node->next_sibling) {
<a name="l01018"></a>01018 position.node->last_child->next_sibling=position.node->next_sibling;
<a name="l01019"></a>01019 position.node->next_sibling->prev_sibling=position.node->last_child;
<a name="l01020"></a>01020 }
<a name="l01021"></a>01021 <span class="keywordflow">else</span> {
<a name="l01022"></a>01022 position.node->parent->last_child=position.node->last_child;
<a name="l01023"></a>01023 }
<a name="l01024"></a>01024 position.node->next_sibling=position.node->first_child;
<a name="l01025"></a>01025 position.node->next_sibling->prev_sibling=position.node;
<a name="l01026"></a>01026 position.node->first_child=0;
<a name="l01027"></a>01027 position.node->last_child=0;
<a name="l01028"></a>01028
<a name="l01029"></a>01029 <span class="keywordflow">return</span> position;
<a name="l01030"></a>01030 }
<a name="l01031"></a>01031
<a name="l01032"></a>01032
<a name="l01033"></a>01033 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01034"></a>01034 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l01035"></a><a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e">01035</a> iter <a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e" title="Move nodes in range to be children of &#39;position&#39;.">tree<T, tree_node_allocator>::reparent</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>)
<a name="l01036"></a>01036 {
<a name="l01037"></a>01037 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *first=begin.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01038"></a>01038 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *last=first;
<a name="l01039"></a>01039 <span class="keywordflow">if</span>(begin==end) <span class="keywordflow">return</span> begin;
<a name="l01040"></a>01040 <span class="comment">// determine last node</span>
<a name="l01041"></a>01041 <span class="keywordflow">while</span>((++begin)!=end) {
<a name="l01042"></a>01042 last=last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01043"></a>01043 }
<a name="l01044"></a>01044 <span class="comment">// move subtree</span>
<a name="l01045"></a>01045 <span class="keywordflow">if</span>(first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>==0) {
<a name="l01046"></a>01046 first-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01047"></a>01047 }
<a name="l01048"></a>01048 <span class="keywordflow">else</span> {
<a name="l01049"></a>01049 first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01050"></a>01050 }
<a name="l01051"></a>01051 <span class="keywordflow">if</span>(last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>==0) {
<a name="l01052"></a>01052 last-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01053"></a>01053 }
<a name="l01054"></a>01054 <span class="keywordflow">else</span> {
<a name="l01055"></a>01055 last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01056"></a>01056 }
<a name="l01057"></a>01057 <span class="keywordflow">if</span>(position.node->first_child==0) {
<a name="l01058"></a>01058 position.node->first_child=first;
<a name="l01059"></a>01059 position.node-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=last;
<a name="l01060"></a>01060 first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=0;
<a name="l01061"></a>01061 }
<a name="l01062"></a>01062 <span class="keywordflow">else</span> {
<a name="l01063"></a>01063 position.node->last_child->next_sibling=first;
<a name="l01064"></a>01064 first-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=position.node->last_child;
<a name="l01065"></a>01065 position.node->last_child=last;
<a name="l01066"></a>01066 }
<a name="l01067"></a>01067 last-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=0;
<a name="l01068"></a>01068
<a name="l01069"></a>01069 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *pos=first;
<a name="l01070"></a>01070 <span class="keywordflow">while</span>(1==1) {
<a name="l01071"></a>01071 pos-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=position.node;
<a name="l01072"></a>01072 <span class="keywordflow">if</span>(pos==last) <span class="keywordflow">break</span>;
<a name="l01073"></a>01073 pos=pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01074"></a>01074 }
<a name="l01075"></a>01075
<a name="l01076"></a>01076 <span class="keywordflow">return</span> first;
<a name="l01077"></a>01077 }
<a name="l01078"></a>01078
<a name="l01079"></a>01079 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01080"></a><a class="code" href="classtree.html#021a394ff7139df8573e2cb80e6beaa2">01080</a> <span class="keyword">template</span> <<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e" title="Move nodes in range to be children of &#39;position&#39;.">tree<T, tree_node_allocator>::reparent</a>(iter <a class="code" href="messages_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter from)
<a name="l01081"></a>01081 {
<a name="l01082"></a>01082 <span class="keywordflow">if</span>(from.node->first_child==0) <span class="keywordflow">return</span> position;
<a name="l01083"></a>01083 <span class="keywordflow">return</span> <a class="code" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e" title="Move nodes in range to be children of &#39;position&#39;.">reparent</a>(position, from.node->first_child, <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(from));
<a name="l01084"></a>01084 }
<a name="l01085"></a>01085
<a name="l01086"></a>01086 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01087"></a><a class="code" href="classtree.html#e7f72ba46cd061f71720c731b4a9bf63">01087</a> <span class="keyword">template</span> <<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#e7f72ba46cd061f71720c731b4a9bf63" title="Move &#39;source&#39; node (plus its children) to become the next sibling of &#39;target&#39;...">tree<T, tree_node_allocator>::move_after</a>(iter target, iter source)
<a name="l01088"></a>01088 {
<a name="l01089"></a>01089 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *dst=target.node;
<a name="l01090"></a>01090 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *src=source.node;
<a name="l01091"></a>01091 assert(dst);
<a name="l01092"></a>01092 assert(src);
<a name="l01093"></a>01093
<a name="l01094"></a>01094 <span class="keywordflow">if</span>(dst==src) <span class="keywordflow">return</span> source;
<a name="l01095"></a>01095
<a name="l01096"></a>01096 <span class="comment">// take src out of the tree</span>
<a name="l01097"></a>01097 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01098"></a>01098 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01099"></a>01099 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01100"></a>01100 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01101"></a>01101
<a name="l01102"></a>01102 <span class="comment">// connect it to the new point</span>
<a name="l01103"></a>01103 <span class="keywordflow">if</span>(dst-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=0) dst-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=src;
<a name="l01104"></a>01104 <span class="keywordflow">else</span> dst-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=src;
<a name="l01105"></a>01105 src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=dst-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01106"></a>01106 dst-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=src;
<a name="l01107"></a>01107 src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=dst;
<a name="l01108"></a>01108 src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=dst-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01109"></a>01109 <span class="keywordflow">return</span> src;
<a name="l01110"></a>01110 }
<a name="l01111"></a>01111
<a name="l01112"></a>01112
<a name="l01113"></a>01113 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01114"></a><a class="code" href="classtree.html#b45aa15042445a81b13873d3ef4a2e86">01114</a> <span class="keyword">template</span> <<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#b45aa15042445a81b13873d3ef4a2e86" title="Move &#39;source&#39; node (plus its children) to become the previous sibling of...">tree<T, tree_node_allocator>::move_before</a>(iter target, iter source)
<a name="l01115"></a>01115 {
<a name="l01116"></a>01116 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *dst=target.node;
<a name="l01117"></a>01117 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *src=source.node;
<a name="l01118"></a>01118 assert(dst);
<a name="l01119"></a>01119 assert(src);
<a name="l01120"></a>01120
<a name="l01121"></a>01121 <span class="keywordflow">if</span>(dst==src) <span class="keywordflow">return</span> source;
<a name="l01122"></a>01122
<a name="l01123"></a>01123 <span class="comment">// take src out of the tree</span>
<a name="l01124"></a>01124 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01125"></a>01125 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01126"></a>01126 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01127"></a>01127 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01128"></a>01128
<a name="l01129"></a>01129 <span class="comment">// connect it to the new point</span>
<a name="l01130"></a>01130 <span class="keywordflow">if</span>(dst-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=0) dst-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=src;
<a name="l01131"></a>01131 <span class="keywordflow">else</span> dst-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=src;
<a name="l01132"></a>01132 src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=dst-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01133"></a>01133 dst-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=src;
<a name="l01134"></a>01134 src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=dst;
<a name="l01135"></a>01135 src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=dst-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01136"></a>01136 <span class="keywordflow">return</span> src;
<a name="l01137"></a>01137 }
<a name="l01138"></a>01138
<a name="l01139"></a>01139 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01140"></a><a class="code" href="classtree.html#a4f8b906b2758eec530e28387b819284">01140</a> <span class="keyword">template</span> <<span class="keyword">typename</span> iter> iter <a class="code" href="classtree.html#a4f8b906b2758eec530e28387b819284" title="Move &#39;source&#39; node (plus its children) to become the node at &#39;target&#39;...">tree<T, tree_node_allocator>::move_ontop</a>(iter target, iter source)
<a name="l01141"></a>01141 {
<a name="l01142"></a>01142 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *dst=target.node;
<a name="l01143"></a>01143 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *src=source.node;
<a name="l01144"></a>01144 assert(dst);
<a name="l01145"></a>01145 assert(src);
<a name="l01146"></a>01146
<a name="l01147"></a>01147 <span class="keywordflow">if</span>(dst==src) <span class="keywordflow">return</span> source;
<a name="l01148"></a>01148
<a name="l01149"></a>01149 <span class="comment">// remember connection points</span>
<a name="l01150"></a>01150 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *b_prev_sibling=dst-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01151"></a>01151 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *b_next_sibling=dst-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01152"></a>01152 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *b_parent=dst-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01153"></a>01153
<a name="l01154"></a>01154 <span class="comment">// remove target</span>
<a name="l01155"></a>01155 <a class="code" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b" title="Erase element at position pointed to by iterator, return incremented iterator.">erase</a>(target);
<a name="l01156"></a>01156
<a name="l01157"></a>01157 <span class="comment">// take src out of the tree</span>
<a name="l01158"></a>01158 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01159"></a>01159 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01160"></a>01160 <span class="keywordflow">if</span>(src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=0) src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>->prev_sibling=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01161"></a>01161 <span class="keywordflow">else</span> src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01162"></a>01162
<a name="l01163"></a>01163 <span class="comment">// connect it to the new point</span>
<a name="l01164"></a>01164 <span class="keywordflow">if</span>(b_prev_sibling!=0) b_prev_sibling-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=src;
<a name="l01165"></a>01165 <span class="keywordflow">else</span> b_parent-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>=src;
<a name="l01166"></a>01166 <span class="keywordflow">if</span>(b_next_sibling!=0) b_next_sibling-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=src;
<a name="l01167"></a>01167 <span class="keywordflow">else</span> b_parent-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>=src;
<a name="l01168"></a>01168 src-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=b_prev_sibling;
<a name="l01169"></a>01169 src-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=b_next_sibling;
<a name="l01170"></a>01170 src-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>=b_parent;
<a name="l01171"></a>01171 <span class="keywordflow">return</span> src;
<a name="l01172"></a>01172 }
<a name="l01173"></a>01173
<a name="l01174"></a>01174 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01175"></a><a class="code" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1">01175</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1" title="Merge with other tree, creating new branches and leaves only if they are not already...">tree<T, tree_node_allocator>::merge</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to1, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to2,
<a name="l01176"></a>01176 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from1, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from2,
<a name="l01177"></a>01177 <span class="keywordtype">bool</span> duplicate_leaves)
<a name="l01178"></a>01178 {
<a name="l01179"></a>01179 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> fnd;
<a name="l01180"></a>01180 <span class="keywordflow">while</span>(from1!=from2) {
<a name="l01181"></a>01181 <span class="keywordflow">if</span>((fnd=std::find(to1, to2, (*from1))) != to2) { <span class="comment">// element found</span>
<a name="l01182"></a>01182 <span class="keywordflow">if</span>(from1.<a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>()==from1.<a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>()) { <span class="comment">// full depth reached</span>
<a name="l01183"></a>01183 <span class="keywordflow">if</span>(duplicate_leaves)
<a name="l01184"></a>01184 <a class="code" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0" title="Insert empty node as last child of node pointed to by position.">append_child</a>(<a class="code" href="classtree.html#aaaa1622d2d58ecda846640bd8f8bd28" title="Return iterator to the parent of a node.">parent</a>(to1), (*from1));
<a name="l01185"></a>01185 }
<a name="l01186"></a>01186 <span class="keywordflow">else</span> { <span class="comment">// descend further</span>
<a name="l01187"></a>01187 <a class="code" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1" title="Merge with other tree, creating new branches and leaves only if they are not already...">merge</a>(fnd.<a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>(), fnd.<a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>(), from1.<a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">begin</a>(), from1.<a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">end</a>(), duplicate_leaves);
<a name="l01188"></a>01188 }
<a name="l01189"></a>01189 }
<a name="l01190"></a>01190 <span class="keywordflow">else</span> { <span class="comment">// element missing</span>
<a name="l01191"></a>01191 <a class="code" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5" title="Insert node (with children) pointed to by subtree as previous sibling of node pointed...">insert_subtree</a>(to2, from1);
<a name="l01192"></a>01192 }
<a name="l01193"></a>01193 ++from1;
<a name="l01194"></a>01194 }
<a name="l01195"></a>01195 }
<a name="l01196"></a>01196
<a name="l01197"></a>01197
<a name="l01198"></a>01198 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01199"></a><a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e">01199</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">tree<T, tree_node_allocator>::sort</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to, <span class="keywordtype">bool</span> deep)
<a name="l01200"></a>01200 {
<a name="l01201"></a>01201 std::less<T> comp;
<a name="l01202"></a>01202 <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">sort</a>(from, to, comp, deep);
<a name="l01203"></a>01203 }
<a name="l01204"></a>01204
<a name="l01205"></a>01205 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01206"></a>01206 <span class="keyword">template</span> <<span class="keyword">class</span> StrictWeakOrdering>
<a name="l01207"></a><a class="code" href="classtree.html#f187f42c28a39304649ee41d3464f2ef">01207</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">tree<T, tree_node_allocator>::sort</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to,
<a name="l01208"></a>01208 StrictWeakOrdering comp, <span class="keywordtype">bool</span> deep)
<a name="l01209"></a>01209 {
<a name="l01210"></a>01210 <span class="keywordflow">if</span>(from==to) <span class="keywordflow">return</span>;
<a name="l01211"></a>01211 <span class="comment">// make list of sorted nodes</span>
<a name="l01212"></a>01212 <span class="comment">// CHECK: if multiset stores equivalent nodes in the order in which they</span>
<a name="l01213"></a>01213 <span class="comment">// are inserted, then this routine should be called 'stable_sort'.</span>
<a name="l01214"></a>01214 std::multiset<tree_node *, compare_nodes<StrictWeakOrdering> > nodes(comp);
<a name="l01215"></a>01215 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> it=from, it2=to;
<a name="l01216"></a>01216 <span class="keywordflow">while</span>(it != to) {
<a name="l01217"></a>01217 nodes.insert(it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>);
<a name="l01218"></a>01218 ++it;
<a name="l01219"></a>01219 }
<a name="l01220"></a>01220 <span class="comment">// reassemble</span>
<a name="l01221"></a>01221 --it2;
<a name="l01222"></a>01222
<a name="l01223"></a>01223 <span class="comment">// prev and next are the nodes before and after the sorted range</span>
<a name="l01224"></a>01224 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *prev=from.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01225"></a>01225 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *next=it2.node->next_sibling;
<a name="l01226"></a>01226 <span class="keyword">typename</span> std::multiset<tree_node *, compare_nodes<StrictWeakOrdering> ><a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">::iterator</a> nit=nodes.begin(), eit=nodes.end();
<a name="l01227"></a>01227 <span class="keywordflow">if</span>(prev==0) {
<a name="l01228"></a>01228 <span class="keywordflow">if</span>((*nit)->parent!=0) <span class="comment">// to catch "sorting the head" situations, when there is no parent</span>
<a name="l01229"></a>01229 (*nit)->parent->first_child=(*nit);
<a name="l01230"></a>01230 }
<a name="l01231"></a>01231 <span class="keywordflow">else</span> prev-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=(*nit);
<a name="l01232"></a>01232
<a name="l01233"></a>01233 --eit;
<a name="l01234"></a>01234 <span class="keywordflow">while</span>(nit!=eit) {
<a name="l01235"></a>01235 (*nit)->prev_sibling=prev;
<a name="l01236"></a>01236 <span class="keywordflow">if</span>(prev)
<a name="l01237"></a>01237 prev-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=(*nit);
<a name="l01238"></a>01238 prev=(*nit);
<a name="l01239"></a>01239 ++nit;
<a name="l01240"></a>01240 }
<a name="l01241"></a>01241 <span class="comment">// prev now points to the last-but-one node in the sorted range</span>
<a name="l01242"></a>01242 <span class="keywordflow">if</span>(prev)
<a name="l01243"></a>01243 prev-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=(*eit);
<a name="l01244"></a>01244
<a name="l01245"></a>01245 <span class="comment">// eit points to the last node in the sorted range.</span>
<a name="l01246"></a>01246 (*eit)->next_sibling=next;
<a name="l01247"></a>01247 (*eit)-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=prev; <span class="comment">// missed in the loop above</span>
<a name="l01248"></a>01248 <span class="keywordflow">if</span>(next==0) {
<a name="l01249"></a>01249 <span class="keywordflow">if</span>((*eit)->parent!=0) <span class="comment">// to catch "sorting the head" situations, when there is no parent</span>
<a name="l01250"></a>01250 (*eit)-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=(*eit);
<a name="l01251"></a>01251 }
<a name="l01252"></a>01252 <span class="keywordflow">else</span> next-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=(*eit);
<a name="l01253"></a>01253
<a name="l01254"></a>01254 <span class="keywordflow">if</span>(deep) { <span class="comment">// sort the children of each node too</span>
<a name="l01255"></a>01255 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> bcs(*nodes.begin());
<a name="l01256"></a>01256 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> ecs(*eit);
<a name="l01257"></a>01257 ++ecs;
<a name="l01258"></a>01258 <span class="keywordflow">while</span>(bcs!=ecs) {
<a name="l01259"></a>01259 <a class="code" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e" title="Sort (std::sort only moves values of nodes, this one moves children as well).">sort</a>(<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(bcs), <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(bcs), comp, deep);
<a name="l01260"></a>01260 ++bcs;
<a name="l01261"></a>01261 }
<a name="l01262"></a>01262 }
<a name="l01263"></a>01263 }
<a name="l01264"></a>01264
<a name="l01265"></a>01265 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01266"></a>01266 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l01267"></a><a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04">01267</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">tree<T, tree_node_allocator>::equal</a>(<span class="keyword">const</span> iter& one_, <span class="keyword">const</span> iter& two, <span class="keyword">const</span> iter& three_)<span class="keyword"> const</span>
<a name="l01268"></a>01268 <span class="keyword"> </span>{
<a name="l01269"></a>01269 std::equal_to<T> comp;
<a name="l01270"></a>01270 <span class="keywordflow">return</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">equal</a>(one_, two, three_, comp);
<a name="l01271"></a>01271 }
<a name="l01272"></a>01272
<a name="l01273"></a>01273 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01274"></a>01274 <span class="keyword">template</span> <<span class="keyword">typename</span> iter>
<a name="l01275"></a><a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">01275</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">tree<T, tree_node_allocator>::equal_subtree</a>(<span class="keyword">const</span> iter& one_, <span class="keyword">const</span> iter& two_)<span class="keyword"> const</span>
<a name="l01276"></a>01276 <span class="keyword"> </span>{
<a name="l01277"></a>01277 std::equal_to<T> comp;
<a name="l01278"></a>01278 <span class="keywordflow">return</span> <a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">equal_subtree</a>(one_, two_, comp);
<a name="l01279"></a>01279 }
<a name="l01280"></a>01280
<a name="l01281"></a>01281 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01282"></a>01282 <span class="keyword">template</span> <<span class="keyword">typename</span> iter, <span class="keyword">class</span> BinaryPredicate>
<a name="l01283"></a><a class="code" href="classtree.html#7ce7ff12a68be494b28925b2f7184a29">01283</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">tree<T, tree_node_allocator>::equal</a>(<span class="keyword">const</span> iter& one_, <span class="keyword">const</span> iter& two, <span class="keyword">const</span> iter& three_, BinaryPredicate fun)<span class="keyword"> const</span>
<a name="l01284"></a>01284 <span class="keyword"> </span>{
<a name="l01285"></a>01285 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> one(one_), three(three_);
<a name="l01286"></a>01286
<a name="l01287"></a>01287 <span class="comment">// if(one==two && is_valid(three) && three.number_of_children()!=0)</span>
<a name="l01288"></a>01288 <span class="comment">// return false;</span>
<a name="l01289"></a>01289 <span class="keywordflow">while</span>(one!=two && <a class="code" href="classtree.html#9605b028195248894dc8cf506cd256e3" title="Determine whether the iterator is an &#39;end&#39; iterator and thus not actually...">is_valid</a>(three)) {
<a name="l01290"></a>01290 <span class="keywordflow">if</span>(!fun(*one,*three))
<a name="l01291"></a>01291 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01292"></a>01292 <span class="keywordflow">if</span>(one.number_of_children()!=three.<a class="code" href="classtree_1_1iterator__base.html#435004214270928d106dd4c8f6a36f17" title="Number of children of the node pointed to by the iterator.">number_of_children</a>())
<a name="l01293"></a>01293 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01294"></a>01294 ++one;
<a name="l01295"></a>01295 ++three;
<a name="l01296"></a>01296 }
<a name="l01297"></a>01297 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01298"></a>01298 }
<a name="l01299"></a>01299
<a name="l01300"></a>01300 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01301"></a>01301 <span class="keyword">template</span> <<span class="keyword">typename</span> iter, <span class="keyword">class</span> BinaryPredicate>
<a name="l01302"></a><a class="code" href="classtree.html#5e8445150c43058416d16b4846ff0f15">01302</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#6e2e76dfa6f0f51ca6f573d73b0c1b28">tree<T, tree_node_allocator>::equal_subtree</a>(<span class="keyword">const</span> iter& one_, <span class="keyword">const</span> iter& two_, BinaryPredicate fun)<span class="keyword"> const</span>
<a name="l01303"></a>01303 <span class="keyword"> </span>{
<a name="l01304"></a>01304 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> one(one_), two(two_);
<a name="l01305"></a>01305
<a name="l01306"></a>01306 <span class="keywordflow">if</span>(!fun(*one,*two)) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01307"></a>01307 <span class="keywordflow">if</span>(<a class="code" href="classtree.html#96f82a90a3e21e82f486f325b0cf9faa" title="Count the number of children of node at position.">number_of_children</a>(one)!=<a class="code" href="classtree.html#96f82a90a3e21e82f486f325b0cf9faa" title="Count the number of children of node at position.">number_of_children</a>(two)) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01308"></a>01308 <span class="keywordflow">return</span> <a class="code" href="classtree.html#59488f63fc6ad997809d971c48ecfc04" title="Compare two ranges of nodes (compares nodes as well as tree structure).">equal</a>(<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(one),<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(one),<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(two),fun);
<a name="l01309"></a>01309 }
<a name="l01310"></a>01310
<a name="l01311"></a>01311 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01312"></a><a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625">01312</a> <a class="code" href="classtree.html">tree<T, tree_node_allocator></a> <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">tree<T, tree_node_allocator>::subtree</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to)<span class="keyword"> const</span>
<a name="l01313"></a>01313 <span class="keyword"> </span>{
<a name="l01314"></a>01314 <a class="code" href="classtree.html">tree</a> tmp;
<a name="l01315"></a>01315 tmp.<a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">set_head</a>(<a class="code" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa" title="Value of the data stored at a node.">value_type</a>());
<a name="l01316"></a>01316 tmp.<a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(tmp.<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), tmp.<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(), from, to);
<a name="l01317"></a>01317 <span class="keywordflow">return</span> tmp;
<a name="l01318"></a>01318 }
<a name="l01319"></a>01319
<a name="l01320"></a>01320 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01321"></a><a class="code" href="classtree.html#830cccac50df183c44c6ff83cab5a27f">01321</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#db61bebed6c56eb5641b0b7fab7fe625" title="Extract a new tree formed by the range of siblings plus all their children.">tree<T, tree_node_allocator>::subtree</a>(<a class="code" href="classtree.html">tree</a>& tmp, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> from, <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> to)<span class="keyword"> const</span>
<a name="l01322"></a>01322 <span class="keyword"> </span>{
<a name="l01323"></a>01323 tmp.<a class="code" href="classtree.html#f11d736ea971ab93651350161f5a7535" title="Short-hand to insert topmost node in otherwise empty tree.">set_head</a>(<a class="code" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa" title="Value of the data stored at a node.">value_type</a>());
<a name="l01324"></a>01324 tmp.<a class="code" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4" title="Replace node at &#39;position&#39; with other node (keeping same children); &#39;position&#39;...">replace</a>(tmp.<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), tmp.<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>(), from, to);
<a name="l01325"></a>01325 }
<a name="l01326"></a>01326
<a name="l01327"></a>01327 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01328"></a><a class="code" href="classtree.html#219ff1bfc99f78fd9a2db71f41891523">01328</a> <span class="keywordtype">int</span> <a class="code" href="classtree.html#219ff1bfc99f78fd9a2db71f41891523" title="Count the total number of nodes.">tree<T, tree_node_allocator>::size</a>()<span class="keyword"> const</span>
<a name="l01329"></a>01329 <span class="keyword"> </span>{
<a name="l01330"></a>01330 <span class="keywordtype">int</span> i=0;
<a name="l01331"></a>01331 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> it=<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), eit=<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>();
<a name="l01332"></a>01332 <span class="keywordflow">while</span>(it!=eit) {
<a name="l01333"></a>01333 ++i;
<a name="l01334"></a>01334 ++it;
<a name="l01335"></a>01335 }
<a name="l01336"></a>01336 <span class="keywordflow">return</span> i;
<a name="l01337"></a>01337 }
<a name="l01338"></a>01338
<a name="l01339"></a>01339 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01340"></a><a class="code" href="classtree.html#e9f7fd30c51443d46ca8941d5bc06da2">01340</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#e9f7fd30c51443d46ca8941d5bc06da2" title="Check if tree is empty.">tree<T, tree_node_allocator>::empty</a>()<span class="keyword"> const</span>
<a name="l01341"></a>01341 <span class="keyword"> </span>{
<a name="l01342"></a>01342 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> it=<a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>(), eit=<a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>();
<a name="l01343"></a>01343 <span class="keywordflow">return</span> (it==eit);
<a name="l01344"></a>01344 }
<a name="l01345"></a>01345
<a name="l01346"></a>01346 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01347"></a><a class="code" href="classtree.html#16c66be75ca89c999a9c4a68497b05a1">01347</a> <span class="keywordtype">int</span> <a class="code" href="classtree.html#16c66be75ca89c999a9c4a68497b05a1" title="Compute the depth to the root.">tree<T, tree_node_allocator>::depth</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it)<span class="keyword"> const</span>
<a name="l01348"></a>01348 <span class="keyword"> </span>{
<a name="l01349"></a>01349 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a>* pos=it.node;
<a name="l01350"></a>01350 assert(pos!=0);
<a name="l01351"></a>01351 <span class="keywordtype">int</span> ret=0;
<a name="l01352"></a>01352 <span class="keywordflow">while</span>(pos-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>!=0) {
<a name="l01353"></a>01353 pos=pos-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01354"></a>01354 ++ret;
<a name="l01355"></a>01355 }
<a name="l01356"></a>01356 <span class="keywordflow">return</span> ret;
<a name="l01357"></a>01357 }
<a name="l01358"></a>01358
<a name="l01359"></a>01359 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01360"></a><a class="code" href="classtree.html#96f82a90a3e21e82f486f325b0cf9faa">01360</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree.html#96f82a90a3e21e82f486f325b0cf9faa" title="Count the number of children of node at position.">tree<T, tree_node_allocator>::number_of_children</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it)<span class="keyword"> const</span>
<a name="l01361"></a>01361 <span class="keyword"> </span>{
<a name="l01362"></a>01362 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *pos=it.node->first_child;
<a name="l01363"></a>01363 <span class="keywordflow">if</span>(pos==0) <span class="keywordflow">return</span> 0;
<a name="l01364"></a>01364
<a name="l01365"></a>01365 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ret=1;
<a name="l01366"></a>01366 <span class="comment">// while(pos!=it.node->last_child) {</span>
<a name="l01367"></a>01367 <span class="comment">// ++ret;</span>
<a name="l01368"></a>01368 <span class="comment">// pos=pos->next_sibling;</span>
<a name="l01369"></a>01369 <span class="comment">// }</span>
<a name="l01370"></a>01370 <span class="keywordflow">while</span>((pos=pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>))
<a name="l01371"></a>01371 ++ret;
<a name="l01372"></a>01372 <span class="keywordflow">return</span> ret;
<a name="l01373"></a>01373 }
<a name="l01374"></a>01374
<a name="l01375"></a>01375 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01376"></a><a class="code" href="classtree.html#3cddce970c4d44af57cf9ec0d7c3d009">01376</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree.html#3cddce970c4d44af57cf9ec0d7c3d009" title="Count the number of &#39;next&#39; siblings of node at iterator.">tree<T, tree_node_allocator>::number_of_siblings</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it)<span class="keyword"> const</span>
<a name="l01377"></a>01377 <span class="keyword"> </span>{
<a name="l01378"></a>01378 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *pos=it.node;
<a name="l01379"></a>01379 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ret=0;
<a name="l01380"></a>01380 <span class="keywordflow">while</span>(pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a> &&
<a name="l01381"></a>01381 pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a> &&
<a name="l01382"></a>01382 pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>!=<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>) {
<a name="l01383"></a>01383 ++ret;
<a name="l01384"></a>01384 pos=pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01385"></a>01385 }
<a name="l01386"></a>01386 <span class="keywordflow">return</span> ret;
<a name="l01387"></a>01387 }
<a name="l01388"></a>01388
<a name="l01389"></a>01389 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01390"></a><a class="code" href="classtree.html#e842f9b70235bc2412b3c43bca759448">01390</a> <span class="keywordtype">void</span> <a class="code" href="classtree.html#e842f9b70235bc2412b3c43bca759448" title="Exchange the node (plus subtree) with its sibling node (do nothing if no sibling...">tree<T, tree_node_allocator>::swap</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> it)
<a name="l01391"></a>01391 {
<a name="l01392"></a>01392 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *nxt=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01393"></a>01393 <span class="keywordflow">if</span>(nxt) {
<a name="l01394"></a>01394 <span class="keywordflow">if</span>(it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>)
<a name="l01395"></a>01395 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>->next_sibling=nxt;
<a name="l01396"></a>01396 <span class="keywordflow">else</span>
<a name="l01397"></a>01397 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->first_child=nxt;
<a name="l01398"></a>01398 nxt-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01399"></a>01399 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *nxtnxt=nxt-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01400"></a>01400 <span class="keywordflow">if</span>(nxtnxt)
<a name="l01401"></a>01401 nxtnxt-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01402"></a>01402 <span class="keywordflow">else</span>
<a name="l01403"></a>01403 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>->last_child=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01404"></a>01404 nxt-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01405"></a>01405 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>=nxt;
<a name="l01406"></a>01406 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>=nxtnxt;
<a name="l01407"></a>01407 }
<a name="l01408"></a>01408 }
<a name="l01409"></a>01409
<a name="l01410"></a>01410 <span class="comment">// template <class BinaryPredicate></span>
<a name="l01411"></a>01411 <span class="comment">// tree<T, tree_node_allocator>::iterator tree<T, tree_node_allocator>::find_subtree(</span>
<a name="l01412"></a>01412 <span class="comment">// sibling_iterator subfrom, sibling_iterator subto, iterator from, iterator to, </span>
<a name="l01413"></a>01413 <span class="comment">// BinaryPredicate fun) const</span>
<a name="l01414"></a>01414 <span class="comment">// {</span>
<a name="l01415"></a>01415 <span class="comment">// assert(1==0); // this routine is not finished yet.</span>
<a name="l01416"></a>01416 <span class="comment">// while(from!=to) {</span>
<a name="l01417"></a>01417 <span class="comment">// if(fun(*subfrom, *from)) {</span>
<a name="l01418"></a>01418 <span class="comment">// </span>
<a name="l01419"></a>01419 <span class="comment">// }</span>
<a name="l01420"></a>01420 <span class="comment">// }</span>
<a name="l01421"></a>01421 <span class="comment">// return to;</span>
<a name="l01422"></a>01422 <span class="comment">// }</span>
<a name="l01423"></a>01423
<a name="l01424"></a>01424 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01425"></a><a class="code" href="classtree.html#825e2106781e846bdd8732c117dc21db">01425</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#825e2106781e846bdd8732c117dc21db" title="Determine whether node at position is in the subtrees with root in the range.">tree<T, tree_node_allocator>::is_in_subtree</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it, <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree.html#76b3a629c0208d5ae5b4ffcd4492e05e" title="Return iterator to the beginning of the tree.">begin</a>,
<a name="l01426"></a>01426 <span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& <a class="code" href="classtree.html#0d09fe9fd34fbfc9c9e4e28cb694448e" title="Return iterator to the end of the tree.">end</a>)<span class="keyword"> const</span>
<a name="l01427"></a>01427 <span class="keyword"> </span>{
<a name="l01428"></a>01428 <span class="comment">// FIXME: this should be optimised.</span>
<a name="l01429"></a>01429 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> tmp=begin;
<a name="l01430"></a>01430 <span class="keywordflow">while</span>(tmp!=end) {
<a name="l01431"></a>01431 <span class="keywordflow">if</span>(tmp==it) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01432"></a>01432 ++tmp;
<a name="l01433"></a>01433 }
<a name="l01434"></a>01434 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01435"></a>01435 }
<a name="l01436"></a>01436
<a name="l01437"></a>01437 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01438"></a><a class="code" href="classtree.html#9605b028195248894dc8cf506cd256e3">01438</a> <span class="keywordtype">bool</span> <a class="code" href="classtree.html#9605b028195248894dc8cf506cd256e3" title="Determine whether the iterator is an &#39;end&#39; iterator and thus not actually...">tree<T, tree_node_allocator>::is_valid</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it)<span class="keyword"> const</span>
<a name="l01439"></a>01439 <span class="keyword"> </span>{
<a name="l01440"></a>01440 <span class="keywordflow">if</span>(it.node==0 || it.node==<a class="code" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01441"></a>01441 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01442"></a>01442 }
<a name="l01443"></a>01443
<a name="l01444"></a>01444 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01445"></a><a class="code" href="classtree.html#de5ec1ba55f94165062e50d01ec35d86">01445</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree.html#de5ec1ba55f94165062e50d01ec35d86" title="Determine the index of a node in the range of siblings to which it belongs.">tree<T, tree_node_allocator>::index</a>(<a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> it)<span class="keyword"> const</span>
<a name="l01446"></a>01446 <span class="keyword"> </span>{
<a name="l01447"></a>01447 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ind=0;
<a name="l01448"></a>01448 <span class="keywordflow">if</span>(it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>==0) {
<a name="l01449"></a>01449 <span class="keywordflow">while</span>(it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=<a class="code" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a>) {
<a name="l01450"></a>01450 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01451"></a>01451 ++ind;
<a name="l01452"></a>01452 }
<a name="l01453"></a>01453 }
<a name="l01454"></a>01454 <span class="keywordflow">else</span> {
<a name="l01455"></a>01455 <span class="keywordflow">while</span>(it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>!=0) {
<a name="l01456"></a>01456 it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=it.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01457"></a>01457 ++ind;
<a name="l01458"></a>01458 }
<a name="l01459"></a>01459 }
<a name="l01460"></a>01460 <span class="keywordflow">return</span> ind;
<a name="l01461"></a>01461 }
<a name="l01462"></a>01462
<a name="l01463"></a>01463
<a name="l01464"></a>01464 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01465"></a><a class="code" href="classtree.html#446c722c82607f8b3243a9153b665d19">01465</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree.html#446c722c82607f8b3243a9153b665d19" title="Inverse of &#39;index&#39;: return the n-th child of the node at position.">tree<T, tree_node_allocator>::child</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& it, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)<span class="keyword"> const</span>
<a name="l01466"></a>01466 <span class="keyword"> </span>{
<a name="l01467"></a>01467 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=it.node->first_child;
<a name="l01468"></a>01468 <span class="keywordflow">while</span>(num--) {
<a name="l01469"></a>01469 assert(tmp!=0);
<a name="l01470"></a>01470 tmp=tmp-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01471"></a>01471 }
<a name="l01472"></a>01472 <span class="keywordflow">return</span> tmp;
<a name="l01473"></a>01473 }
<a name="l01474"></a>01474
<a name="l01475"></a>01475
<a name="l01476"></a>01476
<a name="l01477"></a>01477
<a name="l01478"></a>01478 <span class="comment">// Iterator base</span>
<a name="l01479"></a>01479
<a name="l01480"></a>01480 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01481"></a><a class="code" href="classtree_1_1iterator__base.html#1be2e6802acca5f281ddc7e5d67bd61c">01481</a> <a class="code" href="classtree_1_1iterator__base.html#1be2e6802acca5f281ddc7e5d67bd61c">tree<T, tree_node_allocator>::iterator_base::iterator_base</a>()
<a name="l01482"></a>01482 : node(0), skip_current_children_(<a class="code" href="inc_2libofx_8h.html#65e9886d74aaee76545e83dd09011727">false</a>)
<a name="l01483"></a>01483 {
<a name="l01484"></a>01484 }
<a name="l01485"></a>01485
<a name="l01486"></a>01486 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01487"></a><a class="code" href="classtree_1_1iterator__base.html#dd6dda19c2febebabbc5e769365dc4dd">01487</a> <a class="code" href="classtree_1_1iterator__base.html#1be2e6802acca5f281ddc7e5d67bd61c">tree<T, tree_node_allocator>::iterator_base::iterator_base</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tn)
<a name="l01488"></a>01488 : <a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>(tn), <a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>(<a class="code" href="inc_2libofx_8h.html#65e9886d74aaee76545e83dd09011727">false</a>)
<a name="l01489"></a>01489 {
<a name="l01490"></a>01490 }
<a name="l01491"></a>01491
<a name="l01492"></a>01492 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01493"></a><a class="code" href="classtree_1_1iterator__base.html#ada7cbe4d4f9a5ec29db78d10712edc6">01493</a> T& <a class="code" href="classtree_1_1iterator__base.html#ada7cbe4d4f9a5ec29db78d10712edc6">tree<T, tree_node_allocator>::iterator_base::operator*</a>()<span class="keyword"> const</span>
<a name="l01494"></a>01494 <span class="keyword"> </span>{
<a name="l01495"></a>01495 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>;
<a name="l01496"></a>01496 }
<a name="l01497"></a>01497
<a name="l01498"></a>01498 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01499"></a><a class="code" href="classtree_1_1iterator__base.html#bd9c59569df7d8be5a50c835c180f4dc">01499</a> T* <a class="code" href="classtree_1_1iterator__base.html#bd9c59569df7d8be5a50c835c180f4dc">tree<T, tree_node_allocator>::iterator_base::operator-></a>()<span class="keyword"> const</span>
<a name="l01500"></a>01500 <span class="keyword"> </span>{
<a name="l01501"></a>01501 <span class="keywordflow">return</span> &(<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#4c15077a3ad0552413d1268ee4be1bef">data</a>);
<a name="l01502"></a>01502 }
<a name="l01503"></a>01503
<a name="l01504"></a>01504 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01505"></a><a class="code" href="classtree_1_1post__order__iterator.html#59f0d0d145f27ed094a69214e1831102">01505</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1post__order__iterator.html#59f0d0d145f27ed094a69214e1831102">tree<T, tree_node_allocator>::post_order_iterator::operator!=</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01506"></a>01506 <span class="keyword"> </span>{
<a name="l01507"></a>01507 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>!=this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01508"></a>01508 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01509"></a>01509 }
<a name="l01510"></a>01510
<a name="l01511"></a>01511 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01512"></a><a class="code" href="classtree_1_1post__order__iterator.html#b1303f191d6bc8a62e5f03fa53466ec4">01512</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1post__order__iterator.html#b1303f191d6bc8a62e5f03fa53466ec4">tree<T, tree_node_allocator>::post_order_iterator::operator==</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01513"></a>01513 <span class="keyword"> </span>{
<a name="l01514"></a>01514 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>==this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01515"></a>01515 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01516"></a>01516 }
<a name="l01517"></a>01517
<a name="l01518"></a>01518 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01519"></a><a class="code" href="classtree_1_1pre__order__iterator.html#14425c7743e9a6da2d96b172a85d2bed">01519</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1pre__order__iterator.html#14425c7743e9a6da2d96b172a85d2bed">tree<T, tree_node_allocator>::pre_order_iterator::operator!=</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01520"></a>01520 <span class="keyword"> </span>{
<a name="l01521"></a>01521 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>!=this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01522"></a>01522 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01523"></a>01523 }
<a name="l01524"></a>01524
<a name="l01525"></a>01525 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01526"></a><a class="code" href="classtree_1_1pre__order__iterator.html#ea8dee1bfc2450608b2b35d26a9f11b7">01526</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1pre__order__iterator.html#ea8dee1bfc2450608b2b35d26a9f11b7">tree<T, tree_node_allocator>::pre_order_iterator::operator==</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01527"></a>01527 <span class="keyword"> </span>{
<a name="l01528"></a>01528 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>==this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01529"></a>01529 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01530"></a>01530 }
<a name="l01531"></a>01531
<a name="l01532"></a>01532 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01533"></a><a class="code" href="classtree_1_1sibling__iterator.html#2f4b2c5112c9d16f65852bc84d34c9c9">01533</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1sibling__iterator.html#2f4b2c5112c9d16f65852bc84d34c9c9">tree<T, tree_node_allocator>::sibling_iterator::operator!=</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01534"></a>01534 <span class="keyword"> </span>{
<a name="l01535"></a>01535 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>!=this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01536"></a>01536 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01537"></a>01537 }
<a name="l01538"></a>01538
<a name="l01539"></a>01539 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01540"></a><a class="code" href="classtree_1_1sibling__iterator.html#f235d7b64b7d2654437482bab80c797b">01540</a> <span class="keywordtype">bool</span> <a class="code" href="classtree_1_1sibling__iterator.html#f235d7b64b7d2654437482bab80c797b">tree<T, tree_node_allocator>::sibling_iterator::operator==</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)<span class="keyword"> const</span>
<a name="l01541"></a>01541 <span class="keyword"> </span>{
<a name="l01542"></a>01542 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>==this->node) <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l01543"></a>01543 <span class="keywordflow">else</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01544"></a>01544 }
<a name="l01545"></a>01545
<a name="l01546"></a>01546 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01547"></a><a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">01547</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#7fad2f6cc1a6a667b5c71bb16c9b84e5">tree<T, tree_node_allocator>::iterator_base::begin</a>()<span class="keyword"> const</span>
<a name="l01548"></a>01548 <span class="keyword"> </span>{
<a name="l01549"></a>01549 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> ret(<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>);
<a name="l01550"></a>01550 ret.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01551"></a>01551 <span class="keywordflow">return</span> ret;
<a name="l01552"></a>01552 }
<a name="l01553"></a>01553
<a name="l01554"></a>01554 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01555"></a><a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">01555</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree_1_1iterator__base.html#399dabd62f0659c02bfda59b26bdeefe">tree<T, tree_node_allocator>::iterator_base::end</a>()<span class="keyword"> const</span>
<a name="l01556"></a>01556 <span class="keyword"> </span>{
<a name="l01557"></a>01557 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> ret(0);
<a name="l01558"></a>01558 ret.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>=<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>;
<a name="l01559"></a>01559 <span class="keywordflow">return</span> ret;
<a name="l01560"></a>01560 }
<a name="l01561"></a>01561
<a name="l01562"></a>01562 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01563"></a><a class="code" href="classtree_1_1iterator__base.html#a0be7989b9dd4c5bcdcc0d47a56d11fb">01563</a> <span class="keywordtype">void</span> <a class="code" href="classtree_1_1iterator__base.html#a0be7989b9dd4c5bcdcc0d47a56d11fb" title="When called, the next increment/decrement skips children of this node.">tree<T, tree_node_allocator>::iterator_base::skip_children</a>()
<a name="l01564"></a>01564 {
<a name="l01565"></a>01565 <a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>=<span class="keyword">true</span>;
<a name="l01566"></a>01566 }
<a name="l01567"></a>01567
<a name="l01568"></a>01568 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01569"></a><a class="code" href="classtree_1_1iterator__base.html#435004214270928d106dd4c8f6a36f17">01569</a> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code" href="classtree_1_1iterator__base.html#435004214270928d106dd4c8f6a36f17" title="Number of children of the node pointed to by the iterator.">tree<T, tree_node_allocator>::iterator_base::number_of_children</a>()<span class="keyword"> const</span>
<a name="l01570"></a>01570 <span class="keyword"> </span>{
<a name="l01571"></a>01571 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *pos=<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l01572"></a>01572 <span class="keywordflow">if</span>(pos==0) <span class="keywordflow">return</span> 0;
<a name="l01573"></a>01573
<a name="l01574"></a>01574 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ret=1;
<a name="l01575"></a>01575 <span class="keywordflow">while</span>(pos!=<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>) {
<a name="l01576"></a>01576 ++ret;
<a name="l01577"></a>01577 pos=pos-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01578"></a>01578 }
<a name="l01579"></a>01579 <span class="keywordflow">return</span> ret;
<a name="l01580"></a>01580 }
<a name="l01581"></a>01581
<a name="l01582"></a>01582
<a name="l01583"></a>01583
<a name="l01584"></a>01584 <span class="comment">// Pre-order iterator</span>
<a name="l01585"></a>01585
<a name="l01586"></a>01586 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01587"></a><a class="code" href="classtree_1_1pre__order__iterator.html#aa4abe430ae678fa7d7753d9599be049">01587</a> <a class="code" href="classtree_1_1pre__order__iterator.html#aa4abe430ae678fa7d7753d9599be049">tree<T, tree_node_allocator>::pre_order_iterator::pre_order_iterator</a>()
<a name="l01588"></a>01588 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(0)
<a name="l01589"></a>01589 {
<a name="l01590"></a>01590 }
<a name="l01591"></a>01591
<a name="l01592"></a>01592 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01593"></a><a class="code" href="classtree_1_1pre__order__iterator.html#afdaf0da69c4406b916c14c5589fa391">01593</a> <a class="code" href="classtree_1_1pre__order__iterator.html#aa4abe430ae678fa7d7753d9599be049">tree<T, tree_node_allocator>::pre_order_iterator::pre_order_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tn)
<a name="l01594"></a>01594 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(tn)
<a name="l01595"></a>01595 {
<a name="l01596"></a>01596 }
<a name="l01597"></a>01597
<a name="l01598"></a>01598 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01599"></a><a class="code" href="classtree_1_1pre__order__iterator.html#969cfeb31a2e92d1a64d9f2945bbedf7">01599</a> <a class="code" href="classtree_1_1pre__order__iterator.html#aa4abe430ae678fa7d7753d9599be049">tree<T, tree_node_allocator>::pre_order_iterator::pre_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> &other)
<a name="l01600"></a>01600 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l01601"></a>01601 {
<a name="l01602"></a>01602 }
<a name="l01603"></a>01603
<a name="l01604"></a>01604 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01605"></a><a class="code" href="classtree_1_1pre__order__iterator.html#2705495c89beecc86107ca742a35507f">01605</a> <a class="code" href="classtree_1_1pre__order__iterator.html#aa4abe430ae678fa7d7753d9599be049">tree<T, tree_node_allocator>::pre_order_iterator::pre_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)
<a name="l01606"></a>01606 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l01607"></a>01607 {
<a name="l01608"></a>01608 <span class="keywordflow">if</span>(this->node==0) {
<a name="l01609"></a>01609 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">range_last</a>()!=0)
<a name="l01610"></a>01610 this->node=other.<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">range_last</a>();
<a name="l01611"></a>01611 <span class="keywordflow">else</span>
<a name="l01612"></a>01612 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=other.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>;
<a name="l01613"></a>01613 this-><a class="code" href="classtree_1_1iterator__base.html#a0be7989b9dd4c5bcdcc0d47a56d11fb" title="When called, the next increment/decrement skips children of this node.">skip_children</a>();
<a name="l01614"></a>01614 ++(*this);
<a name="l01615"></a>01615 }
<a name="l01616"></a>01616 }
<a name="l01617"></a>01617
<a name="l01618"></a>01618 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01619"></a><a class="code" href="classtree_1_1pre__order__iterator.html#07b77d1591ad7f05e4531489561d36d2">01619</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a>& <a class="code" href="classtree_1_1pre__order__iterator.html#07b77d1591ad7f05e4531489561d36d2">tree<T, tree_node_allocator>::pre_order_iterator::operator++</a>()
<a name="l01620"></a>01620 {
<a name="l01621"></a>01621 assert(this->node!=0);
<a name="l01622"></a>01622 <span class="keywordflow">if</span>(!this->skip_current_children_ && this->node->first_child != 0) {
<a name="l01623"></a>01623 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l01624"></a>01624 }
<a name="l01625"></a>01625 <span class="keywordflow">else</span> {
<a name="l01626"></a>01626 this-><a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>=<span class="keyword">false</span>;
<a name="l01627"></a>01627 <span class="keywordflow">while</span>(this->node->next_sibling==0) {
<a name="l01628"></a>01628 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01629"></a>01629 <span class="keywordflow">if</span>(this->node==0)
<a name="l01630"></a>01630 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01631"></a>01631 }
<a name="l01632"></a>01632 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01633"></a>01633 }
<a name="l01634"></a>01634 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01635"></a>01635 }
<a name="l01636"></a>01636
<a name="l01637"></a>01637 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01638"></a><a class="code" href="classtree_1_1pre__order__iterator.html#4e2dd21653724b6413d9949caf9bb107">01638</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a>& <a class="code" href="classtree_1_1pre__order__iterator.html#4e2dd21653724b6413d9949caf9bb107">tree<T, tree_node_allocator>::pre_order_iterator::operator--</a>()
<a name="l01639"></a>01639 {
<a name="l01640"></a>01640 assert(this->node!=0);
<a name="l01641"></a>01641 <span class="keywordflow">if</span>(this->node->prev_sibling) {
<a name="l01642"></a>01642 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01643"></a>01643 <span class="keywordflow">while</span>(this->node->last_child)
<a name="l01644"></a>01644 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l01645"></a>01645 }
<a name="l01646"></a>01646 <span class="keywordflow">else</span> {
<a name="l01647"></a>01647 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01648"></a>01648 <span class="keywordflow">if</span>(this->node==0)
<a name="l01649"></a>01649 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01650"></a>01650 }
<a name="l01651"></a>01651 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01652"></a>01652 }
<a name="l01653"></a>01653
<a name="l01654"></a>01654 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01655"></a><a class="code" href="classtree_1_1pre__order__iterator.html#d99a34d4c6cbfaa1de621b276a363856">01655</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a> <a class="code" href="classtree_1_1pre__order__iterator.html#07b77d1591ad7f05e4531489561d36d2">tree<T, tree_node_allocator>::pre_order_iterator::operator++</a>(<span class="keywordtype">int</span> n)
<a name="l01656"></a>01656 {
<a name="l01657"></a>01657 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01658"></a>01658 ++(*this);
<a name="l01659"></a>01659 <span class="keywordflow">return</span> copy;
<a name="l01660"></a>01660 }
<a name="l01661"></a>01661
<a name="l01662"></a>01662 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01663"></a><a class="code" href="classtree_1_1pre__order__iterator.html#9ccab7bd408c6d0a221f69d11f7f3717">01663</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a> <a class="code" href="classtree_1_1pre__order__iterator.html#4e2dd21653724b6413d9949caf9bb107">tree<T, tree_node_allocator>::pre_order_iterator::operator--</a>(<span class="keywordtype">int</span> n)
<a name="l01664"></a>01664 {
<a name="l01665"></a>01665 <a class="code" href="classtree_1_1pre__order__iterator.html" title="Depth-first iterator, first accessing the node, then its children.">pre_order_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01666"></a>01666 --(*this);
<a name="l01667"></a>01667 <span class="keywordflow">return</span> copy;
<a name="l01668"></a>01668 }
<a name="l01669"></a>01669
<a name="l01670"></a>01670 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01671"></a><a class="code" href="classtree_1_1pre__order__iterator.html#5ab66cd50ae22c9b246231b41b7720f5">01671</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a>& <a class="code" href="classtree_1_1pre__order__iterator.html#5ab66cd50ae22c9b246231b41b7720f5">tree<T, tree_node_allocator>::pre_order_iterator::operator+=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01672"></a>01672 {
<a name="l01673"></a>01673 <span class="keywordflow">while</span>(num>0) {
<a name="l01674"></a>01674 ++(*this);
<a name="l01675"></a>01675 --num;
<a name="l01676"></a>01676 }
<a name="l01677"></a>01677 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l01678"></a>01678 }
<a name="l01679"></a>01679
<a name="l01680"></a>01680 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01681"></a><a class="code" href="classtree_1_1pre__order__iterator.html#722aedfd8f8be3490324a587d17cb133">01681</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::pre_order_iterator</a>& <a class="code" href="classtree_1_1pre__order__iterator.html#722aedfd8f8be3490324a587d17cb133">tree<T, tree_node_allocator>::pre_order_iterator::operator-=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01682"></a>01682 {
<a name="l01683"></a>01683 <span class="keywordflow">while</span>(num>0) {
<a name="l01684"></a>01684 --(*this);
<a name="l01685"></a>01685 --num;
<a name="l01686"></a>01686 }
<a name="l01687"></a>01687 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l01688"></a>01688 }
<a name="l01689"></a>01689
<a name="l01690"></a>01690
<a name="l01691"></a>01691
<a name="l01692"></a>01692 <span class="comment">// Post-order iterator</span>
<a name="l01693"></a>01693
<a name="l01694"></a>01694 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01695"></a><a class="code" href="classtree_1_1post__order__iterator.html#f6d2a1ff77da1ca318447faef819fb22">01695</a> <a class="code" href="classtree_1_1post__order__iterator.html#f6d2a1ff77da1ca318447faef819fb22">tree<T, tree_node_allocator>::post_order_iterator::post_order_iterator</a>()
<a name="l01696"></a>01696 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(0)
<a name="l01697"></a>01697 {
<a name="l01698"></a>01698 }
<a name="l01699"></a>01699
<a name="l01700"></a>01700 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01701"></a><a class="code" href="classtree_1_1post__order__iterator.html#add3e555f6a69c1799cb5b9b12e3ef48">01701</a> <a class="code" href="classtree_1_1post__order__iterator.html#f6d2a1ff77da1ca318447faef819fb22">tree<T, tree_node_allocator>::post_order_iterator::post_order_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tn)
<a name="l01702"></a>01702 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(tn)
<a name="l01703"></a>01703 {
<a name="l01704"></a>01704 }
<a name="l01705"></a>01705
<a name="l01706"></a>01706 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01707"></a><a class="code" href="classtree_1_1post__order__iterator.html#bbe898c229fab7e833da744a76aca5ab">01707</a> <a class="code" href="classtree_1_1post__order__iterator.html#f6d2a1ff77da1ca318447faef819fb22">tree<T, tree_node_allocator>::post_order_iterator::post_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a> &other)
<a name="l01708"></a>01708 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l01709"></a>01709 {
<a name="l01710"></a>01710 }
<a name="l01711"></a>01711
<a name="l01712"></a>01712 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01713"></a><a class="code" href="classtree_1_1post__order__iterator.html#d1bba922181132f5c41a6ebd5230abe9">01713</a> <a class="code" href="classtree_1_1post__order__iterator.html#f6d2a1ff77da1ca318447faef819fb22">tree<T, tree_node_allocator>::post_order_iterator::post_order_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)
<a name="l01714"></a>01714 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l01715"></a>01715 {
<a name="l01716"></a>01716 <span class="keywordflow">if</span>(this->node==0) {
<a name="l01717"></a>01717 <span class="keywordflow">if</span>(other.<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">range_last</a>()!=0)
<a name="l01718"></a>01718 this->node=other.<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">range_last</a>();
<a name="l01719"></a>01719 <span class="keywordflow">else</span>
<a name="l01720"></a>01720 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=other.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>;
<a name="l01721"></a>01721 this-><a class="code" href="classtree_1_1iterator__base.html#a0be7989b9dd4c5bcdcc0d47a56d11fb" title="When called, the next increment/decrement skips children of this node.">skip_children</a>();
<a name="l01722"></a>01722 ++(*this);
<a name="l01723"></a>01723 }
<a name="l01724"></a>01724 }
<a name="l01725"></a>01725
<a name="l01726"></a>01726 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01727"></a><a class="code" href="classtree_1_1post__order__iterator.html#baba42c4ecb0a0bb8b21b0c28dfa3009">01727</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a>& <a class="code" href="classtree_1_1post__order__iterator.html#baba42c4ecb0a0bb8b21b0c28dfa3009">tree<T, tree_node_allocator>::post_order_iterator::operator++</a>()
<a name="l01728"></a>01728 {
<a name="l01729"></a>01729 assert(this->node!=0);
<a name="l01730"></a>01730 <span class="keywordflow">if</span>(this->node->next_sibling==0) {
<a name="l01731"></a>01731 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01732"></a>01732 this-><a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>=<span class="keyword">false</span>;
<a name="l01733"></a>01733 }
<a name="l01734"></a>01734 <span class="keywordflow">else</span> {
<a name="l01735"></a>01735 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01736"></a>01736 <span class="keywordflow">if</span>(this->skip_current_children_) {
<a name="l01737"></a>01737 this-><a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>=<span class="keyword">false</span>;
<a name="l01738"></a>01738 }
<a name="l01739"></a>01739 <span class="keywordflow">else</span> {
<a name="l01740"></a>01740 <span class="keywordflow">while</span>(this->node->first_child)
<a name="l01741"></a>01741 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l01742"></a>01742 }
<a name="l01743"></a>01743 }
<a name="l01744"></a>01744 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01745"></a>01745 }
<a name="l01746"></a>01746
<a name="l01747"></a>01747 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01748"></a><a class="code" href="classtree_1_1post__order__iterator.html#f70bbd10b24ca0cf1c674e4ef40899db">01748</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a>& <a class="code" href="classtree_1_1post__order__iterator.html#f70bbd10b24ca0cf1c674e4ef40899db">tree<T, tree_node_allocator>::post_order_iterator::operator--</a>()
<a name="l01749"></a>01749 {
<a name="l01750"></a>01750 assert(this->node!=0);
<a name="l01751"></a>01751 <span class="keywordflow">if</span>(this->skip_current_children_ || this->node->last_child==0) {
<a name="l01752"></a>01752 this-><a class="code" href="classtree_1_1iterator__base.html#88239267268c728952e0cd89b9326e82">skip_current_children_</a>=<span class="keyword">false</span>;
<a name="l01753"></a>01753 <span class="keywordflow">while</span>(this->node->prev_sibling==0)
<a name="l01754"></a>01754 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01755"></a>01755 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01756"></a>01756 }
<a name="l01757"></a>01757 <span class="keywordflow">else</span> {
<a name="l01758"></a>01758 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l01759"></a>01759 }
<a name="l01760"></a>01760 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01761"></a>01761 }
<a name="l01762"></a>01762
<a name="l01763"></a>01763 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01764"></a><a class="code" href="classtree_1_1post__order__iterator.html#7041325e846017886e7c43d9c1c2cddb">01764</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a> <a class="code" href="classtree_1_1post__order__iterator.html#baba42c4ecb0a0bb8b21b0c28dfa3009">tree<T, tree_node_allocator>::post_order_iterator::operator++</a>(<span class="keywordtype">int</span>)
<a name="l01765"></a>01765 {
<a name="l01766"></a>01766 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01767"></a>01767 ++(*this);
<a name="l01768"></a>01768 <span class="keywordflow">return</span> copy;
<a name="l01769"></a>01769 }
<a name="l01770"></a>01770
<a name="l01771"></a>01771 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01772"></a><a class="code" href="classtree_1_1post__order__iterator.html#f2c0df6c235853aa2191d02a557a1fea">01772</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a> <a class="code" href="classtree_1_1post__order__iterator.html#f70bbd10b24ca0cf1c674e4ef40899db">tree<T, tree_node_allocator>::post_order_iterator::operator--</a>(<span class="keywordtype">int</span>)
<a name="l01773"></a>01773 {
<a name="l01774"></a>01774 <a class="code" href="classtree_1_1post__order__iterator.html" title="Depth-first iterator, first accessing the children, then the node itself.">post_order_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01775"></a>01775 --(*this);
<a name="l01776"></a>01776 <span class="keywordflow">return</span> copy;
<a name="l01777"></a>01777 }
<a name="l01778"></a>01778
<a name="l01779"></a>01779
<a name="l01780"></a>01780 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01781"></a><a class="code" href="classtree_1_1post__order__iterator.html#0b6c2246f41b0a2ff8e4c9d9efcee879">01781</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a>& <a class="code" href="classtree_1_1post__order__iterator.html#0b6c2246f41b0a2ff8e4c9d9efcee879">tree<T, tree_node_allocator>::post_order_iterator::operator+=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01782"></a>01782 {
<a name="l01783"></a>01783 <span class="keywordflow">while</span>(num>0) {
<a name="l01784"></a>01784 ++(*this);
<a name="l01785"></a>01785 --num;
<a name="l01786"></a>01786 }
<a name="l01787"></a>01787 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l01788"></a>01788 }
<a name="l01789"></a>01789
<a name="l01790"></a>01790 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01791"></a><a class="code" href="classtree_1_1post__order__iterator.html#93b7ddae75f30985a0d81f38bcbaa306">01791</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::post_order_iterator</a>& <a class="code" href="classtree_1_1post__order__iterator.html#93b7ddae75f30985a0d81f38bcbaa306">tree<T, tree_node_allocator>::post_order_iterator::operator-=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01792"></a>01792 {
<a name="l01793"></a>01793 <span class="keywordflow">while</span>(num>0) {
<a name="l01794"></a>01794 --(*this);
<a name="l01795"></a>01795 --num;
<a name="l01796"></a>01796 }
<a name="l01797"></a>01797 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l01798"></a>01798 }
<a name="l01799"></a>01799
<a name="l01800"></a>01800 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01801"></a><a class="code" href="classtree_1_1post__order__iterator.html#ca4676b4986854521cfa2c7d84f62204">01801</a> <span class="keywordtype">void</span> <a class="code" href="classtree_1_1post__order__iterator.html#ca4676b4986854521cfa2c7d84f62204" title="Set iterator to the first child as deep as possible down the tree.">tree<T, tree_node_allocator>::post_order_iterator::descend_all</a>()
<a name="l01802"></a>01802 {
<a name="l01803"></a>01803 assert(this->node!=0);
<a name="l01804"></a>01804 <span class="keywordflow">while</span>(this->node->first_child)
<a name="l01805"></a>01805 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l01806"></a>01806 }
<a name="l01807"></a>01807
<a name="l01808"></a>01808
<a name="l01809"></a>01809 <span class="comment">// Fixed depth iterator</span>
<a name="l01810"></a>01810
<a name="l01811"></a>01811 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01812"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">01812</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">tree<T, tree_node_allocator>::fixed_depth_iterator::fixed_depth_iterator</a>()
<a name="l01813"></a>01813 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>()
<a name="l01814"></a>01814 {
<a name="l01815"></a>01815 set_first_parent_();
<a name="l01816"></a>01816 }
<a name="l01817"></a>01817
<a name="l01818"></a>01818 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01819"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#a9c0c41473a4d70efa17d7906829823c">01819</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">tree<T, tree_node_allocator>::fixed_depth_iterator::fixed_depth_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tn)
<a name="l01820"></a>01820 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(tn)
<a name="l01821"></a>01821 {
<a name="l01822"></a>01822 set_first_parent_();
<a name="l01823"></a>01823 }
<a name="l01824"></a>01824
<a name="l01825"></a>01825 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01826"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#64403be9e04a8e4929531b8e227b5d94">01826</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">tree<T, tree_node_allocator>::fixed_depth_iterator::fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& other)
<a name="l01827"></a>01827 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l01828"></a>01828 {
<a name="l01829"></a>01829 set_first_parent_();
<a name="l01830"></a>01830 }
<a name="l01831"></a>01831
<a name="l01832"></a>01832 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01833"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#949317e3e8a986e72e0a8dbb79a00b03">01833</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">tree<T, tree_node_allocator>::fixed_depth_iterator::fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)
<a name="l01834"></a>01834 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>), <a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>(other.parent_)
<a name="l01835"></a>01835 {
<a name="l01836"></a>01836 find_leftmost_parent_();
<a name="l01837"></a>01837 }
<a name="l01838"></a>01838
<a name="l01839"></a>01839 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01840"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#4416f43946317c249652270fec7c84a6">01840</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#10f1d20ec2b62e4370a560ebcd84ad54">tree<T, tree_node_allocator>::fixed_depth_iterator::fixed_depth_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a>& other)
<a name="l01841"></a>01841 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>), <a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>(other.<a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>)
<a name="l01842"></a>01842 {
<a name="l01843"></a>01843 }
<a name="l01844"></a>01844
<a name="l01845"></a>01845 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01846"></a>01846 <span class="keywordtype">void</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator::set_first_parent_</a>()
<a name="l01847"></a>01847 {
<a name="l01848"></a>01848 <span class="keywordflow">return</span>; <span class="comment">// FIXME: we do not use first_parent_ yet, and it actually needs some serious reworking if</span>
<a name="l01849"></a>01849 <span class="comment">// it is ever to work at the 'head' level.</span>
<a name="l01850"></a>01850 <a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>=0;
<a name="l01851"></a>01851 <span class="keywordflow">if</span>(this->node==0) <span class="keywordflow">return</span>;
<a name="l01852"></a>01852 <span class="keywordflow">if</span>(this->node->parent!=0)
<a name="l01853"></a>01853 <a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01854"></a>01854 <span class="keywordflow">if</span>(<a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>)
<a name="l01855"></a>01855 find_leftmost_parent_();
<a name="l01856"></a>01856 }
<a name="l01857"></a>01857
<a name="l01858"></a>01858 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01859"></a>01859 <span class="keywordtype">void</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator::find_leftmost_parent_</a>()
<a name="l01860"></a>01860 {
<a name="l01861"></a>01861 <span class="keywordflow">return</span>; <span class="comment">// FIXME: see 'set_first_parent()'</span>
<a name="l01862"></a>01862 <a class="code" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">tree_node</a> *tmppar=<a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>;
<a name="l01863"></a>01863 <span class="keywordflow">while</span>(tmppar->prev_sibling) {
<a name="l01864"></a>01864 tmppar=tmppar->prev_sibling;
<a name="l01865"></a>01865 <span class="keywordflow">if</span>(tmppar->first_child)
<a name="l01866"></a>01866 <a class="code" href="classtree_1_1fixed__depth__iterator.html#5f6c92f12c4281e94e950ccd70833985">first_parent_</a>=tmppar;
<a name="l01867"></a>01867 }
<a name="l01868"></a>01868 }
<a name="l01869"></a>01869
<a name="l01870"></a>01870 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01871"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#71bcee62caa033974d5c0d94ab0dc0c6">01871</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a>& <a class="code" href="classtree_1_1fixed__depth__iterator.html#71bcee62caa033974d5c0d94ab0dc0c6">tree<T, tree_node_allocator>::fixed_depth_iterator::operator++</a>()
<a name="l01872"></a>01872 {
<a name="l01873"></a>01873 assert(this->node!=0);
<a name="l01874"></a>01874
<a name="l01875"></a>01875 <span class="keywordflow">if</span>(this->node->next_sibling) {
<a name="l01876"></a>01876 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01877"></a>01877 }
<a name="l01878"></a>01878 <span class="keywordflow">else</span> {
<a name="l01879"></a>01879 <span class="keywordtype">int</span> relative_depth=0;
<a name="l01880"></a>01880 upper:
<a name="l01881"></a>01881 <span class="keywordflow">do</span> {
<a name="l01882"></a>01882 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01883"></a>01883 <span class="keywordflow">if</span>(this->node==0) <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01884"></a>01884 --relative_depth;
<a name="l01885"></a>01885 } <span class="keywordflow">while</span>(this->node->next_sibling==0);
<a name="l01886"></a>01886 lower:
<a name="l01887"></a>01887 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01888"></a>01888 <span class="keywordflow">while</span>(this->node->first_child==0) {
<a name="l01889"></a>01889 <span class="keywordflow">if</span>(this->node->next_sibling==0)
<a name="l01890"></a>01890 <span class="keywordflow">goto</span> upper;
<a name="l01891"></a>01891 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l01892"></a>01892 <span class="keywordflow">if</span>(this->node==0) <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01893"></a>01893 }
<a name="l01894"></a>01894 <span class="keywordflow">while</span>(relative_depth<0 && this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>!=0) {
<a name="l01895"></a>01895 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l01896"></a>01896 ++relative_depth;
<a name="l01897"></a>01897 }
<a name="l01898"></a>01898 <span class="keywordflow">if</span>(relative_depth<0) {
<a name="l01899"></a>01899 <span class="keywordflow">if</span>(this->node->next_sibling==0) <span class="keywordflow">goto</span> upper;
<a name="l01900"></a>01900 <span class="keywordflow">else</span> <span class="keywordflow">goto</span> lower;
<a name="l01901"></a>01901 }
<a name="l01902"></a>01902 }
<a name="l01903"></a>01903 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01904"></a>01904
<a name="l01905"></a>01905 <span class="comment">// if(this->node->next_sibling!=0) {</span>
<a name="l01906"></a>01906 <span class="comment">// this->node=this->node->next_sibling;</span>
<a name="l01907"></a>01907 <span class="comment">// assert(this->node!=0);</span>
<a name="l01908"></a>01908 <span class="comment">// if(this->node->parent==0 && this->node->next_sibling==0) // feet element</span>
<a name="l01909"></a>01909 <span class="comment">// this->node=0;</span>
<a name="l01910"></a>01910 <span class="comment">// }</span>
<a name="l01911"></a>01911 <span class="comment">// else {</span>
<a name="l01912"></a>01912 <span class="comment">// tree_node *par=this->node->parent;</span>
<a name="l01913"></a>01913 <span class="comment">// do {</span>
<a name="l01914"></a>01914 <span class="comment">// par=par->next_sibling;</span>
<a name="l01915"></a>01915 <span class="comment">// if(par==0) { // FIXME: need to keep track of this!</span>
<a name="l01916"></a>01916 <span class="comment">// this->node=0;</span>
<a name="l01917"></a>01917 <span class="comment">// return *this;</span>
<a name="l01918"></a>01918 <span class="comment">// }</span>
<a name="l01919"></a>01919 <span class="comment">// } while(par->first_child==0);</span>
<a name="l01920"></a>01920 <span class="comment">// this->node=par->first_child;</span>
<a name="l01921"></a>01921 <span class="comment">// }</span>
<a name="l01922"></a>01922 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01923"></a>01923 }
<a name="l01924"></a>01924
<a name="l01925"></a>01925 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01926"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#39a2c5b5048ec0dfff33fbb55bd7767e">01926</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a>& <a class="code" href="classtree_1_1fixed__depth__iterator.html#39a2c5b5048ec0dfff33fbb55bd7767e">tree<T, tree_node_allocator>::fixed_depth_iterator::operator--</a>()
<a name="l01927"></a>01927 {
<a name="l01928"></a>01928 assert(this->node!=0);
<a name="l01929"></a>01929 <span class="keywordflow">if</span>(this->node->prev_sibling!=0) {
<a name="l01930"></a>01930 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01931"></a>01931 assert(this->node!=0);
<a name="l01932"></a>01932 <span class="keywordflow">if</span>(this->node->parent==0 && this->node->prev_sibling==0) <span class="comment">// head element</span>
<a name="l01933"></a>01933 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=0;
<a name="l01934"></a>01934 }
<a name="l01935"></a>01935 <span class="keywordflow">else</span> {
<a name="l01936"></a>01936 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *par=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l01937"></a>01937 <span class="keywordflow">do</span> {
<a name="l01938"></a>01938 par=par-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l01939"></a>01939 <span class="keywordflow">if</span>(par==0) { <span class="comment">// FIXME: need to keep track of this!</span>
<a name="l01940"></a>01940 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=0;
<a name="l01941"></a>01941 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01942"></a>01942 }
<a name="l01943"></a>01943 } <span class="keywordflow">while</span>(par-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>==0);
<a name="l01944"></a>01944 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=par-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l01945"></a>01945 }
<a name="l01946"></a>01946 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01947"></a>01947 }
<a name="l01948"></a>01948
<a name="l01949"></a>01949 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01950"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#f1a1bf2404498a385611f938c2d6a750">01950</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#71bcee62caa033974d5c0d94ab0dc0c6">tree<T, tree_node_allocator>::fixed_depth_iterator::operator++</a>(<span class="keywordtype">int</span>)
<a name="l01951"></a>01951 {
<a name="l01952"></a>01952 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01953"></a>01953 ++(*this);
<a name="l01954"></a>01954 <span class="keywordflow">return</span> copy;
<a name="l01955"></a>01955 }
<a name="l01956"></a>01956
<a name="l01957"></a>01957 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01958"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#b404acdf3639ea5e5ce2ae65b77b94c7">01958</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a> <a class="code" href="classtree_1_1fixed__depth__iterator.html#39a2c5b5048ec0dfff33fbb55bd7767e">tree<T, tree_node_allocator>::fixed_depth_iterator::operator--</a>(<span class="keywordtype">int</span>)
<a name="l01959"></a>01959 {
<a name="l01960"></a>01960 <a class="code" href="classtree_1_1fixed__depth__iterator.html" title="Iterator which traverses only the nodes at a given depth from the root.">fixed_depth_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l01961"></a>01961 --(*this);
<a name="l01962"></a>01962 <span class="keywordflow">return</span> copy;
<a name="l01963"></a>01963 }
<a name="l01964"></a>01964
<a name="l01965"></a>01965 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01966"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#e8ccf119ae29e96044d9a4eeca2a539d">01966</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a>& <a class="code" href="classtree_1_1fixed__depth__iterator.html#e8ccf119ae29e96044d9a4eeca2a539d">tree<T, tree_node_allocator>::fixed_depth_iterator::operator-=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01967"></a>01967 {
<a name="l01968"></a>01968 <span class="keywordflow">while</span>(num>0) {
<a name="l01969"></a>01969 --(*this);
<a name="l01970"></a>01970 --(num);
<a name="l01971"></a>01971 }
<a name="l01972"></a>01972 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l01973"></a>01973 }
<a name="l01974"></a>01974
<a name="l01975"></a>01975 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01976"></a><a class="code" href="classtree_1_1fixed__depth__iterator.html#6909c400794c6feb49d75b99dbf6aa00">01976</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::fixed_depth_iterator</a>& <a class="code" href="classtree_1_1fixed__depth__iterator.html#6909c400794c6feb49d75b99dbf6aa00">tree<T, tree_node_allocator>::fixed_depth_iterator::operator+=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l01977"></a>01977 {
<a name="l01978"></a>01978 <span class="keywordflow">while</span>(num>0) {
<a name="l01979"></a>01979 ++(*this);
<a name="l01980"></a>01980 --(num);
<a name="l01981"></a>01981 }
<a name="l01982"></a>01982 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01983"></a>01983 }
<a name="l01984"></a>01984
<a name="l01985"></a>01985 <span class="comment">// FIXME: add the other members of fixed_depth_iterator.</span>
<a name="l01986"></a>01986
<a name="l01987"></a>01987
<a name="l01988"></a>01988 <span class="comment">// Sibling iterator</span>
<a name="l01989"></a>01989
<a name="l01990"></a>01990 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01991"></a><a class="code" href="classtree_1_1sibling__iterator.html#daaf56c800ed241d36802abab3925a2a">01991</a> <a class="code" href="classtree_1_1sibling__iterator.html#daaf56c800ed241d36802abab3925a2a">tree<T, tree_node_allocator>::sibling_iterator::sibling_iterator</a>()
<a name="l01992"></a>01992 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>()
<a name="l01993"></a>01993 {
<a name="l01994"></a>01994 set_parent_();
<a name="l01995"></a>01995 }
<a name="l01996"></a>01996
<a name="l01997"></a>01997 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l01998"></a><a class="code" href="classtree_1_1sibling__iterator.html#7ddfa2fffd76fdd78b97973408a80528">01998</a> <a class="code" href="classtree_1_1sibling__iterator.html#daaf56c800ed241d36802abab3925a2a">tree<T, tree_node_allocator>::sibling_iterator::sibling_iterator</a>(<a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tn)
<a name="l01999"></a>01999 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(tn)
<a name="l02000"></a>02000 {
<a name="l02001"></a>02001 set_parent_();
<a name="l02002"></a>02002 }
<a name="l02003"></a>02003
<a name="l02004"></a>02004 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02005"></a><a class="code" href="classtree_1_1sibling__iterator.html#093ea4798a85b0d52e5db20a876bc0d3">02005</a> <a class="code" href="classtree_1_1sibling__iterator.html#daaf56c800ed241d36802abab3925a2a">tree<T, tree_node_allocator>::sibling_iterator::sibling_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>& other)
<a name="l02006"></a>02006 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other.<a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>)
<a name="l02007"></a>02007 {
<a name="l02008"></a>02008 set_parent_();
<a name="l02009"></a>02009 }
<a name="l02010"></a>02010
<a name="l02011"></a>02011 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02012"></a><a class="code" href="classtree_1_1sibling__iterator.html#8def7a6f3e109876cb003f4254885ca0">02012</a> <a class="code" href="classtree_1_1sibling__iterator.html#daaf56c800ed241d36802abab3925a2a">tree<T, tree_node_allocator>::sibling_iterator::sibling_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a>& other)
<a name="l02013"></a>02013 : <a class="code" href="classtree_1_1iterator__base.html" title="Base class for iterators, only pointers stored, no traversal logic.">iterator_base</a>(other), <a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>(other.<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>)
<a name="l02014"></a>02014 {
<a name="l02015"></a>02015 }
<a name="l02016"></a>02016
<a name="l02017"></a>02017 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02018"></a>02018 <span class="keywordtype">void</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator::set_parent_</a>()
<a name="l02019"></a>02019 {
<a name="l02020"></a>02020 <a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>=0;
<a name="l02021"></a>02021 <span class="keywordflow">if</span>(this->node==0) <span class="keywordflow">return</span>;
<a name="l02022"></a>02022 <span class="keywordflow">if</span>(this->node->parent!=0)
<a name="l02023"></a>02023 <a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#60597bf2f8288fdd616c52f8a5a4e477">parent</a>;
<a name="l02024"></a>02024 }
<a name="l02025"></a>02025
<a name="l02026"></a>02026 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02027"></a><a class="code" href="classtree_1_1sibling__iterator.html#8d0d647a7843432b5ccc18724fcc3493">02027</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a>& <a class="code" href="classtree_1_1sibling__iterator.html#8d0d647a7843432b5ccc18724fcc3493">tree<T, tree_node_allocator>::sibling_iterator::operator++</a>()
<a name="l02028"></a>02028 {
<a name="l02029"></a>02029 <span class="keywordflow">if</span>(this->node)
<a name="l02030"></a>02030 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#195a647282d6ab1de50d9ac87aa42bce">next_sibling</a>;
<a name="l02031"></a>02031 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l02032"></a>02032 }
<a name="l02033"></a>02033
<a name="l02034"></a>02034 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02035"></a><a class="code" href="classtree_1_1sibling__iterator.html#7e91377755da77acd20d5b9356f7498e">02035</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a>& <a class="code" href="classtree_1_1sibling__iterator.html#7e91377755da77acd20d5b9356f7498e">tree<T, tree_node_allocator>::sibling_iterator::operator--</a>()
<a name="l02036"></a>02036 {
<a name="l02037"></a>02037 <span class="keywordflow">if</span>(this->node) this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>-><a class="code" href="classtree__node__.html#e7b8325f91c0b4460552cef6b9aec159">prev_sibling</a>;
<a name="l02038"></a>02038 <span class="keywordflow">else</span> {
<a name="l02039"></a>02039 assert(<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>);
<a name="l02040"></a>02040 this-><a class="code" href="classtree_1_1iterator__base.html#8e012d9505968cd1b51afab5bb4f2bf0">node</a>=<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l02041"></a>02041 }
<a name="l02042"></a>02042 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l02043"></a>02043 }
<a name="l02044"></a>02044
<a name="l02045"></a>02045 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02046"></a><a class="code" href="classtree_1_1sibling__iterator.html#66b73e99c5425620a5e282fe23cdfd98">02046</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree_1_1sibling__iterator.html#8d0d647a7843432b5ccc18724fcc3493">tree<T, tree_node_allocator>::sibling_iterator::operator++</a>(<span class="keywordtype">int</span>)
<a name="l02047"></a>02047 {
<a name="l02048"></a>02048 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l02049"></a>02049 ++(*this);
<a name="l02050"></a>02050 <span class="keywordflow">return</span> copy;
<a name="l02051"></a>02051 }
<a name="l02052"></a>02052
<a name="l02053"></a>02053 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02054"></a><a class="code" href="classtree_1_1sibling__iterator.html#eac6e7802aabdf7050b314af8d56c81d">02054</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a> <a class="code" href="classtree_1_1sibling__iterator.html#7e91377755da77acd20d5b9356f7498e">tree<T, tree_node_allocator>::sibling_iterator::operator--</a>(<span class="keywordtype">int</span>)
<a name="l02055"></a>02055 {
<a name="l02056"></a>02056 <a class="code" href="classtree_1_1sibling__iterator.html" title="Iterator which traverses only the nodes which are siblings of each other.">sibling_iterator</a> copy = *<span class="keyword">this</span>;
<a name="l02057"></a>02057 --(*this);
<a name="l02058"></a>02058 <span class="keywordflow">return</span> copy;
<a name="l02059"></a>02059 }
<a name="l02060"></a>02060
<a name="l02061"></a>02061 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02062"></a><a class="code" href="classtree_1_1sibling__iterator.html#d36b6994a50c0f73154b08ab35abf336">02062</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a>& <a class="code" href="classtree_1_1sibling__iterator.html#d36b6994a50c0f73154b08ab35abf336">tree<T, tree_node_allocator>::sibling_iterator::operator+=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l02063"></a>02063 {
<a name="l02064"></a>02064 <span class="keywordflow">while</span>(num>0) {
<a name="l02065"></a>02065 ++(*this);
<a name="l02066"></a>02066 --num;
<a name="l02067"></a>02067 }
<a name="l02068"></a>02068 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l02069"></a>02069 }
<a name="l02070"></a>02070
<a name="l02071"></a>02071 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02072"></a><a class="code" href="classtree_1_1sibling__iterator.html#f7b0a37317400fe16a1ad422c1ee6fa1">02072</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::sibling_iterator</a>& <a class="code" href="classtree_1_1sibling__iterator.html#f7b0a37317400fe16a1ad422c1ee6fa1">tree<T, tree_node_allocator>::sibling_iterator::operator-=</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num)
<a name="l02073"></a>02073 {
<a name="l02074"></a>02074 <span class="keywordflow">while</span>(num>0) {
<a name="l02075"></a>02075 --(*this);
<a name="l02076"></a>02076 --num;
<a name="l02077"></a>02077 }
<a name="l02078"></a>02078 <span class="keywordflow">return</span> (*<span class="keyword">this</span>);
<a name="l02079"></a>02079 }
<a name="l02080"></a>02080
<a name="l02081"></a>02081 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02082"></a><a class="code" href="classtree_1_1sibling__iterator.html#faed5294cdf5a6679c788fff0196c2a8">02082</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::tree_node</a> *<a class="code" href="classtree_1_1sibling__iterator.html#faed5294cdf5a6679c788fff0196c2a8">tree<T, tree_node_allocator>::sibling_iterator::range_first</a>()<span class="keyword"> const</span>
<a name="l02083"></a>02083 <span class="keyword"> </span>{
<a name="l02084"></a>02084 <a class="code" href="classtree__node__.html" title="A node in the tree, combining links to other nodes as well as the actual data.">tree_node</a> *tmp=<a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>-><a class="code" href="classtree__node__.html#d51591496e654515b662095f70d1fc1a">first_child</a>;
<a name="l02085"></a>02085 <span class="keywordflow">return</span> tmp;
<a name="l02086"></a>02086 }
<a name="l02087"></a>02087
<a name="l02088"></a>02088 <span class="keyword">template</span> <<span class="keyword">class</span> T, <span class="keyword">class</span> tree_node_allocator>
<a name="l02089"></a><a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">02089</a> <span class="keyword">typename</span> <a class="code" href="classtree.html">tree<T, tree_node_allocator>::tree_node</a> *<a class="code" href="classtree_1_1sibling__iterator.html#85438655c23ba60d2a4f83787e3dcf48">tree<T, tree_node_allocator>::sibling_iterator::range_last</a>()<span class="keyword"> const</span>
<a name="l02090"></a>02090 <span class="keyword"> </span>{
<a name="l02091"></a>02091 <span class="keywordflow">return</span> <a class="code" href="classtree_1_1sibling__iterator.html#204f7449ee908f982d21cc3d334d25bc">parent_</a>-><a class="code" href="classtree__node__.html#611d3c41c716dae6bf2012e3d9152933">last_child</a>;
<a name="l02092"></a>02092 }
<a name="l02093"></a>02093
<a name="l02094"></a>02094
<a name="l02095"></a>02095 <span class="preprocessor">#endif</span>
<a name="l02096"></a>02096 <span class="preprocessor"></span>
<a name="l02097"></a>02097 <span class="comment">// Local variables:</span>
<a name="l02098"></a>02098 <span class="comment">// default-tab-width: 3</span>
<a name="l02099"></a>02099 <span class="comment">// End:</span>
</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Mon Nov 19 20:27:59 2007 for LibOFX by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.3 </small></address>
</body>
</html>
|
