<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>LibOFX: tree< T, tree_node_allocator > Class Template Reference</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.0 -->
<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 id="current"><a href="annotated.html"><span>Data Structures</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
</ul></div>
<div class="tabs">
<ul>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Data Fields</span></a></li>
</ul></div>
<h1>tree< T, tree_node_allocator > Class Template Reference</h1><!-- doxytag: class="tree" --><hr><a name="_details"></a><h2>Detailed Description</h2>
<h3>template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >><br>
class tree< T, tree_node_allocator ></h3>
<p>
<p>
Definition at line <a class="el" href="tree_8hh-source.html#l00103">103</a> of file <a class="el" href="tree_8hh-source.html">tree.hh</a>.<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="1e7bcd21e7420f7922a1bca79080acfa"></a><!-- doxytag: member="tree::value_type" ref="1e7bcd21e7420f7922a1bca79080acfa" args="" -->
typedef T </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa">value_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Value of the data stored at a node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="2079982538b88d21fe1ccea34fe7ce0e"></a><!-- doxytag: member="tree::iterator" ref="2079982538b88d21fe1ccea34fe7ce0e" args="" -->
typedef <a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#2079982538b88d21fe1ccea34fe7ce0e">iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The default iterator type throughout the tree class. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="1e7bcd21e7420f7922a1bca79080acfa"></a><!-- doxytag: member="tree::value_type" ref="1e7bcd21e7420f7922a1bca79080acfa" args="" -->
typedef T </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#1e7bcd21e7420f7922a1bca79080acfa">value_type</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Value of the data stored at a node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="2079982538b88d21fe1ccea34fe7ce0e"></a><!-- doxytag: member="tree::iterator" ref="2079982538b88d21fe1ccea34fe7ce0e" args="" -->
typedef <a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#2079982538b88d21fe1ccea34fe7ce0e">iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">The default iterator type throughout the tree class. <br></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a064a1d9dceac9b918c5247919a4a325"></a><!-- doxytag: member="tree::tree" ref="a064a1d9dceac9b918c5247919a4a325" args="()" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a064a1d9dceac9b918c5247919a4a325">tree</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="5925c012af64fe91a3a5ed39e3ba9d9a"></a><!-- doxytag: member="tree::tree" ref="5925c012af64fe91a3a5ed39e3ba9d9a" args="(const T &)" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#5925c012af64fe91a3a5ed39e3ba9d9a">tree</a> (const T &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b72378e7a772a82f90d91ef7493f27bc"></a><!-- doxytag: member="tree::tree" ref="b72378e7a772a82f90d91ef7493f27bc" args="(const iterator_base &)" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#b72378e7a772a82f90d91ef7493f27bc">tree</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e9e06b40929dfd33a1024bd422beedb6"></a><!-- doxytag: member="tree::tree" ref="e9e06b40929dfd33a1024bd422beedb6" args="(const tree< T, tree_node_allocator > &)" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e9e06b40929dfd33a1024bd422beedb6">tree</a> (const <a class="el" href="classtree.html">tree</a>< T, tree_node_allocator > &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f0169b515c95f4299fd2d984137b7868"></a><!-- doxytag: member="tree::~tree" ref="f0169b515c95f4299fd2d984137b7868" args="()" -->
</td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f0169b515c95f4299fd2d984137b7868">~tree</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9561c0c73b0605f32bf82a026eaf216a"></a><!-- doxytag: member="tree::operator=" ref="9561c0c73b0605f32bf82a026eaf216a" args="(const tree< T, tree_node_allocator > &)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#9561c0c73b0605f32bf82a026eaf216a">operator=</a> (const <a class="el" href="classtree.html">tree</a>< T, tree_node_allocator > &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b7835af8e94710f5b39486b67952200e"></a><!-- doxytag: member="tree::begin" ref="b7835af8e94710f5b39486b67952200e" args="() const" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#b7835af8e94710f5b39486b67952200e">begin</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the beginning of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="fba36da36f09bdefc3c8a8b31443dc13"></a><!-- doxytag: member="tree::end" ref="fba36da36f09bdefc3c8a8b31443dc13" args="() const" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#fba36da36f09bdefc3c8a8b31443dc13">end</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the end of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="044e579efaa40f08d46b08db116bcfd9"></a><!-- doxytag: member="tree::begin_post" ref="044e579efaa40f08d46b08db116bcfd9" args="() const" -->
<a class="el" href="classtree_1_1post__order__iterator.html">post_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#044e579efaa40f08d46b08db116bcfd9">begin_post</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return post-order iterator to the beginning of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9366cb2996612e92fc8333f62ad12ec4"></a><!-- doxytag: member="tree::end_post" ref="9366cb2996612e92fc8333f62ad12ec4" args="() const" -->
<a class="el" href="classtree_1_1post__order__iterator.html">post_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#9366cb2996612e92fc8333f62ad12ec4">end_post</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return post-order iterator to the end of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="bd58303fa5dc63e5bc8158de82a711e0"></a><!-- doxytag: member="tree::begin_fixed" ref="bd58303fa5dc63e5bc8158de82a711e0" args="(const iterator_base &, unsigned int) const" -->
<a class="el" href="classtree_1_1fixed__depth__iterator.html">fixed_depth_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#bd58303fa5dc63e5bc8158de82a711e0">begin_fixed</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &, unsigned int) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return fixed-depth iterator to the first node at a given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="c1944e7457c73af439a433ae3ea4892c"></a><!-- doxytag: member="tree::end_fixed" ref="c1944e7457c73af439a433ae3ea4892c" args="(const iterator_base &, unsigned int) const" -->
<a class="el" href="classtree_1_1fixed__depth__iterator.html">fixed_depth_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#c1944e7457c73af439a433ae3ea4892c">end_fixed</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &, unsigned int) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return fixed-depth iterator to end of the nodes at given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="aa5bb34ea7bda0121d5733d1210e1fb6"></a><!-- doxytag: member="tree::begin" ref="aa5bb34ea7bda0121d5733d1210e1fb6" args="(const iterator_base &) const" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#aa5bb34ea7bda0121d5733d1210e1fb6">begin</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return sibling iterator to the first child of given node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="8a823b13cfbdc0fc9ea248aab92d17f1"></a><!-- doxytag: member="tree::end" ref="8a823b13cfbdc0fc9ea248aab92d17f1" args="(const iterator_base &) const" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#8a823b13cfbdc0fc9ea248aab92d17f1">end</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return sibling iterator to the end of the children of a given node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="c4fad296716ff3afde3556c598f41a7f"></a><!-- doxytag: member="tree::parent" ref="c4fad296716ff3afde3556c598f41a7f" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#c4fad296716ff3afde3556c598f41a7f">parent</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the parent of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="291bee91cf202e130095b1867b9bd356"></a><!-- doxytag: member="tree::previous_sibling" ref="291bee91cf202e130095b1867b9bd356" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#291bee91cf202e130095b1867b9bd356">previous_sibling</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the previous sibling of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="7a09a0eeccff8c96d1351859c007d2ff"></a><!-- doxytag: member="tree::next_sibling" ref="7a09a0eeccff8c96d1351859c007d2ff" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#7a09a0eeccff8c96d1351859c007d2ff">next_sibling</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the next sibling of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="012d4dbcc58401d8a1f9e97ec41898b9"></a><!-- doxytag: member="tree::next_at_same_depth" ref="012d4dbcc58401d8a1f9e97ec41898b9" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#012d4dbcc58401d8a1f9e97ec41898b9">next_at_same_depth</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the next node at a given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a8cf6dfe17504abfc0ffabb5a4ba9d0a"></a><!-- doxytag: member="tree::clear" ref="a8cf6dfe17504abfc0ffabb5a4ba9d0a" args="()" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a">clear</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase all nodes of the tree. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="3eb424c89446ae17a747d2aca2cdda4b"></a><!-- doxytag: member="tree::erase" ref="3eb424c89446ae17a747d2aca2cdda4b" args="(iter)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b">erase</a> (iter)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase element at position pointed to by iterator, return incremented iterator. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="05d5fd71c206efc8ac30df5cd46176bc"></a><!-- doxytag: member="tree::erase_children" ref="05d5fd71c206efc8ac30df5cd46176bc" args="(const iterator_base &)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc">erase_children</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase all children of the node pointed to by iterator. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="8d68e95f5088d48cb54fd6ae381729f0"></a><!-- doxytag: member="tree::append_child" ref="8d68e95f5088d48cb54fd6ae381729f0" args="(iter position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert empty node as last child of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="9318fa77c4e10ec0a9a26a0d08f182a2"></a><!-- doxytag: member="tree::append_child" ref="9318fa77c4e10ec0a9a26a0d08f182a2" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#9318fa77c4e10ec0a9a26a0d08f182a2">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as last child of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="1fb4734b783fed4a66c24130af67316e"></a><!-- doxytag: member="tree::append_child" ref="1fb4734b783fed4a66c24130af67316e" args="(iter position, iter other_position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#1fb4734b783fed4a66c24130af67316e">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter other_position)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Append the node (plus its children) at other_position as a child of position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="92ab22e0a98d8899c0d1b6c9d0a85465"></a><!-- doxytag: member="tree::append_children" ref="92ab22e0a98d8899c0d1b6c9d0a85465" args="(iter position, sibling_iterator from, sibling_iterator to)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#92ab22e0a98d8899c0d1b6c9d0a85465">append_children</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Append the nodes in the from-to range (plus their children) as children of position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f11d736ea971ab93651350161f5a7535"></a><!-- doxytag: member="tree::set_head" ref="f11d736ea971ab93651350161f5a7535" args="(const T &x)" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f11d736ea971ab93651350161f5a7535">set_head</a> (const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Short-hand to insert topmost node in otherwise empty tree. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="c3d19d3a42f91618267674f2c236aad9"></a><!-- doxytag: member="tree::insert" ref="c3d19d3a42f91618267674f2c236aad9" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#c3d19d3a42f91618267674f2c236aad9">insert</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as previous sibling of node pointed to by position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="429bbd485078981ef83b59a779d9f947"></a><!-- doxytag: member="tree::insert" ref="429bbd485078981ef83b59a779d9f947" args="(sibling_iterator position, const T &x)" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#429bbd485078981ef83b59a779d9f947">insert</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Specialisation of previous member. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="d66d55d58b48ce0a8d7a5b41abe923d5"></a><!-- doxytag: member="tree::insert_subtree" ref="d66d55d58b48ce0a8d7a5b41abe923d5" args="(iter position, const iterator_base &subtree)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5">insert_subtree</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &subtree)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node (with children) pointed to by subtree as previous sibling of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="215ab56bd13f59c661eb2298e373ff3e"></a><!-- doxytag: member="tree::insert_after" ref="215ab56bd13f59c661eb2298e373ff3e" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#215ab56bd13f59c661eb2298e373ff3e">insert_after</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as next sibling of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="4885e968c82655ebebea5d0927b7e9f4"></a><!-- doxytag: member="tree::replace" ref="4885e968c82655ebebea5d0927b7e9f4" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4">replace</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace node at 'position' with other node (keeping same children); 'position' becomes invalid. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="5d2ad4532598f26c84b1ab0ec84a5d62"></a><!-- doxytag: member="tree::replace" ref="5d2ad4532598f26c84b1ab0ec84a5d62" args="(iter position, const iterator_base &from)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#5d2ad4532598f26c84b1ab0ec84a5d62">replace</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace node at 'position' with subtree starting at 'from' (do not erase subtree at 'from'); see above. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="fc5bef13996f2fd939d83837aa8e090d"></a><!-- doxytag: member="tree::replace" ref="fc5bef13996f2fd939d83837aa8e090d" args="(sibling_iterator orig_begin, sibling_iterator orig_end, sibling_iterator new_begin, sibling_iterator new_end)" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#fc5bef13996f2fd939d83837aa8e090d">replace</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> orig_begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> orig_end, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> new_begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> new_end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace string of siblings (plus their children) with copy of a new string (with children); see above. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="479c8e3f748608a9b9fb91e58e18998c"></a><!-- doxytag: member="tree::flatten" ref="479c8e3f748608a9b9fb91e58e18998c" args="(iter position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#479c8e3f748608a9b9fb91e58e18998c">flatten</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move all children of node at 'position' to be siblings, returns position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="32b88523e2d5b6c78381b7da9455be5e"></a><!-- doxytag: member="tree::reparent" ref="32b88523e2d5b6c78381b7da9455be5e" args="(iter position, sibling_iterator begin, sibling_iterator end)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e">reparent</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move nodes in range to be children of 'position'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="021a394ff7139df8573e2cb80e6beaa2"></a><!-- doxytag: member="tree::reparent" ref="021a394ff7139df8573e2cb80e6beaa2" args="(iter position, iter from)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#021a394ff7139df8573e2cb80e6beaa2">reparent</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move all child nodes of 'from' to be children of 'position'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="e7f72ba46cd061f71720c731b4a9bf63"></a><!-- doxytag: member="tree::move_after" ref="e7f72ba46cd061f71720c731b4a9bf63" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#e7f72ba46cd061f71720c731b4a9bf63">move_after</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the next sibling of 'target'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="b45aa15042445a81b13873d3ef4a2e86"></a><!-- doxytag: member="tree::move_before" ref="b45aa15042445a81b13873d3ef4a2e86" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#b45aa15042445a81b13873d3ef4a2e86">move_before</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the previous sibling of 'target'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="a4f8b906b2758eec530e28387b819284"></a><!-- doxytag: member="tree::move_ontop" ref="a4f8b906b2758eec530e28387b819284" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#a4f8b906b2758eec530e28387b819284">move_ontop</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the node at 'target' (erasing the node at 'target'). <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="1e3cd901f8f8d8a3da0e1d32e9282db1"></a><!-- doxytag: member="tree::merge" ref="1e3cd901f8f8d8a3da0e1d32e9282db1" args="(sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, bool duplicate_leaves=false)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1">merge</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, bool duplicate_leaves=false)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Merge with other tree, creating new branches and leaves only if they are not already present. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="498ec42a5eb44cba8bf9ef6e7fd5db9e"></a><!-- doxytag: member="tree::sort" ref="498ec42a5eb44cba8bf9ef6e7fd5db9e" args="(sibling_iterator from, sibling_iterator to, bool deep=false)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e">sort</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to, bool deep=false)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sort (std::sort only moves values of nodes, this one moves children as well). <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="f187f42c28a39304649ee41d3464f2ef"></a><!-- doxytag: member="tree::sort" ref="f187f42c28a39304649ee41d3464f2ef" args="(sibling_iterator from, sibling_iterator to, StrictWeakOrdering comp, bool deep=false)" -->
template<class StrictWeakOrdering> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#f187f42c28a39304649ee41d3464f2ef">sort</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to, StrictWeakOrdering comp, bool deep=false)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="066b1a4018f9ed74effee262980aaaae"></a><!-- doxytag: member="tree::equal" ref="066b1a4018f9ed74effee262980aaaae" args="(const iter &one, const iter &two, const iter &three) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#066b1a4018f9ed74effee262980aaaae">equal</a> (const iter &one, const iter &two, const iter &three) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compare two ranges of nodes (compares nodes as well as tree structure). <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="938fa67972463dfd5173b9bce0440c34"></a><!-- doxytag: member="tree::equal" ref="938fa67972463dfd5173b9bce0440c34" args="(const iter &one, const iter &two, const iter &three, BinaryPredicate) const" -->
template<typename iter, class BinaryPredicate> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#938fa67972463dfd5173b9bce0440c34">equal</a> (const iter &one, const iter &two, const iter &three, BinaryPredicate) const</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="5decf01c6fcd8516b8d1152fe574aabc"></a><!-- doxytag: member="tree::equal_subtree" ref="5decf01c6fcd8516b8d1152fe574aabc" args="(const iter &one, const iter &two) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#5decf01c6fcd8516b8d1152fe574aabc">equal_subtree</a> (const iter &one, const iter &two) const</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="81f2dc396b3c8af91555b393213478db"></a><!-- doxytag: member="tree::equal_subtree" ref="81f2dc396b3c8af91555b393213478db" args="(const iter &one, const iter &two, BinaryPredicate) const" -->
template<typename iter, class BinaryPredicate> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#81f2dc396b3c8af91555b393213478db">equal_subtree</a> (const iter &one, const iter &two, BinaryPredicate) const</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f7c1b796877be85cdf6912e3142313cf"></a><!-- doxytag: member="tree::subtree" ref="f7c1b796877be85cdf6912e3142313cf" args="(sibling_iterator from, sibling_iterator to) const" -->
<a class="el" href="classtree.html">tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f7c1b796877be85cdf6912e3142313cf">subtree</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extract a new tree formed by the range of siblings plus all their children. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a677366fa92fc1497aeac283bd3de0f5"></a><!-- doxytag: member="tree::subtree" ref="a677366fa92fc1497aeac283bd3de0f5" args="(tree &, sibling_iterator from, sibling_iterator to) const" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a677366fa92fc1497aeac283bd3de0f5">subtree</a> (<a class="el" href="classtree.html">tree</a> &, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to) const</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e842f9b70235bc2412b3c43bca759448"></a><!-- doxytag: member="tree::swap" ref="e842f9b70235bc2412b3c43bca759448" args="(sibling_iterator it)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e842f9b70235bc2412b3c43bca759448">swap</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Exchange the node (plus subtree) with its sibling node (do nothing if no sibling present). <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="efe4460d7a0f4c0e309649e3ebfe3c3d"></a><!-- doxytag: member="tree::size" ref="efe4460d7a0f4c0e309649e3ebfe3c3d" args="() const" -->
int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#efe4460d7a0f4c0e309649e3ebfe3c3d">size</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the total number of nodes. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e600fb282f7534e75811d14a1d1d0aba"></a><!-- doxytag: member="tree::empty" ref="e600fb282f7534e75811d14a1d1d0aba" args="() const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e600fb282f7534e75811d14a1d1d0aba">empty</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Check if tree is empty. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="85338176eaaf8421fa0ef06d1d5e8e40"></a><!-- doxytag: member="tree::depth" ref="85338176eaaf8421fa0ef06d1d5e8e40" args="(const iterator_base &) const" -->
int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#85338176eaaf8421fa0ef06d1d5e8e40">depth</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute the depth to the root. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="bf7233c3c57bc8b844e4bb6b420727c4"></a><!-- doxytag: member="tree::number_of_children" ref="bf7233c3c57bc8b844e4bb6b420727c4" args="(const iterator_base &) const" -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#bf7233c3c57bc8b844e4bb6b420727c4">number_of_children</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the number of children of node at position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f3613943778560ad57787486e071af12"></a><!-- doxytag: member="tree::number_of_siblings" ref="f3613943778560ad57787486e071af12" args="(const iterator_base &) const" -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f3613943778560ad57787486e071af12">number_of_siblings</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the number of 'next' siblings of node at iterator. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a860f37aa4ec8955ef18a9b1936f0665"></a><!-- doxytag: member="tree::is_in_subtree" ref="a860f37aa4ec8955ef18a9b1936f0665" args="(const iterator_base &position, const iterator_base &begin, const iterator_base &end) const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a860f37aa4ec8955ef18a9b1936f0665">is_in_subtree</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &<a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &begin, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &end) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine whether node at position is in the subtrees with root in the range. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9155b3955497913a965acf612caf02fd"></a><!-- doxytag: member="tree::is_valid" ref="9155b3955497913a965acf612caf02fd" args="(const iterator_base &) const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#9155b3955497913a965acf612caf02fd">is_valid</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine whether the iterator is an 'end' iterator and thus not actually pointing to a node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="de5ec1ba55f94165062e50d01ec35d86"></a><!-- doxytag: member="tree::index" ref="de5ec1ba55f94165062e50d01ec35d86" args="(sibling_iterator it) const " -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#de5ec1ba55f94165062e50d01ec35d86">index</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> it) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine the index of a node in the range of siblings to which it belongs. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="446c722c82607f8b3243a9153b665d19"></a><!-- doxytag: member="tree::child" ref="446c722c82607f8b3243a9153b665d19" args="(const iterator_base &position, unsigned int) const " -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#446c722c82607f8b3243a9153b665d19">child</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &<a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, unsigned int) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inverse of 'index': return the n-th child of the node at position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="5925c012af64fe91a3a5ed39e3ba9d9a"></a><!-- doxytag: member="tree::tree" ref="5925c012af64fe91a3a5ed39e3ba9d9a" args="(const T &)" -->
</td><td class="memItemRight" valign="bottom"><b>tree</b> (const T &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="b72378e7a772a82f90d91ef7493f27bc"></a><!-- doxytag: member="tree::tree" ref="b72378e7a772a82f90d91ef7493f27bc" args="(const iterator_base &)" -->
</td><td class="memItemRight" valign="bottom"><b>tree</b> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e9e06b40929dfd33a1024bd422beedb6"></a><!-- doxytag: member="tree::tree" ref="e9e06b40929dfd33a1024bd422beedb6" args="(const tree< T, tree_node_allocator > &)" -->
</td><td class="memItemRight" valign="bottom"><b>tree</b> (const <a class="el" href="classtree.html">tree</a>< T, tree_node_allocator > &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9561c0c73b0605f32bf82a026eaf216a"></a><!-- doxytag: member="tree::operator=" ref="9561c0c73b0605f32bf82a026eaf216a" args="(const tree< T, tree_node_allocator > &)" -->
void </td><td class="memItemRight" valign="bottom"><b>operator=</b> (const <a class="el" href="classtree.html">tree</a>< T, tree_node_allocator > &)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f3db9ff55646fab0599c1b609877d3d0"></a><!-- doxytag: member="tree::begin" ref="f3db9ff55646fab0599c1b609877d3d0" args="() const" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f3db9ff55646fab0599c1b609877d3d0">begin</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the beginning of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="8d1c59b2ca6c9a07e3a81a6e7bc2bf2e"></a><!-- doxytag: member="tree::end" ref="8d1c59b2ca6c9a07e3a81a6e7bc2bf2e" args="() const" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#8d1c59b2ca6c9a07e3a81a6e7bc2bf2e">end</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the end of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="6ce6ea4851db6f8eaf2c72e1dfec331d"></a><!-- doxytag: member="tree::begin_post" ref="6ce6ea4851db6f8eaf2c72e1dfec331d" args="() const" -->
<a class="el" href="classtree_1_1post__order__iterator.html">post_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#6ce6ea4851db6f8eaf2c72e1dfec331d">begin_post</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return post-order iterator to the beginning of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f89f532633cc4e65b52db26b512f1b1c"></a><!-- doxytag: member="tree::end_post" ref="f89f532633cc4e65b52db26b512f1b1c" args="() const" -->
<a class="el" href="classtree_1_1post__order__iterator.html">post_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f89f532633cc4e65b52db26b512f1b1c">end_post</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return post-order iterator to the end of the tree. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="8f0079827e731673d0087b7a22b8b89e"></a><!-- doxytag: member="tree::begin_fixed" ref="8f0079827e731673d0087b7a22b8b89e" args="(const iterator_base &, unsigned int) const" -->
<a class="el" href="classtree_1_1fixed__depth__iterator.html">fixed_depth_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#8f0079827e731673d0087b7a22b8b89e">begin_fixed</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &, unsigned int) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return fixed-depth iterator to the first node at a given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="d6f29df53a4899fd23ba02ffbf401dbd"></a><!-- doxytag: member="tree::end_fixed" ref="d6f29df53a4899fd23ba02ffbf401dbd" args="(const iterator_base &, unsigned int) const" -->
<a class="el" href="classtree_1_1fixed__depth__iterator.html">fixed_depth_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#d6f29df53a4899fd23ba02ffbf401dbd">end_fixed</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &, unsigned int) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return fixed-depth iterator to end of the nodes at given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a1d6018c4d28b0d52ab51c6faec51937"></a><!-- doxytag: member="tree::begin" ref="a1d6018c4d28b0d52ab51c6faec51937" args="(const iterator_base &) const" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a1d6018c4d28b0d52ab51c6faec51937">begin</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return sibling iterator to the first child of given node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f211529de8f9129986c3a48b4d3286dd"></a><!-- doxytag: member="tree::end" ref="f211529de8f9129986c3a48b4d3286dd" args="(const iterator_base &) const" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f211529de8f9129986c3a48b4d3286dd">end</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return sibling iterator to the end of the children of a given node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="c4fad296716ff3afde3556c598f41a7f"></a><!-- doxytag: member="tree::parent" ref="c4fad296716ff3afde3556c598f41a7f" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#c4fad296716ff3afde3556c598f41a7f">parent</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the parent of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="291bee91cf202e130095b1867b9bd356"></a><!-- doxytag: member="tree::previous_sibling" ref="291bee91cf202e130095b1867b9bd356" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#291bee91cf202e130095b1867b9bd356">previous_sibling</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the previous sibling of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="7a09a0eeccff8c96d1351859c007d2ff"></a><!-- doxytag: member="tree::next_sibling" ref="7a09a0eeccff8c96d1351859c007d2ff" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#7a09a0eeccff8c96d1351859c007d2ff">next_sibling</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the next sibling of a node. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="012d4dbcc58401d8a1f9e97ec41898b9"></a><!-- doxytag: member="tree::next_at_same_depth" ref="012d4dbcc58401d8a1f9e97ec41898b9" args="(iter) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#012d4dbcc58401d8a1f9e97ec41898b9">next_at_same_depth</a> (iter) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Return iterator to the next node at a given depth. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a8cf6dfe17504abfc0ffabb5a4ba9d0a"></a><!-- doxytag: member="tree::clear" ref="a8cf6dfe17504abfc0ffabb5a4ba9d0a" args="()" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a8cf6dfe17504abfc0ffabb5a4ba9d0a">clear</a> ()</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase all nodes of the tree. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="3eb424c89446ae17a747d2aca2cdda4b"></a><!-- doxytag: member="tree::erase" ref="3eb424c89446ae17a747d2aca2cdda4b" args="(iter)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#3eb424c89446ae17a747d2aca2cdda4b">erase</a> (iter)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase element at position pointed to by iterator, return incremented iterator. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="05d5fd71c206efc8ac30df5cd46176bc"></a><!-- doxytag: member="tree::erase_children" ref="05d5fd71c206efc8ac30df5cd46176bc" args="(const iterator_base &)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#05d5fd71c206efc8ac30df5cd46176bc">erase_children</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Erase all children of the node pointed to by iterator. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="8d68e95f5088d48cb54fd6ae381729f0"></a><!-- doxytag: member="tree::append_child" ref="8d68e95f5088d48cb54fd6ae381729f0" args="(iter position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#8d68e95f5088d48cb54fd6ae381729f0">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert empty node as last child of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="9318fa77c4e10ec0a9a26a0d08f182a2"></a><!-- doxytag: member="tree::append_child" ref="9318fa77c4e10ec0a9a26a0d08f182a2" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#9318fa77c4e10ec0a9a26a0d08f182a2">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as last child of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="1fb4734b783fed4a66c24130af67316e"></a><!-- doxytag: member="tree::append_child" ref="1fb4734b783fed4a66c24130af67316e" args="(iter position, iter other_position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#1fb4734b783fed4a66c24130af67316e">append_child</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter other_position)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Append the node (plus its children) at other_position as a child of position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="92ab22e0a98d8899c0d1b6c9d0a85465"></a><!-- doxytag: member="tree::append_children" ref="92ab22e0a98d8899c0d1b6c9d0a85465" args="(iter position, sibling_iterator from, sibling_iterator to)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#92ab22e0a98d8899c0d1b6c9d0a85465">append_children</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Append the nodes in the from-to range (plus their children) as children of position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="16e33d0c3cd419a9fc8fd14e8d1a0768"></a><!-- doxytag: member="tree::set_head" ref="16e33d0c3cd419a9fc8fd14e8d1a0768" args="(const T &x)" -->
<a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#16e33d0c3cd419a9fc8fd14e8d1a0768">set_head</a> (const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Short-hand to insert topmost node in otherwise empty tree. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="c3d19d3a42f91618267674f2c236aad9"></a><!-- doxytag: member="tree::insert" ref="c3d19d3a42f91618267674f2c236aad9" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#c3d19d3a42f91618267674f2c236aad9">insert</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as previous sibling of node pointed to by position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="228da1f727711e92bc8dd64b10f7dfff"></a><!-- doxytag: member="tree::insert" ref="228da1f727711e92bc8dd64b10f7dfff" args="(sibling_iterator position, const T &x)" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#228da1f727711e92bc8dd64b10f7dfff">insert</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Specialisation of previous member. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="d66d55d58b48ce0a8d7a5b41abe923d5"></a><!-- doxytag: member="tree::insert_subtree" ref="d66d55d58b48ce0a8d7a5b41abe923d5" args="(iter position, const iterator_base &subtree)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#d66d55d58b48ce0a8d7a5b41abe923d5">insert_subtree</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &subtree)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node (with children) pointed to by subtree as previous sibling of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="215ab56bd13f59c661eb2298e373ff3e"></a><!-- doxytag: member="tree::insert_after" ref="215ab56bd13f59c661eb2298e373ff3e" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#215ab56bd13f59c661eb2298e373ff3e">insert_after</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Insert node as next sibling of node pointed to by position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="4885e968c82655ebebea5d0927b7e9f4"></a><!-- doxytag: member="tree::replace" ref="4885e968c82655ebebea5d0927b7e9f4" args="(iter position, const T &x)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#4885e968c82655ebebea5d0927b7e9f4">replace</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const T &x)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace node at 'position' with other node (keeping same children); 'position' becomes invalid. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="5d2ad4532598f26c84b1ab0ec84a5d62"></a><!-- doxytag: member="tree::replace" ref="5d2ad4532598f26c84b1ab0ec84a5d62" args="(iter position, const iterator_base &from)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#5d2ad4532598f26c84b1ab0ec84a5d62">replace</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace node at 'position' with subtree starting at 'from' (do not erase subtree at 'from'); see above. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="246ce66bdbc54066ff9b3f47df9adde3"></a><!-- doxytag: member="tree::replace" ref="246ce66bdbc54066ff9b3f47df9adde3" args="(sibling_iterator orig_begin, sibling_iterator orig_end, sibling_iterator new_begin, sibling_iterator new_end)" -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#246ce66bdbc54066ff9b3f47df9adde3">replace</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> orig_begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> orig_end, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> new_begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> new_end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Replace string of siblings (plus their children) with copy of a new string (with children); see above. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="479c8e3f748608a9b9fb91e58e18998c"></a><!-- doxytag: member="tree::flatten" ref="479c8e3f748608a9b9fb91e58e18998c" args="(iter position)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#479c8e3f748608a9b9fb91e58e18998c">flatten</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move all children of node at 'position' to be siblings, returns position. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="32b88523e2d5b6c78381b7da9455be5e"></a><!-- doxytag: member="tree::reparent" ref="32b88523e2d5b6c78381b7da9455be5e" args="(iter position, sibling_iterator begin, sibling_iterator end)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#32b88523e2d5b6c78381b7da9455be5e">reparent</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> begin, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move nodes in range to be children of 'position'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="021a394ff7139df8573e2cb80e6beaa2"></a><!-- doxytag: member="tree::reparent" ref="021a394ff7139df8573e2cb80e6beaa2" args="(iter position, iter from)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#021a394ff7139df8573e2cb80e6beaa2">reparent</a> (iter <a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, iter from)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move all child nodes of 'from' to be children of 'position'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="e7f72ba46cd061f71720c731b4a9bf63"></a><!-- doxytag: member="tree::move_after" ref="e7f72ba46cd061f71720c731b4a9bf63" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#e7f72ba46cd061f71720c731b4a9bf63">move_after</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the next sibling of 'target'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="b45aa15042445a81b13873d3ef4a2e86"></a><!-- doxytag: member="tree::move_before" ref="b45aa15042445a81b13873d3ef4a2e86" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#b45aa15042445a81b13873d3ef4a2e86">move_before</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the previous sibling of 'target'. <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="a4f8b906b2758eec530e28387b819284"></a><!-- doxytag: member="tree::move_ontop" ref="a4f8b906b2758eec530e28387b819284" args="(iter target, iter source)" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">iter </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#a4f8b906b2758eec530e28387b819284">move_ontop</a> (iter target, iter source)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Move 'source' node (plus its children) to become the node at 'target' (erasing the node at 'target'). <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="1e3cd901f8f8d8a3da0e1d32e9282db1"></a><!-- doxytag: member="tree::merge" ref="1e3cd901f8f8d8a3da0e1d32e9282db1" args="(sibling_iterator, sibling_iterator, sibling_iterator, sibling_iterator, bool duplicate_leaves=false)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#1e3cd901f8f8d8a3da0e1d32e9282db1">merge</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a>, bool duplicate_leaves=false)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Merge with other tree, creating new branches and leaves only if they are not already present. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="498ec42a5eb44cba8bf9ef6e7fd5db9e"></a><!-- doxytag: member="tree::sort" ref="498ec42a5eb44cba8bf9ef6e7fd5db9e" args="(sibling_iterator from, sibling_iterator to, bool deep=false)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#498ec42a5eb44cba8bf9ef6e7fd5db9e">sort</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to, bool deep=false)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sort (std::sort only moves values of nodes, this one moves children as well). <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="f187f42c28a39304649ee41d3464f2ef"></a><!-- doxytag: member="tree::sort" ref="f187f42c28a39304649ee41d3464f2ef" args="(sibling_iterator from, sibling_iterator to, StrictWeakOrdering comp, bool deep=false)" -->
template<class StrictWeakOrdering> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><b>sort</b> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to, StrictWeakOrdering comp, bool deep=false)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="066b1a4018f9ed74effee262980aaaae"></a><!-- doxytag: member="tree::equal" ref="066b1a4018f9ed74effee262980aaaae" args="(const iter &one, const iter &two, const iter &three) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="classtree.html#066b1a4018f9ed74effee262980aaaae">equal</a> (const iter &one, const iter &two, const iter &three) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compare two ranges of nodes (compares nodes as well as tree structure). <br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="938fa67972463dfd5173b9bce0440c34"></a><!-- doxytag: member="tree::equal" ref="938fa67972463dfd5173b9bce0440c34" args="(const iter &one, const iter &two, const iter &three, BinaryPredicate) const" -->
template<typename iter, class BinaryPredicate> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>equal</b> (const iter &one, const iter &two, const iter &three, BinaryPredicate) const</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="5decf01c6fcd8516b8d1152fe574aabc"></a><!-- doxytag: member="tree::equal_subtree" ref="5decf01c6fcd8516b8d1152fe574aabc" args="(const iter &one, const iter &two) const" -->
template<typename iter> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>equal_subtree</b> (const iter &one, const iter &two) const</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2"><a class="anchor" name="81f2dc396b3c8af91555b393213478db"></a><!-- doxytag: member="tree::equal_subtree" ref="81f2dc396b3c8af91555b393213478db" args="(const iter &one, const iter &two, BinaryPredicate) const" -->
template<typename iter, class BinaryPredicate> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><b>equal_subtree</b> (const iter &one, const iter &two, BinaryPredicate) const</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a654f718861681deaa1bba07ad6d4ca0"></a><!-- doxytag: member="tree::subtree" ref="a654f718861681deaa1bba07ad6d4ca0" args="(sibling_iterator from, sibling_iterator to) const" -->
<a class="el" href="classtree.html">tree</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a654f718861681deaa1bba07ad6d4ca0">subtree</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Extract a new tree formed by the range of siblings plus all their children. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a677366fa92fc1497aeac283bd3de0f5"></a><!-- doxytag: member="tree::subtree" ref="a677366fa92fc1497aeac283bd3de0f5" args="(tree &, sibling_iterator from, sibling_iterator to) const" -->
void </td><td class="memItemRight" valign="bottom"><b>subtree</b> (<a class="el" href="classtree.html">tree</a> &, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> from, <a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> to) const</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e842f9b70235bc2412b3c43bca759448"></a><!-- doxytag: member="tree::swap" ref="e842f9b70235bc2412b3c43bca759448" args="(sibling_iterator it)" -->
void </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e842f9b70235bc2412b3c43bca759448">swap</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> it)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Exchange the node (plus subtree) with its sibling node (do nothing if no sibling present). <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="efe4460d7a0f4c0e309649e3ebfe3c3d"></a><!-- doxytag: member="tree::size" ref="efe4460d7a0f4c0e309649e3ebfe3c3d" args="() const" -->
int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#efe4460d7a0f4c0e309649e3ebfe3c3d">size</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the total number of nodes. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e600fb282f7534e75811d14a1d1d0aba"></a><!-- doxytag: member="tree::empty" ref="e600fb282f7534e75811d14a1d1d0aba" args="() const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e600fb282f7534e75811d14a1d1d0aba">empty</a> () const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Check if tree is empty. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="85338176eaaf8421fa0ef06d1d5e8e40"></a><!-- doxytag: member="tree::depth" ref="85338176eaaf8421fa0ef06d1d5e8e40" args="(const iterator_base &) const" -->
int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#85338176eaaf8421fa0ef06d1d5e8e40">depth</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute the depth to the root. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="bf7233c3c57bc8b844e4bb6b420727c4"></a><!-- doxytag: member="tree::number_of_children" ref="bf7233c3c57bc8b844e4bb6b420727c4" args="(const iterator_base &) const" -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#bf7233c3c57bc8b844e4bb6b420727c4">number_of_children</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the number of children of node at position. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="f3613943778560ad57787486e071af12"></a><!-- doxytag: member="tree::number_of_siblings" ref="f3613943778560ad57787486e071af12" args="(const iterator_base &) const" -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#f3613943778560ad57787486e071af12">number_of_siblings</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Count the number of 'next' siblings of node at iterator. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a860f37aa4ec8955ef18a9b1936f0665"></a><!-- doxytag: member="tree::is_in_subtree" ref="a860f37aa4ec8955ef18a9b1936f0665" args="(const iterator_base &position, const iterator_base &begin, const iterator_base &end) const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a860f37aa4ec8955ef18a9b1936f0665">is_in_subtree</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &<a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &begin, const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &end) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine whether node at position is in the subtrees with root in the range. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="9155b3955497913a965acf612caf02fd"></a><!-- doxytag: member="tree::is_valid" ref="9155b3955497913a965acf612caf02fd" args="(const iterator_base &) const" -->
bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#9155b3955497913a965acf612caf02fd">is_valid</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &) const</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine whether the iterator is an 'end' iterator and thus not actually pointing to a node. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="de5ec1ba55f94165062e50d01ec35d86"></a><!-- doxytag: member="tree::index" ref="de5ec1ba55f94165062e50d01ec35d86" args="(sibling_iterator it) const " -->
unsigned int </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#de5ec1ba55f94165062e50d01ec35d86">index</a> (<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> it) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Determine the index of a node in the range of siblings to which it belongs. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a614f997d8c45de7a5ea25733ac036be"></a><!-- doxytag: member="tree::child" ref="a614f997d8c45de7a5ea25733ac036be" args="(const iterator_base &position, unsigned int) const " -->
<a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#a614f997d8c45de7a5ea25733ac036be">child</a> (const <a class="el" href="classtree_1_1iterator__base.html">iterator_base</a> &<a class="el" href="fx-0_89_81_2lib_2ofx__sgml_8cpp.html#4da8008b6f110050513003edf67a2495">position</a>, unsigned int) const </td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inverse of 'index': return the n-th child of the node at position. <br></td></tr>
<tr><td colspan="2"><br><h2>Data Fields</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="10991cbf1497e125c0ef04d6e292e32b"></a><!-- doxytag: member="tree::head" ref="10991cbf1497e125c0ef04d6e292e32b" args="" -->
<a class="el" href="classtree__node__.html">tree_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="e1dbb80115ba483e37d081a2256c239b"></a><!-- doxytag: member="tree::feet" ref="e1dbb80115ba483e37d081a2256c239b" args="" -->
<a class="el" href="classtree__node__.html">tree_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#e1dbb80115ba483e37d081a2256c239b">feet</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="10991cbf1497e125c0ef04d6e292e32b"></a><!-- doxytag: member="tree::head" ref="10991cbf1497e125c0ef04d6e292e32b" args="" -->
<a class="el" href="classtree__node__.html">tree_node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#10991cbf1497e125c0ef04d6e292e32b">head</a></td></tr>
<tr><td colspan="2"><br><h2>Protected Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="672d078d87ae97c58b732a940d7b8ca8"></a><!-- doxytag: member="tree::tree_node" ref="672d078d87ae97c58b732a940d7b8ca8" args="" -->
typedef <a class="el" href="classtree__node__.html">tree_node_</a>< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">tree_node</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="672d078d87ae97c58b732a940d7b8ca8"></a><!-- doxytag: member="tree::tree_node" ref="672d078d87ae97c58b732a940d7b8ca8" args="" -->
typedef <a class="el" href="classtree__node__.html">tree_node_</a>< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree.html#672d078d87ae97c58b732a940d7b8ca8">tree_node</a></td></tr>
<tr><td colspan="2"><br><h2>Data Structures</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><b>compare_nodes</b></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Comparator class for two nodes of a tree (used for sorting and searching). <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1fixed__depth__iterator.html">fixed_depth_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterator which traverses only the nodes at a given depth from the root. <a href="classtree_1_1fixed__depth__iterator.html#_details">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1iterator__base.html">iterator_base</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Base class for iterators, only pointers stored, no traversal logic. <a href="classtree_1_1iterator__base.html#_details">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1iterator__base__less.html">iterator_base_less</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Comparator class for iterators (compares the actual node content, not pointer values). <a href="classtree_1_1iterator__base__less.html#_details">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1post__order__iterator.html">post_order_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Depth-first iterator, first accessing the children, then the node itself. <a href="classtree_1_1post__order__iterator.html#_details">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1pre__order__iterator.html">pre_order_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Depth-first iterator, first accessing the node, then its children. <a href="classtree_1_1pre__order__iterator.html#_details">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="classtree_1_1sibling__iterator.html">sibling_iterator</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Iterator which traverses only the nodes which are siblings of each other. <a href="classtree_1_1sibling__iterator.html#_details">More...</a><br></td></tr>
</table>
<hr>The documentation for this class was generated from the following files:<ul>
<li><a class="el" href="tree_8hh-source.html">tree.hh</a><li><a class="el" href="fx-0_89_81_2lib_2tree_8hh-source.html">fx-0.9.1/lib/tree.hh</a></ul>
<hr size="1"><address style="align: right;"><small>Generated on Mon Feb 9 21:22:00 2009 for LibOFX by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.0 </small></address>
</body>
</html>
