mslockbo/OpenShaderDesigner
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
OpenShaderDesigner/External/open-cpp-utils/Documentation/html/directed__tree_8h_source.html
Maddie Slockbower 366774622b Implemented Shader Function 
- Updated License to GPL v3.0
- Added New Math Nodes
- Prototype Rendering Code for Debugging Functions
2024-11-03 12:57:12 -05:00

688 lines
93 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>open-cpp-utils: directed_tree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">open-cpp-utils<span id="projectnumber">&#160;0.0.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search',false);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="doc-content">
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">directed_tree.h</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// =====================================================================================================================</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// open-cpp-utils, an open-source cpp library with data structures that extend the STL.</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// Copyright (C) 2024 Medusa Slockbower</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">//</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">// This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">// the Free Software Foundation, either version 3 of the License, or</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// (at your option) any later version.</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">//</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment">// GNU General Public License for more details.</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">//</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">// You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// along with this program. If not, see &lt;https://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// =====================================================================================================================</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#ifndef OPEN_CPP_UTILS_DIRECTED_TREE_H</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#define OPEN_CPP_UTILS_DIRECTED_TREE_H</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include &lt;deque&gt;</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">namespace </span>open_cpp_utils</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>{</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> Alloc = std::allocator&lt;T&gt;&gt;</div>
<div class="foldopen" id="foldopen00038" data-start="{" data-end="};">
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html"> 38</a></span><span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>{</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// Forward Definitions =================================================================================================</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html">breadth_first</a>;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html">pre_order</a>;</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html">in_order</a>;</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html">post_order</a>;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1unordered.html">unordered</a>;</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">struct </span>Node_;</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// Typedefs ============================================================================================================</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">using </span>data_type = T;</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keyword">using </span>node = size_t;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keyword">using </span>node_queue = std::deque&lt;node&gt;;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">using </span>s_alloc = Alloc;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">using </span>h_alloc = <span class="keyword">typename</span> std::allocator_traits&lt;s_alloc&gt;::template rebind_alloc&lt;Node_&gt;; <span class="comment">// Gross</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">using </span>hierarchy = Node_*;</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">using </span>storage = data_type*;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment">// Constants ===========================================================================================================</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">static</span> <span class="keyword">constexpr</span> std::integral_constant&lt;node, 0&gt; root{};</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// Data Structures =====================================================================================================</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keyword">struct </span>Node_</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keyword">enum</span> flags</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> valid = 0x0001</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> };</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> node parent, child, prev_sibling, next_sibling;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> uint32_t flags, depth;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> Node_() : parent(0), child(0), prev_sibling(0), next_sibling(0), flags(0), depth(0) { }</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> };</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// Functions ===========================================================================================================</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> </div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="comment">// Helpers -------------------------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordtype">void</span> grow_()</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> {</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> hierarchy g_old = graph_;</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> storage d_old = data_;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordtype">size_t</span> c_old = capacity_;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">if</span>(capacity_ == 0) capacity_ = 10;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">else</span> capacity_ *= 2;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> graph_ = g_alloc_.allocate(capacity_);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> data_ = d_alloc_.allocate(capacity_);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span>(size_ &gt; 0)</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> std::memcpy(graph_, g_old, size_ * <span class="keyword">sizeof</span>(Node_));</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> std::memcpy(data_, d_old, size_ * <span class="keyword">sizeof</span>(data_type));</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> </div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordflow">for</span>(node i = size_; i &lt; capacity_; ++i)</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> {</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> graph_[i] = Node_();</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> std::construct_at(data_ + i);</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> }</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> }</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> {</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keywordflow">for</span>(node i = 0; i &lt; capacity_; ++i)</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> {</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> graph_[i] = Node_();</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> std::construct_at(data_ + i);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> graph_[0].flags = Node_::valid;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> </div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> g_alloc_.deallocate(g_old, c_old);</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> d_alloc_.deallocate(d_old, c_old);</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> node push_back_(<span class="keyword">const</span> data_type&amp; data)</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> {</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span>(size_ &gt;= capacity_) grow_();</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> std::construct_at(data_ + size_, data);</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">return</span> size_++;</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> node push_back_(data_type&amp;&amp; data)</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> {</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">if</span>(size_ &gt;= capacity_) grow_();</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> std::construct_at(data_ + size_, std::forward&lt;T&gt;(data));</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">return</span> size_++;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> }</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> </div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span><span class="comment">// Constructors &amp; Destructor -------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#ae178a606c211c614ba7c6959de10ac82"> 156</a></span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#ae178a606c211c614ba7c6959de10ac82">directed_tree</a>()</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> : size_(0), capacity_(0)</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> , graph_(nullptr), data_(nullptr)</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> { push_back_(T()); }</div>
</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#ae178a606c211c614ba7c6959de10ac82">directed_tree</a>(data_type&amp;&amp; data)</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> : size_(0), capacity_(0)</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> , graph_(nullptr), data_(nullptr)</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> { push_back_(std::forward&lt;T&gt;(data)); }</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> </div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#ae178a606c211c614ba7c6959de10ac82">directed_tree</a>(<span class="keyword">const</span> data_type&amp; data)</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> : size_(0), capacity_(0)</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> , graph_(nullptr), data_(nullptr)</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> { push_back_(data); }</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> </div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> ~directed_tree() = <span class="keywordflow">default</span>;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="comment">// Tree Navigation -----------------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#aac38b40db651e5687e663bdd303e8886"> 181</a></span> [[nodiscard]] <span class="keywordtype">bool</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aac38b40db651e5687e663bdd303e8886">valid</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_ ? graph_[id].flags &amp; Node_::valid : <span class="keyword">false</span>; }</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736"> 188</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_ ? graph_[id].parent : 0; }</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> </div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a1ee24c2a22978b8c3f990292baa88e6a"> 195</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a1ee24c2a22978b8c3f990292baa88e6a">first_child</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_ ? graph_[id].child : 0; }</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a6339dd5e1b6f6c8d55e939a7f0feb355"> 202</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a6339dd5e1b6f6c8d55e939a7f0feb355">last_child</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span><span class="keyword"> </span>{</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> node c = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a1ee24c2a22978b8c3f990292baa88e6a">first_child</a>(<span class="keywordtype">id</span>);</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">while</span>(c != 0) { <span class="keywordflow">if</span>(graph_[c].<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a2dbfd46238b9c9941902e3e8a326db69">next_sibling</a> == 0) <span class="keywordflow">break</span>; c = graph_[c].next_sibling; }</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> </div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keywordflow">return</span> c;</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> }</div>
</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> </div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a06b775a2fa9d970b029bdc3a22d561bf"> 216</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a06b775a2fa9d970b029bdc3a22d561bf">prev_sibling</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_[id].prev_sibling; }</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a2dbfd46238b9c9941902e3e8a326db69"> 223</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a2dbfd46238b9c9941902e3e8a326db69">next_sibling</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_[id].next_sibling; }</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
<div class="foldopen" id="foldopen00230" data-start="{" data-end="}">
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a38cbac2c1dcd82e0f1984a2ab4ccaeb4"> 230</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a38cbac2c1dcd82e0f1984a2ab4ccaeb4">left_most</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const</span></div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span><span class="keyword"> </span>{</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> node current = id;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">while</span>(<span class="keywordtype">id</span> = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a1ee24c2a22978b8c3f990292baa88e6a">first_child</a>(current)) current = id;</div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keywordflow">return</span> current;</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a14bebe19888219ebef3c25076ac7e739"> 242</a></span> [[nodiscard]] uint32_t <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a14bebe19888219ebef3c25076ac7e739">depth</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_[id].depth; }</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span><span class="comment">// Tree Modification ---------------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
<div class="foldopen" id="foldopen00251" data-start="{" data-end="}">
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a9f469505ca6dd336e16bf1fa756491a1"> 251</a></span> node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a9f469505ca6dd336e16bf1fa756491a1">next_id</a>()<span class="keyword"> const</span></div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span><span class="keyword"> </span>{</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">if</span>(freed_.empty()) <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>node<span class="keyword">&gt;</span>(size_);</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keywordflow">return</span> freed_.front();</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> }</div>
</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
<div class="foldopen" id="foldopen00264" data-start="{" data-end="}">
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#af9d76505db29e4e7e1bbad14bd5e4998"> 264</a></span> node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#af9d76505db29e4e7e1bbad14bd5e4998">insert</a>(<span class="keyword">const</span> data_type&amp; data, node p_id, node sib = 0)</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> {</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// If there are no freed nodes, create a new node and mark it as freed</span></div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordflow">if</span>(freed_.empty())</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> {</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> freed_.push_back(push_back_(std::forward&lt;T&gt;(data)));</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> }</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> {</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> std::construct_at(data_ + freed_.front(), std::forward&lt;T&gt;(data));</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> }</div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> </div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="comment">// Pop a freed node from the stack</span></div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> node <span class="keywordtype">id</span> = freed_.front(); freed_.pop_front();</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keywordtype">bool</span> back = sib == 0;</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> node s_id = back ? <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a6339dd5e1b6f6c8d55e939a7f0feb355">last_child</a>(p_id) : sib;</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> Node_&amp; node = graph_[id];</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> Node_&amp; <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a> = graph_[p_id];</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> </div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> Node_&amp; sibling = graph_[s_id];</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> <span class="keywordflow">if</span>(<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child == root || (s_id == <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child &amp;&amp; !back)) <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child = id;</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> </div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> node.next_sibling = node.prev_sibling = 0;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> node.parent = p_id;</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> node.depth = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.depth + 1;</div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> node.flags = Node_::valid;</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> node.child = 0;</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> </div>
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">if</span>(s_id == 0) <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> </div>
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> <span class="keywordflow">if</span>(back)</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> {</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> node.next_sibling = sibling.next_sibling;</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> node.prev_sibling = s_id;</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> </div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> sibling.next_sibling = id;</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> }</div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> {</div>
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> node.next_sibling = s_id;</div>
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> node.prev_sibling = sibling.prev_sibling;</div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> </div>
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> sibling.prev_sibling = id;</div>
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> }</div>
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> }</div>
</div>
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> </div>
<div class="foldopen" id="foldopen00319" data-start="{" data-end="}">
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#acc834118457f713918dc864e3c5dc9a6"> 319</a></span> node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#acc834118457f713918dc864e3c5dc9a6">insert</a>(data_type&amp;&amp; data, node p_id, node sib = root)</div>
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> {</div>
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> <span class="comment">// If there are no freed nodes, create a new node and mark it as freed</span></div>
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keywordflow">if</span>(freed_.empty())</div>
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> {</div>
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> freed_.push_back(push_back_(std::forward&lt;T&gt;(data)));</div>
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> }</div>
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> {</div>
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> std::construct_at(data_ + freed_.front(), std::forward&lt;T&gt;(data));</div>
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> }</div>
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> </div>
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> <span class="comment">// Pop a freed node from the stack</span></div>
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> node <span class="keywordtype">id</span> = freed_.front(); freed_.pop_front();</div>
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> <span class="keywordtype">bool</span> back = sib == root;</div>
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> node s_id = back ? <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a6339dd5e1b6f6c8d55e939a7f0feb355">last_child</a>(p_id) : sib;</div>
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> Node_&amp; node = graph_[id];</div>
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> Node_&amp; <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a> = graph_[p_id];</div>
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> </div>
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> Node_&amp; sibling = graph_[s_id];</div>
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="keywordflow">if</span>(<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child == root || (s_id == <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child &amp;&amp; !back)) <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.child = id;</div>
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> </div>
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> node.next_sibling = node.prev_sibling = 0;</div>
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> node.parent = p_id;</div>
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> node.depth = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">parent</a>.depth + 1;</div>
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> node.flags = Node_::valid;</div>
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> node.child = 0;</div>
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> </div>
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <span class="keywordflow">if</span>(s_id == 0) <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> </div>
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">if</span>(back)</div>
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> {</div>
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> node.next_sibling = sibling.next_sibling;</div>
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> node.prev_sibling = s_id;</div>
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> </div>
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> sibling.next_sibling = id;</div>
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> }</div>
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> {</div>
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> node.next_sibling = s_id;</div>
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> node.prev_sibling = sibling.prev_sibling;</div>
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> </div>
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> sibling.prev_sibling = id;</div>
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> }</div>
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> </div>
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> }</div>
</div>
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> </div>
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> <span class="keywordtype">void</span> swap(node a, node b)</div>
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> {</div>
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> Node_&amp; A = graph_[a];</div>
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> Node_&amp; B = graph_[b];</div>
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> </div>
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> std::swap(A, B);</div>
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> </div>
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> <span class="keywordflow">if</span>(graph_[B.parent].child == a) graph_[B.parent].child = b;</div>
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">if</span>(graph_[A.parent].child == b) graph_[A.parent].child = a;</div>
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> }</div>
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> </div>
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> <span class="keywordtype">void</span> clear()</div>
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> {</div>
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; size_; ++i)</div>
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> {</div>
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> <span class="keywordflow">if</span>(<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aac38b40db651e5687e663bdd303e8886">valid</a>(i) == <span class="keyword">false</span>) <span class="keywordflow">continue</span>;</div>
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> graph_[i].flags = 0;</div>
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span> std::destroy_at(data_ + i);</div>
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> freed_.push_back(i);</div>
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> }</div>
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> </div>
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span> g_alloc_.deallocate(graph_, capacity_);</div>
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> d_alloc_.deallocate(data_, capacity_);</div>
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> capacity_ = 0; size_ = 0;</div>
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> }</div>
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> </div>
<div class="foldopen" id="foldopen00398" data-start="{" data-end="}">
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#aafd1b11a9b14342a7d3f46c8c43451f2"> 398</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aafd1b11a9b14342a7d3f46c8c43451f2">erase</a>(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> {</div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> <span class="keywordflow">if</span>(<span class="keywordtype">id</span> == root) <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> </div>
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <span class="comment">// Mark node as invalid and push it to the freed list</span></div>
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> Node_&amp; erased = graph_[id];</div>
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> erased.flags = 0;</div>
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> freed_.push_back(<span class="keywordtype">id</span>);</div>
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> std::destroy_at(data_ + <span class="keywordtype">id</span>);</div>
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> </div>
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// Update the parent&#39;s child</span></div>
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> graph_[erased.parent].child = erased.next_sibling;</div>
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> </div>
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> <span class="comment">// Update siblings</span></div>
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keywordflow">if</span>(erased.next_sibling) graph_[erased.next_sibling].prev_sibling = erased.prev_sibling;</div>
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> <span class="keywordflow">if</span>(erased.prev_sibling) graph_[erased.prev_sibling].next_sibling = erased.next_sibling;</div>
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> </div>
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> <span class="comment">// Erase children - essentially breadth first propagation down the tree</span></div>
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> node_queue stack{ erased.child };</div>
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordflow">while</span>(stack.empty() == <span class="keyword">false</span>)</div>
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> {</div>
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> node next = stack.front(); stack.pop_front();</div>
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> Node_&amp; child = graph_[next];</div>
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> child.flags = 0;</div>
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span> freed_.push_back(next);</div>
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> std::destroy_at(data_ + next);</div>
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span> </div>
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span> <span class="keywordflow">if</span>(child.next_sibling) stack.push_front(child.next_sibling);</div>
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span> <span class="keywordflow">if</span>(child.child) stack.push_front(child.child);</div>
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> }</div>
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> }</div>
</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> </div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> </div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span><span class="comment">// Tree Access ---------------------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> </div>
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a75a113b0542210c67d5ee1039b37dcca"> 438</a></span> data_type&amp; <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a75a113b0542210c67d5ee1039b37dcca">operator[]</a>(node <span class="keywordtype">id</span>) { <span class="keywordflow">return</span> data_[id]; }</div>
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> </div>
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a5ea177cf14e05db354550b59df307f67"> 445</a></span> [[nodiscard]] <span class="keyword">const</span> data_type&amp; <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a5ea177cf14e05db354550b59df307f67">operator[]</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> data_[id]; }</div>
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span> </div>
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span><span class="comment">// Visitor Pattern -----------------------------------------------------------------------------------------------------</span></div>
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> </div>
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <span class="keyword">template</span>&lt;<span class="keyword">typename</span> O = pre_order, <span class="keyword">typename</span> V&gt;</div>
<div class="foldopen" id="foldopen00457" data-start="{" data-end="}">
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#ad6ac014058e9ef045c979f76a96c0b37"> 457</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#ad6ac014058e9ef045c979f76a96c0b37">traverse</a>(V&amp; visitor)</div>
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> {</div>
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser&lt;V, O&gt;</a> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser</a>(*<span class="keyword">this</span>, visitor);</div>
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser</a>();</div>
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> }</div>
</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> </div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> </div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span><span class="comment">// Variables =======================================================================================================</span></div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> </div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> h_alloc g_alloc_;</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> s_alloc d_alloc_;</div>
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> <span class="keywordtype">size_t</span> size_, capacity_;</div>
<div class="line"><a id="l00470" name="l00470"></a><span class="lineno"> 470</span> hierarchy graph_;</div>
<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"> 471</span> storage data_;</div>
<div class="line"><a id="l00472" name="l00472"></a><span class="lineno"> 472</span> node_queue freed_;</div>
<div class="line"><a id="l00473" name="l00473"></a><span class="lineno"> 473</span> </div>
<div class="line"><a id="l00474" name="l00474"></a><span class="lineno"> 474</span> </div>
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"> 475</span><span class="comment">// Navigation ======================================================================================================</span></div>
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> </div>
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> </div>
<div class="foldopen" id="foldopen00479" data-start="{" data-end="};">
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1unordered.html"> 479</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1unordered.html">unordered</a></div>
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> {</div>
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1unordered.html">unordered</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph) : graph_(graph), current_(root) { }</div>
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> </div>
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> node operator()(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> {</div>
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> <span class="keywordflow">while</span>(!graph_.valid(current_) || current_ == root)</div>
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> {</div>
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> ++current_;</div>
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> }</div>
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> </div>
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span> <span class="keywordtype">id</span> = current_;</div>
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> current_ ++;</div>
<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"> 493</span> </div>
<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"> 494</span> <span class="keywordflow">return</span> <span class="keywordtype">id</span> == graph_.graph_.size() ? 0 : id;</div>
<div class="line"><a id="l00495" name="l00495"></a><span class="lineno"> 495</span> }</div>
<div class="line"><a id="l00496" name="l00496"></a><span class="lineno"> 496</span> </div>
<div class="line"><a id="l00497" name="l00497"></a><span class="lineno"> 497</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"> 498</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> node current_;</div>
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> };</div>
</div>
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> </div>
<div class="foldopen" id="foldopen00505" data-start="{" data-end="};">
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html"> 505</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html">breadth_first</a></div>
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> {</div>
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html">breadth_first</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph) : graph_(graph), visit_queue_(0) { }</div>
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> </div>
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> node operator()(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> {</div>
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span> <span class="keywordtype">id</span> = visit_queue_.back(); visit_queue_.pop_back();</div>
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> Node_&amp; current = graph_.graph_[id];</div>
<div class="line"><a id="l00514" name="l00514"></a><span class="lineno"> 514</span> </div>
<div class="line"><a id="l00515" name="l00515"></a><span class="lineno"> 515</span> <span class="keywordflow">if</span>(current.next_sibling) visit_queue_.push_back(current.next_sibling);</div>
<div class="line"><a id="l00516" name="l00516"></a><span class="lineno"> 516</span> <span class="keywordflow">if</span>(current.child) visit_queue_.push_front(current.child);</div>
<div class="line"><a id="l00517" name="l00517"></a><span class="lineno"> 517</span> </div>
<div class="line"><a id="l00518" name="l00518"></a><span class="lineno"> 518</span> <span class="keywordflow">if</span>(visit_queue_.empty()) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"> 519</span> <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> }</div>
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> </div>
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> node_queue visit_queue_;</div>
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> };</div>
</div>
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> </div>
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> </div>
<div class="foldopen" id="foldopen00531" data-start="{" data-end="};">
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html"> 531</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html">pre_order</a></div>
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> {</div>
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html">pre_order</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph) : graph_(graph) { }</div>
<div class="line"><a id="l00535" name="l00535"></a><span class="lineno"> 535</span> </div>
<div class="line"><a id="l00536" name="l00536"></a><span class="lineno"> 536</span> node operator()(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"> 537</span> {</div>
<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"> 538</span> Node_&amp; current = graph_.graph_[id];</div>
<div class="line"><a id="l00539" name="l00539"></a><span class="lineno"> 539</span> </div>
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"> 540</span> <span class="keywordflow">if</span>(current.next_sibling) visit_queue_.push_front(current.next_sibling);</div>
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> <span class="keywordflow">if</span>(current.child) visit_queue_.push_front(current.child);</div>
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> </div>
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <span class="keywordflow">if</span>(visit_queue_.empty()) <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> node next = visit_queue_.front(); visit_queue_.pop_front();</div>
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> <span class="keywordflow">return</span> next;</div>
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> }</div>
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> </div>
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> node_queue visit_queue_;</div>
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> };</div>
</div>
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> </div>
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> </div>
<div class="foldopen" id="foldopen00557" data-start="{" data-end="};">
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html"> 557</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html">in_order</a></div>
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> {</div>
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html">in_order</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph) : graph_(graph) { }</div>
<div class="line"><a id="l00561" name="l00561"></a><span class="lineno"> 561</span> </div>
<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"> 562</span> node operator()(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00563" name="l00563"></a><span class="lineno"> 563</span> {</div>
<div class="line"><a id="l00564" name="l00564"></a><span class="lineno"> 564</span> <span class="keywordflow">if</span>(<span class="keywordtype">id</span> == 0) visit_queue_.push_back(graph_.left_most(<span class="keywordtype">id</span>));</div>
<div class="line"><a id="l00565" name="l00565"></a><span class="lineno"> 565</span> </div>
<div class="line"><a id="l00566" name="l00566"></a><span class="lineno"> 566</span> <span class="keywordtype">id</span> = visit_queue_.front(); visit_queue_.pop_front();</div>
<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"> 567</span> Node_&amp; current = graph_.graph_[id];</div>
<div class="line"><a id="l00568" name="l00568"></a><span class="lineno"> 568</span> </div>
<div class="line"><a id="l00569" name="l00569"></a><span class="lineno"> 569</span> <span class="keywordflow">if</span>(current.Sibling)</div>
<div class="line"><a id="l00570" name="l00570"></a><span class="lineno"> 570</span> {</div>
<div class="line"><a id="l00571" name="l00571"></a><span class="lineno"> 571</span> <span class="keywordflow">if</span>(graph_.next_sibling(current.Sibling)) visit_queue_.push_back(current.parent);</div>
<div class="line"><a id="l00572" name="l00572"></a><span class="lineno"> 572</span> visit_queue_.push_back(graph_.left_most(current.Sibling));</div>
<div class="line"><a id="l00573" name="l00573"></a><span class="lineno"> 573</span> }</div>
<div class="line"><a id="l00574" name="l00574"></a><span class="lineno"> 574</span> </div>
<div class="line"><a id="l00575" name="l00575"></a><span class="lineno"> 575</span> <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00576" name="l00576"></a><span class="lineno"> 576</span> }</div>
<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"> 577</span> </div>
<div class="line"><a id="l00578" name="l00578"></a><span class="lineno"> 578</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00579" name="l00579"></a><span class="lineno"> 579</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00580" name="l00580"></a><span class="lineno"> 580</span> node_queue visit_queue_;</div>
<div class="line"><a id="l00581" name="l00581"></a><span class="lineno"> 581</span> };</div>
</div>
<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"> 582</span> </div>
<div class="line"><a id="l00583" name="l00583"></a><span class="lineno"> 583</span> </div>
<div class="foldopen" id="foldopen00587" data-start="{" data-end="};">
<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html"> 587</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html">post_order</a></div>
<div class="line"><a id="l00588" name="l00588"></a><span class="lineno"> 588</span> {</div>
<div class="line"><a id="l00589" name="l00589"></a><span class="lineno"> 589</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00590" name="l00590"></a><span class="lineno"> 590</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html">post_order</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph) : graph_(graph) { }</div>
<div class="line"><a id="l00591" name="l00591"></a><span class="lineno"> 591</span> </div>
<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"> 592</span> node operator()(node <span class="keywordtype">id</span>)</div>
<div class="line"><a id="l00593" name="l00593"></a><span class="lineno"> 593</span> {</div>
<div class="line"><a id="l00594" name="l00594"></a><span class="lineno"> 594</span> <span class="keywordflow">if</span>(visit_queue_.empty()) visit_queue_.push_back(graph_.left_most(<span class="keywordtype">id</span>));</div>
<div class="line"><a id="l00595" name="l00595"></a><span class="lineno"> 595</span> </div>
<div class="line"><a id="l00596" name="l00596"></a><span class="lineno"> 596</span> <span class="keywordtype">id</span> = visit_queue_.front(); visit_queue_.pop_front();</div>
<div class="line"><a id="l00597" name="l00597"></a><span class="lineno"> 597</span> <span class="keywordflow">if</span>(<span class="keywordtype">id</span> == 0) <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00598" name="l00598"></a><span class="lineno"> 598</span> Node_&amp; current = graph_.graph_[id];</div>
<div class="line"><a id="l00599" name="l00599"></a><span class="lineno"> 599</span> </div>
<div class="line"><a id="l00600" name="l00600"></a><span class="lineno"> 600</span> visit_queue_.push_back(current.Sibling ? graph_.left_most(current.Sibling) : graph_.parent(<span class="keywordtype">id</span>));</div>
<div class="line"><a id="l00601" name="l00601"></a><span class="lineno"> 601</span> </div>
<div class="line"><a id="l00602" name="l00602"></a><span class="lineno"> 602</span> <span class="keywordflow">return</span> id;</div>
<div class="line"><a id="l00603" name="l00603"></a><span class="lineno"> 603</span> }</div>
<div class="line"><a id="l00604" name="l00604"></a><span class="lineno"> 604</span> </div>
<div class="line"><a id="l00605" name="l00605"></a><span class="lineno"> 605</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"> 606</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00607" name="l00607"></a><span class="lineno"> 607</span> node_queue visit_queue_;</div>
<div class="line"><a id="l00608" name="l00608"></a><span class="lineno"> 608</span> };</div>
</div>
<div class="line"><a id="l00609" name="l00609"></a><span class="lineno"> 609</span> </div>
<div class="line"><a id="l00610" name="l00610"></a><span class="lineno"> 610</span> </div>
<div class="line"><a id="l00614" name="l00614"></a><span class="lineno"> 614</span> <span class="keyword">template</span>&lt;<span class="keyword">typename</span> V, <span class="keyword">typename</span> O&gt;</div>
<div class="foldopen" id="foldopen00615" data-start="{" data-end="};">
<div class="line"><a id="l00615" name="l00615"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html"> 615</a></span> <span class="keyword">class </span><a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser</a></div>
<div class="line"><a id="l00616" name="l00616"></a><span class="lineno"> 616</span> {</div>
<div class="line"><a id="l00617" name="l00617"></a><span class="lineno"> 617</span> <span class="keyword">public</span>:</div>
<div class="line"><a id="l00618" name="l00618"></a><span class="lineno"> 618</span> <span class="keyword">using </span>visitor_type = V;</div>
<div class="line"><a id="l00619" name="l00619"></a><span class="lineno"> 619</span> <span class="keyword">using </span>order_type = O;</div>
<div class="line"><a id="l00620" name="l00620"></a><span class="lineno"> 620</span> </div>
<div class="line"><a id="l00621" name="l00621"></a><span class="lineno"> 621</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser</a>(<a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph, visitor_type&amp; visitor) : graph_(graph), visitor_(visitor), order_(graph) { }</div>
<div class="line"><a id="l00622" name="l00622"></a><span class="lineno"> 622</span> </div>
<div class="line"><a id="l00623" name="l00623"></a><span class="lineno"> 623</span> <span class="keywordtype">void</span> operator()()</div>
<div class="line"><a id="l00624" name="l00624"></a><span class="lineno"> 624</span> {</div>
<div class="line"><a id="l00625" name="l00625"></a><span class="lineno"> 625</span> node <span class="keywordtype">id</span> = 0;</div>
<div class="line"><a id="l00626" name="l00626"></a><span class="lineno"> 626</span> <span class="keywordflow">while</span>(<span class="keywordtype">id</span> = order_(<span class="keywordtype">id</span>))</div>
<div class="line"><a id="l00627" name="l00627"></a><span class="lineno"> 627</span> {</div>
<div class="line"><a id="l00628" name="l00628"></a><span class="lineno"> 628</span> <span class="keywordflow">if</span>(visitor_(graph_[<span class="keywordtype">id</span>], <span class="keywordtype">id</span>)) <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00629" name="l00629"></a><span class="lineno"> 629</span> }</div>
<div class="line"><a id="l00630" name="l00630"></a><span class="lineno"> 630</span> }</div>
<div class="line"><a id="l00631" name="l00631"></a><span class="lineno"> 631</span> </div>
<div class="line"><a id="l00632" name="l00632"></a><span class="lineno"> 632</span> <span class="keyword">private</span>:</div>
<div class="line"><a id="l00633" name="l00633"></a><span class="lineno"> 633</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>&amp; graph_;</div>
<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"> 634</span> visitor_type&amp; visitor_;</div>
<div class="line"><a id="l00635" name="l00635"></a><span class="lineno"> 635</span> order_type order_;</div>
<div class="line"><a id="l00636" name="l00636"></a><span class="lineno"> 636</span> };</div>
</div>
<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"> 637</span>};</div>
</div>
<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"> 638</span>}</div>
<div class="line"><a id="l00639" name="l00639"></a><span class="lineno"> 639</span> </div>
<div class="line"><a id="l00640" name="l00640"></a><span class="lineno"> 640</span><span class="preprocessor">#endif </span><span class="comment">// OPEN_CPP_UTILS_DIRECTED_TREE_H</span></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1breadth__first_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html">open_cpp_utils::directed_tree::breadth_first</a></div><div class="ttdoc">Breadth first traversal.</div><div class="ttdef"><b>Definition</b> directed_tree.h:506</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1in__order_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html">open_cpp_utils::directed_tree::in_order</a></div><div class="ttdoc">In-order traversal.</div><div class="ttdef"><b>Definition</b> directed_tree.h:558</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1post__order_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html">open_cpp_utils::directed_tree::post_order</a></div><div class="ttdoc">Post-order traversal.</div><div class="ttdef"><b>Definition</b> directed_tree.h:588</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1pre__order_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html">open_cpp_utils::directed_tree::pre_order</a></div><div class="ttdoc">Pre-order traversal.</div><div class="ttdef"><b>Definition</b> directed_tree.h:532</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1traverser_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">open_cpp_utils::directed_tree::traverser</a></div><div class="ttdoc">Visitor pattern for traversing the tree.</div><div class="ttdef"><b>Definition</b> directed_tree.h:616</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_1_1unordered_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree_1_1unordered.html">open_cpp_utils::directed_tree::unordered</a></div><div class="ttdef"><b>Definition</b> directed_tree.h:480</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html">open_cpp_utils::directed_tree</a></div><div class="ttdoc">Class for creating a directed tree.</div><div class="ttdef"><b>Definition</b> directed_tree.h:39</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a06b775a2fa9d970b029bdc3a22d561bf"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a06b775a2fa9d970b029bdc3a22d561bf">open_cpp_utils::directed_tree::prev_sibling</a></div><div class="ttdeci">node prev_sibling(node id) const</div><div class="ttdoc">Get the previous sibling of a node. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:216</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a10f828e98ef3d5ce490a603e4045a736"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a10f828e98ef3d5ce490a603e4045a736">open_cpp_utils::directed_tree::parent</a></div><div class="ttdeci">node parent(node id) const</div><div class="ttdoc">Get the parent of a node. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:188</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a14bebe19888219ebef3c25076ac7e739"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a14bebe19888219ebef3c25076ac7e739">open_cpp_utils::directed_tree::depth</a></div><div class="ttdeci">uint32_t depth(node id) const</div><div class="ttdoc">Get the depth of a node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:242</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a1ee24c2a22978b8c3f990292baa88e6a"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a1ee24c2a22978b8c3f990292baa88e6a">open_cpp_utils::directed_tree::first_child</a></div><div class="ttdeci">node first_child(node id) const</div><div class="ttdoc">Get the first child of a node. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:195</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a2dbfd46238b9c9941902e3e8a326db69"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a2dbfd46238b9c9941902e3e8a326db69">open_cpp_utils::directed_tree::next_sibling</a></div><div class="ttdeci">node next_sibling(node id) const</div><div class="ttdoc">Get the next sibling of a node. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:223</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a38cbac2c1dcd82e0f1984a2ab4ccaeb4"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a38cbac2c1dcd82e0f1984a2ab4ccaeb4">open_cpp_utils::directed_tree::left_most</a></div><div class="ttdeci">node left_most(node id) const</div><div class="ttdoc">Get the left most child of a node. O(log(n))</div><div class="ttdef"><b>Definition</b> directed_tree.h:230</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a5ea177cf14e05db354550b59df307f67"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a5ea177cf14e05db354550b59df307f67">open_cpp_utils::directed_tree::operator[]</a></div><div class="ttdeci">const data_type &amp; operator[](node id) const</div><div class="ttdoc">Constant getter for data associated with a node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:445</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a6339dd5e1b6f6c8d55e939a7f0feb355"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a6339dd5e1b6f6c8d55e939a7f0feb355">open_cpp_utils::directed_tree::last_child</a></div><div class="ttdeci">node last_child(node id) const</div><div class="ttdoc">Get the first child of a node. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:202</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a75a113b0542210c67d5ee1039b37dcca"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a75a113b0542210c67d5ee1039b37dcca">open_cpp_utils::directed_tree::operator[]</a></div><div class="ttdeci">data_type &amp; operator[](node id)</div><div class="ttdoc">Getter for data associated with a node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:438</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a9f469505ca6dd336e16bf1fa756491a1"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a9f469505ca6dd336e16bf1fa756491a1">open_cpp_utils::directed_tree::next_id</a></div><div class="ttdeci">node next_id() const</div><div class="ttdoc">Get the next id that would be used if insert() were called.</div><div class="ttdef"><b>Definition</b> directed_tree.h:251</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_aac38b40db651e5687e663bdd303e8886"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#aac38b40db651e5687e663bdd303e8886">open_cpp_utils::directed_tree::valid</a></div><div class="ttdeci">bool valid(node id) const</div><div class="ttdoc">Check whether a node is valid. O(1)</div><div class="ttdef"><b>Definition</b> directed_tree.h:181</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_aafd1b11a9b14342a7d3f46c8c43451f2"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#aafd1b11a9b14342a7d3f46c8c43451f2">open_cpp_utils::directed_tree::erase</a></div><div class="ttdeci">void erase(node id)</div><div class="ttdoc">Erase a node in the tree. O(n)</div><div class="ttdef"><b>Definition</b> directed_tree.h:398</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_acc834118457f713918dc864e3c5dc9a6"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#acc834118457f713918dc864e3c5dc9a6">open_cpp_utils::directed_tree::insert</a></div><div class="ttdeci">node insert(data_type &amp;&amp;data, node p_id, node sib=root)</div><div class="ttdoc">Insert a node into the tree as a child of the provided node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:319</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_ad6ac014058e9ef045c979f76a96c0b37"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#ad6ac014058e9ef045c979f76a96c0b37">open_cpp_utils::directed_tree::traverse</a></div><div class="ttdeci">void traverse(V &amp;visitor)</div><div class="ttdoc">Traverser-Visitor pattern for accessing the tree.</div><div class="ttdef"><b>Definition</b> directed_tree.h:457</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_ae178a606c211c614ba7c6959de10ac82"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#ae178a606c211c614ba7c6959de10ac82">open_cpp_utils::directed_tree::directed_tree</a></div><div class="ttdeci">directed_tree()</div><div class="ttdoc">Default constructor, creates tree with empty root.</div><div class="ttdef"><b>Definition</b> directed_tree.h:156</div></div>
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_af9d76505db29e4e7e1bbad14bd5e4998"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#af9d76505db29e4e7e1bbad14bd5e4998">open_cpp_utils::directed_tree::insert</a></div><div class="ttdeci">node insert(const data_type &amp;data, node p_id, node sib=0)</div><div class="ttdoc">Insert a node into the tree as a child of the provided node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:264</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink