backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-22 04:42:10 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

90
df/d42/binary__search__tree2_8cpp.html
View File

@@ -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.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/binary_search_tree2.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,9 +113,6 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../'); ini
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">binary_search_tree2.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -138,55 +127,44 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../'); ini
</div><div class="textblock"><div class="dynheader">
Include dependency graph for binary_search_tree2.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d33/binary__search__tree2_8cpp__incl.svg" width="446" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../de/d33/binary__search__tree2_8cpp__incl.svg" width="446" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../df/d42/binary__search__tree2_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td></tr>
<tr class="memitem:binary_5Fsearch_5Ftree_3C_20T_20_3E" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">The Binary Search Tree class. <a href="../../d9/dde/classbinary__search__tree.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree&lt; T &gt;::bst_node</a></td></tr>
<tr class="memitem:binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_5Fnode" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_5Fnode"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree&lt; T &gt;::bst_node</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A struct to represent a node in the Binary Search Tree. <a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a8c882f43e1e52948a7841a8bfb091350" id="r_a8c882f43e1e52948a7841a8bfb091350"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a> ()</td></tr>
<tr class="memdesc:a8c882f43e1e52948a7841a8bfb091350"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing <a class="el" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" title="inserts a new element into AVL tree">insert()</a>. <br /></td></tr>
<tr class="separator:a8c882f43e1e52948a7841a8bfb091350"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab1333c3ea06dcad896ee204bbd407c4e" id="r_ab1333c3ea06dcad896ee204bbd407c4e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a> ()</td></tr>
<tr class="memdesc:ab1333c3ea06dcad896ee204bbd407c4e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing remove(). <br /></td></tr>
<tr class="separator:ab1333c3ea06dcad896ee204bbd407c4e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1d42876440ac5346e2850a32497385c3" id="r_a1d42876440ac5346e2850a32497385c3"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1d42876440ac5346e2850a32497385c3">test_contains</a> ()</td></tr>
<tr class="memdesc:a1d42876440ac5346e2850a32497385c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing contains(). <br /></td></tr>
<tr class="separator:a1d42876440ac5346e2850a32497385c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af2847a901160fd45b4044550e9921cb4" id="r_af2847a901160fd45b4044550e9921cb4"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2847a901160fd45b4044550e9921cb4">test_find_min</a> ()</td></tr>
<tr class="memdesc:af2847a901160fd45b4044550e9921cb4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing find_min(). <br /></td></tr>
<tr class="separator:af2847a901160fd45b4044550e9921cb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9856b68e2cba50d2e26a1cbe374e0365" id="r_a9856b68e2cba50d2e26a1cbe374e0365"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a> ()</td></tr>
<tr class="memdesc:a9856b68e2cba50d2e26a1cbe374e0365"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing find_max(). <br /></td></tr>
<tr class="separator:a9856b68e2cba50d2e26a1cbe374e0365"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a06f35064850e891d6fda0093c0d9ee6e" id="r_a06f35064850e891d6fda0093c0d9ee6e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a> ()</td></tr>
<tr class="memdesc:a06f35064850e891d6fda0093c0d9ee6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_inorder(). <br /></td></tr>
<tr class="separator:a06f35064850e891d6fda0093c0d9ee6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab00b8d0f21aeb5fbddb6decf3bcb640a" id="r_ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a> ()</td></tr>
<tr class="memdesc:ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_preorder(). <br /></td></tr>
<tr class="separator:ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94b76f781fcbe1ad0e3397ace6bb1965" id="r_a94b76f781fcbe1ad0e3397ace6bb1965"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a> ()</td></tr>
<tr class="memdesc:a94b76f781fcbe1ad0e3397ace6bb1965"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_postorder(). <br /></td></tr>
<tr class="separator:a94b76f781fcbe1ad0e3397ace6bb1965"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a>. </p>
<dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html" title="A simple tree implementation using structured nodes.">binary_search_tree.cpp</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
</div><h2 class="groupheader">Function Documentation</h2>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -234,7 +212,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_contains </td>
<td class="memname">void test_contains </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -248,7 +226,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing contains(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00429">429</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"> 429</span> {</div>
@@ -284,7 +262,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_find_max </td>
<td class="memname">void test_find_max </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -298,7 +276,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing find_max(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00475">475</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"> 475</span> {</div>
@@ -332,7 +310,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_find_min </td>
<td class="memname">void test_find_min </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -346,7 +324,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing find_min(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00452">452</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"> 452</span> {</div>
@@ -380,7 +358,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_get_elements_inorder </td>
<td class="memname">void test_get_elements_inorder </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -394,7 +372,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing get_elements_inorder(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00498">498</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"> 498</span> {</div>
@@ -426,7 +404,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_get_elements_postorder </td>
<td class="memname">void test_get_elements_postorder </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -440,7 +418,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing get_elements_postorder(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00540">540</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"> 540</span> {</div>
@@ -472,7 +450,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_get_elements_preorder </td>
<td class="memname">void test_get_elements_preorder </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -486,7 +464,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing get_elements_preorder(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00519">519</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"> 519</span> {</div>
@@ -518,7 +496,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_insert </td>
<td class="memname">void test_insert </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -532,7 +510,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing <a class="el" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" title="inserts a new element into AVL tree">insert()</a>. </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00358">358</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"> 358</span> {</div>
@@ -577,7 +555,7 @@ Functions</h2></td></tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_remove </td>
<td class="memname">void test_remove </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
@@ -591,7 +569,7 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p>Function for testing remove(). </p>
<dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">void</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00392">392</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"> 392</span> {</div>
@@ -631,11 +609,19 @@ Functions</h2></td></tr>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</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.13.2 </li>
<li class="navelem"><a href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</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.14.0 </li>
</ul>
</div>
</body>