463 lines
62 KiB
HTML
463 lines
62 KiB
HTML
<!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.10.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>
|
|
<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"> 0.0.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.10.0 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search/",'.html');
|
|
/* @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&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() { codefold.init(0); });
|
|
/* @license-end */
|
|
</script>
|
|
</div><!-- top -->
|
|
<!-- 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">// Copyright 2024 Medusa Slockbower</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment">// limitations under the License.</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> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#ifndef DIRECTEDGRAPH_H</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#define DIRECTEDGRAPH_H</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">#include "<a class="code" href="template__utils_8h.html">template_utils.h</a>"</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="keyword">namespace </span>open_cpp_utils</div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span>{</div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> </div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">template</span><<span class="keyword">typename</span> T></div>
|
|
<div class="foldopen" id="foldopen00032" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html"> 32</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="l00033" name="l00033"></a><span class="lineno"> 33</span>{</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// Forward Definitions =================================================================================================</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> </div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</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="l00038" name="l00038"></a><span class="lineno"> 38</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="l00039" name="l00039"></a><span class="lineno"> 39</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="l00040" name="l00040"></a><span class="lineno"> 40</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="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">private</span>:</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keyword">struct </span>director;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> </div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// Typedefs ============================================================================================================</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">using </span>data_type = T;</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">using </span>node = uint32_t;</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">using </span>node_queue = std::deque<node>;</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="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">using </span>hierarchy = std::vector<director>;</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keyword">using </span>storage = std::vector<data_type>;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> </div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> </div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// Constants ===========================================================================================================</span></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">public</span>:</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">static</span> <span class="keyword">constexpr</span> <a class="code hl_struct" href="structopen__cpp__utils_1_1constant__value.html">constant_value</a><node, node(0)> root{};</div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">// Data Structures =====================================================================================================</span></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><span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">struct </span>director</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">enum</span> flags</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> {</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> VALID = 0x0001</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> </div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> node parent, child, prev_sibling, next_sibling;</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> uint32_t flags, depth;</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> director() : parent(0), child(0), prev_sibling(0), next_sibling(0), flags(VALID) { }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> };</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> </div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// Functions ===========================================================================================================</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><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// Constructors & Destructor ---------------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> </div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a274ff5c1261c76482ae0539bcd7db282"> 90</a></span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a274ff5c1261c76482ae0539bcd7db282">directed_tree</a>() : graph_{ director() }, data_{ data_type() }, freed_{ } { }</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> </div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment">// Tree Navigation -------------------------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37"> 100</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_[id].parent; }</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> </div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a4724d2a3787f09eb632687cbb8d3b392"> 107</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a4724d2a3787f09eb632687cbb8d3b392">first_child</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> graph_[id].child; }</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a2894ba29c0eccf98b50bab5c07fcdf40"> 114</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a2894ba29c0eccf98b50bab5c07fcdf40">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="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a2b5a157313e8c92a68d041d1b33514d4"> 121</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a2b5a157313e8c92a68d041d1b33514d4">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="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
|
|
<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a9a03a3bc0948881348a72d5c21390542"> 128</a></span> [[nodiscard]] node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a9a03a3bc0948881348a72d5c21390542">left_most</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="keyword"> </span>{</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> node current = id;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">while</span>(<span class="keywordtype">id</span> = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a4724d2a3787f09eb632687cbb8d3b392">first_child</a>(current)) current = id;</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">return</span> current;</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
|
|
<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11"> 140</a></span> [[nodiscard]] uint32_t <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11">depth</a>(node <span class="keywordtype">id</span>)<span class="keyword"> const</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="keyword"> </span>{</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> uint32_t <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11">depth</a> = 0;</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keywordflow">while</span> (<span class="keywordtype">id</span>)</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> {</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordtype">id</span> = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> ++<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11">depth</a>;</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> <span class="keywordflow">return</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11">depth</a>;</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> }</div>
|
|
</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> </div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span><span class="comment">// Tree Modification ---------------------------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a1a23d372ff1a58609686dcbc0e979cdd"> 160</a></span> node <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a1a23d372ff1a58609686dcbc0e979cdd">insert</a>(<span class="keyword">const</span> data_type& data, node p_id)</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> {</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keywordflow">if</span>(freed_.empty())</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> {</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> freed_.push_back(<span class="keyword">static_cast<</span>node<span class="keyword">></span>(graph_.size()));</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> graph_.push_back(director()); data_.push_back(data);</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> }</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> node <span class="keywordtype">id</span> = freed_.front(); freed_.pop_front();</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> director& node = graph_[id];</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> director& <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a> = graph_[p_id];</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</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> <span class="keywordflow">if</span>(<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>.child)</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> director& nchild = graph_[<a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>.child];</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> node.prev_sibling = nchild.prev_sibling;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> nchild.prev_sibling = id;</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">if</span>(nchild.prev_sibling)</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> {</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> director& pchild = graph_[nchild.prev_sibling];</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> pchild.next_sibling = id;</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> }</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Setup node</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> node.parent = p_id;</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> node.next_sibling = <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>.child;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> node.child = 0;</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> node.flags = director::VALID;</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> </div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// Set parent's child</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">parent</a>.child = id;</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> </div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> data_[id] = data;</div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> </div>
|
|
<div class="foldopen" id="foldopen00205" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#a03aa9c0faf8c6985cc8e8b22c4dabe18"> 205</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#a03aa9c0faf8c6985cc8e8b22c4dabe18">erase</a>(node <span class="keywordtype">id</span>)</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> {</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">if</span>(<span class="keywordtype">id</span> == 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> director& erased = graph_[id];</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> erased.Flags &= ~director::VALID;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> freed_.push_back(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> </div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> graph_[erased.parent].Child = erased.Sibling;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> </div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> node_queue stack{ erased.Child };</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> </div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordflow">while</span>(stack.empty() == <span class="keyword">false</span>)</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> {</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> node next = stack.front(); stack.pop_front();</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> director& child = graph_[next];</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> child.Flags &= ~director::VALID;</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> freed_.push_back(next);</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> </div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <span class="keywordflow">if</span>(child.Sibling) stack.push_front(child.Sibling);</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordflow">if</span>(child.Child) stack.push_front(child.Child);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> }</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> </div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="comment">// Tree Access ---------------------------------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#afe497db6dba649dccc3520adc6ee87ac"> 237</a></span> data_type& <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#afe497db6dba649dccc3520adc6ee87ac">operator[]</a>(node <span class="keywordtype">id</span>) { <span class="keywordflow">return</span> data_[id]; }</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#ae640e0a2ecf325d9f0f9253341d0ce2d"> 244</a></span> [[nodiscard]] <span class="keyword">const</span> data_type& <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#ae640e0a2ecf325d9f0f9253341d0ce2d">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="l00245" name="l00245"></a><span class="lineno"> 245</span> </div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> </div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span><span class="comment">// Visitor Pattern -----------------------------------------------------------------------------------------------------</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> </div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keyword">template</span><<span class="keyword">typename</span> O = pre_order, <span class="keyword">typename</span> V></div>
|
|
<div class="foldopen" id="foldopen00256" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree.html#aae5dccf63007f5094122dee8fdae986e"> 256</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classopen__cpp__utils_1_1directed__tree.html#aae5dccf63007f5094122dee8fdae986e">traverse</a>(V& visitor)</div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> {</div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser<V, O></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="l00259" name="l00259"></a><span class="lineno"> 259</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html">traverser</a>();</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> </div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span><span class="comment">// Variables =======================================================================================================</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> </div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span><span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> hierarchy graph_;</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> storage data_;</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> node_queue freed_;</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> </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="comment">// Navigation ======================================================================================================</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><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
|
|
<div class="foldopen" id="foldopen00278" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1breadth__first.html"> 278</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="l00279" name="l00279"></a><span class="lineno"> 279</span> {</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</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>& graph) : graph_(graph), visit_queue_(0) { }</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 operator()(node node)</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> {</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> node = visit_queue_.back(); visit_queue_.pop_back();</div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> director& current = graph_.graph_[node];</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> </div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">if</span>(current.next_sibling) visit_queue_.push_back(current.next_sibling);</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="keywordflow">if</span>(current.child) visit_queue_.push_front(current.child);</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keywordflow">if</span>(visit_queue_.empty()) <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">return</span> node;</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> </div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>& graph_;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> node_queue visit_queue_;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> };</div>
|
|
</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> </div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> </div>
|
|
<div class="foldopen" id="foldopen00304" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1pre__order.html"> 304</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="l00305" name="l00305"></a><span class="lineno"> 305</span> {</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</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>& graph) : graph_(graph) { }</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> node operator()(node <span class="keywordtype">id</span>)</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> {</div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> director& current = graph_.graph_[id];</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> </div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> <span class="keywordflow">if</span>(current.next_sibling) visit_queue_.push_front(current.next_sibling);</div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="keywordflow">if</span>(current.child) visit_queue_.push_front(current.child);</div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> </div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordflow">if</span>(visit_queue_.empty()) <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> node next = visit_queue_.front(); visit_queue_.pop_front();</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> <span class="keywordflow">return</span> next;</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> }</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="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>& graph_;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> node_queue visit_queue_;</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> };</div>
|
|
</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> </div>
|
|
<div class="foldopen" id="foldopen00330" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1in__order.html"> 330</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="l00331" name="l00331"></a><span class="lineno"> 331</span> {</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</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>& graph) : graph_(graph) { }</div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> </div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> node operator()(node node)</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> {</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">if</span>(node == 0) visit_queue_.push_back(graph_.left_most(node));</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> </div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> node = visit_queue_.front(); visit_queue_.pop_front();</div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> director& current = graph_.graph_[node];</div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> </div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> <span class="keywordflow">if</span>(current.Sibling)</div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> {</div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> <span class="keywordflow">if</span>(graph_.next_sibling(current.Sibling)) visit_queue_.push_back(current.parent);</div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> visit_queue_.push_back(graph_.left_most(current.Sibling));</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> </div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> }</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> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>& graph_;</div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> node_queue visit_queue_;</div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> };</div>
|
|
</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> </div>
|
|
<div class="foldopen" id="foldopen00360" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1post__order.html"> 360</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="l00361" name="l00361"></a><span class="lineno"> 361</span> {</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</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>& graph) : graph_(graph) { }</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> </div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> node operator()(node node)</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="keywordflow">if</span>(visit_queue_.empty()) visit_queue_.push_back(graph_.left_most(node));</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 = visit_queue_.front(); visit_queue_.pop_front();</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> <span class="keywordflow">if</span>(node == 0) <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> director& current = graph_.graph_[node];</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> </div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> visit_queue_.push_back(current.Sibling ? graph_.left_most(current.Sibling) : graph_.parent(node));</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> </div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> <span class="keywordflow">return</span> node;</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="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>& graph_;</div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> node_queue visit_queue_;</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> };</div>
|
|
</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> </div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> <span class="keyword">template</span><<span class="keyword">typename</span> V, <span class="keyword">typename</span> O></div>
|
|
<div class="foldopen" id="foldopen00388" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"><a class="line" href="classopen__cpp__utils_1_1directed__tree_1_1traverser.html"> 388</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="l00389" name="l00389"></a><span class="lineno"> 389</span> {</div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span> <span class="keyword">using </span>visitor_type = V;</div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span> <span class="keyword">using </span>order_type = O;</div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> </div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</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>& graph, visitor_type& visitor) : graph_(graph), visitor_(visitor), order_(graph) { }</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> <span class="keywordtype">void</span> operator()()</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> {</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> node node = 0;</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <span class="keywordflow">while</span>(node = order_(node))</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> {</div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordflow">if</span>(visitor_(graph_[node], node)) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> }</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> }</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> </div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> <a class="code hl_class" href="classopen__cpp__utils_1_1directed__tree.html">directed_tree</a>& graph_;</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> visitor_type& visitor_;</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> order_type order_;</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> };</div>
|
|
</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span>}</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> </div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span><span class="preprocessor">#endif </span><span class="comment">//DIRECTEDGRAPH_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:279</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:331</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:361</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:305</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:389</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:33</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a03aa9c0faf8c6985cc8e8b22c4dabe18"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a03aa9c0faf8c6985cc8e8b22c4dabe18">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.</div><div class="ttdef"><b>Definition</b> directed_tree.h:205</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a1a23d372ff1a58609686dcbc0e979cdd"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a1a23d372ff1a58609686dcbc0e979cdd">open_cpp_utils::directed_tree::insert</a></div><div class="ttdeci">node insert(const data_type &data, node p_id)</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:160</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a274ff5c1261c76482ae0539bcd7db282"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a274ff5c1261c76482ae0539bcd7db282">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:90</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a2894ba29c0eccf98b50bab5c07fcdf40"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a2894ba29c0eccf98b50bab5c07fcdf40">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:114</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a2b5a157313e8c92a68d041d1b33514d4"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a2b5a157313e8c92a68d041d1b33514d4">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:121</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a3c5c1406f23aaafa8853670cd8c09e37"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a3c5c1406f23aaafa8853670cd8c09e37">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:100</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a4724d2a3787f09eb632687cbb8d3b392"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a4724d2a3787f09eb632687cbb8d3b392">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:107</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_a9a03a3bc0948881348a72d5c21390542"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#a9a03a3bc0948881348a72d5c21390542">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:128</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_aa1c7419056d969b7596a0fa1616f3a11"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#aa1c7419056d969b7596a0fa1616f3a11">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:140</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_aae5dccf63007f5094122dee8fdae986e"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#aae5dccf63007f5094122dee8fdae986e">open_cpp_utils::directed_tree::traverse</a></div><div class="ttdeci">void traverse(V &visitor)</div><div class="ttdoc">Traverser-Visitor pattern for accessing the tree.</div><div class="ttdef"><b>Definition</b> directed_tree.h:256</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_ae640e0a2ecf325d9f0f9253341d0ce2d"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#ae640e0a2ecf325d9f0f9253341d0ce2d">open_cpp_utils::directed_tree::operator[]</a></div><div class="ttdeci">const data_type & 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:244</div></div>
|
|
<div class="ttc" id="aclassopen__cpp__utils_1_1directed__tree_html_afe497db6dba649dccc3520adc6ee87ac"><div class="ttname"><a href="classopen__cpp__utils_1_1directed__tree.html#afe497db6dba649dccc3520adc6ee87ac">open_cpp_utils::directed_tree::operator[]</a></div><div class="ttdeci">data_type & operator[](node id)</div><div class="ttdoc">Getter for data associated with a node.</div><div class="ttdef"><b>Definition</b> directed_tree.h:237</div></div>
|
|
<div class="ttc" id="astructopen__cpp__utils_1_1constant__value_html"><div class="ttname"><a href="structopen__cpp__utils_1_1constant__value.html">open_cpp_utils::constant_value</a></div><div class="ttdoc">Compile-time constant value.</div><div class="ttdef"><b>Definition</b> template_utils.h:34</div></div>
|
|
<div class="ttc" id="atemplate__utils_8h_html"><div class="ttname"><a href="template__utils_8h.html">template_utils.h</a></div><div class="ttdoc">Provides compile time evaluation utilities for templates and template packs.</div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.10.0
|
|
</small></address>
|
|
</body>
|
|
</html>
|