20
20
<!-- begin main content -->
22
<!-- Generated by Doxygen 1.5.5 -->
22
<!-- Generated by Doxygen 1.5.6 -->
23
23
<div class="contents">
24
24
<h1>Glib::NodeTree<T> Member List</h1>This is the complete list of members for <a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a>, including all inherited members.<p><table>
25
25
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#65a5e8732e2b140233eb1450ab6f35d4">append</a>(NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
26
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#ce1421b4c26f82c0e6904e3931f6ad8c">append_data</a>(const T& data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
26
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#c8d7b7ce8b478dfd87b8227e621b943c">append_data</a>(const T& the_data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
27
27
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#c787f9ab75c5c765a17317a16d73a518">child_count</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
28
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#8f6b6e6ec360325ab143d4a014274914">child_index</a>(const T& data) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
28
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#a900e05a5eb8ae321b4569b412317d05">child_index</a>(const T& the_data) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
29
29
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#e6bc31fc9c26678a5968cbe4fd3d4ba1">child_position</a>(const NodeTree<T>& child) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
30
30
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#e6159ff89698b40fea479cbafdc4f067">data</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
31
31
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#205cdaaa7bf5eb6a3750c8d4609dd122">data</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
32
32
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#c1ecb9d86f4e6d84a1ee5e98c400861a">depth</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
33
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#8b9e6d5063927afed7f0e136061b77d7">find</a>(const T& data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
34
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#5bca3795eb29259c0868fe50bf48bafb">find</a>(const T& data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
35
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#4632933fd259fca104036c99981c1fce">find_child</a>(const T& data, TraverseFlags flags=TRAVERSE_ALL)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
36
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#841e047625bfea106307d8d87bff2247">find_child</a>(const T& data, TraverseFlags flags=TRAVERSE_ALL) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
33
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#2b7691f32ba16f902124c6c72110d1c5">find</a>(const T& the_data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
34
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#84b95e45ee739d73cd35786c884d6880">find</a>(const T& the_data, TraverseType order=TRAVERSE_IN_ORDER, TraverseFlags flags=TRAVERSE_ALL) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
35
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#7a553e458203bcc295bafc07c3662e9c">find_child</a>(const T& the_data, TraverseFlags flags=TRAVERSE_ALL)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
36
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#10016f20b49c142f9582a5e69e956ee6">find_child</a>(const T& the_data, TraverseFlags flags=TRAVERSE_ALL) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
37
37
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#b64b292bd177d3d513125953141e3de9">first_child</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
38
38
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#ccdea338939b60daa996850da811c71c">first_child</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
39
39
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#2021001eee1ff423ec2f0a759170e4fd">first_sibling</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
48
48
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#664b7930de8a3d5b2f9f691d6a5d2e44">insert</a>(int position, NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
49
49
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#3217b1e57993a335daa02b7728385d32">insert_after</a>(NodeTree<T>& sibling, NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
50
50
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#6c0185ff53ce6f0b6574b4b93c706a29">insert_before</a>(NodeTree<T>& sibling, NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
51
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#36f92ed7fe914dc5e7d3a911078c8616">insert_data</a>(int position, const T& data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
52
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#7e8961948428634ac854630694202c0b">insert_data_before</a>(NodeTree<T>& sibling, const T& data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
51
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#988e1fd1fa5a91ac794ea859db7bcc85">insert_data</a>(int position, const T& the_data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
52
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#aa93210a10a5c3c3b31b728997354f81">insert_data_before</a>(NodeTree<T>& sibling, const T& the_data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
53
53
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#cff54c49a239add277672c971c96c686">is_ancestor</a>(const NodeTree<T>& descendant) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
54
54
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#4b245acd3b836f19b2ed17a584cffca3">is_leaf</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
55
55
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#a0e8f12f34a1091df1fd7690b374cd0e">is_root</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
61
61
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#f7952c290182814a42eed558a3701b5a">next_sibling</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
62
62
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#95893b710363a62b6cc50bc350a3986c">node_count</a>(TraverseFlags flags=TRAVERSE_ALL) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
63
63
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#24d62b0424afc56cef69022c36bb16c5">NodeTree</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
64
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#8acb5732db57bd1a75db3db7424f30a1">NodeTree</a>(const T& data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline, explicit]</code></td></tr>
64
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#a3909f3fe31329f176925791bbe368fb">NodeTree</a>(const T& the_data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline, explicit]</code></td></tr>
65
65
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#5c27a9b91aa532347e463f3629d20dd6">NodeTree</a>(const NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
66
66
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#e956914aaa5bba966934bab270f9ee82">nth_child</a>(int n)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
67
67
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#92694bf6304a94fe68e8a01a525c5f4b">nth_child</a>(int n) const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
68
68
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#f265f6f216ea9209cec39992dd0b6175">operator=</a>(const NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
69
69
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#9a58a1c8f02136d52998a62897c5945d">parent</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
70
70
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#c6d84033181fdbe1d84491bf505d6a5b">prepend</a>(NodeTree<T>& node)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
71
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#6354b8cfba3117e0a2ff697502fa4126">prepend_data</a>(const T& data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
71
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#2db3f440692e02d717bd9a4ec3b6604a">prepend_data</a>(const T& the_data)</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
72
72
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#6ed1973b99c794b1e52fdcb2fc41ba19">prev_sibling</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
73
73
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#4a13060df965cfe95ee2cdcc2ce1dc71">prev_sibling</a>() const </td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>
74
74
<tr class="memlist"><td><a class="el" href="classGlib_1_1NodeTree.html#125bbad27e6950b6d399b9746c9ffb60">reverse_children</a>()</td><td><a class="el" href="classGlib_1_1NodeTree.html">Glib::NodeTree<T></a></td><td><code> [inline]</code></td></tr>