mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-25 14:23:03 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,7 @@
|
||||
<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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: binary_search_tree< T > Class Template Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -230,7 +230,7 @@ class binary_search_tree< T ></div><p>The Binary Search Tree class. </p>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -244,7 +244,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -268,7 +268,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -286,7 +286,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -305,20 +305,20 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00177">177</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 177</span> {</div>
|
||||
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 179</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 180</span> }</div>
|
||||
<div class="line"><span class="lineno"> 181</span> </div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (value < node->value) {</div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, value);</div>
|
||||
<div class="line"><span class="lineno"> 184</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value > <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
||||
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, value);</div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value < node-></a><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 184</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a> > <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value) {</div>
|
||||
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 186</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 188</span> }</div>
|
||||
<div class="line"><span class="lineno"> 189</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00020">binary_search_tree2.cpp:20</a></div></div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr< bst_node > &node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00177">binary_search_tree2.cpp:177</a></div></div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -328,7 +328,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -342,7 +342,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -359,7 +359,7 @@ template<class T > </div>
|
||||
false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00289">289</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 289</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 289</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>); }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -369,7 +369,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -387,7 +387,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -406,13 +406,13 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
||||
<div class="line"><span class="lineno"> 56</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a> = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> }</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, ret_value);</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 61</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr< bst_node > &node, T &ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00053">binary_search_tree2.cpp:53</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -424,7 +424,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -438,7 +438,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -455,7 +455,7 @@ template<class T > </div>
|
||||
false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00307">307</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 307</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 307</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a>); }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -465,7 +465,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -483,7 +483,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -502,14 +502,14 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 74</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
||||
<div class="line"><span class="lineno"> 74</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left) {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a> = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span> </div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, ret_value);</div>
|
||||
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 80</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr< bst_node > &node, T &ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00071">binary_search_tree2.cpp:71</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -521,7 +521,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -535,7 +535,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -552,7 +552,7 @@ template<class T > </div>
|
||||
false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00298">298</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 298</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 298</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">ret_value</a>); }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -562,7 +562,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -576,7 +576,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -586,13 +586,12 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00321">321</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 321</span> {</div>
|
||||
<div class="line"><span class="lineno"> 322</span> std::vector<T> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 323</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
||||
<div class="line"><span class="lineno"> 322</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::vector<T></a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 323</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&](<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">T</a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>) { <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>.push_back(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>); },</div>
|
||||
<div class="line"><span class="lineno"> 324</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
||||
<div class="line"><span class="lineno"> 325</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 325</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 326</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00197">binary_search_tree2.cpp:197</a></div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -602,7 +601,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -616,7 +615,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -626,10 +625,10 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00345">345</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 345</span> {</div>
|
||||
<div class="line"><span class="lineno"> 346</span> std::vector<T> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 347</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
||||
<div class="line"><span class="lineno"> 346</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::vector<T></a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 347</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&](<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">T</a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>) { <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>.push_back(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>); },</div>
|
||||
<div class="line"><span class="lineno"> 348</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
||||
<div class="line"><span class="lineno"> 349</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 349</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 350</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00231">binary_search_tree2.cpp:231</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -641,7 +640,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -655,7 +654,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -665,10 +664,10 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00333">333</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 333</span> {</div>
|
||||
<div class="line"><span class="lineno"> 334</span> std::vector<T> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 335</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
||||
<div class="line"><span class="lineno"> 334</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::vector<T></a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 335</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&](<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">T</a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>) { <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>.push_back(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node_value</a>); },</div>
|
||||
<div class="line"><span class="lineno"> 336</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
||||
<div class="line"><span class="lineno"> 337</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 337</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 338</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00214">binary_search_tree2.cpp:214</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -680,7 +679,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -698,7 +697,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -717,31 +716,32 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> && !<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::unique_ptr<bst_node>(<span class="keyword">new</span> bst_node(new_value));</div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a> && !<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>));</div>
|
||||
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> }</div>
|
||||
<div class="line"><span class="lineno"> 95</span> </div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">if</span> (new_value < node->value) {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left = std::unique_ptr<bst_node>(<span class="keyword">new</span> bst_node(new_value));</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value < node-></a><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left) {</div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>));</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 100</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, new_value);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> }</div>
|
||||
<div class="line"><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value > <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right =</div>
|
||||
<div class="line"><span class="lineno"> 106</span> std::unique_ptr<bst_node>(<span class="keyword">new</span> bst_node(new_value));</div>
|
||||
<div class="line"><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a> > <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value) {</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right =</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>));</div>
|
||||
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 108</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, new_value);</div>
|
||||
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> }</div>
|
||||
<div class="line"><span class="lineno"> 111</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><span class="lineno"> 114</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr< bst_node > &node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00090">binary_search_tree2.cpp:90</a></div></div>
|
||||
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></div><div class="ttdoc">A struct to represent a node in the Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00025">binary_search_tree2.cpp:25</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -751,7 +751,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -765,7 +765,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -783,11 +783,11 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00259">259</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 259</span> {</div>
|
||||
<div class="line"><span class="lineno"> 260</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
|
||||
<div class="line"><span class="lineno"> 261</span> <span class="keywordflow">if</span> (result) {</div>
|
||||
<div class="line"><span class="lineno"> 260</span> <span class="keywordtype">bool</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a> = <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">new_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 261</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 262</span> <a class="code hl_variable" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>++;</div>
|
||||
<div class="line"><span class="lineno"> 263</span> }</div>
|
||||
<div class="line"><span class="lineno"> 264</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 264</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 265</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -798,7 +798,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -821,7 +821,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -841,45 +841,45 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 126</span> {</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 129</span> }</div>
|
||||
<div class="line"><span class="lineno"> 130</span> </div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value == rm_value) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left && <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 133</span> T successor_node_value{};</div>
|
||||
<div class="line"><span class="lineno"> 134</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, successor_node_value);</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, successor_node_value);</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value = successor_node_value;</div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value == <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left && <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 133</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">T</a> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">successor_node_value</a>{};</div>
|
||||
<div class="line"><span class="lineno"> 134</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">successor_node_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">successor_node_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">successor_node_value</a>;</div>
|
||||
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left || <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 139</span> std::unique_ptr<bst_node>& non_null =</div>
|
||||
<div class="line"><span class="lineno"> 140</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left ? <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left : <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left || <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right) {</div>
|
||||
<div class="line"><span class="lineno"> 139</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::unique_ptr<bst_node></a>& <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">non_null</a> =</div>
|
||||
<div class="line"><span class="lineno"> 140</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left ? <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left : <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 141</span> </div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 143</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::move(non_null);</div>
|
||||
<div class="line"><span class="lineno"> 144</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
||||
<div class="line"><span class="lineno"> 145</span> parent->left = std::move(non_null);</div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a> == <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 143</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::move</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">non_null</a>);</div>
|
||||
<div class="line"><span class="lineno"> 144</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value < parent-></a><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 145</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">parent</a>->left = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::move</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">non_null</a>);</div>
|
||||
<div class="line"><span class="lineno"> 146</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> parent->right = std::move(non_null);</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">parent</a>->right = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">std::move</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">non_null</a>);</div>
|
||||
<div class="line"><span class="lineno"> 148</span> }</div>
|
||||
<div class="line"><span class="lineno"> 149</span> </div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 151</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a> == <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>.reset(<span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 154</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
||||
<div class="line"><span class="lineno"> 155</span> parent->left.reset(<span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 154</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value < parent-></a><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 155</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">parent</a>->left.reset(<span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 156</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 157</span> parent->right.reset(<span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 157</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">parent</a>->right.reset(<span class="keyword">nullptr</span>);</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="line"><span class="lineno"> 159</span> </div>
|
||||
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 161</span> }</div>
|
||||
<div class="line"><span class="lineno"> 162</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < node->value) {</div>
|
||||
<div class="line"><span class="lineno"> 163</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, rm_value);</div>
|
||||
<div class="line"><span class="lineno"> 162</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value < node-></a><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">value</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 163</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 164</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, rm_value);</div>
|
||||
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 166</span> }</div>
|
||||
<div class="line"><span class="lineno"> 167</span> }</div>
|
||||
<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00125">binary_search_tree2.cpp:125</a></div></div>
|
||||
@@ -892,7 +892,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -906,7 +906,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -924,11 +924,11 @@ false Otherwise. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 274</span> {</div>
|
||||
<div class="line"><span class="lineno"> 275</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
|
||||
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">if</span> (result) {</div>
|
||||
<div class="line"><span class="lineno"> 275</span> <span class="keywordtype">bool</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a> = <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">rm_value</a>);</div>
|
||||
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 277</span> <a class="code hl_variable" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>--;</div>
|
||||
<div class="line"><span class="lineno"> 278</span> }</div>
|
||||
<div class="line"><span class="lineno"> 279</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 279</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 280</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -939,7 +939,7 @@ false Otherwise. </dd></dl>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -953,7 +953,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -972,7 +972,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -990,7 +990,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -1006,13 +1006,13 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 198</span> {</div>
|
||||
<div class="line"><span class="lineno"> 199</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 199</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 200</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 201</span> }</div>
|
||||
<div class="line"><span class="lineno"> 202</span> </div>
|
||||
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 204</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 205</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 204</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 205</span> <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 206</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -1023,7 +1023,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -1041,7 +1041,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -1057,13 +1057,13 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00231">231</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 232</span> {</div>
|
||||
<div class="line"><span class="lineno"> 233</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 233</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 234</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 235</span> }</div>
|
||||
<div class="line"><span class="lineno"> 236</span> </div>
|
||||
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 238</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 239</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 238</span> <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 239</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 240</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -1074,7 +1074,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -1092,7 +1092,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -1108,13 +1108,13 @@ template<class T > </div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 215</span> {</div>
|
||||
<div class="line"><span class="lineno"> 216</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 216</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 217</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 218</span> }</div>
|
||||
<div class="line"><span class="lineno"> 219</span> </div>
|
||||
<div class="line"><span class="lineno"> 220</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 221</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 222</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 220</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->value);</div>
|
||||
<div class="line"><span class="lineno"> 221</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->left);</div>
|
||||
<div class="line"><span class="lineno"> 222</span> <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(<a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">callback</a>, <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">node</a>->right);</div>
|
||||
<div class="line"><span class="lineno"> 223</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -1126,7 +1126,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -1137,7 +1137,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -1153,7 +1153,7 @@ template<class T > </div>
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<class T > </div>
|
||||
template<class T> </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
@@ -1164,7 +1164,7 @@ template<class T > </div>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -1183,7 +1183,7 @@ template<class T > </div>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user