193 lines
28 KiB
HTML
193 lines
28 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="zh">
|
|
<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.9.5"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>dl: dl/base/dl_tree.h 源文件</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>
|
|
<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">dl
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- 制作者 Doxygen 1.9.5 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="index.html"><span>首页</span></a></li>
|
|
<li><a href="pages.html"><span>相关页面</span></a></li>
|
|
<li><a href="namespaces.html"><span>命名空间</span></a></li>
|
|
<li><a href="concepts.html"><span>概念</span></a></li>
|
|
<li><a href="annotated.html"><span>类</span></a></li>
|
|
<li class="current"><a href="files.html"><span>文件</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="navrow2" class="tabs2">
|
|
<ul class="tablist">
|
|
<li><a href="files.html"><span>文件列表</span></a></li>
|
|
<li><a href="globals.html"><span>文件成员</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_17297ffb27ce571941f5fb5008f01a1f.html">dl</a></li><li class="navelem"><a class="el" href="dir_78beb56c8eba7ccc6c64d7863d88a69e.html">base</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">dl_tree.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="dl__tree_8h.html">浏览该文件的文档.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#pragma once</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">#include <vector></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span> </div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include "<a class="code" href="dl__log_8h.html">io/dl_log.h</a>"</span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespacedl.html">dl</a></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> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">template</span><<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html"> 24</a></span><span class="keyword">class </span><a class="code hl_class" href="classdl_1_1_n_tree.html">NTree</a></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span>{</div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html"> 27</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a></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"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de"> 29</a></span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">_v</a>;</div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#a3467fd2d97a11e946bc6b64ab93161e9"> 30</a></span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#a3467fd2d97a11e946bc6b64ab93161e9">_parent</a>;</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#a00c3cc594414ea7ae9dc963b7f053264"> 31</a></span> std::vector<Node*> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#a00c3cc594414ea7ae9dc963b7f053264">_child</a>;</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#aa70b9a735bfab541862bffcfec334029"> 32</a></span> <a class="code hl_function" href="structdl_1_1_n_tree_1_1_node.html#aa70b9a735bfab541862bffcfec334029">Node</a>(<span class="keyword">const</span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& v, <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* parent) :</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#a3467fd2d97a11e946bc6b64ab93161e9">_parent</a>{ parent },</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">_v</a>{v}</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> </div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#a64f440120450394c703d766fa6fcbe88"> 37</a></span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& <a class="code hl_function" href="structdl_1_1_n_tree_1_1_node.html#a64f440120450394c703d766fa6fcbe88">operator-></a>()</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> {</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">_v</a>;</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> }</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="structdl_1_1_n_tree_1_1_node.html#a32f3a444e03aab49dc612e782baed333"> 41</a></span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& <a class="code hl_function" href="structdl_1_1_n_tree_1_1_node.html#a32f3a444e03aab49dc612e782baed333">operator*</a>()</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> {</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">_v</a>;</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> </div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a03cab3302b9feab0c635f8c1a144874a"> 47</a></span> <a class="code hl_function" href="classdl_1_1_n_tree.html#a03cab3302b9feab0c635f8c1a144874a">NTree</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> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#ac2352560fe96122f65c37b2982c89219"> 54</a></span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* <a class="code hl_function" href="classdl_1_1_n_tree.html#ac2352560fe96122f65c37b2982c89219">Add</a>(<span class="keyword">const</span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& v, <span class="keyword">const</span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& parent)</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> {</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">if</span> (!parent)</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="keywordflow">if</span> (!_allNode.empty())</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> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"根节点已经存在,不能重复添加!"</span>);</div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</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> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node = <span class="keyword">new</span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>(v, <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> _allNode.push_back(node);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> node;</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> </div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node_parent = <a class="code hl_function" href="classdl_1_1_n_tree.html#a515b6e9bd588598f3960cb60f82a0e60">Get</a>(parent);</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> (!node_parent)</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> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"父节点不存在!"</span>);</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">return</span> <span class="keyword">nullptr</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> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node = <span class="keyword">new</span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>(v, node_parent);</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> _allNode.push_back(node);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> node_parent-><a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#a00c3cc594414ea7ae9dc963b7f053264">_child</a>.push_back(node);</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a515b6e9bd588598f3960cb60f82a0e60"> 82</a></span> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* <a class="code hl_function" href="classdl_1_1_n_tree.html#a515b6e9bd588598f3960cb60f82a0e60">Get</a>(<a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a> v)</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node : _allNode)</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> <span class="keywordflow">if</span> (v == node->_v)</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">return</span> node;</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> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">template</span><<span class="keyword">typename</span> F></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a0e85cfd877259d7c24c2a6ee02ab6435"> 95</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#a0e85cfd877259d7c24c2a6ee02ab6435">ForEach</a>(<a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132a800618943025315f869e4e1f09471012">F</a> func)</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> {</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (_allNode.empty())</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> </div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> std::stack<Node*> s;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> s.push(_allNode.front());</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keywordflow">while</span> (!s.empty())</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> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node_this = s.top();</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> s.pop();</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> func(node_this-><a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">_v</a>);</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">//反向遍历</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keyword">auto</span>& c = node_this-><a class="code hl_variable" href="structdl_1_1_n_tree_1_1_node.html#a00c3cc594414ea7ae9dc963b7f053264">_child</a>;</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = c.rbegin(); iter != c.rend(); ++iter)</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> <a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node = *iter;</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> s.push(node);</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> }</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> }</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="l00120" name="l00120"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a824d9865f4d470ac02e77516a49a20c0"> 120</a></span> <span class="keyword">auto</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#a824d9865f4d470ac02e77516a49a20c0">begin</a>() { <span class="keywordflow">return</span> _allNode.begin(); }</div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a2e721dd6735ac47917f88beb70b25f08"> 121</a></span> <span class="keyword">auto</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#a2e721dd6735ac47917f88beb70b25f08">end</a>() { <span class="keywordflow">return</span> _allNode.end(); }</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"><a class="line" href="classdl_1_1_n_tree.html#aa7e865f0fa619bf747d643f913921eb9"> 123</a></span> <a class="code hl_function" href="classdl_1_1_n_tree.html#aa7e865f0fa619bf747d643f913921eb9">~NTree</a>()</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> {</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (<a class="code hl_struct" href="structdl_1_1_n_tree_1_1_node.html">Node</a>* node : _allNode)</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> <span class="keyword">delete</span> node;</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><span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> std::list<Node*> _allNode;<span class="comment">//所有节点,第一个为根节点</span></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>}</div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html"><div class="ttname"><a href="classdl_1_1_n_tree.html">dl::NTree</a></div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00024">dl_tree.h:25</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a03cab3302b9feab0c635f8c1a144874a"><div class="ttname"><a href="classdl_1_1_n_tree.html#a03cab3302b9feab0c635f8c1a144874a">dl::NTree::NTree</a></div><div class="ttdeci">NTree()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00047">dl_tree.h:47</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a0e85cfd877259d7c24c2a6ee02ab6435"><div class="ttname"><a href="classdl_1_1_n_tree.html#a0e85cfd877259d7c24c2a6ee02ab6435">dl::NTree::ForEach</a></div><div class="ttdeci">void ForEach(F func)</div><div class="ttdoc">遍历,保证父节点先遍历</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00095">dl_tree.h:95</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a2e721dd6735ac47917f88beb70b25f08"><div class="ttname"><a href="classdl_1_1_n_tree.html#a2e721dd6735ac47917f88beb70b25f08">dl::NTree::end</a></div><div class="ttdeci">auto end()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00121">dl_tree.h:121</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a515b6e9bd588598f3960cb60f82a0e60"><div class="ttname"><a href="classdl_1_1_n_tree.html#a515b6e9bd588598f3960cb60f82a0e60">dl::NTree::Get</a></div><div class="ttdeci">Node * Get(T v)</div><div class="ttdoc">查找,失败返回nullptr</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00082">dl_tree.h:82</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a824d9865f4d470ac02e77516a49a20c0"><div class="ttname"><a href="classdl_1_1_n_tree.html#a824d9865f4d470ac02e77516a49a20c0">dl::NTree::begin</a></div><div class="ttdeci">auto begin()</div><div class="ttdoc">标准库迭代方法不保证父节点先遍历</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00120">dl_tree.h:120</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_aa7e865f0fa619bf747d643f913921eb9"><div class="ttname"><a href="classdl_1_1_n_tree.html#aa7e865f0fa619bf747d643f913921eb9">dl::NTree::~NTree</a></div><div class="ttdeci">~NTree()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00123">dl_tree.h:123</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_ac2352560fe96122f65c37b2982c89219"><div class="ttname"><a href="classdl_1_1_n_tree.html#ac2352560fe96122f65c37b2982c89219">dl::NTree::Add</a></div><div class="ttdeci">Node * Add(const T &v, const T &parent)</div><div class="ttdoc">添加,parent为nullptr时,为添加根节点</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00054">dl_tree.h:54</a></div></div>
|
|
<div class="ttc" id="adl__log_8h_html"><div class="ttname"><a href="dl__log_8h.html">dl_log.h</a></div><div class="ttdoc">日志系统</div></div>
|
|
<div class="ttc" id="anamespacedl_html"><div class="ttname"><a href="namespacedl.html">dl</a></div><div class="ttdef"><b>Definition:</b> <a href="dl__array2_8h_source.html#l00016">dl_array2.h:17</a></div></div>
|
|
<div class="ttc" id="anamespacedl_html_a38a0162879cdbfbbe99ba16e7a170132a800618943025315f869e4e1f09471012"><div class="ttname"><a href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132a800618943025315f869e4e1f09471012">dl::KeyCode::F</a></div><div class="ttdeci">@ F</div></div>
|
|
<div class="ttc" id="anamespacedl_html_a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3"><div class="ttname"><a href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">dl::KeyCode::T</a></div><div class="ttdeci">@ T</div></div>
|
|
<div class="ttc" id="anamespacedl_html_adece4f3bf077e2bd3f1d35a793939184"><div class="ttname"><a href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">dl::log_err0</a></div><div class="ttdeci">void log_err0(std::string_view str, const std::source_location location=std::source_location::current())</div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html">dl::NTree::Node</a></div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00027">dl_tree.h:28</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_a00c3cc594414ea7ae9dc963b7f053264"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#a00c3cc594414ea7ae9dc963b7f053264">dl::NTree::Node::_child</a></div><div class="ttdeci">std::vector< Node * > _child</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00031">dl_tree.h:31</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_a32f3a444e03aab49dc612e782baed333"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#a32f3a444e03aab49dc612e782baed333">dl::NTree::Node::operator*</a></div><div class="ttdeci">T & operator*()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00041">dl_tree.h:41</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_a3467fd2d97a11e946bc6b64ab93161e9"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#a3467fd2d97a11e946bc6b64ab93161e9">dl::NTree::Node::_parent</a></div><div class="ttdeci">Node * _parent</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00030">dl_tree.h:30</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_a64f440120450394c703d766fa6fcbe88"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#a64f440120450394c703d766fa6fcbe88">dl::NTree::Node::operator-></a></div><div class="ttdeci">T & operator->()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00037">dl_tree.h:37</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_aa70b9a735bfab541862bffcfec334029"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#aa70b9a735bfab541862bffcfec334029">dl::NTree::Node::Node</a></div><div class="ttdeci">Node(const T &v, Node *parent)</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00032">dl_tree.h:32</a></div></div>
|
|
<div class="ttc" id="astructdl_1_1_n_tree_1_1_node_html_ad5f216e2d9749f36c2546404e54917de"><div class="ttname"><a href="structdl_1_1_n_tree_1_1_node.html#ad5f216e2d9749f36c2546404e54917de">dl::NTree::Node::_v</a></div><div class="ttdeci">T _v</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00029">dl_tree.h:29</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<!-- start footer part -->
|
|
<hr class="footer"/><address class="footer"><small>
|
|
制作者 <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.5
|
|
</small></address>
|
|
</body>
|
|
</html>
|