299 lines
45 KiB
HTML
299 lines
45 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="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="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="preprocessor">#pragma once</span></div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span> </div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <list></span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <unordered_map></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="preprocessor">#include "<a class="code" href="dl__log_8h.html">io/dl_log.h</a>"</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="keyword">namespace </span><a class="code hl_namespace" href="namespacedl.html">dl</a></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span>{</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">template</span><<span class="keyword">typename</span> T></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html"> 26</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="l00027" name="l00027"></a><span class="lineno"> 27</span>{</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html"> 29</a></span> <span class="keyword">class </span><a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> {</div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_class" href="classdl_1_1_n_tree.html">NTree</a><<a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>>;</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html#aa70b9a735bfab541862bffcfec334029"> 33</a></span> <a class="code hl_function" href="classdl_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_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* parent) :</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> _parent{ parent },</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> _v{v}</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"> 37</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html#ab3ddced796c322cc7242d6f95a9457fd"> 38</a></span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>& <a class="code hl_function" href="classdl_1_1_n_tree_1_1_node.html#ab3ddced796c322cc7242d6f95a9457fd">GetValue</a>() { <span class="keywordflow">return</span> _v; }</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html#a8dc088f83fe5f36a5a8b3e43be5f9f4d"> 39</a></span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* <a class="code hl_function" href="classdl_1_1_n_tree_1_1_node.html#a8dc088f83fe5f36a5a8b3e43be5f9f4d">GetParent</a>() { <span class="keywordflow">return</span> _parent; }</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html#af4bdc8ee33a1644d1d553453c1a54132"> 40</a></span> std::vector<Node*>& <a class="code hl_function" href="classdl_1_1_n_tree_1_1_node.html#af4bdc8ee33a1644d1d553453c1a54132">GetChild</a>() { <span class="keywordflow">return</span> _child; }</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a> _v;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* _parent;</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> std::vector<Node*> _child;</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_class" href="classdl_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_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node = <span class="keyword">new</span> <a class="code hl_class" href="classdl_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_class" href="classdl_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_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node = <span class="keyword">new</span> <a class="code hl_class" href="classdl_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->_child.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#ac5b454b02dfc485bb951c34b92e1dfb7"> 82</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#ac5b454b02dfc485bb951c34b92e1dfb7">Del</a>(<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node)</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="keyword">auto</span> iter = std::find(_allNode.begin(), _allNode.end(), node);</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (iter == _allNode.end())</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> {</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"节点不存在!"</span>);</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="keywordflow">return</span> <span class="keyword">false</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">// 从父节点移除</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">auto</span> iter1 = std::find(node->_parent->_child.begin(), node->_parent->_child.end(), node);</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">if</span> (iter1 == node->_parent->_child.end())</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> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"父节点引用错误!"</span>);</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> node->_parent->_child.erase(iter1);</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> </div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// 子节点移除引用</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node_child : node->_child)</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> node_child->_parent = <span class="keyword">nullptr</span>;</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="comment">// 从主列表移除</span></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">delete</span> node;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> _allNode.erase(iter);</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> }</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a515b6e9bd588598f3960cb60f82a0e60"> 111</a></span> <a class="code hl_class" href="classdl_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="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> (<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node : _allNode)</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> <span class="keywordflow">if</span> (v == node->_v)</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="keywordflow">return</span> node;</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> <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#ad2d117e65449fc7b3697268790a0e453"> 123</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#ad2d117e65449fc7b3697268790a0e453">Has</a>(<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node)</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_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* iter : _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="keywordflow">if</span> (iter == node)</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">true</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="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a9e01b73a29c7cd747b837f0bf5c8455a"> 135</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#a9e01b73a29c7cd747b837f0bf5c8455a">SetParent</a>(<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node, <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* parent)</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> {</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">if</span> (!parent)</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> {</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"parent不能为空!"</span>);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">if</span> (!node->_parent)</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> {</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"自己不能为空节点!"</span>);</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">return</span>;</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> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classdl_1_1_n_tree.html#ad2d117e65449fc7b3697268790a0e453">Has</a>(node))</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> {</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"节点不存在!"</span>);</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="classdl_1_1_n_tree.html#ad2d117e65449fc7b3697268790a0e453">Has</a>(parent))</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"parent节点不存在!"</span>);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> }</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keyword">auto</span>& vec_child = node-><a class="code hl_function" href="classdl_1_1_n_tree_1_1_node.html#a8dc088f83fe5f36a5a8b3e43be5f9f4d">GetParent</a>()-><a class="code hl_function" href="classdl_1_1_n_tree_1_1_node.html#af4bdc8ee33a1644d1d553453c1a54132">GetChild</a>();</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keyword">auto</span> iter_child = std::find(vec_child.begin(), vec_child.end(), node);</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">if</span> (iter_child == vec_child.end())</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> <a class="code hl_function" href="namespacedl.html#adece4f3bf077e2bd3f1d35a793939184">log_err0</a>(<span class="stringliteral">"旧parent不包含自身!"</span>);</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> }</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> vec_child.erase(iter_child);</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> parent->_child.push_back(node);</div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> node->_parent = parent;</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> }</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">template</span><<span class="keyword">typename</span> F></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a0e85cfd877259d7c24c2a6ee02ab6435"> 173</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="l00174" name="l00174"></a><span class="lineno"> 174</span> {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">if</span> (_allNode.empty())</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> </div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> std::stack<Node*> s;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> s.push(_allNode.front());</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> <span class="keywordflow">while</span> (!s.empty())</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node_this = s.top();</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> s.pop();</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> func(node_this->_v);</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> </div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// 反向遍历</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keyword">auto</span>& c = node_this->_child;</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = c.rbegin(); iter != c.rend(); ++iter)</div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> {</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node = *iter;</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> s.push(node);</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> }</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="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keyword">template</span><<span class="keyword">typename</span> T1></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#aa3d5e7894a2423c97808b454d7754591"> 200</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classdl_1_1_n_tree.html#aa3d5e7894a2423c97808b454d7754591">Copy</a>(<span class="keyword">const</span> <a class="code hl_class" href="classdl_1_1_n_tree.html">NTree<T1></a>& b, std::function<<span class="keywordtype">void</span>(<span class="keyword">const</span> T1&, <a class="code hl_enumvalue" href="namespacedl.html#a38a0162879cdbfbbe99ba16e7a170132ab9ece18c950afbfa6b0fdbfa4ff731d3">T</a>&)> func)</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// 先清空</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& iter : _allNode)</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> {</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">delete</span> iter;</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> _allNode.clear();</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> <span class="comment">// 指针映射表</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> std::unordered_map<void*, void*> map_ptr;</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// 构建Node,并生成 指针映射表</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter : b._allNode)</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> {</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">NTree::Node</a>* node_b = *iter;</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">NTree<T>::Node</a>* node = <span class="keyword">new</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">NTree<T>::Node</a>;</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> _allNode.push_back(node);</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> map_ptr[node_b] = node;</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> }</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// 构建 数据</span></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter : b._allNode)</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> {</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">NTree::Node</a>* node_b = *iter;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">NTree<T>::Node</a>* node = map_ptr[node_b];</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> func(node_b->_v, node);</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> node->_parent = map_ptr[node_b->_parent];</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <span class="keywordflow">for</span> (<span class="keyword">auto</span>& iter : node_b->_child)</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> node->_child.push_back(map_ptr[iter]);</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> }</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> _allNode.push_back(node);</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> }</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> }</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> </div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a824d9865f4d470ac02e77516a49a20c0"> 236</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="l00237" name="l00237"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#a2e721dd6735ac47917f88beb70b25f08"> 237</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="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree.html#aa7e865f0fa619bf747d643f913921eb9"> 239</a></span> <a class="code hl_function" href="classdl_1_1_n_tree.html#aa7e865f0fa619bf747d643f913921eb9">~NTree</a>()</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> {</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordflow">for</span> (<a class="code hl_class" href="classdl_1_1_n_tree_1_1_node.html">Node</a>* node : _allNode)</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> {</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keyword">delete</span> node;</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> }</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span><span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="classdl_1_1_n_tree_1_1_node.html#ac0f5716edb14b167c551ea29c23b38d7"> 247</a></span> std::list<Node*> _allNode;<span class="comment">//所有节点,第一个为根节点</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span>};</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> </div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span>}</div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_1_1_node_html"><div class="ttname"><a href="classdl_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#l00029">dl_tree.h:30</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_1_1_node_html_a8dc088f83fe5f36a5a8b3e43be5f9f4d"><div class="ttname"><a href="classdl_1_1_n_tree_1_1_node.html#a8dc088f83fe5f36a5a8b3e43be5f9f4d">dl::NTree::Node::GetParent</a></div><div class="ttdeci">Node * GetParent()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00039">dl_tree.h:39</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_1_1_node_html_aa70b9a735bfab541862bffcfec334029"><div class="ttname"><a href="classdl_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#l00033">dl_tree.h:33</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_1_1_node_html_ab3ddced796c322cc7242d6f95a9457fd"><div class="ttname"><a href="classdl_1_1_n_tree_1_1_node.html#ab3ddced796c322cc7242d6f95a9457fd">dl::NTree::Node::GetValue</a></div><div class="ttdeci">T & GetValue()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00038">dl_tree.h:38</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_1_1_node_html_af4bdc8ee33a1644d1d553453c1a54132"><div class="ttname"><a href="classdl_1_1_n_tree_1_1_node.html#af4bdc8ee33a1644d1d553453c1a54132">dl::NTree::Node::GetChild</a></div><div class="ttdeci">std::vector< Node * > & GetChild()</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00040">dl_tree.h:40</a></div></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#l00026">dl_tree.h:27</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#l00173">dl_tree.h:173</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#l00237">dl_tree.h:237</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#l00111">dl_tree.h:111</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#l00236">dl_tree.h:236</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_a9e01b73a29c7cd747b837f0bf5c8455a"><div class="ttname"><a href="classdl_1_1_n_tree.html#a9e01b73a29c7cd747b837f0bf5c8455a">dl::NTree::SetParent</a></div><div class="ttdeci">void SetParent(Node *node, Node *parent)</div><div class="ttdoc">修改父节点</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00135">dl_tree.h:135</a></div></div>
|
|
<div class="ttc" id="aclassdl_1_1_n_tree_html_aa3d5e7894a2423c97808b454d7754591"><div class="ttname"><a href="classdl_1_1_n_tree.html#aa3d5e7894a2423c97808b454d7754591">dl::NTree::Copy</a></div><div class="ttdeci">void Copy(const NTree< T1 > &b, std::function< void(const T1 &, T &)> func)</div><div class="ttdoc">从另一个树填充</div><div class="ttdef"><b>Definition:</b> <a href="dl__tree_8h_source.html#l00200">dl_tree.h:200</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#l00239">dl_tree.h:239</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="aclassdl_1_1_n_tree_html_ac5b454b02dfc485bb951c34b92e1dfb7"><div class="ttname"><a href="classdl_1_1_n_tree.html#ac5b454b02dfc485bb951c34b92e1dfb7">dl::NTree::Del</a></div><div class="ttdeci">bool Del(Node *node)</div><div class="ttdoc">删除节点</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_ad2d117e65449fc7b3697268790a0e453"><div class="ttname"><a href="classdl_1_1_n_tree.html#ad2d117e65449fc7b3697268790a0e453">dl::NTree::Has</a></div><div class="ttdeci">bool Has(Node *node)</div><div class="ttdoc">包含节点</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="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#l00017">dl_array2.h:18</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><!-- 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>
|