backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 19:41:16 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 2dadbf73f4

Browse Source
This commit is contained in:
github-actions
2024-02-12 20:07:08 +00:00
parent b5b4d78981
commit a1eb9bd385
1261 changed files with 30404 additions and 29974 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
d8/d01/struct_item-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('db/d66/struct_item.html','../../'); initResizable(); });
$(function(){initNavTree('db/d66/struct_item.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('db/d66/struct_item.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d10/structlist.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: list Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d10/structlist.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d10/structlist.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -131,7 +133,7 @@ struct <a class="el" href="../../d8/d10/structlist.html">list</a> *&#160;</td><t
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d10/structlist.html">list</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

17
d8/d13/bubble__sort_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/bubble_sort.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d13/bubble__sort_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d13/bubble__sort_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -115,7 +117,7 @@ Include dependency graph for bubble_sort.cpp:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></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="../../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
@@ -138,8 +140,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -201,7 +202,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/d13/bubble__sort_8cpp.html">bubble_sort.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d14/namespacen__queens__optimized.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: n_queens_optimized Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d14/namespacen__queens__optimized.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d14/namespacen__queens__optimized.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d14/namespacen__queens__optimized.h
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized.
<a href="../../d8/d14/namespacen__queens__optimized.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d14/namespacen__queens__optimized.h
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d1d/namespacestrand.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: strand Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d1d/namespacestrand.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d1d/namespacestrand.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d1d/namespacestrand.html','../../')
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm.
<a href="../../d8/d1d/namespacestrand.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d1d/namespacestrand.html','../../')
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d1d/namespacestrand.html">strand</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d20/classuint256__t-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d1/d83/classuint256__t.html','../../'); initResizable(); });
$(function(){initNavTree('d1/d83/classuint256__t.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -192,7 +194,7 @@ $(document).ready(function(){initNavTree('d1/d83/classuint256__t.html','../../')
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html','../../'); initResizable(); });
$(function(){initNavTree('d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -128,7 +130,7 @@ $(document).ready(function(){initNavTree('d4/df4/classmachine__learning_1_1neura
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

212
d8/d28/classrange__queries_1_1per_seg_tree.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: range_queries::perSegTree Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_tree.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_tree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_
<div class="contents">
<p>Range query here is range sum, but the code can be modified to make different queries like range max or min.
<a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for range_queries::perSegTree:</div>
<div class="dyncontent">
@@ -122,34 +124,34 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ac83bcabf5a8db8b0d8d156a4c1bcd4c3" id="r_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>)</td></tr>
<tr class="memitem:ac83bcabf5a8db8b0d8d156a4c1bcd4c3" id="r_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>)</td></tr>
<tr class="memdesc:ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed in the pointers vector to have access to the original version if the segment tree is updated. <br /></td></tr>
<tr class="separator:ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af87494e6cf012d28c4f5b9d1c15f9c5d" id="r_af87494e6cf012d28c4f5b9d1c15f9c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">update</a> (const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)</td></tr>
<tr class="memitem:af87494e6cf012d28c4f5b9d1c15f9c5d" id="r_af87494e6cf012d28c4f5b9d1c15f9c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af87494e6cf012d28c4f5b9d1c15f9c5d">update</a> (const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)</td></tr>
<tr class="memdesc:af87494e6cf012d28c4f5b9d1c15f9c5d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Doing range update by passing the left and right indexes of the range as well as the value to be added. <br /></td></tr>
<tr class="separator:af87494e6cf012d28c4f5b9d1c15f9c5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad484002bcb701820d55f32ea5d525571" id="r_ad484002bcb701820d55f32ea5d525571"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">query</a> (const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)</td></tr>
<tr class="memitem:ad484002bcb701820d55f32ea5d525571" id="r_ad484002bcb701820d55f32ea5d525571"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad484002bcb701820d55f32ea5d525571">query</a> (const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)</td></tr>
<tr class="memdesc:ad484002bcb701820d55f32ea5d525571"><td class="mdescLeft">&#160;</td><td class="mdescRight">Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l&lt;=x&lt;=r. <br /></td></tr>
<tr class="separator:ad484002bcb701820d55f32ea5d525571"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0fe4e431f3e09c274ecd7d2d58dcb865" id="r_a0fe4e431f3e09c274ecd7d2d58dcb865"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a> ()</td></tr>
<tr class="memitem:a0fe4e431f3e09c274ecd7d2d58dcb865" id="r_a0fe4e431f3e09c274ecd7d2d58dcb865"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a> ()</td></tr>
<tr class="memdesc:a0fe4e431f3e09c274ecd7d2d58dcb865"><td class="mdescLeft">&#160;</td><td class="mdescRight">Getting the number of versions after updates so far which is equal to the size of the pointers vector. <br /></td></tr>
<tr class="separator:a0fe4e431f3e09c274ecd7d2d58dcb865"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a0cec4b77d264521717cf9b0482c45817" id="r_a0cec4b77d264521717cf9b0482c45817"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memitem:a0cec4b77d264521717cf9b0482c45817" id="r_a0cec4b77d264521717cf9b0482c45817"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memdesc:a0cec4b77d264521717cf9b0482c45817"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creating a new node with the same values of curr node. <br /></td></tr>
<tr class="separator:a0cec4b77d264521717cf9b0482c45817"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ace7f57935b3bb9446f11c239fd89ae79" id="r_ace7f57935b3bb9446f11c239fd89ae79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a> (const uint32_t &amp;i, const uint32_t &amp;j, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memitem:ace7f57935b3bb9446f11c239fd89ae79" id="r_ace7f57935b3bb9446f11c239fd89ae79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a> (const uint32_t &amp;i, const uint32_t &amp;j, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memdesc:ace7f57935b3bb9446f11c239fd89ae79"><td class="mdescLeft">&#160;</td><td class="mdescRight">If there is some value to be propagated to the passed node, value is added to the node and the children of the node, if exist, are copied and the propagated value is also added to them. <br /></td></tr>
<tr class="separator:ace7f57935b3bb9446f11c239fd89ae79"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d3f2465a7c5803a1ff16c5378bcc5e4" id="r_a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a> (const uint32_t &amp;i, const uint32_t &amp;j)</td></tr>
<tr class="memitem:a6d3f2465a7c5803a1ff16c5378bcc5e4" id="r_a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a> (const uint32_t &amp;i, const uint32_t &amp;j)</td></tr>
<tr class="memdesc:a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum of the given range, set its pointers to the children, and set its value to the sum of the children's values. <br /></td></tr>
<tr class="separator:a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a24487eda25123bc4d112e8430821a6c6" id="r_a24487eda25123bc4d112e8430821a6c6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memitem:a24487eda25123bc4d112e8430821a6c6" id="r_a24487eda25123bc4d112e8430821a6c6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a24487eda25123bc4d112e8430821a6c6">update</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memdesc:a24487eda25123bc4d112e8430821a6c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Doing range update, checking at every node if it has some value to be propagated. All nodes affected by the update are copied and propagation value is added to the leaf of them. <br /></td></tr>
<tr class="separator:a24487eda25123bc4d112e8430821a6c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae8ae4b1835e5e8aec32f68c5059ed4d4" id="r_ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memitem:ae8ae4b1835e5e8aec32f68c5059ed4d4" id="r_ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
<tr class="memdesc:ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Querying the range from index l to index r, checking at every node if it has some value to be propagated. Current node's value is returned if its range is completely inside the wanted range, else 0 is returned. <br /></td></tr>
<tr class="separator:ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -158,10 +160,10 @@ Private Attributes</h2></td></tr>
<tr class="memitem:a6f5b36111f90807a9fdf6bbca04f535e" id="r_a6f5b36111f90807a9fdf6bbca04f535e"><td class="memItemLeft" align="right" valign="top"><a id="a6f5b36111f90807a9fdf6bbca04f535e" name="a6f5b36111f90807a9fdf6bbca04f535e"></a>
uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
<tr class="separator:a6f5b36111f90807a9fdf6bbca04f535e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1eac9cf0613dfc8e2b0195009dd5c9d5" id="r_a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a> {}</td></tr>
<tr class="memitem:a1eac9cf0613dfc8e2b0195009dd5c9d5" id="r_a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a> {}</td></tr>
<tr class="memdesc:a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of elements/leaf nodes in the segment tree <br /></td></tr>
<tr class="separator:a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8ff495d2f389b4aaa54449c26c6078f3" id="r_a8ff495d2f389b4aaa54449c26c6078f3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a> {}</td></tr>
<tr class="memitem:a8ff495d2f389b4aaa54449c26c6078f3" id="r_a8ff495d2f389b4aaa54449c26c6078f3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a> {}</td></tr>
<tr class="separator:a8ff495d2f389b4aaa54449c26c6078f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -179,8 +181,7 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></t
<tr>
<td class="memname">void range_queries::perSegTree::construct </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;&#160;</td>
<td class="paramname"><em>vec</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -200,17 +201,17 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></t
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 200</span> {</div>
<div class="line"><span class="lineno"> 201</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
<div class="line"><span class="lineno"> 201</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 203</span> }</div>
<div class="line"><span class="lineno"> 204</span> n = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 205</span> this-&gt;vec = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>;</div>
<div class="line"><span class="lineno"> 206</span> <span class="keyword">auto</span> root = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(0, n - 1);</div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(root);</div>
<div class="line"><span class="lineno"> 204</span> n = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 205</span> this-&gt;vec = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>;</div>
<div class="line"><span class="lineno"> 206</span> <span class="keyword">auto</span> root = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(0, n - 1);</div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(root);</div>
<div class="line"><span class="lineno"> 208</span> }</div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:54</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:106</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; vec</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:57</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:54</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:106</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; vec</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:57</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
@@ -234,19 +235,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::construct </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>i</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>i</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>j</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>j</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -268,17 +262,18 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 106</span> {</div>
<div class="line"><span class="lineno"> 107</span> <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (i == j) {</div>
<div class="line"><span class="lineno"> 109</span> newNode-&gt;val = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>[i];</div>
<div class="line"><span class="lineno"> 109</span> newNode-&gt;val = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>[i];</div>
<div class="line"><span class="lineno"> 110</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 111</span> uint32_t mid = i + (j - i) / 2;</div>
<div class="line"><span class="lineno"> 112</span> <span class="keyword">auto</span> leftt = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(i, mid);</div>
<div class="line"><span class="lineno"> 113</span> <span class="keyword">auto</span> right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
<div class="line"><span class="lineno"> 114</span> newNode-&gt;val = leftt-&gt;val + right-&gt;val;</div>
<div class="line"><span class="lineno"> 112</span> <span class="keyword">auto</span> leftt = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(i, mid);</div>
<div class="line"><span class="lineno"> 113</span> <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
<div class="line"><span class="lineno"> 114</span> newNode-&gt;val = leftt-&gt;val + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;val;</div>
<div class="line"><span class="lineno"> 115</span> newNode-&gt;left = leftt;</div>
<div class="line"><span class="lineno"> 116</span> newNode-&gt;right = right;</div>
<div class="line"><span class="lineno"> 116</span> newNode-&gt;right = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>;</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> newNode;</div>
<div class="line"><span class="lineno"> 119</span> }</div>
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -300,25 +295,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void range_queries::perSegTree::lazy </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>i</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>i</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>j</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>j</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;&#160;</td>
<td class="paramname"><em>curr</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td> <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -344,14 +331,14 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 87</span> }</div>
<div class="line"><span class="lineno"> 88</span> curr-&gt;val += (j - i + 1) * curr-&gt;prop;</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">if</span> (i != j) {</div>
<div class="line"><span class="lineno"> 90</span> curr-&gt;left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;left);</div>
<div class="line"><span class="lineno"> 91</span> curr-&gt;right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;right);</div>
<div class="line"><span class="lineno"> 90</span> curr-&gt;left = <a class="code hl_function" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;left);</div>
<div class="line"><span class="lineno"> 91</span> curr-&gt;right = <a class="code hl_function" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;right);</div>
<div class="line"><span class="lineno"> 92</span> curr-&gt;left-&gt;prop += curr-&gt;prop;</div>
<div class="line"><span class="lineno"> 93</span> curr-&gt;right-&gt;prop += curr-&gt;prop;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="line"><span class="lineno"> 95</span> curr-&gt;prop = 0;</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; newKid(std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:65</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; newKid(std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:65</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -372,8 +359,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::newKid </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;&#160;</td>
<td class="paramname"><em>curr</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td> <td class="paramname"><span class="paramname"><em>curr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -415,37 +401,27 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int64_t range_queries::perSegTree::query </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>i</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>i</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>j</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>j</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;&#160;</td>
<td class="paramname"><em>curr</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td> <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -468,7 +444,7 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>sum of elements whose index x satisfies l&lt;=x&lt;=r </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 172</span> {</div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_function" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
<div class="line"><span class="lineno"> 174</span> <span class="keywordflow">if</span> (j &lt; l || r &lt; i) {</div>
<div class="line"><span class="lineno"> 175</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 176</span> }</div>
@@ -476,15 +452,15 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">return</span> curr-&gt;val;</div>
<div class="line"><span class="lineno"> 179</span> }</div>
<div class="line"><span class="lineno"> 180</span> uint32_t mid = i + (j - i) / 2;</div>
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">return</span> <a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a>(i, mid, l, r, curr-&gt;left) +</div>
<div class="line"><span class="lineno"> 182</span> <a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a>(mid + 1, j, l, r, curr-&gt;right);</div>
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, mid, l, r, curr-&gt;left) +</div>
<div class="line"><span class="lineno"> 182</span> <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(mid + 1, j, l, r, curr-&gt;right);</div>
<div class="line"><span class="lineno"> 183</span> }</div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:83</div></div>
<div class="ttc" id="astructquery_html"><div class="ttname"><a href="../../dd/d1b/structquery.html">query</a></div><div class="ttdef"><b>Definition</b> mo.cpp:6</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:83</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:171</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg" width="639" height="52"><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" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg" width="639" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -501,25 +477,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int64_t range_queries::perSegTree::query </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>version</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>version</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -540,9 +508,14 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>sum of elements whose index x satisfies l&lt;=x&lt;=r </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 246</span> {</div>
<div class="line"><span class="lineno"> 247</span> <span class="keywordflow">return</span> <a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a>(0, n - 1, l, r, <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[version]);</div>
<div class="line"><span class="lineno"> 247</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(0, n - 1, l, r, <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[version]);</div>
<div class="line"><span class="lineno"> 248</span> }</div>
</div><!-- fragment -->
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
</div>
<a id="a0fe4e431f3e09c274ecd7d2d58dcb865" name="a0fe4e431f3e09c274ecd7d2d58dcb865"></a>
@@ -557,7 +530,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint32_t range_queries::perSegTree::size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -571,7 +544,7 @@ Here is the call graph for this function:</div>
<p>Getting the number of versions after updates so far which is equal to the size of the pointers vector. </p>
<dl class="section return"><dt>Returns</dt><dd>the number of versions </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 258</span> {</div>
<div class="line"><span class="lineno"> 259</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 259</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 260</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -593,43 +566,32 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::update </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>i</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>i</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>j</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>j</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int64_t &amp;&#160;</td>
<td class="paramname"><em>value</em>, </td>
<td class="paramtype">const int64_t &amp;</td> <td class="paramname"><span class="paramname"><em>value</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;&#160;</td>
<td class="paramname"><em>curr</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td> <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -653,11 +615,11 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>pointer to the current newly created node </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">if</span> (i &gt;= l &amp;&amp; j &lt;= r) {</div>
<div class="line"><span class="lineno"> 141</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> newNode = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
<div class="line"><span class="lineno"> 141</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> newNode = <a class="code hl_function" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
<div class="line"><span class="lineno"> 142</span> newNode-&gt;prop += value;</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, newNode);</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, newNode);</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> newNode;</div>
<div class="line"><span class="lineno"> 145</span> }</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">if</span> (i &gt; r || j &lt; l) {</div>
@@ -665,12 +627,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 148</span> }</div>
<div class="line"><span class="lineno"> 149</span> <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
<div class="line"><span class="lineno"> 150</span> uint32_t mid = i + (j - i) / 2;</div>
<div class="line"><span class="lineno"> 151</span> newNode-&gt;left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(i, mid, l, r, value, curr-&gt;left);</div>
<div class="line"><span class="lineno"> 152</span> newNode-&gt;right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(mid + 1, j, l, r, value, curr-&gt;right);</div>
<div class="line"><span class="lineno"> 151</span> newNode-&gt;left = <a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(i, mid, l, r, value, curr-&gt;left);</div>
<div class="line"><span class="lineno"> 152</span> newNode-&gt;right = <a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(mid + 1, j, l, r, value, curr-&gt;right);</div>
<div class="line"><span class="lineno"> 153</span> newNode-&gt;val = newNode-&gt;left-&gt;val + newNode-&gt;right-&gt;val;</div>
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">return</span> newNode;</div>
<div class="line"><span class="lineno"> 155</span> }</div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:135</div></div>
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:135</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -692,25 +654,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void range_queries::perSegTree::update </td>
<td>(</td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int64_t &amp;&#160;</td>
<td class="paramname"><em>value</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const int64_t &amp;</td> <td class="paramname"><span class="paramname"><em>value</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -731,9 +685,9 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 223</span> {</div>
<div class="line"><span class="lineno"> 224</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
<div class="line"><span class="lineno"> 224</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
<div class="line"><span class="lineno"> 225</span> 0, n - 1, l, r, value,</div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() -</div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() -</div>
<div class="line"><span class="lineno"> 227</span> 1])); <span class="comment">// saving the root pointer to the new segment tree</span></div>
<div class="line"><span class="lineno"> 228</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -803,7 +757,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

10
d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map Normal file
View File

@@ -0,0 +1,10 @@
<map id="range_queries::perSegTree::query" name="range_queries::perSegTree::query">
<area shape="rect" id="Node000001" title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l..." alt="" coords="5,29,183,70"/>
<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="231,29,408,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,47,215,47,215,52,183,52"/>
<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="277,29,275,19,282,10,297,5,319,3,344,5,358,11,356,16,342,10,319,8,298,10,285,15,280,21,282,28"/>
<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="456,29,633,70"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="408,47,440,47,440,52,408,52"/>
<area shape="rect" id="Node000004" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="681,29,859,70"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="633,47,666,47,666,52,633,52"/>
</map>

1
d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
d87ad1a779660183ec12d19bde9a55cd

170
d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg Normal file
View File

@@ -0,0 +1,170 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: range_queries::perSegTree::query Pages: 1 -->
<!--zoomable 57 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
</g>
</defs>
<script type="application/ecmascript">
var viewWidth = 648;
var viewHeight = 57;
var sectionId = 'dynsection-5';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>range_queries::perSegTree::query</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...">
<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge4_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M205.55,-30.99C199.44,-40.06 209.42,-48.5 235.5,-48.5 249.76,-48.5 259.21,-45.97 263.84,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-42.88 265.23,-32.48 260.35,-41.89 267.28,-42.88"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
<polygon fill="white" stroke="#666666" points="640,-30.5 507,-30.5 507,0 640,0 640,-30.5"/>
<text text-anchor="start" x="515" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="573.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M471.02,-15.25C478.97,-15.25 487.15,-15.25 495.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-18.75 505.1,-15.25 495.1,-11.75 495.1,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.5 KiB

88
d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg Normal file
View File

@@ -0,0 +1,88 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: range_queries::perSegTree::query Pages: 1 -->
<svg width="648pt" height="57pt"
viewBox="0.00 0.00 648.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>range_queries::perSegTree::query</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...">
<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge4_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M205.55,-30.99C199.44,-40.06 209.42,-48.5 235.5,-48.5 249.76,-48.5 259.21,-45.97 263.84,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-42.88 265.23,-32.48 260.35,-41.89 267.28,-42.88"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
<polygon fill="white" stroke="#666666" points="640,-30.5 507,-30.5 507,0 640,0 640,-30.5"/>
<text text-anchor="start" x="515" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="573.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M471.02,-15.25C478.97,-15.25 487.15,-15.25 495.25,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-18.75 505.1,-15.25 495.1,-11.75 495.1,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.6 KiB

11
d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map
View File

@@ -1,7 +1,8 @@
<map id="range_queries::perSegTree::query" name="range_queries::perSegTree::query">
<area shape="rect" id="Node000001" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="5,5,183,46"/>
<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="231,5,408,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,23,215,23,215,28,183,28"/>
<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="456,5,633,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="408,23,440,23,440,28,408,28"/>
<area shape="rect" id="Node000001" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="5,29,183,70"/>
<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,56,10,71,5,94,3,118,5,133,11,131,16,117,10,94,8,73,10,60,15,55,21,57,28"/>
<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="231,29,408,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,47,215,47,215,52,183,52"/>
<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="456,29,633,70"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="408,47,440,47,440,52,408,52"/>
</map>

2
d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5
View File

@@ -1 +1 @@
49b1384190e585e38d4d2029d902fd45
991b705637377a9d6d81be7be1aa5a0b

15
d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: range_queries::perSegTree::query Pages: 1 -->
<svg width="479pt" height="39pt"
viewBox="0.00 0.00 479.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="479pt" height="57pt"
viewBox="0.00 0.00 479.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,7 +16,7 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>range_queries::perSegTree::query</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -28,6 +28,15 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M36.55,-30.99C30.44,-40.06 40.42,-48.5 66.5,-48.5 80.76,-48.5 90.21,-45.97 94.84,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-42.88 96.23,-32.48 91.35,-41.89 98.28,-42.88"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

15
d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: range_queries::perSegTree::query Pages: 1 -->
<svg width="479pt" height="39pt"
viewBox="0.00 0.00 479.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<svg width="479pt" height="57pt"
viewBox="0.00 0.00 479.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>range_queries::perSegTree::query</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -18,6 +18,15 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M36.55,-30.99C30.44,-40.06 40.42,-48.5 66.5,-48.5 80.76,-48.5 90.21,-45.97 94.84,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-42.88 96.23,-32.48 91.35,-41.89 98.28,-42.88"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.5 KiB

2
d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg
View File

@@ -48,7 +48,7 @@
<script type="application/ecmascript">
var viewWidth = 648;
var viewHeight = 131;
var sectionId = 'dynsection-7';
var sectionId = 'dynsection-8';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 11 KiB

14
d8/d2a/namespacea1z26.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: a1z26 Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d2a/namespacea1z26.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d2a/namespacea1z26.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d2a/namespacea1z26.html','../../');
<div class="contents">
<p>Functions for <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26</a> encryption and decryption implementation.
<a href="../../d8/d2a/namespacea1z26.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26</a> encryption and decryption implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d2a/namespacea1z26.html','../../');
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d2a/namespacea1z26.html">a1z26</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d36/namespacecut__rod.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: cut_rod Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d36/namespacecut__rod.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d36/namespacecut__rod.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d36/namespacecut__rod.html','../../
<div class="contents">
<p>Implementation of cutting a rod problem.
<a href="../../d8/d36/namespacecut__rod.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of cutting a rod problem. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d36/namespacecut__rod.html','../../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d36/namespacecut__rod.html">cut_rod</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d38/structquery-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('dd/d1b/structquery.html','../../'); initResizable(); });
$(function(){initNavTree('dd/d1b/structquery.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('dd/d1b/structquery.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

22
d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map
View File

@@ -1,14 +1,14 @@
<map id="data_structures::BloomFilter&lt; T &gt;" name="data_structures::BloomFilter&lt; T &gt;">
<area shape="rect" id="Node000001" title="Bloom filter template class." alt="" coords="167,301,385,327"/>
<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html" title="Simple bitset implementation for bloom filter." alt="" coords="107,205,261,231"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="208,240,266,299,262,303,204,244"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="110,102,279,127"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="194,143,188,205,182,204,189,142"/>
<area shape="rect" id="Node000001" title="Bloom filter template class." alt="" coords="135,286,353,312"/>
<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html" title="Simple bitset implementation for bloom filter." alt="" coords="75,190,229,216"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,225,234,284,230,288,172,229"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="110,94,279,120"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="185,135,160,191,155,189,180,133"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="5,5,88,31"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="39,46,31,89,32,112,40,133,59,158,84,177,112,191,139,202,137,207,110,196,81,181,56,161,35,136,27,113,25,89,34,45"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="80,37,177,99,174,103,77,42"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="284,198,452,238"/>
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="340,251,289,303,285,299,336,248"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/functional/function.html" title=" " alt="" coords="306,94,430,135"/>
<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="371,150,371,197,365,197,365,150"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="39,46,33,82,34,101,40,118,56,141,77,161,123,187,120,192,74,165,52,145,35,121,29,102,28,82,34,45"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="81,37,175,91,172,96,79,41"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="252,183,420,223"/>
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="308,236,257,288,253,284,304,233"/>
<area shape="rect" id="Node000006" title=" " alt="" coords="317,94,355,120"/>
<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="339,135,339,182,333,182,333,135"/>
</map>

2
d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5
View File

@@ -1 +1 @@
d829501ad3379c32837a3226b67e5f41
864119e941297c9ddafe2c5174f0cfc9

71
d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::BloomFilter&lt; T &gt; Pages: 1 -->
<svg width="343pt" height="249pt"
viewBox="0.00 0.00 342.62 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="319pt" height="238pt"
viewBox="0.00 0.00 318.62 238.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,14 +16,14 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 234)">
<title>data_structures::BloomFilter&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Bloom filter template class.">
<polygon fill="#999999" stroke="#666666" points="284.38,-19.25 121.38,-19.25 121.38,0 284.38,0 284.38,-19.25"/>
<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
<polygon fill="#999999" stroke="#666666" points="260.38,-19.25 97.38,-19.25 97.38,0 260.38,0 260.38,-19.25"/>
<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
</a>
</g>
</g>
@@ -31,8 +31,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html" target="_top" xlink:title="Simple bitset implementation for bloom filter.">
<polygon fill="white" stroke="#666666" points="191.38,-91.38 76.38,-91.38 76.38,-72.12 191.38,-72.12 191.38,-91.38"/>
<text text-anchor="middle" x="133.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
<polygon fill="white" stroke="#666666" points="167.38,-91.38 52.38,-91.38 52.38,-72.12 167.38,-72.12 167.38,-91.38"/>
<text text-anchor="middle" x="109.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
</a>
</g>
</g>
@@ -40,18 +40,18 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M150.34,-64.02C164.03,-50.11 182.99,-30.84 193.99,-19.66"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="148.19,-61.21 143.68,-70.79 153.18,-66.12 148.19,-61.21"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.34,-64.02C140.03,-50.11 158.99,-30.84 169.99,-19.66"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="124.19,-61.21 119.68,-70.79 129.18,-66.12 124.19,-61.21"/>
</a>
</g>
<text text-anchor="middle" x="185.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
<text text-anchor="middle" x="161.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="205,-169.12 78.75,-169.12 78.75,-149.88 205,-149.88 205,-169.12"/>
<text text-anchor="middle" x="141.88" y="-155.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
<polygon fill="white" stroke="#666666" points="205,-163.5 78.75,-163.5 78.75,-144.25 205,-144.25 205,-163.5"/>
<text text-anchor="middle" x="141.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
</a>
</g>
</g>
@@ -59,18 +59,18 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M139.73,-138.22C138.13,-123.08 136.03,-103.11 134.82,-91.73"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="136.24,-138.43 140.77,-148.01 143.2,-137.7 136.24,-138.43"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M133.14,-133.73C126.91,-120.08 118.81,-102.33 114,-91.78"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="129.86,-134.97 137.19,-142.62 136.23,-132.07 129.86,-134.97"/>
</a>
</g>
<text text-anchor="middle" x="149.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
<text text-anchor="middle" x="140.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="61.75,-241.25 0,-241.25 0,-222 61.75,-222 61.75,-241.25"/>
<text text-anchor="middle" x="30.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
<polygon fill="white" stroke="#bfbfbf" points="61.75,-230 0,-230 0,-210.75 61.75,-210.75 61.75,-230"/>
<text text-anchor="middle" x="30.88" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
</a>
</g>
</g>
@@ -78,29 +78,29 @@
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node4&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.24,-210.89C17.41,-192.38 12.21,-164.58 24.12,-144.25 40.25,-116.74 73.68,-100.6 99.43,-91.82"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="19.86,-211.84 26.48,-220.11 26.46,-209.52 19.86,-211.84"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.58,-199.82C18.92,-183.97 15.26,-161.52 24.12,-144.25 37.26,-118.66 66.54,-101.33 87.22,-91.75"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="20.17,-200.65 26.66,-209.02 26.8,-198.43 20.17,-200.65"/>
</a>
</g>
<text text-anchor="middle" x="47.75" y="-155.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
<text text-anchor="middle" x="47.75" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M54.6,-215.64C76.77,-201.63 109.13,-181.19 127.58,-169.53"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="52.8,-212.64 46.21,-220.94 56.54,-218.55 52.8,-212.64"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.09,-204.72C77.65,-192.19 107.99,-174.56 126.21,-163.98"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.51,-201.6 47.62,-209.65 58.02,-207.65 54.51,-201.6"/>
</a>
</g>
<text text-anchor="middle" x="111.25" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="115.25" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="334.62,-97 209.12,-97 209.12,-66.5 334.62,-66.5 334.62,-97"/>
<text text-anchor="start" x="217.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
<text text-anchor="middle" x="271.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
<polygon fill="white" stroke="#666666" points="310.62,-97 185.12,-97 185.12,-66.5 310.62,-66.5 310.62,-97"/>
<text text-anchor="start" x="193.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
<text text-anchor="middle" x="247.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
</a>
</g>
</g>
@@ -108,19 +108,18 @@
<g id="edge5_Node000001_Node000005" class="edge">
<title>Node5&#45;&gt;Node1</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M249.53,-58.04C236.56,-44.86 220.96,-29.01 211.49,-19.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="247.01,-60.47 256.52,-65.14 252,-55.56 247.01,-60.47"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M225.53,-58.04C212.56,-44.86 196.96,-29.01 187.49,-19.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="223.01,-60.47 232.52,-65.14 228,-55.56 223.01,-60.47"/>
</a>
</g>
<text text-anchor="middle" x="265.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
<text text-anchor="middle" x="241.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/functional/function.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="318.12,-174.75 225.62,-174.75 225.62,-144.25 318.12,-144.25 318.12,-174.75"/>
<text text-anchor="start" x="233.62" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::function&lt; std</text>
<text text-anchor="middle" x="271.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">::size_t(T)&gt;</text>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="262.27,-163.5 233.47,-163.5 233.47,-144.25 262.27,-144.25 262.27,-163.5"/>
<text text-anchor="middle" x="247.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -128,11 +127,11 @@
<g id="edge6_Node000005_Node000006" class="edge">
<title>Node6&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M271.88,-132.47C271.88,-120.71 271.88,-107.26 271.88,-97.31"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="268.38,-132.38 271.88,-142.38 275.38,-132.38 268.38,-132.38"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M247.88,-132.67C247.88,-121.41 247.88,-107.64 247.88,-97.42"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="244.38,-132.48 247.88,-142.48 251.38,-132.48 244.38,-132.48"/>
</a>
</g>
<text text-anchor="middle" x="293.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="269.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.5 KiB

After

Width:  |  Height:  |  Size: 7.3 KiB

71
d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: data_structures::BloomFilter&lt; T &gt; Pages: 1 -->
<svg width="343pt" height="249pt"
viewBox="0.00 0.00 342.62 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
<svg width="319pt" height="238pt"
viewBox="0.00 0.00 318.62 238.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 234)">
<title>data_structures::BloomFilter&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Bloom filter template class.">
<polygon fill="#999999" stroke="#666666" points="284.38,-19.25 121.38,-19.25 121.38,0 284.38,0 284.38,-19.25"/>
<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
<polygon fill="#999999" stroke="#666666" points="260.38,-19.25 97.38,-19.25 97.38,0 260.38,0 260.38,-19.25"/>
<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html" target="_top" xlink:title="Simple bitset implementation for bloom filter.">
<polygon fill="white" stroke="#666666" points="191.38,-91.38 76.38,-91.38 76.38,-72.12 191.38,-72.12 191.38,-91.38"/>
<text text-anchor="middle" x="133.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
<polygon fill="white" stroke="#666666" points="167.38,-91.38 52.38,-91.38 52.38,-72.12 167.38,-72.12 167.38,-91.38"/>
<text text-anchor="middle" x="109.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
</a>
</g>
</g>
@@ -30,18 +30,18 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M150.34,-64.02C164.03,-50.11 182.99,-30.84 193.99,-19.66"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="148.19,-61.21 143.68,-70.79 153.18,-66.12 148.19,-61.21"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.34,-64.02C140.03,-50.11 158.99,-30.84 169.99,-19.66"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="124.19,-61.21 119.68,-70.79 129.18,-66.12 124.19,-61.21"/>
</a>
</g>
<text text-anchor="middle" x="185.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
<text text-anchor="middle" x="161.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="205,-169.12 78.75,-169.12 78.75,-149.88 205,-149.88 205,-169.12"/>
<text text-anchor="middle" x="141.88" y="-155.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
<polygon fill="white" stroke="#666666" points="205,-163.5 78.75,-163.5 78.75,-144.25 205,-144.25 205,-163.5"/>
<text text-anchor="middle" x="141.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
</a>
</g>
</g>
@@ -49,18 +49,18 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M139.73,-138.22C138.13,-123.08 136.03,-103.11 134.82,-91.73"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="136.24,-138.43 140.77,-148.01 143.2,-137.7 136.24,-138.43"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M133.14,-133.73C126.91,-120.08 118.81,-102.33 114,-91.78"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="129.86,-134.97 137.19,-142.62 136.23,-132.07 129.86,-134.97"/>
</a>
</g>
<text text-anchor="middle" x="149.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
<text text-anchor="middle" x="140.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="61.75,-241.25 0,-241.25 0,-222 61.75,-222 61.75,-241.25"/>
<text text-anchor="middle" x="30.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
<polygon fill="white" stroke="#bfbfbf" points="61.75,-230 0,-230 0,-210.75 61.75,-210.75 61.75,-230"/>
<text text-anchor="middle" x="30.88" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
</a>
</g>
</g>
@@ -68,29 +68,29 @@
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node4&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.24,-210.89C17.41,-192.38 12.21,-164.58 24.12,-144.25 40.25,-116.74 73.68,-100.6 99.43,-91.82"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="19.86,-211.84 26.48,-220.11 26.46,-209.52 19.86,-211.84"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.58,-199.82C18.92,-183.97 15.26,-161.52 24.12,-144.25 37.26,-118.66 66.54,-101.33 87.22,-91.75"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="20.17,-200.65 26.66,-209.02 26.8,-198.43 20.17,-200.65"/>
</a>
</g>
<text text-anchor="middle" x="47.75" y="-155.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
<text text-anchor="middle" x="47.75" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M54.6,-215.64C76.77,-201.63 109.13,-181.19 127.58,-169.53"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="52.8,-212.64 46.21,-220.94 56.54,-218.55 52.8,-212.64"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.09,-204.72C77.65,-192.19 107.99,-174.56 126.21,-163.98"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.51,-201.6 47.62,-209.65 58.02,-207.65 54.51,-201.6"/>
</a>
</g>
<text text-anchor="middle" x="111.25" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="115.25" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="334.62,-97 209.12,-97 209.12,-66.5 334.62,-66.5 334.62,-97"/>
<text text-anchor="start" x="217.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
<text text-anchor="middle" x="271.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
<polygon fill="white" stroke="#666666" points="310.62,-97 185.12,-97 185.12,-66.5 310.62,-66.5 310.62,-97"/>
<text text-anchor="start" x="193.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
<text text-anchor="middle" x="247.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
</a>
</g>
</g>
@@ -98,19 +98,18 @@
<g id="edge5_Node000001_Node000005" class="edge">
<title>Node5&#45;&gt;Node1</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M249.53,-58.04C236.56,-44.86 220.96,-29.01 211.49,-19.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="247.01,-60.47 256.52,-65.14 252,-55.56 247.01,-60.47"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M225.53,-58.04C212.56,-44.86 196.96,-29.01 187.49,-19.38"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="223.01,-60.47 232.52,-65.14 228,-55.56 223.01,-60.47"/>
</a>
</g>
<text text-anchor="middle" x="265.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
<text text-anchor="middle" x="241.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/functional/function.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="318.12,-174.75 225.62,-174.75 225.62,-144.25 318.12,-144.25 318.12,-174.75"/>
<text text-anchor="start" x="233.62" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::function&lt; std</text>
<text text-anchor="middle" x="271.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">::size_t(T)&gt;</text>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="262.27,-163.5 233.47,-163.5 233.47,-144.25 262.27,-144.25 262.27,-163.5"/>
<text text-anchor="middle" x="247.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -118,11 +117,11 @@
<g id="edge6_Node000005_Node000006" class="edge">
<title>Node6&#45;&gt;Node5</title>
<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M271.88,-132.47C271.88,-120.71 271.88,-107.26 271.88,-97.31"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="268.38,-132.38 271.88,-142.38 275.38,-132.38 268.38,-132.38"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M247.88,-132.67C247.88,-121.41 247.88,-107.64 247.88,-97.42"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="244.38,-132.48 247.88,-142.48 251.38,-132.48 244.38,-132.48"/>
</a>
</g>
<text text-anchor="middle" x="293.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="269.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.7 KiB

After

Width:  |  Height:  |  Size: 6.5 KiB

46
d8/d53/modular__inverse__fermat__little__theorem_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d53/modular__inverse__fermat__little__theorem_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d53/modular__inverse__fermat__little__theorem_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -115,11 +117,11 @@ Include dependency graph for modular_inverse_fermat_little_theorem.cpp:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a4c6eefd1254eab3e8d34bf02c205e0f4" id="r_a4c6eefd1254eab3e8d34bf02c205e0f4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a> (int64_t a, int64_t b, int64_t m)</td></tr>
<tr class="memitem:a4c6eefd1254eab3e8d34bf02c205e0f4" id="r_a4c6eefd1254eab3e8d34bf02c205e0f4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a> (int64_t a, int64_t b, int64_t m)</td></tr>
<tr class="separator:a4c6eefd1254eab3e8d34bf02c205e0f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a09660096b134753128952246f4f4e4bd" id="r_a09660096b134753128952246f4f4e4bd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">isPrime</a> (int64_t m)</td></tr>
<tr class="memitem:a09660096b134753128952246f4f4e4bd" id="r_a09660096b134753128952246f4f4e4bd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a09660096b134753128952246f4f4e4bd">isPrime</a> (int64_t m)</td></tr>
<tr class="separator:a09660096b134753128952246f4f4e4bd"><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="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
@@ -163,25 +165,17 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
<tr>
<td class="memname">int64_t binExpo </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>a</em>, </td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>a</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>b</em>, </td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>b</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>m</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>m</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -211,8 +205,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
<tr>
<td class="memname">bool isPrime </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>m</em></td><td>)</td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>m</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -242,8 +235,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -256,9 +248,9 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Give input &#39;a&#39; and &#39;m&#39; space separated : &quot;</span>;</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a &gt;&gt; m;</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">isPrime</a>(m)) {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a09660096b134753128952246f4f4e4bd">isPrime</a>(m)) {</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The modular inverse of a with mod m is (a^(m-2)) : &quot;</span>;</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a>(a, m - 2, m) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a>(a, m - 2, m) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 94</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;m must be a prime number.&quot;</span>;</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
@@ -267,8 +259,8 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a09660096b134753128952246f4f4e4bd"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">isPrime</a></div><div class="ttdeci">bool isPrime(int64_t m)</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:68</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a4c6eefd1254eab3e8d34bf02c205e0f4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a></div><div class="ttdeci">int64_t binExpo(int64_t a, int64_t b, int64_t m)</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:52</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a09660096b134753128952246f4f4e4bd"><div class="ttname"><a href="#a09660096b134753128952246f4f4e4bd">isPrime</a></div><div class="ttdeci">bool isPrime(int64_t m)</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:68</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a4c6eefd1254eab3e8d34bf02c205e0f4"><div class="ttname"><a href="#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a></div><div class="ttdeci">int64_t binExpo(int64_t a, int64_t b, int64_t m)</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:52</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -283,7 +275,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d55/class_cycle_check-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d3/dbb/class_cycle_check.html','../../'); initResizable(); });
$(function(){initNavTree('d3/dbb/class_cycle_check.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -115,7 +117,7 @@ $(document).ready(function(){initNavTree('d3/dbb/class_cycle_check.html','../../
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

53
d8/d61/radix__sort2_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/radix_sort2.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d61/radix__sort2_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d61/radix__sort2_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -127,16 +129,16 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a98ead7d43b11505398daf9a894f122f9" id="r_a98ead7d43b11505398daf9a894f122f9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a> (uint16_t cur_digit, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
<tr class="memitem:a98ead7d43b11505398daf9a894f122f9" id="r_a98ead7d43b11505398daf9a894f122f9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a> (uint16_t cur_digit, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
<tr class="memdesc:a98ead7d43b11505398daf9a894f122f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to sort vector according to current digit using stable sorting. <br /></td></tr>
<tr class="separator:a98ead7d43b11505398daf9a894f122f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae0cfd94fa3765b53d4ec7893ffaee5f8" id="r_ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
<tr class="memitem:ae0cfd94fa3765b53d4ec7893ffaee5f8" id="r_ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
<tr class="memdesc:ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to sort vector digit by digit. <br /></td></tr>
<tr class="separator:ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the above algorithm. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><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="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -157,8 +159,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -167,10 +168,10 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 117</span> {</div>
<div class="line"><span class="lineno"> 118</span> <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 118</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 120</span>}</div>
<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:102</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:102</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -188,8 +189,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; sorting::radix_sort::radix </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;&#160;</td>
<td class="paramname"><em>ar</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>ar</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -210,7 +210,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; max_ele / i &gt; 0;</div>
<div class="line"><span class="lineno"> 85</span> i *= 10) { <span class="comment">// loop breaks when i &gt; max_ele because no further digits</span></div>
<div class="line"><span class="lineno"> 86</span> <span class="comment">// left to makes changes in aray.</span></div>
<div class="line"><span class="lineno"> 87</span> temp = <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">step_ith</a>(i, temp);</div>
<div class="line"><span class="lineno"> 87</span> temp = <a class="code hl_function" href="#a98ead7d43b11505398daf9a894f122f9">step_ith</a>(i, temp);</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">for</span> (uint64_t i : temp) {</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
@@ -222,7 +222,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a98ead7d43b11505398daf9a894f122f9"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:49</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a98ead7d43b11505398daf9a894f122f9"><div class="ttname"><a href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:49</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -241,19 +241,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; sorting::radix_sort::step_ith </td>
<td>(</td>
<td class="paramtype">uint16_t&#160;</td>
<td class="paramname"><em>cur_digit</em>, </td>
<td class="paramtype">uint16_t</td> <td class="paramname"><span class="paramname"><em>cur_digit</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;&#160;</td>
<td class="paramname"><em>ar</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>ar</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -312,7 +305,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -330,16 +323,16 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 102</span> {<span class="comment"></span></div>
<div class="line"><span class="lineno"> 103</span><span class="comment"> /// Test 1</span></div>
<div class="line"><span class="lineno"> 104</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar1 = {432, 234, 143, 332, 123};</div>
<div class="line"><span class="lineno"> 105</span> ar1 = <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar1);</div>
<div class="line"><span class="lineno"> 105</span> ar1 = <a class="code hl_function" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar1);</div>
<div class="line"><span class="lineno"> 106</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));<span class="comment"></span></div>
<div class="line"><span class="lineno"> 107</span><span class="comment"> /// Test 2</span></div>
<div class="line"><span class="lineno"> 108</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar2 = {213, 3214, 123, 111, 112, 142,</div>
<div class="line"><span class="lineno"> 109</span> 133, 132, 32, 12, 113};</div>
<div class="line"><span class="lineno"> 110</span> ar2 = <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar2);</div>
<div class="line"><span class="lineno"> 110</span> ar2 = <a class="code hl_function" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar2);</div>
<div class="line"><span class="lineno"> 111</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
<div class="line"><span class="lineno"> 112</span>}</div>
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_ae0cfd94fa3765b53d4ec7893ffaee5f8"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:80</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_ae0cfd94fa3765b53d4ec7893ffaee5f8"><div class="ttname"><a href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:80</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -354,7 +347,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/d61/radix__sort2_8cpp.html">radix_sort2.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d64/namespaceboruvkas__minimum__spanning__tree.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: boruvkas_minimum_spanning_tree Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spanning__tree.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spanning__tree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spa
<div class="contents">
<p>Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation.
<a href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d64/namespaceboruvkas__minimum__spa
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

136
d8/d69/classgraph_1_1_h_k_graph.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: graph::HKGraph Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d69/classgraph_1_1_h_k_graph.html',
<div class="contents">
<p>Represents Bipartite graph for Hopcroft Karp implementation.
<a href="../../d8/d69/classgraph_1_1_h_k_graph.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for graph::HKGraph:</div>
<div class="dyncontent">
@@ -119,33 +121,33 @@ Public Member Functions</h2></td></tr>
&#160;</td><td class="memItemRight" valign="bottom"><b>HKGraph</b> ()</td></tr>
<tr class="memdesc:af02b0c83911070ac6d95fc9905e58aa9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default Constructor for initialization. <br /></td></tr>
<tr class="separator:af02b0c83911070ac6d95fc9905e58aa9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0da5aa674d3b3e54a38251ee60d7cd64" id="r_a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64">HKGraph</a> (int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>, int <a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>)</td></tr>
<tr class="memitem:a0da5aa674d3b3e54a38251ee60d7cd64" id="r_a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0da5aa674d3b3e54a38251ee60d7cd64">HKGraph</a> (int <a class="el" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>, int <a class="el" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>)</td></tr>
<tr class="memdesc:a0da5aa674d3b3e54a38251ee60d7cd64"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor for initialization. <br /></td></tr>
<tr class="separator:a0da5aa674d3b3e54a38251ee60d7cd64"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3b49011c09cf90a116ab53bef61cd95a" id="r_a3b49011c09cf90a116ab53bef61cd95a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a> (int u, int v)</td></tr>
<tr class="memitem:a3b49011c09cf90a116ab53bef61cd95a" id="r_a3b49011c09cf90a116ab53bef61cd95a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a> (int u, int v)</td></tr>
<tr class="memdesc:a3b49011c09cf90a116ab53bef61cd95a"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to add edge from u to v <br /></td></tr>
<tr class="separator:a3b49011c09cf90a116ab53bef61cd95a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7491add14d9fc04f679114ca6d6f0f93" id="r_a7491add14d9fc04f679114ca6d6f0f93"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a> ()</td></tr>
<tr class="memitem:a7491add14d9fc04f679114ca6d6f0f93" id="r_a7491add14d9fc04f679114ca6d6f0f93"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7491add14d9fc04f679114ca6d6f0f93">bfs</a> ()</td></tr>
<tr class="memdesc:a7491add14d9fc04f679114ca6d6f0f93"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function checks for the possibility of augmented path availability. <br /></td></tr>
<tr class="separator:a7491add14d9fc04f679114ca6d6f0f93"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae794950cb3407b6b47d3dc986cf714c0" id="r_ae794950cb3407b6b47d3dc986cf714c0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a> (int u)</td></tr>
<tr class="memitem:ae794950cb3407b6b47d3dc986cf714c0" id="r_ae794950cb3407b6b47d3dc986cf714c0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae794950cb3407b6b47d3dc986cf714c0">dfs</a> (int u)</td></tr>
<tr class="memdesc:ae794950cb3407b6b47d3dc986cf714c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">This functions checks whether an augmenting path is available exists beginning with free vertex u. <br /></td></tr>
<tr class="separator:ae794950cb3407b6b47d3dc986cf714c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9dbda80d02bdc26c3e8ff7330c9be75d" id="r_a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a> ()</td></tr>
<tr class="memitem:a9dbda80d02bdc26c3e8ff7330c9be75d" id="r_a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a> ()</td></tr>
<tr class="memdesc:a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function counts the number of augmenting paths between left and right sides of the Bipartite graph. <br /></td></tr>
<tr class="separator:a9dbda80d02bdc26c3e8ff7330c9be75d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a3d9101e3b4598159005fd028b9b0ff74" id="r_a3d9101e3b4598159005fd028b9b0ff74"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> {}</td></tr>
<tr class="memitem:a3d9101e3b4598159005fd028b9b0ff74" id="r_a3d9101e3b4598159005fd028b9b0ff74"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> {}</td></tr>
<tr class="memdesc:a3d9101e3b4598159005fd028b9b0ff74"><td class="mdescLeft">&#160;</td><td class="mdescRight">m is the number of vertices on left side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="separator:a3d9101e3b4598159005fd028b9b0ff74"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6f5a9fdbb83ef731d739ba6707e21c3c" id="r_a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> {}</td></tr>
<tr class="memitem:a6f5a9fdbb83ef731d739ba6707e21c3c" id="r_a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> {}</td></tr>
<tr class="memdesc:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">n is the number of vertices on right side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> <br /></td></tr>
<tr class="separator:a6f5a9fdbb83ef731d739ba6707e21c3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae6d069bd16d6eafa6e08c7e5f735eda6" id="r_ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae6d069bd16d6eafa6e08c7e5f735eda6">NIL</a> {0}</td></tr>
<tr class="memitem:ae6d069bd16d6eafa6e08c7e5f735eda6" id="r_ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6d069bd16d6eafa6e08c7e5f735eda6">NIL</a> {0}</td></tr>
<tr class="separator:ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44742cb9cfecd1a4493970af9b8bbb15" id="r_a44742cb9cfecd1a4493970af9b8bbb15"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a44742cb9cfecd1a4493970af9b8bbb15">INF</a> {INT_MAX}</td></tr>
<tr class="memitem:a44742cb9cfecd1a4493970af9b8bbb15" id="r_a44742cb9cfecd1a4493970af9b8bbb15"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44742cb9cfecd1a4493970af9b8bbb15">INF</a> {INT_MAX}</td></tr>
<tr class="separator:a44742cb9cfecd1a4493970af9b8bbb15"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a35893def7a1c5cd60907b4893117796f" id="r_a35893def7a1c5cd60907b4893117796f"><td class="memItemLeft" align="right" valign="top"><a id="a35893def7a1c5cd60907b4893117796f" name="a35893def7a1c5cd60907b4893117796f"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
@@ -176,19 +178,12 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">graph::HKGraph::HKGraph </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>m</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>m</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -202,13 +197,13 @@ Private Attributes</h2></td></tr>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 231</span> {</div>
<div class="line"><span class="lineno"> 232</span> this-&gt;<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>;</div>
<div class="line"><span class="lineno"> 233</span> this-&gt;<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>;</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::list&lt;int&gt;</a> &gt;(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);</div>
<div class="line"><span class="lineno"> 232</span> this-&gt;<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> = <a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>;</div>
<div class="line"><span class="lineno"> 233</span> this-&gt;<a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> = <a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>;</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::list&lt;int&gt;</a> &gt;(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);</div>
<div class="line"><span class="lineno"> 235</span>}</div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:73</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:68</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:69</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:73</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:68</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:69</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment -->
</div>
@@ -223,19 +218,12 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void graph::HKGraph::addEdge </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>u</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>u</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>v</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -249,7 +237,7 @@ Private Attributes</h2></td></tr>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 243</span>{</div>
<div class="line"><span class="lineno"> 244</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v); <span class="comment">// Add v to u’s list.</span></div>
<div class="line"><span class="lineno"> 244</span> <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v); <span class="comment">// Add v to u’s list.</span></div>
<div class="line"><span class="lineno"> 245</span>}</div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -269,7 +257,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool graph::HKGraph::bfs </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -283,22 +271,22 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> q; <span class="comment">// an integer queue for bfs</span></div>
<div class="line"><span class="lineno"> 136</span> </div>
<div class="line"><span class="lineno"> 137</span> <span class="comment">// First layer of vertices (set distance as 0)</span></div>
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++)</div>
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++)</div>
<div class="line"><span class="lineno"> 139</span> {</div>
<div class="line"><span class="lineno"> 140</span> <span class="comment">// If this is a free vertex, add it to queue</span></div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL){</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL){</div>
<div class="line"><span class="lineno"> 142</span> </div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = 0; <span class="comment">// u is not matched so distance is 0</span></div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = 0; <span class="comment">// u is not matched so distance is 0</span></div>
<div class="line"><span class="lineno"> 144</span> q.push(u);</div>
<div class="line"><span class="lineno"> 145</span> }</div>
<div class="line"><span class="lineno"> 146</span> </div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">else</span>{</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// set distance as infinite so that this vertex is considered next time for availibility</span></div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// set distance as infinite so that this vertex is considered next time for availibility</span></div>
<div class="line"><span class="lineno"> 149</span> }</div>
<div class="line"><span class="lineno"> 150</span> }</div>
<div class="line"><span class="lineno"> 151</span> </div>
<div class="line"><span class="lineno"> 152</span> </div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] = INF; <span class="comment">// Initialize distance to NIL as infinite</span></div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] = INF; <span class="comment">// Initialize distance to NIL as infinite</span></div>
<div class="line"><span class="lineno"> 154</span> </div>
<div class="line"><span class="lineno"> 155</span> <span class="comment">// q is going to contain vertices of left side only.</span></div>
<div class="line"><span class="lineno"> 156</span> <span class="keywordflow">while</span> (!q.empty())</div>
@@ -307,19 +295,19 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 159</span> q.pop();</div>
<div class="line"><span class="lineno"> 160</span> </div>
<div class="line"><span class="lineno"> 161</span> <span class="comment">// If this node is not NIL and can provide a shorter path to NIL then</span></div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] &lt; <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL])</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] &lt; <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL])</div>
<div class="line"><span class="lineno"> 163</span> {</div>
<div class="line"><span class="lineno"> 164</span> <span class="comment">// Get all the adjacent vertices of the dequeued vertex u</span></div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list&lt;int&gt;::iterator</a> it;</div>
<div class="line"><span class="lineno"> 166</span> <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
<div class="line"><span class="lineno"> 165</span> std::list&lt;int&gt;::iterator it;</div>
<div class="line"><span class="lineno"> 166</span> <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
<div class="line"><span class="lineno"> 167</span> {</div>
<div class="line"><span class="lineno"> 168</span> <span class="keywordtype">int</span> v = *it;</div>
<div class="line"><span class="lineno"> 169</span> </div>
<div class="line"><span class="lineno"> 170</span> <span class="comment">// If pair of v is not considered so far i.e. (v, pair_v[v]) is not yet explored edge.</span></div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == INF)</div>
<div class="line"><span class="lineno"> 171</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == INF)</div>
<div class="line"><span class="lineno"> 172</span> {</div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1; </div>
<div class="line"><span class="lineno"> 174</span> q.push(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]); <span class="comment">// Consider the pair and push it to queue</span></div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] = <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1; </div>
<div class="line"><span class="lineno"> 174</span> q.push(<a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]); <span class="comment">// Consider the pair and push it to queue</span></div>
<div class="line"><span class="lineno"> 175</span> }</div>
<div class="line"><span class="lineno"> 176</span> }</div>
<div class="line"><span class="lineno"> 177</span> }</div>
@@ -327,14 +315,13 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 179</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">return</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] != INF); <span class="comment">// If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available</span></div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] != INF); <span class="comment">// If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available</span></div>
<div class="line"><span class="lineno"> 183</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector&lt; int &gt; dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:77</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:75</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:76</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector&lt; int &gt; dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:77</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:75</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:76</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div></div>
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -353,8 +340,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool graph::HKGraph::dfs </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>u</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>u</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -373,32 +359,32 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 192</span>{</div>
<div class="line"><span class="lineno"> 193</span> <span class="keywordflow">if</span> (u != NIL)</div>
<div class="line"><span class="lineno"> 194</span> {</div>
<div class="line"><span class="lineno"> 195</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list&lt;int&gt;::iterator</a> it;</div>
<div class="line"><span class="lineno"> 196</span> <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
<div class="line"><span class="lineno"> 195</span> std::list&lt;int&gt;::iterator it;</div>
<div class="line"><span class="lineno"> 196</span> <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
<div class="line"><span class="lineno"> 197</span> {</div>
<div class="line"><span class="lineno"> 198</span> </div>
<div class="line"><span class="lineno"> 199</span> <span class="keywordtype">int</span> v = *it; <span class="comment">// Adjacent vertex of u</span></div>
<div class="line"><span class="lineno"> 200</span> </div>
<div class="line"><span class="lineno"> 201</span> <span class="comment">// Follow the distances set by BFS search</span></div>
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1)</div>
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1)</div>
<div class="line"><span class="lineno"> 203</span> {</div>
<div class="line"><span class="lineno"> 204</span> <span class="comment">// If dfs for pair of v also return true then new matching possible, store the matching</span></div>
<div class="line"><span class="lineno"> 205</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]) == <span class="keyword">true</span>)</div>
<div class="line"><span class="lineno"> 205</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(<a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]) == <span class="keyword">true</span>)</div>
<div class="line"><span class="lineno"> 206</span> { </div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v] = u;</div>
<div class="line"><span class="lineno"> 208</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] = v;</div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a>[v] = u;</div>
<div class="line"><span class="lineno"> 208</span> <a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] = v;</div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 210</span> }</div>
<div class="line"><span class="lineno"> 211</span> }</div>
<div class="line"><span class="lineno"> 212</span> }</div>
<div class="line"><span class="lineno"> 213</span> </div>
<div class="line"><span class="lineno"> 214</span> </div>
<div class="line"><span class="lineno"> 215</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// If there is no augmenting path beginning with u then set distance to infinite.</span></div>
<div class="line"><span class="lineno"> 215</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// If there is no augmenting path beginning with u then set distance to infinite.</span></div>
<div class="line"><span class="lineno"> 216</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 217</span> }</div>
<div class="line"><span class="lineno"> 218</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 219</span>}</div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:191</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:191</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -416,7 +402,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int graph::HKGraph::hopcroftKarpAlgorithm </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -428,33 +414,33 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 97</span> </div>
<div class="line"><span class="lineno"> 98</span> <span class="comment">// pair_u[u] stores pair of u in matching on left side of Bipartite Graph.</span></div>
<div class="line"><span class="lineno"> 99</span> <span class="comment">// If u doesn&#39;t have any pair, then pair_u[u] is NIL</span></div>
<div class="line"><span class="lineno"> 100</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1,NIL); </div>
<div class="line"><span class="lineno"> 100</span> <a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1,NIL); </div>
<div class="line"><span class="lineno"> 101</span> </div>
<div class="line"><span class="lineno"> 102</span> <span class="comment">// pair_v[v] stores pair of v in matching on right side of Biparite Graph.</span></div>
<div class="line"><span class="lineno"> 103</span> <span class="comment">// If v doesn&#39;t have any pair, then pair_u[v] is NIL</span></div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> + 1,NIL); </div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> + 1,NIL); </div>
<div class="line"><span class="lineno"> 105</span> </div>
<div class="line"><span class="lineno"> 106</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1); <span class="comment">// dist[u] stores distance of left side vertices</span></div>
<div class="line"><span class="lineno"> 106</span> <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1); <span class="comment">// dist[u] stores distance of left side vertices</span></div>
<div class="line"><span class="lineno"> 107</span> </div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = 0; <span class="comment">// Initialize result</span></div>
<div class="line"><span class="lineno"> 109</span> </div>
<div class="line"><span class="lineno"> 110</span> <span class="comment">// Keep updating the result while there is an augmenting path possible.</span></div>
<div class="line"><span class="lineno"> 111</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a>())</div>
<div class="line"><span class="lineno"> 111</span> <span class="keywordflow">while</span> (<a class="code hl_function" href="#a7491add14d9fc04f679114ca6d6f0f93">bfs</a>())</div>
<div class="line"><span class="lineno"> 112</span> {</div>
<div class="line"><span class="lineno"> 113</span> <span class="comment">// Find a free vertex to check for a matching</span></div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++){</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++){</div>
<div class="line"><span class="lineno"> 115</span> </div>
<div class="line"><span class="lineno"> 116</span> <span class="comment">// If current vertex is free and there is</span></div>
<div class="line"><span class="lineno"> 117</span> <span class="comment">// an augmenting path from current vertex</span></div>
<div class="line"><span class="lineno"> 118</span> <span class="comment">// then increment the result</span></div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL &amp;&amp; <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(u)){</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL &amp;&amp; <a class="code hl_function" href="#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(u)){</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>++;</div>
<div class="line"><span class="lineno"> 121</span> }</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span> }</div>
<div class="line"><span class="lineno"> 124</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"> 125</span>}</div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:133</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:133</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> fibonacci_sum.cpp:76</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -570,7 +556,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

17
d8/d6c/line__segment__intersection_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: geometry/line_segment_intersection.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d6c/line__segment__intersection_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d6c/line__segment__intersection_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -123,7 +125,7 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></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="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
@@ -138,8 +140,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -179,7 +180,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><a class="el" href="../../d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

63
d8/d72/class_r_btree.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: RBtree Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d72/class_r_btree.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d72/class_r_btree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,25 +114,25 @@ Collaboration diagram for RBtree:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a7079253fc09a70388a3c0b975e9fdc08" id="r_a7079253fc09a70388a3c0b975e9fdc08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a7079253fc09a70388a3c0b975e9fdc08">insert</a> ()</td></tr>
<tr class="memitem:a7079253fc09a70388a3c0b975e9fdc08" id="r_a7079253fc09a70388a3c0b975e9fdc08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7079253fc09a70388a3c0b975e9fdc08">insert</a> ()</td></tr>
<tr class="separator:a7079253fc09a70388a3c0b975e9fdc08"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a65b1a4fad18419a577bcb5d7bdc29512" id="r_a65b1a4fad18419a577bcb5d7bdc29512"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a65b1a4fad18419a577bcb5d7bdc29512">insertfix</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a65b1a4fad18419a577bcb5d7bdc29512" id="r_a65b1a4fad18419a577bcb5d7bdc29512"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a65b1a4fad18419a577bcb5d7bdc29512">insertfix</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a65b1a4fad18419a577bcb5d7bdc29512"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a85750df7084f843206e83e8a68f5e761" id="r_a85750df7084f843206e83e8a68f5e761"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a85750df7084f843206e83e8a68f5e761">leftrotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a85750df7084f843206e83e8a68f5e761" id="r_a85750df7084f843206e83e8a68f5e761"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a85750df7084f843206e83e8a68f5e761">leftrotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a85750df7084f843206e83e8a68f5e761"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1359f8f04ad2046256f5a2b575ad3dd1" id="r_a1359f8f04ad2046256f5a2b575ad3dd1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a1359f8f04ad2046256f5a2b575ad3dd1">rightrotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a1359f8f04ad2046256f5a2b575ad3dd1" id="r_a1359f8f04ad2046256f5a2b575ad3dd1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1359f8f04ad2046256f5a2b575ad3dd1">rightrotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a1359f8f04ad2046256f5a2b575ad3dd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5a9e8bcf8651413afec219b4b0d51704" id="r_a5a9e8bcf8651413afec219b4b0d51704"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a5a9e8bcf8651413afec219b4b0d51704">del</a> ()</td></tr>
<tr class="memitem:a5a9e8bcf8651413afec219b4b0d51704" id="r_a5a9e8bcf8651413afec219b4b0d51704"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a9e8bcf8651413afec219b4b0d51704">del</a> ()</td></tr>
<tr class="separator:a5a9e8bcf8651413afec219b4b0d51704"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5b1979fe346534f63fe01358e3e0cdf8" id="r_a5b1979fe346534f63fe01358e3e0cdf8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a5b1979fe346534f63fe01358e3e0cdf8">successor</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a5b1979fe346534f63fe01358e3e0cdf8" id="r_a5b1979fe346534f63fe01358e3e0cdf8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5b1979fe346534f63fe01358e3e0cdf8">successor</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a5b1979fe346534f63fe01358e3e0cdf8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a01ade919cc34cb2fa24bc07bc631f440" id="r_a01ade919cc34cb2fa24bc07bc631f440"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a01ade919cc34cb2fa24bc07bc631f440">delfix</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a01ade919cc34cb2fa24bc07bc631f440" id="r_a01ade919cc34cb2fa24bc07bc631f440"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a01ade919cc34cb2fa24bc07bc631f440">delfix</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a01ade919cc34cb2fa24bc07bc631f440"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94a8072ec181ba69cbe3bfa2976beee8" id="r_a94a8072ec181ba69cbe3bfa2976beee8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a94a8072ec181ba69cbe3bfa2976beee8">disp</a> ()</td></tr>
<tr class="memitem:a94a8072ec181ba69cbe3bfa2976beee8" id="r_a94a8072ec181ba69cbe3bfa2976beee8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94a8072ec181ba69cbe3bfa2976beee8">disp</a> ()</td></tr>
<tr class="separator:a94a8072ec181ba69cbe3bfa2976beee8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a860d40eefb48ac948be2dad4d3990535" id="r_a860d40eefb48ac948be2dad4d3990535"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#a860d40eefb48ac948be2dad4d3990535">display</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="memitem:a860d40eefb48ac948be2dad4d3990535" id="r_a860d40eefb48ac948be2dad4d3990535"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a860d40eefb48ac948be2dad4d3990535">display</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *)</td></tr>
<tr class="separator:a860d40eefb48ac948be2dad4d3990535"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acf7a8e0285ac25ad885ac92726132e80" id="r_acf7a8e0285ac25ad885ac92726132e80"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d72/class_r_btree.html#acf7a8e0285ac25ad885ac92726132e80">search</a> ()</td></tr>
<tr class="memitem:acf7a8e0285ac25ad885ac92726132e80" id="r_acf7a8e0285ac25ad885ac92726132e80"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf7a8e0285ac25ad885ac92726132e80">search</a> ()</td></tr>
<tr class="separator:acf7a8e0285ac25ad885ac92726132e80"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
@@ -155,7 +157,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">RBtree::RBtree </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -182,7 +184,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::del </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -288,8 +290,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::delfix </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -376,7 +377,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::disp </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -396,8 +397,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::display </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -459,7 +459,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::insert </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -469,7 +469,7 @@ Private Attributes</h2></td></tr>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter key of the node to be inserted: &quot;</span>;</div>
<div class="line"><span class="lineno"> 38</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; z;</div>
<div class="line"><span class="lineno"> 39</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, *q;</div>
<div class="line"><span class="lineno"> 40</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 40</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 41</span> t-&gt;key = z;</div>
<div class="line"><span class="lineno"> 42</span> t-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 43</span> t-&gt;right = NULL;</div>
@@ -499,6 +499,7 @@ Private Attributes</h2></td></tr>
<div class="line"><span class="lineno"> 67</span> }</div>
<div class="line"><span class="lineno"> 68</span> insertfix(t);</div>
<div class="line"><span class="lineno"> 69</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -511,8 +512,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::insertfix </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>t</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>t</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -593,8 +593,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::leftrotate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -639,8 +638,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::rightrotate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -685,7 +683,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void RBtree::search </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -752,8 +750,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * RBtree::successor </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -786,7 +783,7 @@ Private Attributes</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d72/class_r_btree.html">RBtree</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

65
d8/d76/morse__code_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: ciphers/morse_code.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d76/morse__code_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d76/morse__code_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -127,18 +129,18 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ab31773fd11555d21f70d6914138d9535" id="r_ab31773fd11555d21f70d6914138d9535"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a> (const char &amp;c)</td></tr>
<tr class="memitem:ab31773fd11555d21f70d6914138d9535" id="r_ab31773fd11555d21f70d6914138d9535"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a> (const char &amp;c)</td></tr>
<tr class="separator:ab31773fd11555d21f70d6914138d9535"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9f294b0dec08a4a11d477a32f9bd829" id="r_ac9f294b0dec08a4a11d477a32f9bd829"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s)</td></tr>
<tr class="memitem:ac9f294b0dec08a4a11d477a32f9bd829" id="r_ac9f294b0dec08a4a11d477a32f9bd829"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s)</td></tr>
<tr class="separator:ac9f294b0dec08a4a11d477a32f9bd829"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0242e458904de8a242fcdaffe9e3ba1a" id="r_a0242e458904de8a242fcdaffe9e3ba1a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
<tr class="memitem:a0242e458904de8a242fcdaffe9e3ba1a" id="r_a0242e458904de8a242fcdaffe9e3ba1a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
<tr class="separator:a0242e458904de8a242fcdaffe9e3ba1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a15c66ec8cf4cef0a35c50cbab86965dc" id="r_a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
<tr class="memitem:a15c66ec8cf4cef0a35c50cbab86965dc" id="r_a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
<tr class="separator:a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test above algorithm. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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="../../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -156,8 +158,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::char_to_morse </td>
<td>(</td>
<td class="paramtype">const char &amp;&#160;</td>
<td class="paramname"><em>c</em></td><td>)</td>
<td class="paramtype">const char &amp;</td> <td class="paramname"><span class="paramname"><em>c</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -269,8 +270,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::decrypt </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>text</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td> <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -299,14 +299,14 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 230</span> <span class="comment">// Traversing through each morse code string</span></div>
<div class="line"><span class="lineno"> 231</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s : splits) {</div>
<div class="line"><span class="lineno"> 232</span> <span class="comment">// Add corresponding character</span></div>
<div class="line"><span class="lineno"> 233</span> decrypted_text += <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a>(s);</div>
<div class="line"><span class="lineno"> 233</span> decrypted_text += <a class="code hl_function" href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a>(s);</div>
<div class="line"><span class="lineno"> 234</span> }</div>
<div class="line"><span class="lineno"> 235</span> </div>
<div class="line"><span class="lineno"> 236</span> <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
<div class="line"><span class="lineno"> 237</span>}</div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">std::string::find</a></div><div class="ttdeci">T find(T... args)</div></div>
<div class="ttc" id="amorse__code_8cpp_html_ac9f294b0dec08a4a11d477a32f9bd829"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a></div><div class="ttdeci">char morse_to_char(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:118</div></div>
<div class="ttc" id="amorse__code_8cpp_html_ac9f294b0dec08a4a11d477a32f9bd829"><div class="ttname"><a href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a></div><div class="ttdeci">char morse_to_char(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:118</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
@@ -328,8 +328,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::encrypt </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>text</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td> <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -346,11 +345,11 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 204</span> <span class="comment">// Going through each character of text and converting it</span></div>
<div class="line"><span class="lineno"> 205</span> <span class="comment">// to morse representation</span></div>
<div class="line"><span class="lineno"> 206</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span> &amp;c : text) {</div>
<div class="line"><span class="lineno"> 207</span> encrypted_text += <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a>(c) + <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 207</span> encrypted_text += <a class="code hl_function" href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a>(c) + <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 208</span> }</div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordflow">return</span> encrypted_text; <span class="comment">// Returning encrypted text</span></div>
<div class="line"><span class="lineno"> 210</span>}</div>
<div class="ttc" id="amorse__code_8cpp_html_ab31773fd11555d21f70d6914138d9535"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a></div><div class="ttdeci">std::string char_to_morse(const char &amp;c)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:33</div></div>
<div class="ttc" id="amorse__code_8cpp_html_ab31773fd11555d21f70d6914138d9535"><div class="ttname"><a href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a></div><div class="ttdeci">std::string char_to_morse(const char &amp;c)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:33</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -368,8 +367,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -379,10 +377,10 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 268</span> {</div>
<div class="line"><span class="lineno"> 269</span> <span class="comment">// Testing</span></div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><span class="lineno"> 271</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 272</span>}</div>
<div class="ttc" id="amorse__code_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> morse_code.cpp:245</div></div>
<div class="ttc" id="amorse__code_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> morse_code.cpp:245</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -400,8 +398,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">char ciphers::morse::morse_to_char </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>s</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td> <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -512,7 +509,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -528,23 +525,23 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 245</span> {</div>
<div class="line"><span class="lineno"> 246</span> <span class="comment">// Test 1</span></div>
<div class="line"><span class="lineno"> 247</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;01234567890&quot;</span>;</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text1);</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted1);</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text1);</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted1);</div>
<div class="line"><span class="lineno"> 250</span> assert(text1 == decrypted1);</div>
<div class="line"><span class="lineno"> 251</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 252</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted1 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 253</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted1 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 254</span> <span class="comment">// Test 2</span></div>
<div class="line"><span class="lineno"> 255</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;abcdefghijklmnopqrstuvwxyz&quot;</span>;</div>
<div class="line"><span class="lineno"> 256</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text2);</div>
<div class="line"><span class="lineno"> 257</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted2);</div>
<div class="line"><span class="lineno"> 256</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text2);</div>
<div class="line"><span class="lineno"> 257</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted2);</div>
<div class="line"><span class="lineno"> 258</span> assert(text2 == decrypted2);</div>
<div class="line"><span class="lineno"> 259</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted2 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 261</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted2 &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 262</span>}</div>
<div class="ttc" id="amorse__code_8cpp_html_a0242e458904de8a242fcdaffe9e3ba1a"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:202</div></div>
<div class="ttc" id="amorse__code_8cpp_html_a15c66ec8cf4cef0a35c50cbab86965dc"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:216</div></div>
<div class="ttc" id="amorse__code_8cpp_html_a0242e458904de8a242fcdaffe9e3ba1a"><div class="ttname"><a href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:202</div></div>
<div class="ttc" id="amorse__code_8cpp_html_a15c66ec8cf4cef0a35c50cbab86965dc"><div class="ttname"><a href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:216</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -559,7 +556,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../d8/d76/morse__code_8cpp.html">morse_code.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

392
d8/d77/namespacemachine__learning.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: machine_learning Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d77/namespacemachine__learning.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d77/namespacemachine__learning.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d77/namespacemachine__learning.html
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>
<a href="../../d8/d77/namespacemachine__learning.html#details">More...</a></p>
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
@@ -115,86 +117,86 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
<tr class="separator:aa72a53c88203fde278f1fe6c3afe5b07"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
<tr class="separator:ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
<tr class="separator:ac43d294e21a0c4fa33c53757df054576"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *D, double alpha, int R)</td></tr>
<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6aac06ccf128b0a9c55c9ee1a8e5631">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *D, double alpha, int R)</td></tr>
<tr class="separator:aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
<tr class="separator:a042f435bca0839e721fc1574a61e8da3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7" id="r_a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
<tr class="separator:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4986b23760039711848155739c31b35" id="r_af4986b23760039711848155739c31b35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;A)</td></tr>
<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4986b23760039711848155739c31b35">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;A)</td></tr>
<tr class="separator:af4986b23760039711848155739c31b35"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269" id="r_a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a54bf1f3c43271a5fc93101f6ae2e6269">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="separator:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd" id="r_a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a496302e3371aa7b478cb7d5917904bdd">insert_element</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
<tr class="separator:a496302e3371aa7b478cb7d5917904bdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a912cf68863063a38d6e63545be5eb093" id="r_a912cf68863063a38d6e63545be5eb093"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">pop_front</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a912cf68863063a38d6e63545be5eb093">pop_front</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="separator:a912cf68863063a38d6e63545be5eb093"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae10178b082f0205c326550877d998e5d" id="r_ae10178b082f0205c326550877d998e5d"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">pop_back</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae10178b082f0205c326550877d998e5d">pop_back</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
<tr class="separator:ae10178b082f0205c326550877d998e5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f" id="r_af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
<tr class="separator:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abee7b35403af3612222d3b7a53074905" id="r_abee7b35403af3612222d3b7a53074905"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
<tr class="separator:abee7b35403af3612222d3b7a53074905"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" id="r_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
<tr class="separator:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" id="r_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
<tr class="separator:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35" id="r_a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="separator:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078" id="r_aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="separator:aa4bbf61e65f8cd297255fa94b983d078"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac332d152078e96311e43ac5e7183ea26" id="r_ac332d152078e96311e43ac5e7183ea26"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
<tr class="separator:ac332d152078e96311e43ac5e7183ea26"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec" id="r_a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="separator:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb" id="r_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
<tr class="separator:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695" id="r_a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">operator*</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a16f34574b7e0dd51bc3b3fda37446695">operator*</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
<tr class="separator:a16f34574b7e0dd51bc3b3fda37446695"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5" id="r_ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
<tr class="separator:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a89fde571b38f9483576594f66572958a" id="r_a89fde571b38f9483576594f66572958a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">transpose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a89fde571b38f9483576594f66572958a">transpose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
<tr class="separator:a89fde571b38f9483576594f66572958a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2466857dab977a49f117029835b3b6d2" id="r_a2466857dab977a49f117029835b3b6d2"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">operator+</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2466857dab977a49f117029835b3b6d2">operator+</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="separator:a2466857dab977a49f117029835b3b6d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3" id="r_a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">operator-</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cc29566568e0383dd7d374068cbe6b3">operator-</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="separator:a0cc29566568e0383dd7d374068cbe6b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9" id="r_a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="separator:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43" id="r_acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
<tr class="separator:acafa3e62b686aebdbad81c4f89913f43"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a7220dbb7fa896d83bfb7a50e4fce1786" id="r_a7220dbb7fa896d83bfb7a50e4fce1786"><td class="memItemLeft" align="right" valign="top">constexpr double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">MIN_DISTANCE</a> = 1e-4</td></tr>
<tr class="memitem:a7220dbb7fa896d83bfb7a50e4fce1786" id="r_a7220dbb7fa896d83bfb7a50e4fce1786"><td class="memItemLeft" align="right" valign="top">constexpr double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7220dbb7fa896d83bfb7a50e4fce1786">MIN_DISTANCE</a> = 1e-4</td></tr>
<tr class="separator:a7220dbb7fa896d83bfb7a50e4fce1786"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -219,19 +221,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::apply_function </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T(*)(const T &amp;)&#160;</td>
<td class="paramname"><em>func</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">T(*)(const T &amp;)</td> <td class="paramname"><span class="paramname"><em>func</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -272,8 +267,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">size_t machine_learning::argmax </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -292,7 +286,7 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>index of maximum element </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 307</span> {</div>
<div class="line"><span class="lineno"> 308</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 308</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 309</span> <span class="comment">// As this function is used on predicted (or target) vector, shape should be</span></div>
<div class="line"><span class="lineno"> 310</span> <span class="comment">// (1, X)</span></div>
<div class="line"><span class="lineno"> 311</span> <span class="keywordflow">if</span> (shape.first != 1) {</div>
@@ -311,7 +305,7 @@ template&lt;typename T &gt; </div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:247</div></div>
<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:247</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -331,19 +325,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::equal_shuffle </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -403,8 +390,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; machine_learning::get_shape </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -454,19 +440,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::hadamard_product </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -485,8 +464,8 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 496</span> {</div>
<div class="line"><span class="lineno"> 497</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 498</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 497</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 498</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 499</span> <span class="comment">// If vectors are not eligible for hadamard product</span></div>
<div class="line"><span class="lineno"> 500</span> <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
<div class="line"><span class="lineno"> 501</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
@@ -520,19 +499,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::insert_element </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>ele</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>ele</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -572,25 +544,17 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::kohonen_som </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>X</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>X</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *&#160;</td>
<td class="paramname"><em>W</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>W</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>alpha_min</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>alpha_min</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -622,7 +586,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 287</span> <span class="comment">// Loop for each sample pattern in the data set</span></div>
<div class="line"><span class="lineno"> 288</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
<div class="line"><span class="lineno"> 289</span> <span class="comment">// update weights for the current input pattern sample</span></div>
<div class="line"><span class="lineno"> 290</span> dmin += <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><span class="lineno"> 290</span> dmin += <a class="code hl_function" href="#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><span class="lineno"> 291</span> }</div>
<div class="line"><span class="lineno"> 292</span> </div>
<div class="line"><span class="lineno"> 293</span> <span class="comment">// every 100th iteration, reduce the neighborhood range</span></div>
@@ -645,7 +609,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 310</span> </div>
<div class="line"><span class="lineno"> 311</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 312</span>}</div>
<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:200</div></div>
<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:200</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -663,25 +627,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void machine_learning::kohonen_som_tracer </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>X</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>X</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *&#160;</td>
<td class="paramname"><em>W</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>W</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>alpha_min</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>alpha_min</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -708,7 +664,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 162</span> <span class="comment">// Loop for each sample pattern in the data set</span></div>
<div class="line"><span class="lineno"> 163</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
<div class="line"><span class="lineno"> 164</span> <span class="comment">// update weights for the current input pattern sample</span></div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_function" href="#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
<div class="line"><span class="lineno"> 166</span> }</div>
<div class="line"><span class="lineno"> 167</span> </div>
<div class="line"><span class="lineno"> 168</span> <span class="comment">// every 10th iteration, reduce the neighborhood range</span></div>
@@ -739,25 +695,17 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; machine_learning::minmax_scaler </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>low</em>, </td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>low</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>high</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>high</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -779,7 +727,7 @@ template&lt;typename T &gt; </div>
<div class="fragment"><div class="line"><span class="lineno"> 271</span> {</div>
<div class="line"><span class="lineno"> 272</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;</a>&gt;&gt; B =</div>
<div class="line"><span class="lineno"> 273</span> A; <span class="comment">// Copying into new vector B</span></div>
<div class="line"><span class="lineno"> 274</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B[0]); <span class="comment">// Storing shape of B&#39;s every element</span></div>
<div class="line"><span class="lineno"> 274</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B[0]); <span class="comment">// Storing shape of B&#39;s every element</span></div>
<div class="line"><span class="lineno"> 275</span> <span class="comment">// As this function is used for scaling training data vector should be of</span></div>
<div class="line"><span class="lineno"> 276</span> <span class="comment">// shape (1, X)</span></div>
<div class="line"><span class="lineno"> 277</span> <span class="keywordflow">if</span> (shape.first != 1) {</div>
@@ -825,19 +773,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::multiply </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -856,8 +797,8 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 461</span> {</div>
<div class="line"><span class="lineno"> 462</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 463</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 462</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 463</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 464</span> <span class="comment">// If vectors are not eligible for multiplication</span></div>
<div class="line"><span class="lineno"> 465</span> <span class="keywordflow">if</span> (shape_a.second != shape_b.first) {</div>
<div class="line"><span class="lineno"> 466</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
@@ -898,19 +839,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator* </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>val</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -950,19 +884,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator+ </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -981,8 +908,8 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 408</span> {</div>
<div class="line"><span class="lineno"> 409</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 410</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 409</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 410</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 411</span> <span class="comment">// If vectors don&#39;t have equal shape</span></div>
<div class="line"><span class="lineno"> 412</span> <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
<div class="line"><span class="lineno"> 413</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
@@ -1015,19 +942,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator- </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>B</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1046,8 +966,8 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 435</span> {</div>
<div class="line"><span class="lineno"> 436</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 437</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 436</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
<div class="line"><span class="lineno"> 437</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
<div class="line"><span class="lineno"> 438</span> <span class="comment">// If vectors don&#39;t have equal shape</span></div>
<div class="line"><span class="lineno"> 439</span> <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
<div class="line"><span class="lineno"> 440</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
@@ -1080,19 +1000,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator/ </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>val</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1132,19 +1045,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td>
<td class="paramname"><em>out</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td> <td class="paramname"><span class="paramname"><em>out</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1172,7 +1078,7 @@ template&lt;typename T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg" width="534" height="184"><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" frameborder="0" src="../../d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg" width="407" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1188,19 +1094,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td>
<td class="paramname"><em>out</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td> <td class="paramname"><span class="paramname"><em>out</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1229,7 +1128,7 @@ template&lt;typename T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg" width="534" height="184"><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" frameborder="0" src="../../d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg" width="407" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1245,19 +1144,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td>
<td class="paramname"><em>out</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td> <td class="paramname"><span class="paramname"><em>out</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;&#160;</td>
<td class="paramname"><em>A</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1288,7 +1180,7 @@ template&lt;typename T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg" width="534" height="184"><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" frameborder="0" src="../../d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg" width="407" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1304,8 +1196,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::pop_back </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1346,8 +1237,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::pop_front </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1386,19 +1276,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">int machine_learning::save_u_matrix </td>
<td>(</td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>fname</em>, </td>
<td class="paramtype">const char *</td> <td class="paramname"><span class="paramname"><em>fname</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>W</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>W</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1482,8 +1365,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">T machine_learning::sum </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1522,8 +1404,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::transpose </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1542,7 +1423,7 @@ template&lt;typename T &gt; </div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 383</span> {</div>
<div class="line"><span class="lineno"> 384</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A); <span class="comment">// Current shape of vector</span></div>
<div class="line"><span class="lineno"> 384</span> <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A); <span class="comment">// Current shape of vector</span></div>
<div class="line"><span class="lineno"> 385</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; B; <span class="comment">// New vector to store result</span></div>
<div class="line"><span class="lineno"> 386</span> <span class="comment">// Storing transpose values of A in B</span></div>
<div class="line"><span class="lineno"> 387</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; shape.second; j++) {</div>
@@ -1574,31 +1455,22 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::uniform_random_initialization </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;&#160;</td>
<td class="paramname"><em>shape</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>shape</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>low</em>, </td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>low</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const T &amp;&#160;</td>
<td class="paramname"><em>high</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>high</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1656,19 +1528,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::unit_matrix_initialization </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;&#160;</td>
<td class="paramname"><em>shape</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1708,37 +1573,27 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::update_weights </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *&#160;</td>
<td class="paramname"><em>W</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>W</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *&#160;</td>
<td class="paramname"><em>D</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td> <td class="paramname"><span class="paramname"><em>D</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>alpha</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>alpha</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>R</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>R</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1806,37 +1661,27 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">double machine_learning::update_weights </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;&#160;</td>
<td class="paramname"><em>X</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>X</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *&#160;</td>
<td class="paramname"><em>W</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>W</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *&#160;</td>
<td class="paramname"><em>D</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>D</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>alpha</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>alpha</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>R</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>R</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1870,7 +1715,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 218</span> <span class="comment">// compute Euclidian distance of each output</span></div>
<div class="line"><span class="lineno"> 219</span> <span class="comment">// point from the current sample</span></div>
<div class="line"><span class="lineno"> 220</span> <span class="keyword">auto</span> d = ((*W)[x][y] - X);</div>
<div class="line"><span class="lineno"> 221</span> (*D)[x][y] = (d * d).<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>();</div>
<div class="line"><span class="lineno"> 221</span> (*D)[x][y] = (d * d).<a class="code hl_function" href="#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>();</div>
<div class="line"><span class="lineno"> 222</span> (*D)[x][y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>((*D)[x][y]);</div>
<div class="line"><span class="lineno"> 223</span> }</div>
<div class="line"><span class="lineno"> 224</span> }</div>
@@ -1911,7 +1756,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 259</span>}</div>
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
<div class="ttc" id="agroup__machine__learning_html_ga60f9186ccb682724a8792a2bf81e9b9e"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:105</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -1931,19 +1776,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void machine_learning::zeroes_initialization </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;&#160;</td>
<td class="paramname"><em>shape</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -2003,7 +1841,7 @@ template&lt;typename T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

23
d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map
View File

@@ -1,26 +1,25 @@
<map id="machine_learning::kohonen_som_tracer" name="machine_learning::kohonen_som_tracer">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,146,185,187"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,146,51,136,58,127,73,121,95,119,119,122,133,128,131,133,118,127,95,124,74,126,61,131,56,137,58,145"/>
<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" title=" " alt="" coords="233,146,402,187"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="185,164,217,164,217,169,185,169"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,164,217,164,217,169,185,169"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="494,29,562,55"/>
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="339,143,387,103,449,64,478,52,480,57,451,69,391,108,342,148"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="339,143,387,103,449,64,478,52,480,57,451,69,391,108,342,148"/>
<area shape="rect" id="Node000004" href="$d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" title=" " alt="" coords="484,79,572,104"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="370,143,449,113,468,107,469,112,451,118,372,148"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="370,143,449,113,468,107,469,112,451,118,372,148"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="492,128,564,154"/>
<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="402,153,475,144,476,150,403,159"/>
<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="402,153,475,144,476,150,403,159"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="494,177,562,203"/>
<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="403,173,479,182,478,187,402,179"/>
<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="403,173,479,182,478,187,402,179"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="493,227,562,252"/>
<area shape="poly" id="edge11_Node000002_Node000011" title=" " alt="" coords="373,184,451,213,479,222,477,227,449,218,371,189"/>
<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="373,184,451,213,479,222,477,227,449,218,371,189"/>
<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="450,276,605,302"/>
<area shape="poly" id="edge12_Node000002_Node000012" title=" " alt="" coords="343,185,391,224,451,262,462,268,460,272,449,267,388,228,340,189"/>
<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="343,185,391,224,451,262,462,268,460,272,449,267,388,228,340,189"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="675,5,753,31"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="571,77,604,65,652,40,663,35,665,40,655,45,606,70,573,82"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="571,77,604,65,652,40,663,35,665,40,655,45,606,70,573,82"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="666,55,762,80"/>
<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="572,83,650,73,651,78,572,89"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="572,83,650,73,651,78,572,89"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="680,104,748,130"/>
<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="572,95,665,108,664,113,572,100"/>
<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="572,95,665,108,664,113,572,100"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="653,153,775,179"/>
<area shape="poly" id="edge8_Node000004_Node000008" title=" " alt="" coords="573,101,606,113,655,140,665,145,663,149,652,145,604,118,571,106"/>
<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="573,101,606,113,655,140,665,145,663,149,652,145,604,118,571,106"/>
</map>

2
d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5
View File

@@ -1 +1 @@
745b70a0c3e0237863f536a02848ca65
3cc03b906d359c08441aa0384717fbbd

53
d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg
View File

@@ -64,15 +64,6 @@ var sectionId = 'dynsection-5';
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.7,-117.36C31.67,-126.43 41.52,-134.88 67.25,-134.88 81.32,-134.88 90.64,-132.35 95.21,-128.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.65,-129.25 96.59,-118.86 91.72,-128.27 98.65,-129.25"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -84,9 +75,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge2_Node000001_Node000002" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.79,-101.62C142.74,-101.62 150.89,-101.62 158.94,-101.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-105.13 168.7,-101.63 158.7,-98.13 158.7,-105.13"/>
</a>
@@ -102,9 +93,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge3_Node000002_Node000003" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.55,-117.14C270.19,-133.88 302.01,-160.32 333.5,-176.62 340.2,-180.09 347.68,-183.04 354.98,-185.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="353.74,-188.76 364.33,-188.36 355.8,-182.07 353.74,-188.76"/>
</a>
@@ -120,9 +111,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4_Node000002_Node000004" class="edge">
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.09,-117.36C292.09,-124.44 313.78,-132.73 333.5,-139.62 337.98,-141.19 342.68,-142.77 347.38,-144.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="346.2,-147.61 356.79,-147.33 348.34,-140.94 346.2,-147.61"/>
</a>
@@ -138,9 +129,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M297.9,-109.3C316.52,-111.57 336.32,-113.98 352.83,-116"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="352.36,-119.47 362.71,-117.2 353.2,-112.52 352.36,-119.47"/>
</a>
@@ -156,9 +147,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge10_Node000002_Node000010" class="edge">
<g id="edge9_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M297.9,-94.36C317.24,-92.12 337.87,-89.74 354.76,-87.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="354.75,-91.31 364.28,-86.68 353.95,-84.36 354.75,-91.31"/>
</a>
@@ -174,9 +165,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge11_Node000002_Node000011" class="edge">
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge11_Node000002_Node000011"><a xlink:title=" ">
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.08,-86C292.89,-79.21 314.16,-71.29 333.5,-64.62 340.21,-62.31 347.4,-59.96 354.34,-57.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="355.35,-61.09 363.84,-54.76 353.25,-54.42 355.35,-61.09"/>
</a>
@@ -192,9 +183,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<g id="edge11_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.93,-86.03C270.65,-69.51 302.3,-43.65 333.5,-27.62 336.19,-26.24 339,-24.95 341.88,-23.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="342.96,-27.06 351.04,-20.21 340.45,-20.53 342.96,-27.06"/>
</a>
@@ -210,9 +201,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5_Node000004_Node000005" class="edge">
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.21,-166.71C433.41,-169.31 442.11,-172.34 450,-175.62 466.7,-182.59 469.59,-187 486,-194.62 488.58,-195.82 491.26,-197.02 493.97,-198.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="492.46,-201.36 503.03,-202.01 495.17,-194.91 492.46,-201.36"/>
</a>
@@ -228,9 +219,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge6_Node000004_Node000006" class="edge">
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.05,-161.85C442.51,-164.13 464.4,-166.99 483.7,-169.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="483.15,-172.97 493.52,-170.79 484.06,-166.03 483.15,-172.97"/>
</a>
@@ -246,9 +237,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge7_Node000004_Node000007" class="edge">
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.05,-153.17C445.85,-150.3 472.92,-146.57 494.42,-143.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="494.79,-147.08 504.22,-142.25 493.84,-140.15 494.79,-147.08"/>
</a>
@@ -264,9 +255,9 @@ var sectionId = 'dynsection-5';
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge8_Node000004_Node000008" class="edge">
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.26,-148.66C433.46,-146.06 442.15,-143 450,-139.62 466.82,-132.4 469.49,-127.52 486,-119.62 488.57,-118.4 491.24,-117.18 493.94,-115.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="495.15,-119.28 502.99,-112.16 492.42,-112.83 495.15,-119.28"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 15 KiB

After

Width:  |  Height:  |  Size: 14 KiB

53
d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg
View File

@@ -18,15 +18,6 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.7,-117.36C31.67,-126.43 41.52,-134.88 67.25,-134.88 81.32,-134.88 90.64,-132.35 95.21,-128.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.65,-129.25 96.59,-118.86 91.72,-128.27 98.65,-129.25"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -38,9 +29,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge2_Node000001_Node000002" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.79,-101.62C142.74,-101.62 150.89,-101.62 158.94,-101.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-105.13 168.7,-101.63 158.7,-98.13 158.7,-105.13"/>
</a>
@@ -56,9 +47,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge3_Node000002_Node000003" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.55,-117.14C270.19,-133.88 302.01,-160.32 333.5,-176.62 340.2,-180.09 347.68,-183.04 354.98,-185.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="353.74,-188.76 364.33,-188.36 355.8,-182.07 353.74,-188.76"/>
</a>
@@ -74,9 +65,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4_Node000002_Node000004" class="edge">
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.09,-117.36C292.09,-124.44 313.78,-132.73 333.5,-139.62 337.98,-141.19 342.68,-142.77 347.38,-144.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="346.2,-147.61 356.79,-147.33 348.34,-140.94 346.2,-147.61"/>
</a>
@@ -92,9 +83,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M297.9,-109.3C316.52,-111.57 336.32,-113.98 352.83,-116"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="352.36,-119.47 362.71,-117.2 353.2,-112.52 352.36,-119.47"/>
</a>
@@ -110,9 +101,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge10_Node000002_Node000010" class="edge">
<g id="edge9_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M297.9,-94.36C317.24,-92.12 337.87,-89.74 354.76,-87.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="354.75,-91.31 364.28,-86.68 353.95,-84.36 354.75,-91.31"/>
</a>
@@ -128,9 +119,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge11_Node000002_Node000011" class="edge">
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge11_Node000002_Node000011"><a xlink:title=" ">
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.08,-86C292.89,-79.21 314.16,-71.29 333.5,-64.62 340.21,-62.31 347.4,-59.96 354.34,-57.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="355.35,-61.09 363.84,-54.76 353.25,-54.42 355.35,-61.09"/>
</a>
@@ -146,9 +137,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<g id="edge11_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.93,-86.03C270.65,-69.51 302.3,-43.65 333.5,-27.62 336.19,-26.24 339,-24.95 341.88,-23.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="342.96,-27.06 351.04,-20.21 340.45,-20.53 342.96,-27.06"/>
</a>
@@ -164,9 +155,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5_Node000004_Node000005" class="edge">
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.21,-166.71C433.41,-169.31 442.11,-172.34 450,-175.62 466.7,-182.59 469.59,-187 486,-194.62 488.58,-195.82 491.26,-197.02 493.97,-198.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="492.46,-201.36 503.03,-202.01 495.17,-194.91 492.46,-201.36"/>
</a>
@@ -182,9 +173,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge6_Node000004_Node000006" class="edge">
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.05,-161.85C442.51,-164.13 464.4,-166.99 483.7,-169.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="483.15,-172.97 493.52,-170.79 484.06,-166.03 483.15,-172.97"/>
</a>
@@ -200,9 +191,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge7_Node000004_Node000007" class="edge">
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.05,-153.17C445.85,-150.3 472.92,-146.57 494.42,-143.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="494.79,-147.08 504.22,-142.25 493.84,-140.15 494.79,-147.08"/>
</a>
@@ -218,9 +209,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge8_Node000004_Node000008" class="edge">
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M425.26,-148.66C433.46,-146.06 442.15,-143 450,-139.62 466.82,-132.4 469.49,-127.52 486,-119.62 488.57,-118.4 491.24,-117.18 493.94,-115.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="495.15,-119.28 502.99,-112.16 492.42,-112.83 495.15,-119.28"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 11 KiB

20
d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map
View File

@@ -1,17 +1,7 @@
<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,199,106"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="453,5,524,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,77,186,58,246,41,347,25,437,17,437,23,348,30,247,46,188,63,136,82"/>
<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" title=" " alt="" coords="282,80,366,106"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,90,266,90,266,96,199,96"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,129,401,155"/>
<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="164,104,248,123,247,128,163,109"/>
<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="353,77,443,36,445,40,355,82"/>
<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="296,81,290,71,294,62,305,56,324,53,344,56,354,63,352,67,342,61,324,59,307,61,298,65,296,71,300,78"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="456,55,521,80"/>
<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,84,440,72,441,77,367,89"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="449,104,527,130"/>
<area shape="poly" id="edge6_Node000003_Node000005" title=" " alt="" coords="367,96,434,106,433,112,366,102"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="451,153,526,179"/>
<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="367,102,402,114,454,143,451,148,400,119,365,107"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,199,56"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="288,5,360,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,30,272,21,273,27,199,35"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,55,401,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,51,231,55,231,60,199,57"/>
</map>

2
d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5
View File

@@ -1 +1 @@
7491a41aa8bf1abf5dd1e6f8f00237cf
5037bc766a84951d786a77f5d204d721

118
d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="305pt" height="64pt"
viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,14 +16,14 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-74.25 0,-74.25 0,-55 145,-55 145,-74.25"/>
<text text-anchor="middle" x="72.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -31,8 +31,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -40,17 +40,17 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M97.39,-74.6C118.88,-83.15 151.52,-95.09 181,-101.62 229.62,-112.41 287.01,-117.12 323.72,-119.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.2,-122.63 333.36,-119.64 323.56,-115.63 323.2,-122.63"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -58,98 +58,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-64.62C162.35,-64.62 180.22,-64.62 195.62,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.34,-68.13 205.34,-64.63 195.34,-61.13 195.34,-68.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.42,-54.51C137.99,-50.11 161.13,-44.9 181.81,-40.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-43.67 191.54,-38.06 181.01,-36.84 182.55,-43.67"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge5_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge6_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.5 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

118
d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<svg width="305pt" height="64pt"
viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-74.25 0,-74.25 0,-55 145,-55 145,-74.25"/>
<text text-anchor="middle" x="72.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -30,17 +30,17 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M97.39,-74.6C118.88,-83.15 151.52,-95.09 181,-101.62 229.62,-112.41 287.01,-117.12 323.72,-119.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.2,-122.63 333.36,-119.64 323.56,-115.63 323.2,-122.63"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -48,98 +48,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-64.62C162.35,-64.62 180.22,-64.62 195.62,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.34,-68.13 205.34,-64.63 195.34,-61.13 195.34,-68.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.42,-54.51C137.99,-50.11 161.13,-44.9 181.81,-40.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-43.67 191.54,-38.06 181.01,-36.84 182.55,-43.67"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge5_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge6_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.7 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

20
d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map
View File

@@ -1,17 +1,7 @@
<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,199,106"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="453,5,524,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,77,186,58,246,41,347,25,437,17,437,23,348,30,247,46,188,63,136,82"/>
<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" title=" " alt="" coords="282,80,366,106"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,90,266,90,266,96,199,96"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,129,401,155"/>
<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="164,104,248,123,247,128,163,109"/>
<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="353,77,443,36,445,40,355,82"/>
<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="296,81,290,71,294,62,305,56,324,53,344,56,354,63,352,67,342,61,324,59,307,61,298,65,296,71,300,78"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="456,55,521,80"/>
<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,84,440,72,441,77,367,89"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="449,104,527,130"/>
<area shape="poly" id="edge6_Node000003_Node000005" title=" " alt="" coords="367,96,434,106,433,112,366,102"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="451,153,526,179"/>
<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="367,102,402,114,454,143,451,148,400,119,365,107"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,199,56"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="288,5,360,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,30,272,21,273,27,199,35"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,55,401,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,51,231,55,231,60,199,57"/>
</map>

2
d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5
View File

@@ -1 +1 @@
7491a41aa8bf1abf5dd1e6f8f00237cf
5037bc766a84951d786a77f5d204d721

118
d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="305pt" height="64pt"
viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,14 +16,14 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-74.25 0,-74.25 0,-55 145,-55 145,-74.25"/>
<text text-anchor="middle" x="72.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -31,8 +31,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -40,17 +40,17 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M97.39,-74.6C118.88,-83.15 151.52,-95.09 181,-101.62 229.62,-112.41 287.01,-117.12 323.72,-119.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.2,-122.63 333.36,-119.64 323.56,-115.63 323.2,-122.63"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -58,98 +58,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-64.62C162.35,-64.62 180.22,-64.62 195.62,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.34,-68.13 205.34,-64.63 195.34,-61.13 195.34,-68.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.42,-54.51C137.99,-50.11 161.13,-44.9 181.81,-40.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-43.67 191.54,-38.06 181.01,-36.84 182.55,-43.67"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge5_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge6_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.5 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

118
d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<svg width="305pt" height="64pt"
viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-74.25 0,-74.25 0,-55 145,-55 145,-74.25"/>
<text text-anchor="middle" x="72.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -30,17 +30,17 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M97.39,-74.6C118.88,-83.15 151.52,-95.09 181,-101.62 229.62,-112.41 287.01,-117.12 323.72,-119.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.2,-122.63 333.36,-119.64 323.56,-115.63 323.2,-122.63"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -48,98 +48,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-64.62C162.35,-64.62 180.22,-64.62 195.62,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.34,-68.13 205.34,-64.63 195.34,-61.13 195.34,-68.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.42,-54.51C137.99,-50.11 161.13,-44.9 181.81,-40.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-43.67 191.54,-38.06 181.01,-36.84 182.55,-43.67"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge5_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge4_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge6_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge7_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.7 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

5
d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map
View File

@@ -1,6 +1,5 @@
<map id="machine_learning::save_u_matrix" name="machine_learning::save_u_matrix">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,97,164,137"/>
<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="47,96,45,87,51,78,65,72,85,70,106,72,119,79,116,83,104,77,84,75,66,77,55,82,51,88,52,95"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="212,5,349,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="116,94,160,67,211,40,222,35,224,40,213,45,162,71,118,98"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="245,55,316,80"/>
@@ -8,7 +7,7 @@
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="245,104,316,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="164,114,229,114,229,120,164,120"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="246,153,315,179"/>
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="165,134,231,151,230,156,163,139"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="165,134,231,151,230,156,163,139"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="236,203,325,228"/>
<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="118,135,162,162,213,189,224,194,222,199,211,194,160,167,116,140"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="118,135,162,162,213,189,224,194,222,199,211,194,160,167,116,140"/>
</map>

2
d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5
View File

@@ -1 +1 @@
4548052f410a77b2126de55102ebc00b
2aac8c73bbc8837f7fcadeb2d6889e76

17
d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg
View File

@@ -28,15 +28,6 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge4_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.35,-99.36C28.04,-108.43 36.71,-116.88 59.38,-116.88 71.77,-116.88 79.98,-114.35 84.01,-110.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.45,-111.22 85.21,-100.86 80.51,-110.35 87.45,-111.22"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -101,9 +92,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5_Node000001_Node000005" class="edge">
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.88,-68.68C135.78,-64.37 153.73,-59.78 168.86,-55.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.53,-59.36 178.35,-53.5 167.79,-52.58 169.53,-59.36"/>
</a>
@@ -119,9 +110,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M83.73,-68.04C102.42,-56 129.57,-39.45 154.75,-27.62 157.5,-26.33 160.37,-25.08 163.28,-23.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="164.43,-27.18 172.48,-20.29 161.89,-20.66 164.43,-27.18"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.4 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

17
d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg
View File

@@ -18,15 +18,6 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge4_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.35,-99.36C28.04,-108.43 36.71,-116.88 59.38,-116.88 71.77,-116.88 79.98,-114.35 84.01,-110.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.45,-111.22 85.21,-100.86 80.51,-110.35 87.45,-111.22"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -91,9 +82,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5_Node000001_Node000005" class="edge">
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M118.88,-68.68C135.78,-64.37 153.73,-59.78 168.86,-55.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.53,-59.36 178.35,-53.5 167.79,-52.58 169.53,-59.36"/>
</a>
@@ -109,9 +100,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M83.73,-68.04C102.42,-56 129.57,-39.45 154.75,-27.62 157.5,-26.33 160.37,-25.08 163.28,-23.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="164.43,-27.18 172.48,-20.29 161.89,-20.66 164.43,-27.18"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.2 KiB

23
d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map
View File

@@ -1,26 +1,25 @@
<map id="machine_learning::kohonen_som" name="machine_learning::kohonen_som">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,217,179"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="72,155,64,145,68,135,85,129,111,127,141,130,155,137,153,141,139,135,111,132,86,134,72,139,69,144,76,151"/>
<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" title=" " alt="" coords="265,146,434,187"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="217,164,249,164,249,169,217,169"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="217,164,249,164,249,169,217,169"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="526,29,594,55"/>
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="371,143,419,103,481,64,510,52,512,57,483,69,423,108,374,148"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="371,143,419,103,481,64,510,52,512,57,483,69,423,108,374,148"/>
<area shape="rect" id="Node000004" href="$d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" title=" " alt="" coords="516,79,604,104"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="402,143,481,113,500,107,501,112,483,118,404,148"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="402,143,481,113,500,107,501,112,483,118,404,148"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="524,128,596,154"/>
<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="434,153,507,144,508,150,435,159"/>
<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="434,153,507,144,508,150,435,159"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="526,177,594,203"/>
<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="435,173,511,182,510,187,434,179"/>
<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="435,173,511,182,510,187,434,179"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="525,227,594,252"/>
<area shape="poly" id="edge11_Node000002_Node000011" title=" " alt="" coords="405,184,483,213,511,222,509,227,481,218,403,189"/>
<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="405,184,483,213,511,222,509,227,481,218,403,189"/>
<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="482,276,637,302"/>
<area shape="poly" id="edge12_Node000002_Node000012" title=" " alt="" coords="375,185,423,224,483,262,494,268,492,272,481,267,420,228,372,189"/>
<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="375,185,423,224,483,262,494,268,492,272,481,267,420,228,372,189"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="707,5,785,31"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="603,77,636,65,684,40,695,35,697,40,687,45,638,70,605,82"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="603,77,636,65,684,40,695,35,697,40,687,45,638,70,605,82"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="698,55,794,80"/>
<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="604,83,682,73,683,78,604,89"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="604,83,682,73,683,78,604,89"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="712,104,780,130"/>
<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="604,95,697,108,696,113,604,100"/>
<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="604,95,697,108,696,113,604,100"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="685,153,807,179"/>
<area shape="poly" id="edge8_Node000004_Node000008" title=" " alt="" coords="605,101,638,113,687,140,697,145,695,149,684,145,636,118,603,106"/>
<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="605,101,638,113,687,140,697,145,695,149,684,145,636,118,603,106"/>
</map>

2
d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5
View File

@@ -1 +1 @@
152dd2967de00a39e09ece49da0f929e
fc4174f43c406273aae7026d0b3b0803

53
d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg
View File

@@ -63,15 +63,6 @@ var sectionId = 'dynsection-4';
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M51.27,-111.54C38.5,-120.15 47.83,-129.25 79.25,-129.25 97.42,-129.25 108.2,-126.21 111.59,-121.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="114.9,-120.81 107.82,-112.93 108.44,-123.51 114.9,-120.81"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -83,9 +74,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge2_Node000001_Node000002" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M158.8,-101.62C166.73,-101.62 174.77,-101.62 182.65,-101.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-105.13 192.55,-101.63 182.55,-98.13 182.55,-105.13"/>
</a>
@@ -101,9 +92,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge3_Node000002_Node000003" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.55,-117.14C294.19,-133.88 326.01,-160.32 357.5,-176.62 364.2,-180.09 371.68,-183.04 378.98,-185.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="377.74,-188.76 388.33,-188.36 379.8,-182.07 377.74,-188.76"/>
</a>
@@ -119,9 +110,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4_Node000002_Node000004" class="edge">
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M298.09,-117.36C316.09,-124.44 337.78,-132.73 357.5,-139.62 361.98,-141.19 366.68,-142.77 371.38,-144.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="370.2,-147.61 380.79,-147.33 372.34,-140.94 370.2,-147.61"/>
</a>
@@ -137,9 +128,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M321.9,-109.3C340.52,-111.57 360.32,-113.98 376.83,-116"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="376.36,-119.47 386.71,-117.2 377.2,-112.52 376.36,-119.47"/>
</a>
@@ -155,9 +146,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge10_Node000002_Node000010" class="edge">
<g id="edge9_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M321.9,-94.36C341.24,-92.12 361.87,-89.74 378.76,-87.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="378.75,-91.31 388.28,-86.68 377.95,-84.36 378.75,-91.31"/>
</a>
@@ -173,9 +164,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge11_Node000002_Node000011" class="edge">
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge11_Node000002_Node000011"><a xlink:title=" ">
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M299.08,-86C316.89,-79.21 338.16,-71.29 357.5,-64.62 364.21,-62.31 371.4,-59.96 378.34,-57.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="379.35,-61.09 387.84,-54.76 377.25,-54.42 379.35,-61.09"/>
</a>
@@ -191,9 +182,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<g id="edge11_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.93,-86.03C294.65,-69.51 326.3,-43.65 357.5,-27.62 360.19,-26.24 363,-24.95 365.88,-23.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.96,-27.06 375.04,-20.21 364.45,-20.53 366.96,-27.06"/>
</a>
@@ -209,9 +200,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5_Node000004_Node000005" class="edge">
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.21,-166.71C457.41,-169.31 466.11,-172.34 474,-175.62 490.7,-182.59 493.59,-187 510,-194.62 512.58,-195.82 515.26,-197.02 517.97,-198.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="516.46,-201.36 527.03,-202.01 519.17,-194.91 516.46,-201.36"/>
</a>
@@ -227,9 +218,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge6_Node000004_Node000006" class="edge">
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.05,-161.85C466.51,-164.13 488.4,-166.99 507.7,-169.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="507.15,-172.97 517.52,-170.79 508.06,-166.03 507.15,-172.97"/>
</a>
@@ -245,9 +236,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge7_Node000004_Node000007" class="edge">
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.05,-153.17C469.85,-150.3 496.92,-146.57 518.42,-143.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="518.79,-147.08 528.22,-142.25 517.84,-140.15 518.79,-147.08"/>
</a>
@@ -263,9 +254,9 @@ var sectionId = 'dynsection-4';
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge8_Node000004_Node000008" class="edge">
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.26,-148.66C457.46,-146.06 466.15,-143 474,-139.62 490.82,-132.4 493.49,-127.52 510,-119.62 512.57,-118.4 515.24,-117.18 517.94,-115.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.15,-119.28 526.99,-112.16 516.42,-112.83 519.15,-119.28"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 15 KiB

After

Width:  |  Height:  |  Size: 14 KiB

53
d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg
View File

@@ -17,15 +17,6 @@
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M51.27,-111.54C38.5,-120.15 47.83,-129.25 79.25,-129.25 97.42,-129.25 108.2,-126.21 111.59,-121.98"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="114.9,-120.81 107.82,-112.93 108.44,-123.51 114.9,-120.81"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
@@ -37,9 +28,9 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge2_Node000001_Node000002" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M158.8,-101.62C166.73,-101.62 174.77,-101.62 182.65,-101.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-105.13 192.55,-101.63 182.55,-98.13 182.55,-105.13"/>
</a>
@@ -55,9 +46,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge3_Node000002_Node000003" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.55,-117.14C294.19,-133.88 326.01,-160.32 357.5,-176.62 364.2,-180.09 371.68,-183.04 378.98,-185.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="377.74,-188.76 388.33,-188.36 379.8,-182.07 377.74,-188.76"/>
</a>
@@ -73,9 +64,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4_Node000002_Node000004" class="edge">
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M298.09,-117.36C316.09,-124.44 337.78,-132.73 357.5,-139.62 361.98,-141.19 366.68,-142.77 371.38,-144.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="370.2,-147.61 380.79,-147.33 372.34,-140.94 370.2,-147.61"/>
</a>
@@ -91,9 +82,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge9_Node000002_Node000009" class="edge">
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M321.9,-109.3C340.52,-111.57 360.32,-113.98 376.83,-116"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="376.36,-119.47 386.71,-117.2 377.2,-112.52 376.36,-119.47"/>
</a>
@@ -109,9 +100,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node10 -->
<g id="edge10_Node000002_Node000010" class="edge">
<g id="edge9_Node000002_Node000010" class="edge">
<title>Node2&#45;&gt;Node10</title>
<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M321.9,-94.36C341.24,-92.12 361.87,-89.74 378.76,-87.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="378.75,-91.31 388.28,-86.68 377.95,-84.36 378.75,-91.31"/>
</a>
@@ -127,9 +118,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node11 -->
<g id="edge11_Node000002_Node000011" class="edge">
<g id="edge10_Node000002_Node000011" class="edge">
<title>Node2&#45;&gt;Node11</title>
<g id="a_edge11_Node000002_Node000011"><a xlink:title=" ">
<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M299.08,-86C316.89,-79.21 338.16,-71.29 357.5,-64.62 364.21,-62.31 371.4,-59.96 378.34,-57.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="379.35,-61.09 387.84,-54.76 377.25,-54.42 379.35,-61.09"/>
</a>
@@ -145,9 +136,9 @@
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<g id="edge11_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.93,-86.03C294.65,-69.51 326.3,-43.65 357.5,-27.62 360.19,-26.24 363,-24.95 365.88,-23.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.96,-27.06 375.04,-20.21 364.45,-20.53 366.96,-27.06"/>
</a>
@@ -163,9 +154,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5_Node000004_Node000005" class="edge">
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.21,-166.71C457.41,-169.31 466.11,-172.34 474,-175.62 490.7,-182.59 493.59,-187 510,-194.62 512.58,-195.82 515.26,-197.02 517.97,-198.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="516.46,-201.36 527.03,-202.01 519.17,-194.91 516.46,-201.36"/>
</a>
@@ -181,9 +172,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge6_Node000004_Node000006" class="edge">
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.05,-161.85C466.51,-164.13 488.4,-166.99 507.7,-169.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="507.15,-172.97 517.52,-170.79 508.06,-166.03 507.15,-172.97"/>
</a>
@@ -199,9 +190,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge7_Node000004_Node000007" class="edge">
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.05,-153.17C469.85,-150.3 496.92,-146.57 518.42,-143.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="518.79,-147.08 528.22,-142.25 517.84,-140.15 518.79,-147.08"/>
</a>
@@ -217,9 +208,9 @@
</g>
</g>
<!-- Node4&#45;&gt;Node8 -->
<g id="edge8_Node000004_Node000008" class="edge">
<g id="edge7_Node000004_Node000008" class="edge">
<title>Node4&#45;&gt;Node8</title>
<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M449.26,-148.66C457.46,-146.06 466.15,-143 474,-139.62 490.82,-132.4 493.49,-127.52 510,-119.62 512.57,-118.4 515.24,-117.18 517.94,-115.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.15,-119.28 526.99,-112.16 516.42,-112.83 519.15,-119.28"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 10 KiB

17
d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map
View File

@@ -1,16 +1,5 @@
<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,105,199,131"/>
<area shape="rect" id="Node000002" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" title=" " alt="" coords="282,80,366,106"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,104,266,97,266,102,199,110"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,129,401,155"/>
<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="199,126,231,130,231,135,199,131"/>
<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="296,81,290,71,294,62,305,56,324,53,344,56,354,63,352,67,342,61,324,59,307,61,298,65,296,71,300,78"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="453,5,524,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="353,77,443,36,445,40,355,82"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="456,55,521,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="366,84,440,72,441,77,367,89"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="449,104,527,130"/>
<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="367,96,434,106,433,112,366,102"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="451,153,526,179"/>
<area shape="poly" id="edge6_Node000002_Node000006" title=" " alt="" coords="367,102,402,114,454,143,451,148,400,119,365,107"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,199,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,5,401,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,16,231,16,231,21,199,21"/>
</map>

2
d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5
View File

@@ -1 +1 @@
0d4f9d0b14c4f8b392a1f0ac11f16fb9
7f1dc6e9d6cb9a5a6d5f47948242c662

119
d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="305pt" height="27pt"
viewBox="0.00 0.00 304.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,23 +16,23 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-55.25 0,-55.25 0,-36 145,-36 145,-55.25"/>
<text text-anchor="middle" x="72.5" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-19.25 0,-19.25 0,0 145,0 145,-19.25"/>
<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -40,107 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-53.9C162.35,-55.9 180.22,-57.96 195.62,-59.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.02,-63.19 205.35,-60.87 195.82,-56.24 195.02,-63.19"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge7_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-37.78C153.18,-36.9 161.37,-36 169.38,-35.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-38.63 179.06,-34.07 168.74,-31.68 169.5,-38.63"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge4_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge6_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge6_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-9.62C153.08,-9.62 161.18,-9.62 169.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.05,-13.13 179.05,-9.63 169.05,-6.13 169.05,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.1 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

119
d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg
View File

@@ -4,25 +4,25 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
<svg width="400pt" height="138pt"
viewBox="0.00 0.00 399.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<svg width="305pt" height="27pt"
viewBox="0.00 0.00 304.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>machine_learning::operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="145,-55.25 0,-55.25 0,-36 145,-36 145,-55.25"/>
<text text-anchor="middle" x="72.5" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="145,-19.25 0,-19.25 0,0 145,0 145,-19.25"/>
<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="270.5,-74.25 207.25,-74.25 207.25,-55 270.5,-55 270.5,-74.25"/>
<text text-anchor="middle" x="238.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
@@ -30,107 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-53.9C162.35,-55.9 180.22,-57.96 195.62,-59.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.02,-63.19 205.35,-60.87 195.82,-56.24 195.02,-63.19"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="296.75,-37.25 181,-37.25 181,-18 296.75,-18 296.75,-37.25"/>
<text text-anchor="middle" x="238.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge7_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M145.12,-37.78C153.18,-36.9 161.37,-36 169.38,-35.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-38.63 179.06,-34.07 168.74,-31.68 169.5,-38.63"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge4_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M219.58,-74.54C210.78,-83.15 217.21,-92.25 238.88,-92.25 250.72,-92.25 258.02,-89.53 260.75,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="264.18,-84.96 258.51,-76.01 257.37,-86.54 264.18,-84.96"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="388.88,-130.25 335.38,-130.25 335.38,-111 388.88,-111 388.88,-130.25"/>
<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M261.55,-74.64C280.32,-83.3 307.71,-95.96 329.02,-105.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="327.31,-108.86 337.85,-109.88 330.24,-102.51 327.31,-108.86"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="386.62,-93.25 337.62,-93.25 337.62,-74 386.62,-74 386.62,-93.25"/>
<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-69.47C287.71,-72.12 308.73,-75.41 326.24,-78.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.24,-81.54 335.66,-79.63 326.32,-74.63 325.24,-81.54"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="391.5,-56.25 332.75,-56.25 332.75,-37 391.5,-37 391.5,-56.25"/>
<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.79,-60.04C286.18,-57.75 304.96,-54.96 321.41,-52.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.48,-56.05 330.86,-51.12 320.45,-49.13 321.48,-56.05"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="390.38,-19.25 333.88,-19.25 333.88,0 390.38,0 390.38,-19.25"/>
<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge6_Node000002_Node000006" class="edge">
<title>Node2&#45;&gt;Node6</title>
<g id="a_edge6_Node000002_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.72,-56.19C279.29,-53.49 288.5,-50.25 296.75,-46.62 304.42,-43.25 320.9,-33.77 335.27,-25.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.65,-28.49 343.44,-20.36 333.06,-22.48 336.65,-28.49"/>
<path fill="none" stroke="#63b8ff" d="M145.12,-9.62C153.08,-9.62 161.18,-9.62 169.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.05,-13.13 179.05,-9.63 169.05,-6.13 169.05,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

107
d8/d7a/sha1_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: hashing/sha1.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d7a/sha1_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d7a/sha1_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -130,25 +132,25 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:acf6bd970f29a68702bdbdfe8338e45e0" id="r_acf6bd970f29a68702bdbdfe8338e45e0"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0">hashing::sha1::leftRotate32bits</a> (uint32_t n, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> rotate)</td></tr>
<tr class="memitem:acf6bd970f29a68702bdbdfe8338e45e0" id="r_acf6bd970f29a68702bdbdfe8338e45e0"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf6bd970f29a68702bdbdfe8338e45e0">hashing::sha1::leftRotate32bits</a> (uint32_t n, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> rotate)</td></tr>
<tr class="memdesc:acf6bd970f29a68702bdbdfe8338e45e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotates the bits of a 32-bit unsigned integer. <br /></td></tr>
<tr class="separator:acf6bd970f29a68702bdbdfe8338e45e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aada0803ef851d831b7a290a924e3c228" id="r_aada0803ef851d831b7a290a924e3c228"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a> (void *sig)</td></tr>
<tr class="memitem:aada0803ef851d831b7a290a924e3c228" id="r_aada0803ef851d831b7a290a924e3c228"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a> (void *sig)</td></tr>
<tr class="memdesc:aada0803ef851d831b7a290a924e3c228"><td class="mdescLeft">&#160;</td><td class="mdescRight">Transforms the 160-bit SHA-1 signature into a 40 char hex string. <br /></td></tr>
<tr class="separator:aada0803ef851d831b7a290a924e3c228"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7be3471f7e489d7d0df42b97a48bf141" id="r_a7be3471f7e489d7d0df42b97a48bf141"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141">hashing::sha1::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
<tr class="memitem:a7be3471f7e489d7d0df42b97a48bf141" id="r_a7be3471f7e489d7d0df42b97a48bf141"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7be3471f7e489d7d0df42b97a48bf141">hashing::sha1::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
<tr class="memdesc:a7be3471f7e489d7d0df42b97a48bf141"><td class="mdescLeft">&#160;</td><td class="mdescRight">The SHA-1 algorithm itself, taking in a bytestring. <br /></td></tr>
<tr class="separator:a7be3471f7e489d7d0df42b97a48bf141"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2397f2444a05e4d1487c67e215410d3c" id="r_a2397f2444a05e4d1487c67e215410d3c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;message)</td></tr>
<tr class="memitem:a2397f2444a05e4d1487c67e215410d3c" id="r_a2397f2444a05e4d1487c67e215410d3c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;message)</td></tr>
<tr class="memdesc:a2397f2444a05e4d1487c67e215410d3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Converts the string to bytestring and calls the main algorithm. <br /></td></tr>
<tr class="separator:a2397f2444a05e4d1487c67e215410d3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations of well-known SHA-1 hashes. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9e1a11f44135b890dd10a00e73b5661" id="r_ac9e1a11f44135b890dd10a00e73b5661"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a> ()</td></tr>
<tr class="memitem:ac9e1a11f44135b890dd10a00e73b5661" id="r_ac9e1a11f44135b890dd10a00e73b5661"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a> ()</td></tr>
<tr class="memdesc:ac9e1a11f44135b890dd10a00e73b5661"><td class="mdescLeft">&#160;</td><td class="mdescRight">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed. <br /></td></tr>
<tr class="separator:ac9e1a11f44135b890dd10a00e73b5661"><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="../../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -170,8 +172,7 @@ Algorithm</h3>
<tr>
<td class="memname">void * hashing::sha1::hash </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>message</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td> <td class="paramname"><span class="paramname"><em>message</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -207,19 +208,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void * hashing::sha1::hash_bs </td>
<td>(</td>
<td class="paramtype">const void *&#160;</td>
<td class="paramname"><em>input_bs</em>, </td>
<td class="paramtype">const void *</td> <td class="paramname"><span class="paramname"><em>input_bs</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>input_size</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>input_size</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -379,7 +373,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void interactive </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -398,8 +392,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 277</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
<div class="line"><span class="lineno"> 278</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 279</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, input);</div>
<div class="line"><span class="lineno"> 280</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(input);</div>
<div class="line"><span class="lineno"> 281</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 280</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(input);</div>
<div class="line"><span class="lineno"> 281</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 282</span> </div>
<div class="line"><span class="lineno"> 283</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><span class="lineno"> 284</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
@@ -418,8 +412,8 @@ Here is the call graph for this function:</div>
<div class="ttc" id="acompare_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">std::string::compare</a></div><div class="ttdeci">T compare(T... args)</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
<div class="ttc" id="asha1_8cpp_html_a2397f2444a05e4d1487c67e215410d3c"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> sha1.cpp:210</div></div>
<div class="ttc" id="asha1_8cpp_html_aada0803ef851d831b7a290a924e3c228"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 160-bit SHA-1 signature into a 40 char hex string.</div><div class="ttdef"><b>Definition</b> sha1.cpp:66</div></div>
<div class="ttc" id="asha1_8cpp_html_a2397f2444a05e4d1487c67e215410d3c"><div class="ttname"><a href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> sha1.cpp:210</div></div>
<div class="ttc" id="asha1_8cpp_html_aada0803ef851d831b7a290a924e3c228"><div class="ttname"><a href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 160-bit SHA-1 signature into a 40 char hex string.</div><div class="ttdef"><b>Definition</b> sha1.cpp:66</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -437,19 +431,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint32_t hashing::sha1::leftRotate32bits </td>
<td>(</td>
<td class="paramtype">uint32_t&#160;</td>
<td class="paramname"><em>n</em>, </td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>n</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td>
<td class="paramname"><em>rotate</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td> <td class="paramname"><span class="paramname"><em>rotate</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -479,8 +466,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -489,19 +475,19 @@ Here is the call graph for this function:</div>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 299</span> {</div>
<div class="line"><span class="lineno"> 300</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 300</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 301</span> </div>
<div class="line"><span class="lineno"> 302</span> <span class="comment">// Launch interactive mode where user can input messages and see</span></div>
<div class="line"><span class="lineno"> 303</span> <span class="comment">// their hash</span></div>
<div class="line"><span class="lineno"> 304</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
<div class="line"><span class="lineno"> 304</span> <a class="code hl_function" href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
<div class="line"><span class="lineno"> 305</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 306</span>}</div>
<div class="ttc" id="asha1_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known SHA-1 hashes.</div><div class="ttdef"><b>Definition</b> sha1.cpp:220</div></div>
<div class="ttc" id="asha1_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> sha1.cpp:274</div></div>
<div class="ttc" id="asha1_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known SHA-1 hashes.</div><div class="ttdef"><b>Definition</b> sha1.cpp:220</div></div>
<div class="ttc" id="asha1_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> sha1.cpp:274</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="375" height="135"><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" frameborder="0" src="../../d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="375" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -515,8 +501,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> hashing::sha1::sig2hex </td>
<td>(</td>
<td class="paramtype">void *&#160;</td>
<td class="paramname"><em>sig</em></td><td>)</td>
<td class="paramtype">void *</td> <td class="paramname"><span class="paramname"><em>sig</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -556,7 +541,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -571,57 +556,57 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 220</span> {</div>
<div class="line"><span class="lineno"> 221</span> <span class="comment">// Hashes empty string and stores signature</span></div>
<div class="line"><span class="lineno"> 222</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 222</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 223</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 224</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 225</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 225</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 226</span> <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
<div class="line"><span class="lineno"> 227</span> assert(hashing::sha1::sig2hex(sig).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 227</span> assert(hashing::sha1::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 228</span> <span class="stringliteral">&quot;da39a3ee5e6b4b0d3255bfef95601890afd80709&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 229</span> </div>
<div class="line"><span class="lineno"> 230</span> <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog&quot; and stores signature</span></div>
<div class="line"><span class="lineno"> 231</span> <span class="keywordtype">void</span>* sig2 =</div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
<div class="line"><span class="lineno"> 233</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
<div class="line"><span class="lineno"> 234</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 235</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig2) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig2) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 237</span> <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
<div class="line"><span class="lineno"> 238</span> assert(hashing::sha1::sig2hex(sig2).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 238</span> assert(hashing::sha1::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 239</span> <span class="stringliteral">&quot;2fd4e1c67a2d28fced849ee1bb76e7391b93eb12&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 240</span> </div>
<div class="line"><span class="lineno"> 241</span> <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog.&quot; (notice the</span></div>
<div class="line"><span class="lineno"> 242</span> <span class="comment">// additional period) and stores signature</span></div>
<div class="line"><span class="lineno"> 243</span> <span class="keywordtype">void</span>* sig3 =</div>
<div class="line"><span class="lineno"> 244</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
<div class="line"><span class="lineno"> 244</span> <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
<div class="line"><span class="lineno"> 245</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
<div class="line"><span class="lineno"> 246</span> <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
<div class="line"><span class="lineno"> 247</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 248</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig3) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig3) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 250</span> <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
<div class="line"><span class="lineno"> 251</span> assert(hashing::sha1::sig2hex(sig3).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 251</span> assert(hashing::sha1::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 252</span> <span class="stringliteral">&quot;408d94384216f890ff7a0c3528e8bed1e0b01621&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 253</span> </div>
<div class="line"><span class="lineno"> 254</span> <span class="comment">// Hashes &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
<div class="line"><span class="lineno"> 255</span> <span class="comment">// and stores signature</span></div>
<div class="line"><span class="lineno"> 256</span> <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(</div>
<div class="line"><span class="lineno"> 256</span> <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(</div>
<div class="line"><span class="lineno"> 257</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
<div class="line"><span class="lineno"> 258</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
<div class="line"><span class="lineno"> 259</span> &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
<div class="line"><span class="lineno"> 260</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
<div class="line"><span class="lineno"> 261</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 262</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig4) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig4) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 264</span> <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
<div class="line"><span class="lineno"> 265</span> assert(hashing::sha1::sig2hex(sig4).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 265</span> assert(hashing::sha1::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 266</span> <span class="stringliteral">&quot;761c457bf73b14d27e9e9265c46f4b4dda11f940&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 267</span>}</div>
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> huffman.cpp:28</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:87</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><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" frameborder="0" src="../../d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -632,7 +617,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d8/d7a/sha1_8cpp.html">sha1.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

8
d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,5 +1,7 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes." alt="" coords="5,5,49,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
<area shape="rect" id="Node000001" title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes." alt="" coords="5,31,49,56"/>
<area shape="rect" id="Node000002" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="97,5,168,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,55,168,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,82,53,81,58,49,51"/>
</map>

2
d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
26083a40d70f854a17e3e067d4246882
051da4281d575e7f47fc60770596a53a

38
d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<svg width="130pt" height="27pt"
viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="130pt" height="64pt"
viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,23 +16,23 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
</a>
</g>
</g>
@@ -40,8 +40,26 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

38
d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -4,25 +4,25 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<svg width="130pt" height="27pt"
viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<svg width="130pt" height="64pt"
viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
</a>
</g>
</g>
@@ -30,8 +30,26 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

4
d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -10,5 +10,7 @@
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="185,78,251,99,249,104,184,83"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="258,55,343,80"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="184,65,243,65,243,70,184,70"/>
<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="166,114,250,114,250,120,166,120"/>
<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="166,114,250,114,250,120,166,120"/>
<area shape="rect" id="Node000007" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="265,153,336,179"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="166,121,251,148,250,153,165,126"/>
</map>

2
d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
8ea8abf0dd20626a6248a98fe192134d
0ed0d9463a76665282a5146586435f83

76
d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="281pt" height="101pt"
viewBox="0.00 0.00 281.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="281pt" height="138pt"
viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,14 +16,14 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -31,8 +31,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
<polygon fill="white" stroke="#666666" points="134,-56.25 73,-56.25 73,-37 134,-37 134,-56.25"/>
<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
</a>
</g>
</g>
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.1,-31.65C44.25,-33.29 52.83,-35.25 61.39,-37.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-40.6 71.03,-39.42 62.06,-33.78 60.5,-40.6"/>
<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
</a>
</g>
</g>
@@ -49,8 +49,8 @@
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
<polygon fill="white" stroke="#666666" points="119.75,-19.25 87.25,-19.25 87.25,0 119.75,0 119.75,-19.25"/>
<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -58,8 +58,8 @@
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.1,-23.81C48.4,-21.36 63.27,-18.13 75.98,-15.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-18.87 85.4,-13.33 74.89,-12.03 76.37,-18.87"/>
<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
</a>
</g>
</g>
@@ -67,8 +67,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273,-93.25 170,-93.25 170,-74 273,-74 273,-93.25"/>
<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
</a>
</g>
</g>
@@ -76,8 +76,8 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-56.15C147.75,-60.42 163.75,-65.52 178.32,-70.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-73.45 187.66,-73.15 179.2,-66.78 177.07,-73.45"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
</a>
</g>
</g>
@@ -85,8 +85,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -94,8 +94,8 @@
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-37.1C149.43,-32.29 167.82,-26.43 183.73,-21.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-24.82 192.84,-18.45 182.25,-18.15 184.38,-24.82"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
</a>
</g>
</g>
@@ -103,8 +103,8 @@
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.5,-56.25 189.5,-56.25 189.5,-37 253.5,-37 253.5,-56.25"/>
<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
</a>
</g>
</g>
@@ -112,17 +112,35 @@
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-46.62C147.62,-46.62 163.44,-46.62 177.89,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-50.13 187.59,-46.63 177.59,-43.13 177.59,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge6_Node000006_Node000004" class="edge">
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-9.62C136.22,-9.62 161.83,-9.62 183.15,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-13.13 192.96,-9.63 182.96,-6.13 182.96,-13.13"/>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.2 KiB

After

Width:  |  Height:  |  Size: 7.0 KiB

76
d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="281pt" height="101pt"
viewBox="0.00 0.00 281.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
<svg width="281pt" height="138pt"
viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
<polygon fill="white" stroke="#666666" points="134,-56.25 73,-56.25 73,-37 134,-37 134,-56.25"/>
<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
</a>
</g>
</g>
@@ -30,8 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.1,-31.65C44.25,-33.29 52.83,-35.25 61.39,-37.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-40.6 71.03,-39.42 62.06,-33.78 60.5,-40.6"/>
<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
</a>
</g>
</g>
@@ -39,8 +39,8 @@
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
<polygon fill="white" stroke="#666666" points="119.75,-19.25 87.25,-19.25 87.25,0 119.75,0 119.75,-19.25"/>
<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -48,8 +48,8 @@
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.1,-23.81C48.4,-21.36 63.27,-18.13 75.98,-15.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-18.87 85.4,-13.33 74.89,-12.03 76.37,-18.87"/>
<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
</a>
</g>
</g>
@@ -57,8 +57,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273,-93.25 170,-93.25 170,-74 273,-74 273,-93.25"/>
<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
</a>
</g>
</g>
@@ -66,8 +66,8 @@
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-56.15C147.75,-60.42 163.75,-65.52 178.32,-70.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-73.45 187.66,-73.15 179.2,-66.78 177.07,-73.45"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
</a>
</g>
</g>
@@ -75,8 +75,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -84,8 +84,8 @@
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-37.1C149.43,-32.29 167.82,-26.43 183.73,-21.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-24.82 192.84,-18.45 182.25,-18.15 184.38,-24.82"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
</a>
</g>
</g>
@@ -93,8 +93,8 @@
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.5,-56.25 189.5,-56.25 189.5,-37 253.5,-37 253.5,-56.25"/>
<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
</a>
</g>
</g>
@@ -102,17 +102,35 @@
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M134.37,-46.62C147.62,-46.62 163.44,-46.62 177.89,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-50.13 187.59,-46.63 177.59,-43.13 177.59,-50.13"/>
<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge6_Node000006_Node000004" class="edge">
<g id="edge7_Node000006_Node000004" class="edge">
<title>Node6&#45;&gt;Node4</title>
<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-9.62C136.22,-9.62 161.83,-9.62 183.15,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-13.13 192.96,-9.63 182.96,-6.13 182.96,-13.13"/>
<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 6.3 KiB

170
d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d8/d7c/classoperations__on__datastruct
<div class="contents">
<p>A class that implements a Circular Linked List.
<a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for operations_on_datastructures::circular_linked_list::CircularLinkedList:</div>
<div class="dyncontent">
@@ -115,45 +117,45 @@ Collaboration diagram for operations_on_datastructures::circular_linked_list::Ci
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa704319924f97fedfb41caf193a00888" id="r_aa704319924f97fedfb41caf193a00888"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888">CircularLinkedList</a> ()</td></tr>
<tr class="memitem:aa704319924f97fedfb41caf193a00888" id="r_aa704319924f97fedfb41caf193a00888"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa704319924f97fedfb41caf193a00888">CircularLinkedList</a> ()</td></tr>
<tr class="memdesc:aa704319924f97fedfb41caf193a00888"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates an empty <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. <br /></td></tr>
<tr class="separator:aa704319924f97fedfb41caf193a00888"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a142fa439b102c6f86341f421ddcfe0a1" id="r_a142fa439b102c6f86341f421ddcfe0a1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1">CircularLinkedList</a> (const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;copy)</td></tr>
<tr class="memitem:a142fa439b102c6f86341f421ddcfe0a1" id="r_a142fa439b102c6f86341f421ddcfe0a1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a142fa439b102c6f86341f421ddcfe0a1">CircularLinkedList</a> (const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;copy)</td></tr>
<tr class="memdesc:a142fa439b102c6f86341f421ddcfe0a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor for <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. <br /></td></tr>
<tr class="separator:a142fa439b102c6f86341f421ddcfe0a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abde75f6ee432b0378d264da8c7c64db2" id="r_abde75f6ee432b0378d264da8c7c64db2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2">CircularLinkedList</a> (<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;source) noexcept</td></tr>
<tr class="memitem:abde75f6ee432b0378d264da8c7c64db2" id="r_abde75f6ee432b0378d264da8c7c64db2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abde75f6ee432b0378d264da8c7c64db2">CircularLinkedList</a> (<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;source) noexcept</td></tr>
<tr class="memdesc:abde75f6ee432b0378d264da8c7c64db2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move constructor for <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. <br /></td></tr>
<tr class="separator:abde75f6ee432b0378d264da8c7c64db2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9cc37166f2f73763df39894b675f89c9" id="r_a9cc37166f2f73763df39894b675f89c9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operator=</a> (const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;other)</td></tr>
<tr class="memitem:a9cc37166f2f73763df39894b675f89c9" id="r_a9cc37166f2f73763df39894b675f89c9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9cc37166f2f73763df39894b675f89c9">operator=</a> (const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;other)</td></tr>
<tr class="memdesc:a9cc37166f2f73763df39894b675f89c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy assignment operator. <br /></td></tr>
<tr class="separator:a9cc37166f2f73763df39894b675f89c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8f26dc32615abc5bab8ac458ef424bc5" id="r_a8f26dc32615abc5bab8ac458ef424bc5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5">operator=</a> (<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;other) noexcept</td></tr>
<tr class="memitem:a8f26dc32615abc5bab8ac458ef424bc5" id="r_a8f26dc32615abc5bab8ac458ef424bc5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8f26dc32615abc5bab8ac458ef424bc5">operator=</a> (<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;other) noexcept</td></tr>
<tr class="memdesc:a8f26dc32615abc5bab8ac458ef424bc5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move assignment operator. <br /></td></tr>
<tr class="separator:a8f26dc32615abc5bab8ac458ef424bc5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a46195fcf11b636064c7172cb74b55dd0" id="r_a46195fcf11b636064c7172cb74b55dd0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0">~CircularLinkedList</a> ()</td></tr>
<tr class="memitem:a46195fcf11b636064c7172cb74b55dd0" id="r_a46195fcf11b636064c7172cb74b55dd0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a46195fcf11b636064c7172cb74b55dd0">~CircularLinkedList</a> ()</td></tr>
<tr class="memdesc:a46195fcf11b636064c7172cb74b55dd0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Cleans up memory when destroyed. <br /></td></tr>
<tr class="separator:a46195fcf11b636064c7172cb74b55dd0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a398d6cc927a2c8e4a156ae2806f48986" id="r_a398d6cc927a2c8e4a156ae2806f48986"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a> ()</td></tr>
<tr class="memitem:a398d6cc927a2c8e4a156ae2806f48986" id="r_a398d6cc927a2c8e4a156ae2806f48986"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a> ()</td></tr>
<tr class="separator:a398d6cc927a2c8e4a156ae2806f48986"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac38565472a07d07f63ec0d2fd8a69d4d" id="r_ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>)</td></tr>
<tr class="memitem:ac38565472a07d07f63ec0d2fd8a69d4d" id="r_ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>)</td></tr>
<tr class="memdesc:ac38565472a07d07f63ec0d2fd8a69d4d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts all the values from a vector into the Circular Linked List. <br /></td></tr>
<tr class="separator:ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3b7bbb0918c261bc216aef9e6dd39aa4" id="r_a3b7bbb0918c261bc216aef9e6dd39aa4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4">insert</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memitem:a3b7bbb0918c261bc216aef9e6dd39aa4" id="r_a3b7bbb0918c261bc216aef9e6dd39aa4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b7bbb0918c261bc216aef9e6dd39aa4">insert</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a3b7bbb0918c261bc216aef9e6dd39aa4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts a single value into the Circular Linked List. <br /></td></tr>
<tr class="separator:a3b7bbb0918c261bc216aef9e6dd39aa4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a15150d6d933c58190c9c1dd7d22c51ae" id="r_a15150d6d933c58190c9c1dd7d22c51ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">insert</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memitem:a15150d6d933c58190c9c1dd7d22c51ae" id="r_a15150d6d933c58190c9c1dd7d22c51ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15150d6d933c58190c9c1dd7d22c51ae">insert</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:a15150d6d933c58190c9c1dd7d22c51ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts a given <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> into the Circular Linked List. <br /></td></tr>
<tr class="separator:a15150d6d933c58190c9c1dd7d22c51ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac341901e926b3fa3a796c64ca572f592" id="r_ac341901e926b3fa3a796c64ca572f592"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">print</a> ()</td></tr>
<tr class="memitem:ac341901e926b3fa3a796c64ca572f592" id="r_ac341901e926b3fa3a796c64ca572f592"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac341901e926b3fa3a796c64ca572f592">print</a> ()</td></tr>
<tr class="memdesc:ac341901e926b3fa3a796c64ca572f592"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of the Circular Linked List, beginning from the root <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:ac341901e926b3fa3a796c64ca572f592"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a424b17ddc672b25fe0bd9dc8612fba21" id="r_a424b17ddc672b25fe0bd9dc8612fba21"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21">print</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
<tr class="memitem:a424b17ddc672b25fe0bd9dc8612fba21" id="r_a424b17ddc672b25fe0bd9dc8612fba21"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a424b17ddc672b25fe0bd9dc8612fba21">print</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
<tr class="memdesc:a424b17ddc672b25fe0bd9dc8612fba21"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of the Circular Linked List, beginning from a given <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> to be used as the root. <br /></td></tr>
<tr class="separator:a424b17ddc672b25fe0bd9dc8612fba21"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a53611ec1fef92eeeb875aea1bde1e4de" id="r_a53611ec1fef92eeeb875aea1bde1e4de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a> ()</td></tr>
<tr class="memitem:a53611ec1fef92eeeb875aea1bde1e4de" id="r_a53611ec1fef92eeeb875aea1bde1e4de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a> ()</td></tr>
<tr class="memdesc:a53611ec1fef92eeeb875aea1bde1e4de"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List. <br /></td></tr>
<tr class="separator:a53611ec1fef92eeeb875aea1bde1e4de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a03a896b34d27fda69049827e0c4dab42" id="r_a03a896b34d27fda69049827e0c4dab42"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42">values</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
<tr class="memitem:a03a896b34d27fda69049827e0c4dab42" id="r_a03a896b34d27fda69049827e0c4dab42"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a03a896b34d27fda69049827e0c4dab42">values</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
<tr class="memdesc:a03a896b34d27fda69049827e0c4dab42"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List, beginning from a given <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:a03a896b34d27fda69049827e0c4dab42"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -163,7 +165,7 @@ Private Attributes</h2></td></tr>
<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
<tr class="memdesc:a5d5cebd6bc906c60763fc6be10cfdd13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the root <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:a5d5cebd6bc906c60763fc6be10cfdd13"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab682f854f39582a20c9c4102f0482208" id="r_ab682f854f39582a20c9c4102f0482208"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> {}</td></tr>
<tr class="memitem:ab682f854f39582a20c9c4102f0482208" id="r_ab682f854f39582a20c9c4102f0482208"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab682f854f39582a20c9c4102f0482208">end</a> {}</td></tr>
<tr class="memdesc:ab682f854f39582a20c9c4102f0482208"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the last <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:ab682f854f39582a20c9c4102f0482208"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -182,7 +184,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -195,11 +197,11 @@ Private Attributes</h2></td></tr>
<p>Creates an empty <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. </p>
<div class="fragment"><div class="line"><span class="lineno"> 66</span> {</div>
<div class="line"><span class="lineno"> 67</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 67</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a5d5cebd6bc906c60763fc6be10cfdd13"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">operations_on_datastructures::circular_linked_list::CircularLinkedList::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:59</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ab682f854f39582a20c9c4102f0482208"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList::end</a></div><div class="ttdeci">Node * end</div><div class="ttdoc">Pointer to the last Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:60</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a5d5cebd6bc906c60763fc6be10cfdd13"><div class="ttname"><a href="#a5d5cebd6bc906c60763fc6be10cfdd13">operations_on_datastructures::circular_linked_list::CircularLinkedList::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:59</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ab682f854f39582a20c9c4102f0482208"><div class="ttname"><a href="#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList::end</a></div><div class="ttdeci">Node * end</div><div class="ttdoc">Pointer to the last Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:60</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -215,8 +217,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td>
<td class="paramname"><em>copy</em></td><td>)</td>
<td class="paramtype">const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;</td> <td class="paramname"><span class="paramname"><em>copy</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -229,16 +230,16 @@ Private Attributes</h2></td></tr>
<p>Copy constructor for <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. </p>
<div class="fragment"><div class="line"><span class="lineno"> 73</span> {</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">copy</a>.root;</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
<div class="line"><span class="lineno"> 79</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="line"><span class="lineno"> 81</span> }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a398d6cc927a2c8e4a156ae2806f48986"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">operations_on_datastructures::circular_linked_list::CircularLinkedList::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:126</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac38565472a07d07f63ec0d2fd8a69d4d"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(const std::vector&lt; int64_t &gt; &amp;values)</div><div class="ttdoc">Inserts all the values from a vector into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:146</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a398d6cc927a2c8e4a156ae2806f48986"><div class="ttname"><a href="#a398d6cc927a2c8e4a156ae2806f48986">operations_on_datastructures::circular_linked_list::CircularLinkedList::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:126</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac38565472a07d07f63ec0d2fd8a69d4d"><div class="ttname"><a href="#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(const std::vector&lt; int64_t &gt; &amp;values)</div><div class="ttdoc">Inserts all the values from a vector into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:146</div></div>
<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</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> binary_search_tree.cpp:11</div></div>
@@ -262,8 +263,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;&#160;</td>
<td class="paramname"><em>source</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;</td> <td class="paramname"><span class="paramname"><em>source</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -282,8 +282,8 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 86</span> {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = source.root;</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = source.end;</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = source.root;</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = source.end;</div>
<div class="line"><span class="lineno"> 89</span> source.root = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 90</span> source.end = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 91</span> }</div>
@@ -302,7 +302,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -314,7 +314,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>Cleans up memory when destroyed. </p>
<div class="fragment"><div class="line"><span class="lineno"> 122</span>{ <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>(); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 122</span>{ <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>(); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -336,7 +336,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::erase </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -348,18 +348,19 @@ Here is the call graph for this function:</div>
</div><div class="memdoc">
<p>Iteratively frees each node in the Circular Linked List from the heap </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_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 129</span> }</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 133</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 134</span> <span class="keyword">delete</span> (temp);</div>
<div class="line"><span class="lineno"> 135</span> } <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 136</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 135</span> } <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 136</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 138</span> }</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -375,8 +376,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;&#160;</td>
<td class="paramname"><em>values</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>values</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -396,11 +396,11 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 146</span> {</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">for</span> (int64_t value : <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>) {</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(value);</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">for</span> (int64_t value : <a class="code hl_function" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>) {</div>
<div class="line"><span class="lineno"> 148</span> <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(value);</div>
<div class="line"><span class="lineno"> 149</span> }</div>
<div class="line"><span class="lineno"> 150</span> }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a53611ec1fef92eeeb875aea1bde1e4de"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values()</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:214</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a53611ec1fef92eeeb875aea1bde1e4de"><div class="ttname"><a href="#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values()</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:214</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -421,8 +421,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em></td><td>)</td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -442,8 +441,8 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 158</span> {</div>
<div class="line"><span class="lineno"> 159</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
<div class="line"><span class="lineno"> 159</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
<div class="line"><span class="lineno"> 161</span> }</div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -466,8 +465,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>node</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -493,14 +491,14 @@ Here is the call graph for this function:</div>
<p>&lt; Set the next value to the root</p>
<p>&lt; Make end point to node</p>
<div class="fragment"><div class="line"><span class="lineno"> 169</span> {</div>
<div class="line"><span class="lineno"> 170</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 171</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>; <span class="comment">///&lt; Set node as the root</span></div>
<div class="line"><span class="lineno"> 172</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Point node to itself</span></div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Set the end to the root</span></div>
<div class="line"><span class="lineno"> 170</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 171</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>; <span class="comment">///&lt; Set node as the root</span></div>
<div class="line"><span class="lineno"> 172</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Point node to itself</span></div>
<div class="line"><span class="lineno"> 173</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Set the end to the root</span></div>
<div class="line"><span class="lineno"> 174</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 175</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a>-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>; <span class="comment">///&lt; Append node to the end</span></div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Set the next value to the root</span></div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>; <span class="comment">///&lt; Make end point to node</span></div>
<div class="line"><span class="lineno"> 175</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a>-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>; <span class="comment">///&lt; Append node to the end</span></div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>; <span class="comment">///&lt; Set the next value to the root</span></div>
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>; <span class="comment">///&lt; Make end point to node</span></div>
<div class="line"><span class="lineno"> 178</span> }</div>
<div class="line"><span class="lineno"> 179</span> }</div>
<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:34</div></div>
@@ -519,8 +517,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp; operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;&#160;</td>
<td class="paramname"><em>other</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -540,8 +537,8 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Reference to <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a> </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = other.root;</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = other.end;</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = other.root;</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = other.end;</div>
<div class="line"><span class="lineno"> 115</span> other.root = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 116</span> other.end = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -561,8 +558,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp; operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;&#160;</td>
<td class="paramname"><em>other</em></td><td>)</td>
<td class="paramtype">const <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> &amp;</td> <td class="paramname"><span class="paramname"><em>other</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -582,11 +578,11 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Reference to <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a> </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 97</span> {</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 100</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = other.root;</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 104</span> }</div>
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -611,7 +607,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::print </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -624,8 +620,8 @@ Here is the call graph for this function:</div>
<p>Prints the values of the Circular Linked List, beginning from the root <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>. </p>
<p>Goes through each <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> from the root and prints them out in order </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 187</span>{ <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">print</a>(<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac341901e926b3fa3a796c64ca572f592"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:187</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 187</span>{ <a class="code hl_function" href="#ac341901e926b3fa3a796c64ca572f592">print</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac341901e926b3fa3a796c64ca572f592"><div class="ttname"><a href="#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:187</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -646,8 +642,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::print </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -667,15 +662,15 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 196</span> {</div>
<div class="line"><span class="lineno"> 197</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 197</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 199</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Empty List!\n&quot;</span>;</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> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 204</span> temp = temp-&gt;next;</div>
<div class="line"><span class="lineno"> 205</span> } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 205</span> } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 207</span> }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
@@ -694,7 +689,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -707,7 +702,7 @@ Here is the call graph for this function:</div>
<p>Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List. </p>
<p>Starting from the root <a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a>, appends each value of the list to a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> and returns it </p><dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the list's values </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>(<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -728,8 +723,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -751,14 +745,14 @@ Here is the call graph for this function:</div>
<p>&lt; Return empty vector</p>
<div class="fragment"><div class="line"><span class="lineno"> 223</span> {</div>
<div class="line"><span class="lineno"> 224</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> res;</div>
<div class="line"><span class="lineno"> 225</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 225</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 226</span> <span class="keywordflow">return</span> res; <span class="comment">///&lt; Return empty vector</span></div>
<div class="line"><span class="lineno"> 227</span> }</div>
<div class="line"><span class="lineno"> 228</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 228</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
<div class="line"><span class="lineno"> 229</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 230</span> res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(temp-&gt;data);</div>
<div class="line"><span class="lineno"> 231</span> temp = temp-&gt;next;</div>
<div class="line"><span class="lineno"> 232</span> } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 232</span> } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
<div class="line"><span class="lineno"> 233</span> <span class="keywordflow">return</span> res;</div>
<div class="line"><span class="lineno"> 234</span> }</div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
@@ -806,7 +800,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>circular_linked_list</b></li><li class="navelem"><a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

17
d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -126,7 +128,7 @@ Functions</h2></td></tr>
<tr class="memitem:a127ce4403660032f53ae2e6467e5427d"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d">greedy_algorithms::findMinimumEdge</a> (const int &amp;infinity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, 6 &gt;, 6 &gt; &amp;graph)</td></tr>
<tr class="memdesc:a127ce4403660032f53ae2e6467e5427d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the minimum edge of the given graph. <br /></td></tr>
<tr class="separator:a127ce4403660032f53ae2e6467e5427d"><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="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -145,8 +147,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -184,7 +185,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_minimum_spanning_tree.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d88/namespaceset_kth_bit.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: setKthBit Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../
<div class="contents">
<p>Functions for the [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) implementation.
<a href="../../d8/d88/namespaceset_kth_bit.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d88/namespaceset_kth_bit.html','../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d88/namespaceset_kth_bit.html">setKthBit</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

98
d8/d89/namespacelinear__probing.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: linear_probing Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d89/namespacelinear__probing.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d89/namespacelinear__probing.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d8/d89/namespacelinear__probing.html',
<div class="contents">
<p>An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing</a> algorithm.
<a href="../../d8/d89/namespacelinear__probing.html#details">More...</a></p>
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
@@ -116,32 +118,32 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a7f5ad74ceb8a8be09560e4d84b344849" id="r_a7f5ad74ceb8a8be09560e4d84b344849"><td class="memItemLeft" align="right" valign="top"><a id="a7f5ad74ceb8a8be09560e4d84b344849" name="a7f5ad74ceb8a8be09560e4d84b344849"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> = <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a></td></tr>
<tr class="separator:a7f5ad74ceb8a8be09560e4d84b344849"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a617268d1e3a4993b7bc952a658904d51" id="r_a617268d1e3a4993b7bc952a658904d51"><td class="memItemLeft" align="right" valign="top"><a id="a617268d1e3a4993b7bc952a658904d51" name="a617268d1e3a4993b7bc952a658904d51"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> = struct Entry</td></tr>
<tr class="separator:a617268d1e3a4993b7bc952a658904d51"><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>
Functions</h2></td></tr>
<tr class="memitem:a75d779938df7ebc68581d922b60a2541" id="r_a75d779938df7ebc68581d922b60a2541"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="memitem:a75d779938df7ebc68581d922b60a2541" id="r_a75d779938df7ebc68581d922b60a2541"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75d779938df7ebc68581d922b60a2541">putProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:a75d779938df7ebc68581d922b60a2541"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a942fc8407b8001890ea26830cdcd9d77" id="r_a942fc8407b8001890ea26830cdcd9d77"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="memitem:a942fc8407b8001890ea26830cdcd9d77" id="r_a942fc8407b8001890ea26830cdcd9d77"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a> (const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:a942fc8407b8001890ea26830cdcd9d77"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1" id="r_a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a> (int key)</td></tr>
<tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1" id="r_a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16d34fd3511626a83ab00665d7bc34d1">add</a> (int key)</td></tr>
<tr class="separator:a16d34fd3511626a83ab00665d7bc34d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527" id="r_a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a> (int key)</td></tr>
<tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527" id="r_a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a> (int key)</td></tr>
<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. <br /></td></tr>
<tr class="separator:a4bde7a47f98dd1ad24c84038e2608527"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746" id="r_a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a> (int key, bool searching)</td></tr>
<tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746" id="r_a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a> (int key, bool searching)</td></tr>
<tr class="separator:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad87b71d810901fab69c4ad9d4d0fa635" id="r_ad87b71d810901fab69c4ad9d4d0fa635"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a> ()</td></tr>
<tr class="memitem:ad87b71d810901fab69c4ad9d4d0fa635" id="r_ad87b71d810901fab69c4ad9d4d0fa635"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad87b71d810901fab69c4ad9d4d0fa635">display</a> ()</td></tr>
<tr class="separator:ad87b71d810901fab69c4ad9d4d0fa635"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a082dc1426a79f866cee6b370df37b0" id="r_a6a082dc1426a79f866cee6b370df37b0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">rehash</a> ()</td></tr>
<tr class="memitem:a6a082dc1426a79f866cee6b370df37b0" id="r_a6a082dc1426a79f866cee6b370df37b0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6a082dc1426a79f866cee6b370df37b0">rehash</a> ()</td></tr>
<tr class="separator:a6a082dc1426a79f866cee6b370df37b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abcf8d033f8115f39f3c93cfb6cee0b28" id="r_abcf8d033f8115f39f3c93cfb6cee0b28"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a> (int key)</td></tr>
<tr class="memitem:abcf8d033f8115f39f3c93cfb6cee0b28" id="r_abcf8d033f8115f39f3c93cfb6cee0b28"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a> (int key)</td></tr>
<tr class="separator:abcf8d033f8115f39f3c93cfb6cee0b28"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a16680b8a37d442c2f208faa286e33908" id="r_a16680b8a37d442c2f208faa286e33908"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">addInfo</a> (int key)</td></tr>
<tr class="memitem:a16680b8a37d442c2f208faa286e33908" id="r_a16680b8a37d442c2f208faa286e33908"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16680b8a37d442c2f208faa286e33908">addInfo</a> (int key)</td></tr>
<tr class="separator:a16680b8a37d442c2f208faa286e33908"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a75854f5aa216e61219154c62167ce8f0" id="r_a75854f5aa216e61219154c62167ce8f0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">removalInfo</a> (int key)</td></tr>
<tr class="memitem:a75854f5aa216e61219154c62167ce8f0" id="r_a75854f5aa216e61219154c62167ce8f0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75854f5aa216e61219154c62167ce8f0">removalInfo</a> (int key)</td></tr>
<tr class="separator:a75854f5aa216e61219154c62167ce8f0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
@@ -177,8 +179,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
<tr>
<td class="memname">void linear_probing::add </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -190,14 +191,14 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 161</span> {</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 163</span> table[index].key = key;</div>
<div class="line"><span class="lineno"> 164</span> <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(totalSize) &gt;= 0.5) {</div>
<div class="line"><span class="lineno"> 166</span> rehash();</div>
<div class="line"><span class="lineno"> 167</span> }</div>
<div class="line"><span class="lineno"> 168</span>}</div>
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:55</div></div>
<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:55</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -215,8 +216,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void linear_probing::addInfo </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -258,7 +258,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void linear_probing::display </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -295,8 +295,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">size_t linear_probing::hashFxn </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -327,19 +326,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int linear_probing::linearProbe </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool&#160;</td>
<td class="paramname"><em>searching</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">bool</td> <td class="paramname"><span class="paramname"><em>searching</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -407,19 +399,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool linear_probing::putProber </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;&#160;</td>
<td class="paramname"><em>entry</em>, </td>
<td class="paramtype">const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;</td> <td class="paramname"><span class="paramname"><em>entry</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -449,7 +434,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void linear_probing::rehash </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -492,8 +477,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void linear_probing::removalInfo </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -532,8 +516,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void linear_probing::remove </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -545,7 +528,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 173</span> {</div>
<div class="line"><span class="lineno"> 174</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 174</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 175</span> <span class="keywordflow">if</span> (index == notPresent) {</div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 177</span> }</div>
@@ -570,19 +553,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool linear_probing::searchingProber </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;&#160;</td>
<td class="paramname"><em>entry</em>, </td>
<td class="paramtype">const <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &amp;</td> <td class="paramname"><span class="paramname"><em>entry</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -609,7 +585,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d89/namespacelinear__probing.html">linear_probing</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

51
d8/d8a/exponential__search_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/exponential_search.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d8a/exponential__search_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d8a/exponential__search_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -118,12 +120,12 @@ Include dependency graph for exponential_search.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae" id="r_ab06cedad209456eae95d37b7cd66acae"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">binary_s</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="memitem:ab06cedad209456eae95d37b7cd66acae"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab06cedad209456eae95d37b7cd66acae">binary_s</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:ab06cedad209456eae95d37b7cd66acae"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208" id="r_af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="memitem:af421bf4b7b95f20ac86c233adfdb9208"><td class="memTemplItemLeft" align="right" valign="top">Type *&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a> (Type *array, size_t size, Type key)</td></tr>
<tr class="separator:af421bf4b7b95f20ac86c233adfdb9208"><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="../../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
@@ -145,25 +147,17 @@ template&lt;class Type &gt; </div>
<tr>
<td class="memname">Type * binary_s </td>
<td>(</td>
<td class="paramtype">Type *&#160;</td>
<td class="paramname"><em>array</em>, </td>
<td class="paramtype">Type *</td> <td class="paramname"><span class="paramname"><em>array</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>size</em>, </td>
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>size</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">Type&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">Type</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -172,7 +166,7 @@ template&lt;class Type &gt; </div>
</tr>
</table>
</div><div class="memdoc">
<p>Binary Search Algorithm (used by <a class="el" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a>)<br />
<p>Binary Search Algorithm (used by <a class="el" href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a>)<br />
</p><ul>
<li>Time Complexity O(log n) where 'n' is the number of elements</li>
<li>Worst Time Complexity O(log n)</li>
@@ -217,8 +211,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -249,25 +242,17 @@ template&lt;class Type &gt; </div>
<tr>
<td class="memname">Type * struzik_search </td>
<td>(</td>
<td class="paramtype">Type *&#160;</td>
<td class="paramname"><em>array</em>, </td>
<td class="paramtype">Type *</td> <td class="paramname"><span class="paramname"><em>array</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>size</em>, </td>
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>size</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">Type&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">Type</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -300,7 +285,7 @@ template&lt;class Type &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html">exponential_search.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d8e/struct_node-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('db/d8b/struct_node.html','../../'); initResizable(); });
$(function(){initNavTree('db/d8b/struct_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('db/d8b/struct_node.html','../../'); in
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

107
d8/d90/iterative__tree__traversals_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: others/iterative_tree_traversals.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -138,25 +140,25 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a21d922dbb5905993960c6a7f0ba71ac0" id="r_a21d922dbb5905993960c6a7f0ba71ac0"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0">test1</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:a21d922dbb5905993960c6a7f0ba71ac0" id="r_a21d922dbb5905993960c6a7f0ba71ac0"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a21d922dbb5905993960c6a7f0ba71ac0">test1</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:a21d922dbb5905993960c6a7f0ba71ac0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed preorder with the actual preorder. <br /></td></tr>
<tr class="separator:a21d922dbb5905993960c6a7f0ba71ac0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac35ae2868441f8a11c965b87b2494f21" id="r_ac35ae2868441f8a11c965b87b2494f21"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21">test2</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:ac35ae2868441f8a11c965b87b2494f21" id="r_ac35ae2868441f8a11c965b87b2494f21"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac35ae2868441f8a11c965b87b2494f21">test2</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:ac35ae2868441f8a11c965b87b2494f21"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed postorder with the actual postorder. <br /></td></tr>
<tr class="separator:ac35ae2868441f8a11c965b87b2494f21"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a425c4c8520991999ee6dbe13d99b87f4" id="r_a425c4c8520991999ee6dbe13d99b87f4"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4">test3</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:a425c4c8520991999ee6dbe13d99b87f4" id="r_a425c4c8520991999ee6dbe13d99b87f4"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a425c4c8520991999ee6dbe13d99b87f4">test3</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:a425c4c8520991999ee6dbe13d99b87f4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed inorder with the actual inorder. <br /></td></tr>
<tr class="separator:a425c4c8520991999ee6dbe13d99b87f4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a038b236fe900f7bb7e57164f5bed66c2" id="r_a038b236fe900f7bb7e57164f5bed66c2"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:a038b236fe900f7bb7e57164f5bed66c2" id="r_a038b236fe900f7bb7e57164f5bed66c2"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:a038b236fe900f7bb7e57164f5bed66c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed preorder with the actual preorder on negative value. <br /></td></tr>
<tr class="separator:a038b236fe900f7bb7e57164f5bed66c2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa9ef334cd7eb607f4eb8732566ea00b8" id="r_aa9ef334cd7eb607f4eb8732566ea00b8"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:aa9ef334cd7eb607f4eb8732566ea00b8" id="r_aa9ef334cd7eb607f4eb8732566ea00b8"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:aa9ef334cd7eb607f4eb8732566ea00b8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed postorder with the actual postorder on negative value. <br /></td></tr>
<tr class="separator:aa9ef334cd7eb607f4eb8732566ea00b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af727f920064f2b8f484b589b60d49b89" id="r_af727f920064f2b8f484b589b60d49b89"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memitem:af727f920064f2b8f484b589b60d49b89" id="r_af727f920064f2b8f484b589b60d49b89"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af727f920064f2b8f484b589b60d49b89">test6</a> (<a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree, <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root)</td></tr>
<tr class="memdesc:af727f920064f2b8f484b589b60d49b89"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test the computed inorder with the actual inorder on negative value. <br /></td></tr>
<tr class="separator:af727f920064f2b8f484b589b60d49b89"><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="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -182,8 +184,7 @@ Iterative Inorder Traversal of a tree</h3>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -229,13 +230,13 @@ Iterative Inorder Traversal of a tree</h3>
<div class="line"><span class="lineno"> 387</span> root-&gt;left-&gt;right-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a> = -5;</div>
<div class="line"><span class="lineno"> 388</span> </div>
<div class="line"><span class="lineno"> 389</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n| Tests for negative data values |&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 390</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(binaryTree, root); <span class="comment">// run preorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 390</span> <a class="code hl_function" href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(binaryTree, root); <span class="comment">// run preorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 391</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPre-order test on-negative value Passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 392</span> </div>
<div class="line"><span class="lineno"> 393</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(binaryTree, root); <span class="comment">// run postorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 393</span> <a class="code hl_function" href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(binaryTree, root); <span class="comment">// run postorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 394</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPost-order test on-negative value Passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 395</span> </div>
<div class="line"><span class="lineno"> 396</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a>(binaryTree, root); <span class="comment">// run inorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 396</span> <a class="code hl_function" href="#af727f920064f2b8f484b589b60d49b89">test6</a>(binaryTree, root); <span class="comment">// run inorder-iterative test on negative values</span></div>
<div class="line"><span class="lineno"> 397</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nIn-order test on-negative value Passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 398</span> </div>
<div class="line"><span class="lineno"> 399</span> <span class="keywordflow">return</span> 0;</div>
@@ -248,9 +249,9 @@ Iterative Inorder Traversal of a tree</h3>
<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:169</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:122</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:272</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:300</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:327</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:272</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:300</div></div>
<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:327</div></div>
<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:58</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -272,19 +273,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test1 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -346,19 +340,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test2 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -418,19 +405,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test3 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -490,19 +470,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test4 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -561,19 +534,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test5 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -632,19 +598,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test6 </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a>&#160;</td>
<td class="paramname"><em>binaryTree</em>, </td>
<td class="paramtype"><a class="el" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></td> <td class="paramname"><span class="paramname"><em>binaryTree</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *&#160;</td>
<td class="paramname"><em>root</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -697,7 +656,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

96
d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -10,20 +10,20 @@
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="36,262,43,291,56,329,76,368,104,402,122,413,141,420,139,425,119,418,101,406,72,371,51,331,38,292,31,263"/>
<area shape="rect" id="Node000017" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="156,366,206,391"/>
<area shape="poly" id="edge21_Node000001_Node000017" title=" " alt="" coords="45,261,104,322,148,355,144,359,101,326,41,264"/>
<area shape="rect" id="Node000018" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="156,515,206,541"/>
<area shape="poly" id="edge25_Node000001_Node000018" title=" " alt="" coords="36,262,58,345,78,400,105,452,127,480,152,503,149,507,123,483,100,455,73,402,53,347,31,263"/>
<area shape="rect" id="Node000021" href="$d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" title="Test the computed preorder with the actual preorder on negative value." alt="" coords="156,135,206,161"/>
<area shape="poly" id="edge28_Node000001_Node000021" title=" " alt="" coords="40,234,66,206,101,178,140,158,142,163,104,182,70,210,44,238"/>
<area shape="rect" id="Node000026" href="$d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" title="Test the computed postorder with the actual postorder on negative value." alt="" coords="156,236,206,262"/>
<area shape="poly" id="edge34_Node000001_Node000026" title=" " alt="" coords="55,247,140,247,140,252,55,252"/>
<area shape="rect" id="Node000028" href="$d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" title="Test the computed inorder with the actual inorder on negative value." alt="" coords="156,286,206,311"/>
<area shape="poly" id="edge40_Node000001_Node000028" title=" " alt="" coords="56,255,104,272,141,284,140,289,102,277,54,260"/>
<area shape="rect" id="Node000018" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="156,602,206,627"/>
<area shape="poly" id="edge25_Node000001_Node000018" title=" " alt="" coords="38,261,64,343,105,452,168,587,163,589,100,454,59,344,33,263"/>
<area shape="rect" id="Node000022" href="$d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" title="Test the computed preorder with the actual preorder on negative value." alt="" coords="156,135,206,161"/>
<area shape="poly" id="edge31_Node000001_Node000022" title=" " alt="" coords="40,234,66,206,101,178,140,158,142,163,104,182,70,210,44,238"/>
<area shape="rect" id="Node000027" href="$d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" title="Test the computed postorder with the actual postorder on negative value." alt="" coords="156,236,206,262"/>
<area shape="poly" id="edge37_Node000001_Node000027" title=" " alt="" coords="55,247,140,247,140,252,55,252"/>
<area shape="rect" id="Node000029" href="$d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" title="Test the computed inorder with the actual inorder on negative value." alt="" coords="156,286,206,311"/>
<area shape="poly" id="edge43_Node000001_Node000029" title=" " alt="" coords="56,255,104,272,141,284,140,289,102,277,54,260"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/at.html#" title=" " alt="" coords="334,366,436,391"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="206,419,318,392,319,397,207,424"/>
<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="351,415,419,441"/>
<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="206,425,335,425,335,431,206,431"/>
<area shape="rect" id="Node000012" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="333,516,437,542"/>
<area shape="poly" id="edge14_Node000005_Node000012" title=" " alt="" coords="208,438,345,507,343,512,205,442"/>
<area shape="rect" id="Node000012" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="333,514,437,539"/>
<area shape="poly" id="edge14_Node000005_Node000012" title=" " alt="" coords="208,437,344,504,342,509,205,442"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="538,316,639,342"/>
<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="419,419,441,412,462,402,476,389,485,377,494,364,510,351,522,344,525,349,513,355,498,368,490,380,480,393,465,406,443,417,421,424"/>
<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="540,366,637,391"/>
@@ -35,42 +35,46 @@
<area shape="poly" id="edge9_Node000009_Node000009" title=" " alt="" coords="730,416,725,406,728,397,740,391,759,388,780,391,791,398,788,402,778,396,759,394,742,396,732,400,730,406,735,413"/>
<area shape="poly" id="edge11_Node000010_Node000009" title=" " alt="" coords="637,389,699,408,698,413,635,395"/>
<area shape="poly" id="edge13_Node000011_Node000009" title=" " alt="" coords="626,425,698,425,698,431,626,431"/>
<area shape="poly" id="edge15_Node000012_Node000009" title=" " alt="" coords="435,513,665,451,698,442,699,447,666,456,437,518"/>
<area shape="rect" id="Node000013" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="541,516,636,542"/>
<area shape="poly" id="edge16_Node000012_Node000013" title=" " alt="" coords="438,527,526,527,526,532,438,532"/>
<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="552,664,625,690"/>
<area shape="poly" id="edge18_Node000012_Node000014" title=" " alt="" coords="398,541,444,594,476,624,513,651,539,663,537,668,510,655,473,629,440,598,394,544"/>
<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="554,566,623,591"/>
<area shape="poly" id="edge19_Node000012_Node000015" title=" " alt="" coords="438,539,540,564,538,569,437,544"/>
<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="549,615,628,641"/>
<area shape="poly" id="edge20_Node000012_Node000016" title=" " alt="" coords="407,540,454,570,512,601,536,610,534,615,510,606,451,575,404,545"/>
<area shape="poly" id="edge17_Node000013_Node000009" title=" " alt="" coords="625,513,664,495,730,448,733,453,667,499,628,518"/>
<area shape="poly" id="edge15_Node000012_Node000009" title=" " alt="" coords="420,537,469,554,532,566,566,569,600,567,633,561,664,549,691,530,714,506,744,454,749,456,718,509,695,534,667,554,635,566,601,573,566,574,532,571,468,559,418,542"/>
<area shape="rect" id="Node000013" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="541,615,636,641"/>
<area shape="poly" id="edge16_Node000012_Node000013" title=" " alt="" coords="410,537,513,593,541,606,539,611,510,598,407,542"/>
<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="723,703,796,729"/>
<area shape="poly" id="edge18_Node000012_Node000014" title=" " alt="" coords="398,538,443,593,476,625,513,651,548,665,599,680,708,704,707,709,598,685,546,670,510,656,472,629,439,597,394,542"/>
<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="554,464,623,490"/>
<area shape="poly" id="edge19_Node000012_Node000015" title=" " alt="" coords="437,511,538,486,540,492,438,517"/>
<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="549,514,628,539"/>
<area shape="poly" id="edge20_Node000012_Node000016" title=" " alt="" coords="438,524,534,524,534,529,438,529"/>
<area shape="poly" id="edge17_Node000013_Node000009" title=" " alt="" coords="634,612,664,594,693,561,717,523,747,454,752,456,721,526,697,564,667,598,637,617"/>
<area shape="poly" id="edge22_Node000017_Node000006" title=" " alt="" coords="206,376,318,376,318,381,206,381"/>
<area shape="poly" id="edge23_Node000017_Node000007" title=" " alt="" coords="207,382,336,413,335,419,206,387"/>
<area shape="poly" id="edge24_Node000017_Node000012" title=" " alt="" coords="207,380,234,388,260,400,276,412,287,424,309,451,361,504,358,507,305,455,283,427,273,416,258,405,232,393,206,385"/>
<area shape="rect" id="Node000019" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="331,639,439,665"/>
<area shape="poly" id="edge26_Node000018_Node000019" title=" " alt="" coords="205,539,351,628,348,633,202,543"/>
<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="511,714,666,739"/>
<area shape="poly" id="edge27_Node000019_Node000020" title=" " alt="" coords="419,663,512,700,529,706,528,711,510,705,417,668"/>
<area shape="poly" id="edge29_Node000021_Node000004" title=" " alt="" coords="207,148,334,160,333,166,206,153"/>
<area shape="rect" id="Node000022" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="307,75,463,130"/>
<area shape="poly" id="edge30_Node000021_Node000022" title=" " alt="" coords="206,140,291,121,292,126,207,145"/>
<area shape="rect" id="Node000023" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="547,168,630,194"/>
<area shape="poly" id="edge31_Node000022_Node000023" title=" " alt="" coords="460,128,540,160,538,165,458,133"/>
<area shape="rect" id="Node000024" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="544,218,633,243"/>
<area shape="poly" id="edge32_Node000022_Node000024" title=" " alt="" coords="449,129,465,141,480,158,489,174,498,189,513,204,531,214,528,219,510,209,493,193,484,177,476,161,462,144,446,133"/>
<area shape="rect" id="Node000025" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="549,267,628,293"/>
<area shape="poly" id="edge33_Node000022_Node000025" title=" " alt="" coords="452,129,465,141,477,156,483,171,489,200,494,227,501,241,513,254,536,267,533,272,510,258,497,244,489,229,483,201,478,173,472,159,461,144,449,133"/>
<area shape="poly" id="edge35_Node000026_Node000004" title=" " alt="" coords="206,237,258,215,306,191,334,180,336,185,308,196,260,220,208,242"/>
<area shape="rect" id="Node000027" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="307,205,463,261"/>
<area shape="poly" id="edge36_Node000026_Node000027" title=" " alt="" coords="206,245,291,238,291,243,207,250"/>
<area shape="poly" id="edge37_Node000027_Node000023" title=" " alt="" coords="463,211,532,193,533,198,464,216"/>
<area shape="poly" id="edge38_Node000027_Node000024" title=" " alt="" coords="463,229,529,229,529,234,464,235"/>
<area shape="poly" id="edge39_Node000027_Node000025" title=" " alt="" coords="464,248,534,265,533,270,463,254"/>
<area shape="poly" id="edge41_Node000028_Node000004" title=" " alt="" coords="206,293,232,286,257,272,273,253,281,233,288,212,305,191,334,176,336,181,309,195,293,215,286,235,278,256,261,277,234,291,207,298"/>
<area shape="rect" id="Node000029" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="307,285,463,341"/>
<area shape="poly" id="edge42_Node000028_Node000029" title=" " alt="" coords="207,298,291,304,291,309,206,303"/>
<area shape="poly" id="edge43_Node000029_Node000023" title=" " alt="" coords="446,283,462,271,476,254,484,237,493,220,510,203,531,191,534,196,513,207,497,223,489,239,481,257,465,275,449,287"/>
<area shape="poly" id="edge44_Node000029_Node000024" title=" " alt="" coords="442,282,510,252,528,245,530,250,512,257,444,287"/>
<area shape="poly" id="edge45_Node000029_Node000025" title=" " alt="" coords="463,298,533,286,534,291,464,303"/>
<area shape="poly" id="edge24_Node000017_Node000012" title=" " alt="" coords="207,380,234,388,260,400,276,412,287,424,309,451,360,501,357,505,305,455,283,427,273,416,258,405,232,393,206,385"/>
<area shape="rect" id="Node000019" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="331,740,439,766"/>
<area shape="poly" id="edge26_Node000018_Node000019" title=" " alt="" coords="203,626,353,729,350,733,200,630"/>
<area shape="rect" id="Node000020" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="560,740,617,766"/>
<area shape="poly" id="edge27_Node000019_Node000020" title=" " alt="" coords="440,751,545,751,545,756,440,756"/>
<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="511,790,666,815"/>
<area shape="poly" id="edge30_Node000019_Node000021" title=" " alt="" coords="440,764,518,783,517,788,439,769"/>
<area shape="poly" id="edge29_Node000020_Node000014" title=" " alt="" coords="617,744,708,724,709,729,618,750"/>
<area shape="poly" id="edge28_Node000020_Node000020" title=" " alt="" coords="559,741,554,732,557,722,569,716,589,714,609,716,620,723,617,727,608,721,588,719,571,721,561,726,559,731,564,739"/>
<area shape="poly" id="edge32_Node000022_Node000004" title=" " alt="" coords="207,148,334,160,333,166,206,153"/>
<area shape="rect" id="Node000023" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="307,75,463,130"/>
<area shape="poly" id="edge33_Node000022_Node000023" title=" " alt="" coords="206,140,291,121,292,126,207,145"/>
<area shape="rect" id="Node000024" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="547,168,630,194"/>
<area shape="poly" id="edge34_Node000023_Node000024" title=" " alt="" coords="460,128,540,160,538,165,458,133"/>
<area shape="rect" id="Node000025" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="544,218,633,243"/>
<area shape="poly" id="edge35_Node000023_Node000025" title=" " alt="" coords="449,129,465,141,480,158,489,174,498,189,513,204,531,214,528,219,510,209,493,193,484,177,476,161,462,144,446,133"/>
<area shape="rect" id="Node000026" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="549,267,628,293"/>
<area shape="poly" id="edge36_Node000023_Node000026" title=" " alt="" coords="452,129,465,141,477,156,483,171,489,200,494,227,501,241,513,254,536,267,533,272,510,258,497,244,489,229,483,201,478,173,472,159,461,144,449,133"/>
<area shape="poly" id="edge38_Node000027_Node000004" title=" " alt="" coords="206,237,258,215,306,191,334,180,336,185,308,196,260,220,208,242"/>
<area shape="rect" id="Node000028" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="307,205,463,261"/>
<area shape="poly" id="edge39_Node000027_Node000028" title=" " alt="" coords="206,245,291,238,291,243,207,250"/>
<area shape="poly" id="edge40_Node000028_Node000024" title=" " alt="" coords="463,211,532,193,533,198,464,216"/>
<area shape="poly" id="edge41_Node000028_Node000025" title=" " alt="" coords="463,229,529,229,529,234,464,235"/>
<area shape="poly" id="edge42_Node000028_Node000026" title=" " alt="" coords="464,248,534,265,533,270,463,254"/>
<area shape="poly" id="edge44_Node000029_Node000004" title=" " alt="" coords="206,293,232,286,257,272,273,253,281,233,288,212,305,191,334,176,336,181,309,195,293,215,286,235,278,256,261,277,234,291,207,298"/>
<area shape="rect" id="Node000030" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="307,285,463,341"/>
<area shape="poly" id="edge45_Node000029_Node000030" title=" " alt="" coords="207,298,291,304,291,309,206,303"/>
<area shape="poly" id="edge46_Node000030_Node000024" title=" " alt="" coords="446,283,462,271,476,254,484,237,493,220,510,203,531,191,534,196,513,207,497,223,489,239,481,257,465,275,449,287"/>
<area shape="poly" id="edge47_Node000030_Node000025" title=" " alt="" coords="442,282,510,252,528,245,530,250,512,257,444,287"/>
<area shape="poly" id="edge48_Node000030_Node000026" title=" " alt="" coords="463,298,533,286,534,291,464,303"/>
</map>

2
d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
961c419788dbcc8e36d8b4ae9600395e
44f49165bbee9a3e7d8b64612961ec44

548
d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 559 -->
<!--zoomable 616 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -47,7 +47,7 @@
</defs>
<script type="application/ecmascript">
var viewWidth = 608;
var viewHeight = 559;
var viewHeight = 616;
var sectionId = 'dynsection-1';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
@@ -58,8 +58,8 @@ var sectionId = 'dynsection-1';
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-377.25 0,-377.25 0,-358 37,-358 37,-377.25"/>
<text text-anchor="middle" x="18.5" y="-363.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-434.25 0,-434.25 0,-415 37,-415 37,-434.25"/>
<text text-anchor="middle" x="18.5" y="-420.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -67,10 +67,10 @@ var sectionId = 'dynsection-1';
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6" target="_top" xlink:title="function that will create new node for insertion.">
<polygon fill="white" stroke="#666666" points="190.25,-550.5 73,-550.5 73,-508.75 190.25,-508.75 190.25,-550.5"/>
<text text-anchor="start" x="81" y="-537" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="81" y="-525.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="131.62" y="-514.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
<polygon fill="white" stroke="#666666" points="190.25,-607.5 73,-607.5 73,-565.75 190.25,-565.75 190.25,-607.5"/>
<text text-anchor="start" x="81" y="-594" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="81" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="131.62" y="-571.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
</a>
</g>
</g>
@@ -78,8 +78,8 @@ var sectionId = 'dynsection-1';
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.09,-377.48C25.38,-401.25 39.23,-462.49 73,-499.62 73.36,-500.02 73.73,-500.41 74.1,-500.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.73,-503.38 81.56,-507.32 76.33,-498.1 71.73,-503.38"/>
<path fill="none" stroke="#63b8ff" d="M21.09,-434.48C25.38,-458.25 39.23,-519.49 73,-556.62 73.36,-557.02 73.73,-557.41 74.1,-557.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.73,-560.38 81.56,-564.32 76.33,-555.1 71.73,-560.38"/>
</a>
</g>
</g>
@@ -87,8 +87,8 @@ var sectionId = 'dynsection-1';
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="175.25,-490.25 88,-490.25 88,-471 175.25,-471 175.25,-490.25"/>
<text text-anchor="middle" x="131.62" y="-476.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
<polygon fill="white" stroke="#666666" points="175.25,-547.25 88,-547.25 88,-528 175.25,-528 175.25,-547.25"/>
<text text-anchor="middle" x="131.62" y="-533.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
</a>
</g>
</g>
@@ -96,8 +96,8 @@ var sectionId = 'dynsection-1';
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M22.37,-377.58C28.45,-396.88 44.45,-439.53 73,-462.62 74.48,-463.83 76.05,-464.95 77.68,-465.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.72,-468.92 86.2,-470.5 78.99,-462.73 75.72,-468.92"/>
<path fill="none" stroke="#63b8ff" d="M22.37,-434.58C28.45,-453.88 44.45,-496.53 73,-519.62 74.48,-520.83 76.05,-521.95 77.68,-522.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.72,-525.92 86.2,-527.5 78.99,-519.73 75.72,-525.92"/>
</a>
</g>
</g>
@@ -105,8 +105,8 @@ var sectionId = 'dynsection-1';
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="311.62,-438.25 258.12,-438.25 258.12,-419 311.62,-419 311.62,-438.25"/>
<text text-anchor="middle" x="284.88" y="-424.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="311.62,-495.25 258.12,-495.25 258.12,-476 311.62,-476 311.62,-495.25"/>
<text text-anchor="middle" x="284.88" y="-481.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -114,8 +114,8 @@ var sectionId = 'dynsection-1';
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.13,-374.61C47.46,-378.52 60.84,-383.27 73,-386.62 133.03,-403.17 204.37,-415.99 246.79,-422.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.03,-426.33 256.46,-424.46 247.14,-419.42 246.03,-426.33"/>
<path fill="none" stroke="#63b8ff" d="M37.13,-431.61C47.46,-435.52 60.84,-440.27 73,-443.62 133.03,-460.17 204.37,-472.99 246.79,-479.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.03,-483.33 256.46,-481.46 247.14,-476.42 246.03,-483.33"/>
</a>
</g>
</g>
@@ -123,8 +123,8 @@ var sectionId = 'dynsection-1';
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="white" stroke="#666666" points="150.5,-243.25 112.75,-243.25 112.75,-224 150.5,-224 150.5,-243.25"/>
<text text-anchor="middle" x="131.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
<polygon fill="white" stroke="#666666" points="150.5,-300.25 112.75,-300.25 112.75,-281 150.5,-281 150.5,-300.25"/>
<text text-anchor="middle" x="131.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
@@ -132,8 +132,8 @@ var sectionId = 'dynsection-1';
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.28,-357.6C25.77,-335.23 39.67,-280.9 73,-251.62 80.87,-244.71 91.37,-240.46 101.25,-237.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.86,-241.28 110.9,-235.76 100.38,-234.44 101.86,-241.28"/>
<path fill="none" stroke="#63b8ff" d="M21.28,-414.6C25.77,-392.23 39.67,-337.9 73,-308.62 80.87,-301.71 91.37,-297.46 101.25,-294.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.86,-298.28 110.9,-292.76 100.38,-291.44 101.86,-298.28"/>
</a>
</g>
</g>
@@ -141,8 +141,8 @@ var sectionId = 'dynsection-1';
<g id="Node000017" class="node">
<title>Node17</title>
<g id="a_Node000017"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="#666666" points="150.5,-280.25 112.75,-280.25 112.75,-261 150.5,-261 150.5,-280.25"/>
<text text-anchor="middle" x="131.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
<polygon fill="white" stroke="#666666" points="150.5,-337.25 112.75,-337.25 112.75,-318 150.5,-318 150.5,-337.25"/>
<text text-anchor="middle" x="131.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
@@ -150,8 +150,8 @@ var sectionId = 'dynsection-1';
<g id="edge21_Node000001_Node000017" class="edge">
<title>Node1&#45;&gt;Node17</title>
<g id="a_edge21_Node000001_Node000017"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.06,-357.56C38.22,-345.9 55.92,-326.41 73,-311.62 83.13,-302.86 95.1,-294.11 105.49,-286.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.27,-289.99 113.61,-281.5 103.36,-284.19 107.27,-289.99"/>
<path fill="none" stroke="#63b8ff" d="M28.06,-414.56C38.22,-402.9 55.92,-383.41 73,-368.62 83.13,-359.86 95.1,-351.11 105.49,-343.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.27,-346.99 113.61,-338.5 103.36,-341.19 107.27,-346.99"/>
</a>
</g>
</g>
@@ -159,8 +159,8 @@ var sectionId = 'dynsection-1';
<g id="Node000018" class="node">
<title>Node18</title>
<g id="a_Node000018"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="150.5,-168.25 112.75,-168.25 112.75,-149 150.5,-149 150.5,-168.25"/>
<text text-anchor="middle" x="131.62" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
<polygon fill="white" stroke="#666666" points="150.5,-160.25 112.75,-160.25 112.75,-141 150.5,-141 150.5,-160.25"/>
<text text-anchor="middle" x="131.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
</a>
</g>
</g>
@@ -168,62 +168,62 @@ var sectionId = 'dynsection-1';
<g id="edge25_Node000001_Node000018" class="edge">
<title>Node1&#45;&gt;Node18</title>
<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.33,-357.62C26.33,-332.11 41.97,-263.25 73,-214.62 82.57,-199.63 96.9,-185.68 108.88,-175.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.78,-178.42 116.29,-169.37 106.34,-173.01 110.78,-178.42"/>
<path fill="none" stroke="#63b8ff" d="M22.52,-414.82C30.15,-390.35 51.15,-324.71 73,-271.62 87.92,-235.38 108.15,-194.45 120.25,-170.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.33,-172.34 124.78,-161.85 117.1,-169.15 123.33,-172.34"/>
</a>
</g>
</g>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-453.25 112.75,-453.25 112.75,-434 150.5,-434 150.5,-453.25"/>
<text text-anchor="middle" x="131.62" y="-439.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
<!-- Node22 -->
<g id="Node000022" class="node">
<title>Node22</title>
<g id="a_Node000022"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-510.25 112.75,-510.25 112.75,-491 150.5,-491 150.5,-510.25"/>
<text text-anchor="middle" x="131.62" y="-496.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node21 -->
<g id="edge28_Node000001_Node000021" class="edge">
<title>Node1&#45;&gt;Node21</title>
<g id="a_edge28_Node000001_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M27.68,-377.59C37.47,-389 54.83,-407.65 73,-419.62 81.78,-425.41 92.18,-430.26 101.72,-434.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.35,-437.28 110.94,-437.48 102.79,-430.71 100.35,-437.28"/>
<!-- Node1&#45;&gt;Node22 -->
<g id="edge31_Node000001_Node000022" class="edge">
<title>Node1&#45;&gt;Node22</title>
<g id="a_edge31_Node000001_Node000022"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M27.68,-434.59C37.47,-446 54.83,-464.65 73,-476.62 81.78,-482.41 92.18,-487.26 101.72,-491.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.35,-494.28 110.94,-494.48 102.79,-487.71 100.35,-494.28"/>
</a>
</g>
</g>
<!-- Node26 -->
<g id="Node000026" class="node">
<title>Node26</title>
<g id="a_Node000026"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-377.25 112.75,-377.25 112.75,-358 150.5,-358 150.5,-377.25"/>
<text text-anchor="middle" x="131.62" y="-363.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
<!-- Node27 -->
<g id="Node000027" class="node">
<title>Node27</title>
<g id="a_Node000027"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-434.25 112.75,-434.25 112.75,-415 150.5,-415 150.5,-434.25"/>
<text text-anchor="middle" x="131.62" y="-420.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node26 -->
<g id="edge34_Node000001_Node000026" class="edge">
<title>Node1&#45;&gt;Node26</title>
<g id="a_edge34_Node000001_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-367.62C54.51,-367.62 80.73,-367.62 101.01,-367.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.93,-371.13 110.93,-367.63 100.93,-364.13 100.93,-371.13"/>
<!-- Node1&#45;&gt;Node27 -->
<g id="edge37_Node000001_Node000027" class="edge">
<title>Node1&#45;&gt;Node27</title>
<g id="a_edge37_Node000001_Node000027"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-424.62C54.51,-424.62 80.73,-424.62 101.01,-424.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.93,-428.13 110.93,-424.63 100.93,-421.13 100.93,-428.13"/>
</a>
</g>
</g>
<!-- Node28 -->
<g id="Node000028" class="node">
<title>Node28</title>
<g id="a_Node000028"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-340.25 112.75,-340.25 112.75,-321 150.5,-321 150.5,-340.25"/>
<text text-anchor="middle" x="131.62" y="-326.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
<!-- Node29 -->
<g id="Node000029" class="node">
<title>Node29</title>
<g id="a_Node000029"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-397.25 112.75,-397.25 112.75,-378 150.5,-378 150.5,-397.25"/>
<text text-anchor="middle" x="131.62" y="-383.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node28 -->
<g id="edge40_Node000001_Node000028" class="edge">
<title>Node1&#45;&gt;Node28</title>
<g id="a_edge40_Node000001_Node000028"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.27,-361.12C47.66,-357.37 61.03,-352.62 73,-348.62 82.23,-345.55 92.34,-342.33 101.48,-339.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="102.43,-342.86 110.95,-336.57 100.37,-336.17 102.43,-342.86"/>
<!-- Node1&#45;&gt;Node29 -->
<g id="edge43_Node000001_Node000029" class="edge">
<title>Node1&#45;&gt;Node29</title>
<g id="a_edge43_Node000001_Node000029"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.27,-418.12C47.66,-414.37 61.03,-409.62 73,-405.62 82.23,-402.55 92.34,-399.33 101.48,-396.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="102.43,-399.86 110.95,-393.57 100.37,-393.17 102.43,-399.86"/>
</a>
</g>
</g>
@@ -231,8 +231,8 @@ var sectionId = 'dynsection-1';
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="323.25,-280.25 246.5,-280.25 246.5,-261 323.25,-261 323.25,-280.25"/>
<text text-anchor="middle" x="284.88" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
<polygon fill="white" stroke="#666666" points="323.25,-337.25 246.5,-337.25 246.5,-318 323.25,-318 323.25,-337.25"/>
<text text-anchor="middle" x="284.88" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
</a>
</g>
</g>
@@ -240,8 +240,8 @@ var sectionId = 'dynsection-1';
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-238.09C171.61,-243.16 206.32,-251.65 235.08,-258.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.15,-262.06 244.7,-261.04 235.82,-255.27 234.15,-262.06"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-295.09C171.61,-300.16 206.32,-308.65 235.08,-315.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.15,-319.06 244.7,-318.04 235.82,-312.27 234.15,-319.06"/>
</a>
</g>
</g>
@@ -249,8 +249,8 @@ var sectionId = 'dynsection-1';
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="310.5,-243.25 259.25,-243.25 259.25,-224 310.5,-224 310.5,-243.25"/>
<text text-anchor="middle" x="284.88" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
<polygon fill="white" stroke="#666666" points="310.5,-300.25 259.25,-300.25 259.25,-281 310.5,-281 310.5,-300.25"/>
<text text-anchor="middle" x="284.88" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
@@ -258,8 +258,8 @@ var sectionId = 'dynsection-1';
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-233.62C174.66,-233.62 216.83,-233.62 247.32,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="247.26,-237.13 257.26,-233.63 247.26,-230.13 247.26,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-290.62C174.66,-290.62 216.83,-290.62 247.32,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="247.26,-294.13 257.26,-290.63 247.26,-287.13 247.26,-294.13"/>
</a>
</g>
</g>
@@ -267,8 +267,8 @@ var sectionId = 'dynsection-1';
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="324,-167.25 245.75,-167.25 245.75,-148 324,-148 324,-167.25"/>
<text text-anchor="middle" x="284.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
<polygon fill="white" stroke="#666666" points="324,-226.25 245.75,-226.25 245.75,-207 324,-207 324,-226.25"/>
<text text-anchor="middle" x="284.88" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
@@ -276,8 +276,8 @@ var sectionId = 'dynsection-1';
<g id="edge14_Node000005_Node000012" class="edge">
<title>Node5&#45;&gt;Node12</title>
<g id="a_edge14_Node000005_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-224.46C176.45,-211.6 223.29,-188.07 254,-172.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="255.41,-175.84 262.78,-168.23 252.27,-169.59 255.41,-175.84"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-281.7C176.31,-269.25 222.77,-246.52 253.49,-231.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.84,-234.73 262.28,-227.19 251.76,-228.44 254.84,-234.73"/>
</a>
</g>
</g>
@@ -285,8 +285,8 @@ var sectionId = 'dynsection-1';
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="475,-317.25 399.75,-317.25 399.75,-298 475,-298 475,-317.25"/>
<text text-anchor="middle" x="437.38" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
<polygon fill="white" stroke="#666666" points="475,-374.25 399.75,-374.25 399.75,-355 475,-355 475,-374.25"/>
<text text-anchor="middle" x="437.38" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
@@ -294,8 +294,8 @@ var sectionId = 'dynsection-1';
<g id="edge7_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.89,-238.48C321.48,-241.27 333.63,-245.47 343.5,-251.62 363.24,-263.94 359.78,-277.28 379.5,-289.62 382.43,-291.46 385.57,-293.13 388.81,-294.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="387.38,-297.83 397.96,-298.35 390.01,-291.34 387.38,-297.83"/>
<path fill="none" stroke="#63b8ff" d="M310.89,-295.48C321.48,-298.27 333.63,-302.47 343.5,-308.62 363.24,-320.94 359.78,-334.28 379.5,-346.62 382.43,-348.46 385.57,-350.13 388.81,-351.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="387.38,-354.83 397.96,-355.35 390.01,-348.34 387.38,-354.83"/>
</a>
</g>
</g>
@@ -303,8 +303,8 @@ var sectionId = 'dynsection-1';
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="473.5,-280.25 401.25,-280.25 401.25,-261 473.5,-261 473.5,-280.25"/>
<text text-anchor="middle" x="437.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
<polygon fill="white" stroke="#666666" points="473.5,-337.25 401.25,-337.25 401.25,-318 473.5,-318 473.5,-337.25"/>
<text text-anchor="middle" x="437.38" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
@@ -312,8 +312,8 @@ var sectionId = 'dynsection-1';
<g id="edge10_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.73,-239.73C332.11,-244.99 363.54,-252.72 389.61,-259.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.77,-262.53 399.32,-261.51 390.44,-255.73 388.77,-262.53"/>
<path fill="none" stroke="#63b8ff" d="M310.73,-296.73C332.11,-301.99 363.54,-309.72 389.61,-316.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.77,-319.53 399.32,-318.51 390.44,-312.73 388.77,-319.53"/>
</a>
</g>
</g>
@@ -321,8 +321,8 @@ var sectionId = 'dynsection-1';
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="465.25,-243.25 409.5,-243.25 409.5,-224 465.25,-224 465.25,-243.25"/>
<text text-anchor="middle" x="437.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
<polygon fill="white" stroke="#666666" points="465.25,-300.25 409.5,-300.25 409.5,-281 465.25,-281 465.25,-300.25"/>
<text text-anchor="middle" x="437.38" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
@@ -330,8 +330,8 @@ var sectionId = 'dynsection-1';
<g id="edge12_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.73,-233.62C334.47,-233.62 370.6,-233.62 398.03,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-237.13 407.68,-233.63 397.68,-230.13 397.68,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M310.73,-290.62C334.47,-290.62 370.6,-290.62 398.03,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-294.13 407.68,-290.63 397.68,-287.13 397.68,-294.13"/>
</a>
</g>
</g>
@@ -339,8 +339,8 @@ var sectionId = 'dynsection-1';
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="599.75,-243.25 531.25,-243.25 531.25,-224 599.75,-224 599.75,-243.25"/>
<text text-anchor="middle" x="565.5" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
<polygon fill="white" stroke="#666666" points="599.75,-300.25 531.25,-300.25 531.25,-281 599.75,-281 599.75,-300.25"/>
<text text-anchor="middle" x="565.5" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
@@ -348,8 +348,8 @@ var sectionId = 'dynsection-1';
<g id="edge8_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M475.31,-298.16C482.13,-295.79 489.05,-292.96 495.25,-289.62 514.28,-279.39 533.17,-263.64 546.4,-251.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.64,-254.15 553.49,-244.73 543.83,-249.07 548.64,-254.15"/>
<path fill="none" stroke="#63b8ff" d="M475.31,-355.16C482.13,-352.79 489.05,-349.96 495.25,-346.62 514.28,-336.39 533.17,-320.64 546.4,-308.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.64,-311.15 553.49,-301.73 543.83,-306.07 548.64,-311.15"/>
</a>
</g>
</g>
@@ -357,8 +357,8 @@ var sectionId = 'dynsection-1';
<g id="edge9_Node000009_Node000009" class="edge">
<title>Node9&#45;&gt;Node9</title>
<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M545.44,-243.54C536.29,-252.15 542.98,-261.25 565.5,-261.25 577.82,-261.25 585.4,-258.53 588.24,-254.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="591.66,-253.91 585.91,-245.01 584.86,-255.55 591.66,-253.91"/>
<path fill="none" stroke="#63b8ff" d="M545.44,-300.54C536.29,-309.15 542.98,-318.25 565.5,-318.25 577.82,-318.25 585.4,-315.53 588.24,-311.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="591.66,-310.91 585.91,-302.01 584.86,-312.55 591.66,-310.91"/>
</a>
</g>
</g>
@@ -366,8 +366,8 @@ var sectionId = 'dynsection-1';
<g id="edge11_Node000010_Node000009" class="edge">
<title>Node10&#45;&gt;Node9</title>
<g id="a_edge11_Node000010_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M472.84,-260.51C487.39,-256.24 504.53,-251.22 520.02,-246.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.89,-250.07 529.5,-243.89 518.92,-243.35 520.89,-250.07"/>
<path fill="none" stroke="#63b8ff" d="M472.84,-317.51C487.39,-313.24 504.53,-308.22 520.02,-303.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.89,-307.07 529.5,-300.89 518.92,-300.35 520.89,-307.07"/>
</a>
</g>
</g>
@@ -375,8 +375,8 @@ var sectionId = 'dynsection-1';
<g id="edge13_Node000011_Node000009" class="edge">
<title>Node11&#45;&gt;Node9</title>
<g id="a_edge13_Node000011_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M465.74,-233.62C481.43,-233.62 501.52,-233.62 519.47,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.38,-237.13 529.38,-233.63 519.38,-230.13 519.38,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M465.74,-290.62C481.43,-290.62 501.52,-290.62 519.47,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.38,-294.13 529.38,-290.63 519.38,-287.13 519.38,-294.13"/>
</a>
</g>
</g>
@@ -384,8 +384,8 @@ var sectionId = 'dynsection-1';
<g id="edge15_Node000012_Node000009" class="edge">
<title>Node12&#45;&gt;Node9</title>
<g id="a_edge15_Node000012_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M322.95,-167.69C364.8,-179.07 434.93,-198.14 495.25,-214.62 503.27,-216.82 511.81,-219.16 520.06,-221.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.01,-224.76 529.58,-224.03 520.86,-218.01 519.01,-224.76"/>
<path fill="none" stroke="#63b8ff" d="M310.01,-206.55C350.65,-191.25 434.25,-167 495.25,-197.62 525.28,-212.7 545.59,-247.65 556.09,-270.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="552.85,-271.48 560.07,-279.23 559.25,-268.66 552.85,-271.48"/>
</a>
</g>
</g>
@@ -393,8 +393,8 @@ var sectionId = 'dynsection-1';
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="472.75,-167.25 402,-167.25 402,-148 472.75,-148 472.75,-167.25"/>
<text text-anchor="middle" x="437.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
<polygon fill="white" stroke="#666666" points="472.75,-150.25 402,-150.25 402,-131 472.75,-131 472.75,-150.25"/>
<text text-anchor="middle" x="437.38" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
@@ -402,8 +402,8 @@ var sectionId = 'dynsection-1';
<g id="edge16_Node000012_Node000013" class="edge">
<title>Node12&#45;&gt;Node13</title>
<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M324.24,-157.62C344.38,-157.62 369.19,-157.62 390.35,-157.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.17,-161.13 400.17,-157.63 390.17,-154.13 390.17,-161.13"/>
<path fill="none" stroke="#63b8ff" d="M302.5,-206.68C321,-195.78 351.92,-178.06 379.5,-164.62 386.3,-161.31 393.67,-158.01 400.78,-154.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.66,-158.38 409.52,-151.27 398.95,-151.92 401.66,-158.38"/>
</a>
</g>
</g>
@@ -411,8 +411,8 @@ var sectionId = 'dynsection-1';
<g id="Node000014" class="node">
<title>Node14</title>
<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="464.5,-56.25 410.25,-56.25 410.25,-37 464.5,-37 464.5,-56.25"/>
<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="592.62,-84.25 538.38,-84.25 538.38,-65 592.62,-65 592.62,-84.25"/>
<text text-anchor="middle" x="565.5" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
@@ -420,8 +420,8 @@ var sectionId = 'dynsection-1';
<g id="edge18_Node000012_Node000014" class="edge">
<title>Node12&#45;&gt;Node14</title>
<g id="a_edge18_Node000012_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.22,-147.66C307.67,-128.75 341.67,-87.52 379.5,-64.62 385.55,-60.96 392.41,-57.98 399.23,-55.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.86,-59.04 408.34,-52.68 397.75,-52.36 399.86,-59.04"/>
<path fill="none" stroke="#63b8ff" d="M292.83,-206.54C306.86,-187.01 340.53,-143.98 379.5,-121.62 404.41,-107.34 480.38,-90.85 526.86,-81.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="527.36,-85.16 536.51,-79.82 526.03,-78.29 527.36,-85.16"/>
</a>
</g>
</g>
@@ -429,8 +429,8 @@ var sectionId = 'dynsection-1';
<g id="Node000015" class="node">
<title>Node15</title>
<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="463,-130.25 411.75,-130.25 411.75,-111 463,-111 463,-130.25"/>
<text text-anchor="middle" x="437.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
<polygon fill="white" stroke="#666666" points="463,-263.25 411.75,-263.25 411.75,-244 463,-244 463,-263.25"/>
<text text-anchor="middle" x="437.38" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
@@ -438,8 +438,8 @@ var sectionId = 'dynsection-1';
<g id="edge19_Node000012_Node000015" class="edge">
<title>Node12&#45;&gt;Node15</title>
<g id="a_edge19_Node000012_Node000015"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M324.24,-148.19C347.64,-142.44 377.35,-135.14 400.31,-129.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="400.96,-132.94 409.84,-127.15 399.29,-126.14 400.96,-132.94"/>
<path fill="none" stroke="#63b8ff" d="M324.24,-226.06C347.64,-231.81 377.35,-239.11 400.31,-244.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-248.11 409.84,-247.1 400.96,-241.31 399.29,-248.11"/>
</a>
</g>
</g>
@@ -447,8 +447,8 @@ var sectionId = 'dynsection-1';
<g id="Node000016" class="node">
<title>Node16</title>
<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="466.75,-93.25 408,-93.25 408,-74 466.75,-74 466.75,-93.25"/>
<text text-anchor="middle" x="437.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
<polygon fill="white" stroke="#666666" points="466.75,-226.25 408,-226.25 408,-207 466.75,-207 466.75,-226.25"/>
<text text-anchor="middle" x="437.38" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
@@ -456,8 +456,8 @@ var sectionId = 'dynsection-1';
<g id="edge20_Node000012_Node000016" class="edge">
<title>Node12&#45;&gt;Node16</title>
<g id="a_edge20_Node000012_Node000016"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M300.22,-147.6C318.11,-135.44 349.96,-114.91 379.5,-101.62 385.05,-99.13 391.05,-96.83 396.99,-94.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-98.23 406.1,-91.8 395.51,-91.57 397.68,-98.23"/>
<path fill="none" stroke="#63b8ff" d="M324.24,-216.62C346.24,-216.62 373.83,-216.62 396.13,-216.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-220.13 406.07,-216.63 396.07,-213.13 396.07,-220.13"/>
</a>
</g>
</g>
@@ -465,8 +465,8 @@ var sectionId = 'dynsection-1';
<g id="edge17_Node000013_Node000009" class="edge">
<title>Node13&#45;&gt;Node9</title>
<g id="a_edge17_Node000013_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M465.93,-167.67C475.46,-171.55 486.05,-176.34 495.25,-181.62 512.87,-191.75 531.19,-205.69 544.56,-216.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="542.25,-219.21 552.18,-222.91 546.72,-213.83 542.25,-219.21"/>
<path fill="none" stroke="#63b8ff" d="M472.44,-150.66C480.54,-154.16 488.72,-158.74 495.25,-164.62 527.87,-194.04 548.36,-242.55 557.99,-270"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="554.59,-270.87 561.08,-279.24 561.23,-268.65 554.59,-270.87"/>
</a>
</g>
</g>
@@ -474,8 +474,8 @@ var sectionId = 'dynsection-1';
<g id="edge22_Node000017_Node000006" class="edge">
<title>Node17&#45;&gt;Node6</title>
<g id="a_edge22_Node000017_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-270.62C171.52,-270.62 206.01,-270.62 234.69,-270.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-274.13 244.65,-270.63 234.65,-267.13 234.65,-274.13"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-327.62C171.52,-327.62 206.01,-327.62 234.69,-327.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-331.13 244.65,-327.63 234.65,-324.13 234.65,-331.13"/>
</a>
</g>
</g>
@@ -483,8 +483,8 @@ var sectionId = 'dynsection-1';
<g id="edge23_Node000017_Node000007" class="edge">
<title>Node17&#45;&gt;Node7</title>
<g id="a_edge23_Node000017_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-266.16C174.77,-260.32 217.21,-249.93 247.73,-242.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-245.9 257.31,-240.12 246.76,-239.1 248.42,-245.9"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-323.16C174.77,-317.32 217.21,-306.93 247.73,-299.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-302.9 257.31,-297.12 246.76,-296.1 248.42,-302.9"/>
</a>
</g>
</g>
@@ -492,8 +492,8 @@ var sectionId = 'dynsection-1';
<g id="edge24_Node000017_Node000012" class="edge">
<title>Node17&#45;&gt;Node12</title>
<g id="a_edge24_Node000017_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.77,-267.44C162.65,-264.78 178.15,-260.17 190.25,-252.62 209.99,-240.31 209.98,-231.25 226.25,-214.62 239.27,-201.32 254.22,-186.55 265.63,-175.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.78,-178.16 272.49,-168.67 262.89,-173.16 267.78,-178.16"/>
<path fill="none" stroke="#63b8ff" d="M150.77,-324.44C162.65,-321.78 178.15,-317.17 190.25,-309.62 209.99,-297.31 209.83,-288.11 226.25,-271.62 238.88,-258.95 253.47,-245.03 264.8,-234.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.09,-237.03 271.99,-227.64 262.3,-231.92 267.09,-237.03"/>
</a>
</g>
</g>
@@ -501,8 +501,8 @@ var sectionId = 'dynsection-1';
<g id="Node000019" class="node">
<title>Node19</title>
<g id="a_Node000019"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="325.5,-75.25 244.25,-75.25 244.25,-56 325.5,-56 325.5,-75.25"/>
<text text-anchor="middle" x="284.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
<polygon fill="white" stroke="#666666" points="325.5,-56.25 244.25,-56.25 244.25,-37 325.5,-37 325.5,-56.25"/>
<text text-anchor="middle" x="284.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
</a>
</g>
</g>
@@ -510,17 +510,17 @@ var sectionId = 'dynsection-1';
<g id="edge26_Node000018_Node000019" class="edge">
<title>Node18&#45;&gt;Node19</title>
<g id="a_edge26_Node000018_Node000019"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M148.81,-148.67C174.97,-132.59 226.74,-100.75 258.04,-81.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="259.83,-84.52 266.52,-76.3 256.16,-78.56 259.83,-84.52"/>
<path fill="none" stroke="#63b8ff" d="M147.13,-140.65C173.15,-122.76 228,-85.04 259.76,-63.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="261.69,-66.13 267.95,-57.58 257.72,-60.36 261.69,-66.13"/>
</a>
</g>
</g>
<!-- Node20 -->
<g id="Node000020" class="node">
<title>Node20</title>
<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="495.25,-19.25 379.5,-19.25 379.5,0 495.25,0 495.25,-19.25"/>
<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_Node000020"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="458.5,-56.25 416.25,-56.25 416.25,-37 458.5,-37 458.5,-56.25"/>
<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
</a>
</g>
</g>
@@ -528,203 +528,239 @@ var sectionId = 'dynsection-1';
<g id="edge27_Node000019_Node000020" class="edge">
<title>Node19&#45;&gt;Node20</title>
<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M309.15,-55.58C327.97,-47.6 355.24,-36.37 379.5,-27.62 383.66,-26.13 388.01,-24.63 392.37,-23.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.28,-26.55 401.71,-20.13 391.11,-19.9 393.28,-26.55"/>
<path fill="none" stroke="#63b8ff" d="M325.81,-46.62C350.47,-46.62 381.66,-46.62 404.63,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="404.61,-50.13 414.61,-46.63 404.61,-43.13 404.61,-50.13"/>
</a>
</g>
</g>
<!-- Node21&#45;&gt;Node4 -->
<g id="edge29_Node000021_Node000004" class="edge">
<title>Node21&#45;&gt;Node4</title>
<g id="a_edge29_Node000021_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-441.82C174.38,-439.48 215.85,-435.37 246.25,-432.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-435.84 256.2,-431.37 245.9,-428.87 246.59,-435.84"/>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="495.25,-19.25 379.5,-19.25 379.5,0 495.25,0 495.25,-19.25"/>
<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node22 -->
<g id="Node000022" class="node">
<title>Node22</title>
<g id="a_Node000022"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-498.5 226.25,-498.5 226.25,-456.75 343.5,-456.75 343.5,-498.5"/>
<text text-anchor="start" x="234.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-462.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
<!-- Node19&#45;&gt;Node21 -->
<g id="edge30_Node000019_Node000021" class="edge">
<title>Node19&#45;&gt;Node21</title>
<g id="a_edge30_Node000019_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M325.81,-36.81C343.72,-32.4 365.08,-27.15 384.23,-22.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="384.86,-25.89 393.73,-20.11 383.19,-19.1 384.86,-25.89"/>
</a>
</g>
</g>
<!-- Node21&#45;&gt;Node22 -->
<g id="edge30_Node000021_Node000022" class="edge">
<title>Node21&#45;&gt;Node22</title>
<g id="a_edge30_Node000021_Node000022"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-447.73C166.88,-451.32 191.2,-456.79 214.7,-462.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-465.45 224.28,-464.23 215.29,-458.62 213.76,-465.45"/>
<!-- Node20&#45;&gt;Node14 -->
<g id="edge29_Node000020_Node000014" class="edge">
<title>Node20&#45;&gt;Node14</title>
<g id="a_edge29_Node000020_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M458.92,-51.19C477.35,-55.28 504.84,-61.38 527.15,-66.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="526.27,-69.72 536.79,-68.47 527.79,-62.89 526.27,-69.72"/>
</a>
</g>
</g>
<!-- Node20&#45;&gt;Node20 -->
<g id="edge28_Node000020_Node000020" class="edge">
<title>Node20&#45;&gt;Node20</title>
<g id="a_edge28_Node000020_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M417.32,-56.54C408.17,-65.15 414.85,-74.25 437.38,-74.25 449.69,-74.25 457.27,-71.53 460.12,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="463.54,-66.91 457.79,-58.01 456.73,-68.55 463.54,-66.91"/>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node4 -->
<g id="edge32_Node000022_Node000004" class="edge">
<title>Node22&#45;&gt;Node4</title>
<g id="a_edge32_Node000022_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-498.82C174.38,-496.48 215.85,-492.37 246.25,-489.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-492.84 256.2,-488.37 245.9,-485.87 246.59,-492.84"/>
</a>
</g>
</g>
<!-- Node23 -->
<g id="Node000023" class="node">
<title>Node23</title>
<g id="a_Node000023"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="468.25,-428.25 406.5,-428.25 406.5,-409 468.25,-409 468.25,-428.25"/>
<text text-anchor="middle" x="437.38" y="-414.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
<g id="a_Node000023"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-555.5 226.25,-555.5 226.25,-513.75 343.5,-513.75 343.5,-555.5"/>
<text text-anchor="start" x="234.25" y="-542" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-530.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-519.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node23 -->
<g id="edge31_Node000022_Node000023" class="edge">
<g id="edge33_Node000022_Node000023" class="edge">
<title>Node22&#45;&gt;Node23</title>
<g id="a_edge31_Node000022_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M340.21,-456.32C360.15,-448.51 382.22,-439.85 400.18,-432.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.34,-436.12 409.37,-429.21 398.78,-429.6 401.34,-436.12"/>
<g id="a_edge33_Node000022_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-504.73C166.88,-508.32 191.2,-513.79 214.7,-519.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-522.45 224.28,-521.23 215.29,-515.62 213.76,-522.45"/>
</a>
</g>
</g>
<!-- Node24 -->
<g id="Node000024" class="node">
<title>Node24</title>
<g id="a_Node000024"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="470.88,-391.25 403.88,-391.25 403.88,-372 470.88,-372 470.88,-391.25"/>
<text text-anchor="middle" x="437.38" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
<g id="a_Node000024"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="468.25,-485.25 406.5,-485.25 406.5,-466 468.25,-466 468.25,-485.25"/>
<text text-anchor="middle" x="437.38" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node24 -->
<g id="edge32_Node000022_Node000024" class="edge">
<title>Node22&#45;&gt;Node24</title>
<g id="a_edge32_Node000022_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.49,-456.4C335.72,-453.69 339.8,-450.76 343.5,-447.62 363.83,-430.37 357.75,-415.05 379.5,-399.62 383.6,-396.72 388.2,-394.26 392.94,-392.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.9,-395.58 402.04,-388.8 391.45,-389.02 393.9,-395.58"/>
<!-- Node23&#45;&gt;Node24 -->
<g id="edge34_Node000023_Node000024" class="edge">
<title>Node23&#45;&gt;Node24</title>
<g id="a_edge34_Node000023_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M340.21,-513.32C360.15,-505.51 382.22,-496.85 400.18,-489.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.34,-493.12 409.37,-486.21 398.78,-486.6 401.34,-493.12"/>
</a>
</g>
</g>
<!-- Node25 -->
<g id="Node000025" class="node">
<title>Node25</title>
<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="467.12,-354.25 407.62,-354.25 407.62,-335 467.12,-335 467.12,-354.25"/>
<text text-anchor="middle" x="437.38" y="-340.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="470.88,-448.25 403.88,-448.25 403.88,-429 470.88,-429 470.88,-448.25"/>
<text text-anchor="middle" x="437.38" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node25 -->
<g id="edge33_Node000022_Node000025" class="edge">
<title>Node22&#45;&gt;Node25</title>
<g id="a_edge33_Node000022_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M333.74,-456.26C337.28,-453.65 340.59,-450.77 343.5,-447.62 371.34,-417.49 349.16,-390.24 379.5,-362.62 384.41,-358.16 390.42,-354.8 396.68,-352.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.46,-355.71 405.85,-349.24 395.26,-349.06 397.46,-355.71"/>
<!-- Node23&#45;&gt;Node25 -->
<g id="edge35_Node000023_Node000025" class="edge">
<title>Node23&#45;&gt;Node25</title>
<g id="a_edge35_Node000023_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.49,-513.4C335.72,-510.69 339.8,-507.76 343.5,-504.62 363.83,-487.37 357.75,-472.05 379.5,-456.62 383.6,-453.72 388.2,-451.26 392.94,-449.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.9,-452.58 402.04,-445.8 391.45,-446.02 393.9,-452.58"/>
</a>
</g>
</g>
<!-- Node26&#45;&gt;Node4 -->
<g id="edge35_Node000026_Node000004" class="edge">
<title>Node26&#45;&gt;Node4</title>
<g id="a_edge35_Node000026_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.93,-374.87C162.33,-379.48 177.24,-385.67 190.25,-391.62 206.52,-399.07 209.71,-402.81 226.25,-409.62 232.9,-412.37 240.1,-415 247.08,-417.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-420.62 256.33,-420.43 247.93,-413.97 245.74,-420.62"/>
<!-- Node26 -->
<g id="Node000026" class="node">
<title>Node26</title>
<g id="a_Node000026"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="467.12,-411.25 407.62,-411.25 407.62,-392 467.12,-392 467.12,-411.25"/>
<text text-anchor="middle" x="437.38" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
</a>
</g>
</g>
<!-- Node27 -->
<g id="Node000027" class="node">
<title>Node27</title>
<g id="a_Node000027"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-400.5 226.25,-400.5 226.25,-358.75 343.5,-358.75 343.5,-400.5"/>
<text text-anchor="start" x="234.25" y="-387" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-375.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-364.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
<!-- Node23&#45;&gt;Node26 -->
<g id="edge36_Node000023_Node000026" class="edge">
<title>Node23&#45;&gt;Node26</title>
<g id="a_edge36_Node000023_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M333.74,-513.26C337.28,-510.65 340.59,-507.77 343.5,-504.62 371.34,-474.49 349.16,-447.24 379.5,-419.62 384.41,-415.16 390.42,-411.8 396.68,-409.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.46,-412.71 405.85,-406.24 395.26,-406.06 397.46,-412.71"/>
</a>
</g>
</g>
<!-- Node26&#45;&gt;Node27 -->
<g id="edge36_Node000026_Node000027" class="edge">
<title>Node26&#45;&gt;Node27</title>
<g id="a_edge36_Node000026_Node000027"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-369.07C166.8,-370.34 190.98,-372.26 214.38,-374.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-377.59 224.25,-374.89 214.56,-370.61 214.01,-377.59"/>
<!-- Node27&#45;&gt;Node4 -->
<g id="edge38_Node000027_Node000004" class="edge">
<title>Node27&#45;&gt;Node4</title>
<g id="a_edge38_Node000027_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.93,-431.87C162.33,-436.48 177.24,-442.67 190.25,-448.62 206.52,-456.07 209.71,-459.81 226.25,-466.62 232.9,-469.37 240.1,-472 247.08,-474.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-477.62 256.33,-477.43 247.93,-470.97 245.74,-477.62"/>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node23 -->
<g id="edge37_Node000027_Node000023" class="edge">
<title>Node27&#45;&gt;Node23</title>
<g id="a_edge37_Node000027_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-394.59C360.84,-399.05 379.34,-403.85 395.26,-407.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.31,-411.34 404.87,-410.46 396.07,-404.56 394.31,-411.34"/>
<!-- Node28 -->
<g id="Node000028" class="node">
<title>Node28</title>
<g id="a_Node000028"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-457.5 226.25,-457.5 226.25,-415.75 343.5,-415.75 343.5,-457.5"/>
<text text-anchor="start" x="234.25" y="-444" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-432.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-421.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node24 -->
<g id="edge38_Node000027_Node000024" class="edge">
<title>Node27&#45;&gt;Node24</title>
<g id="a_edge38_Node000027_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-380.39C359.88,-380.61 377.28,-380.84 392.57,-381.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="392.24,-384.54 402.29,-381.17 392.33,-377.54 392.24,-384.54"/>
<!-- Node27&#45;&gt;Node28 -->
<g id="edge39_Node000027_Node000028" class="edge">
<title>Node27&#45;&gt;Node28</title>
<g id="a_edge39_Node000027_Node000028"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-426.07C166.8,-427.34 190.98,-429.26 214.38,-431.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-434.59 224.25,-431.89 214.56,-427.61 214.01,-434.59"/>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node25 -->
<g id="edge39_Node000027_Node000025" class="edge">
<title>Node27&#45;&gt;Node25</title>
<g id="a_edge39_Node000027_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-366.19C361.11,-362.13 379.92,-357.75 396,-354.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.75,-357.43 405.69,-351.76 395.16,-350.62 396.75,-357.43"/>
<!-- Node28&#45;&gt;Node24 -->
<g id="edge40_Node000028_Node000024" class="edge">
<title>Node28&#45;&gt;Node24</title>
<g id="a_edge40_Node000028_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-451.59C360.84,-456.05 379.34,-460.85 395.26,-464.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.31,-468.34 404.87,-467.46 396.07,-461.56 394.31,-468.34"/>
</a>
</g>
</g>
<!-- Node28&#45;&gt;Node4 -->
<g id="edge41_Node000028_Node000004" class="edge">
<title>Node28&#45;&gt;Node4</title>
<g id="a_edge41_Node000028_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.84,-332.85C163.06,-335.11 178.91,-339.64 190.25,-348.62 214.92,-368.18 201.73,-389.88 226.25,-409.62 232.31,-414.51 239.68,-418.16 247.09,-420.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-424.14 256.39,-423.78 247.88,-417.46 245.8,-424.14"/>
<!-- Node28&#45;&gt;Node25 -->
<g id="edge41_Node000028_Node000025" class="edge">
<title>Node28&#45;&gt;Node25</title>
<g id="a_edge41_Node000028_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-437.39C359.88,-437.61 377.28,-437.84 392.57,-438.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="392.24,-441.54 402.29,-438.17 392.33,-434.54 392.24,-441.54"/>
</a>
</g>
</g>
<!-- Node29 -->
<g id="Node000029" class="node">
<title>Node29</title>
<g id="a_Node000029"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
<polygon fill="white" stroke="#666666" points="343.5,-340.5 226.25,-340.5 226.25,-298.75 343.5,-298.75 343.5,-340.5"/>
<text text-anchor="start" x="234.25" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-315.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-304.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
<!-- Node28&#45;&gt;Node26 -->
<g id="edge42_Node000028_Node000026" class="edge">
<title>Node28&#45;&gt;Node26</title>
<g id="a_edge42_Node000028_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-423.19C361.11,-419.13 379.92,-414.75 396,-411.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.75,-414.43 405.69,-408.76 395.16,-407.62 396.75,-414.43"/>
</a>
</g>
</g>
<!-- Node28&#45;&gt;Node29 -->
<g id="edge42_Node000028_Node000029" class="edge">
<title>Node28&#45;&gt;Node29</title>
<g id="a_edge42_Node000028_Node000029"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-329.3C166.8,-328.14 190.98,-326.38 214.38,-324.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-328.18 224.25,-323.96 214.02,-321.2 214.53,-328.18"/>
<!-- Node29&#45;&gt;Node4 -->
<g id="edge44_Node000029_Node000004" class="edge">
<title>Node29&#45;&gt;Node4</title>
<g id="a_edge44_Node000029_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.84,-389.85C163.06,-392.11 178.91,-396.64 190.25,-405.62 214.92,-425.18 201.73,-446.88 226.25,-466.62 232.31,-471.51 239.68,-475.16 247.09,-477.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-481.14 256.39,-480.78 247.88,-474.46 245.8,-481.14"/>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node23 -->
<g id="edge43_Node000029_Node000023" class="edge">
<title>Node29&#45;&gt;Node23</title>
<g id="a_edge43_Node000029_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.88,-340.93C335.98,-343.61 339.93,-346.51 343.5,-349.62 364.39,-367.88 357.1,-384.25 379.5,-400.62 384.24,-404.09 389.67,-406.9 395.25,-409.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394,-412.45 404.59,-412.44 396.3,-405.84 394,-412.45"/>
<!-- Node30 -->
<g id="Node000030" class="node">
<title>Node30</title>
<g id="a_Node000030"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
<polygon fill="white" stroke="#666666" points="343.5,-397.5 226.25,-397.5 226.25,-355.75 343.5,-355.75 343.5,-397.5"/>
<text text-anchor="start" x="234.25" y="-384" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-372.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-361.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node24 -->
<g id="edge44_Node000029_Node000024" class="edge">
<title>Node29&#45;&gt;Node24</title>
<g id="a_edge44_Node000029_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.23,-340.99C344.11,-348.61 362.44,-356.95 379.5,-363.62 383.84,-365.32 388.41,-366.98 393,-368.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.6,-371.78 402.2,-371.6 393.8,-365.14 391.6,-371.78"/>
<!-- Node29&#45;&gt;Node30 -->
<g id="edge45_Node000029_Node000030" class="edge">
<title>Node29&#45;&gt;Node30</title>
<g id="a_edge45_Node000029_Node000030"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-386.3C166.8,-385.14 190.98,-383.38 214.38,-381.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-385.18 224.25,-380.96 214.02,-378.2 214.53,-385.18"/>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node25 -->
<g id="edge45_Node000029_Node000025" class="edge">
<title>Node29&#45;&gt;Node25</title>
<g id="a_edge45_Node000029_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-329.22C361.11,-332.12 379.92,-335.25 396,-337.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.24,-341.34 405.67,-339.53 396.38,-334.43 395.24,-341.34"/>
<!-- Node30&#45;&gt;Node24 -->
<g id="edge46_Node000030_Node000024" class="edge">
<title>Node30&#45;&gt;Node24</title>
<g id="a_edge46_Node000030_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.88,-397.93C335.98,-400.61 339.93,-403.51 343.5,-406.62 364.39,-424.88 357.1,-441.25 379.5,-457.62 384.24,-461.09 389.67,-463.9 395.25,-466.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394,-469.45 404.59,-469.44 396.3,-462.84 394,-469.45"/>
</a>
</g>
</g>
<!-- Node30&#45;&gt;Node25 -->
<g id="edge47_Node000030_Node000025" class="edge">
<title>Node30&#45;&gt;Node25</title>
<g id="a_edge47_Node000030_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.23,-397.99C344.11,-405.61 362.44,-413.95 379.5,-420.62 383.84,-422.32 388.41,-423.98 393,-425.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.6,-428.78 402.2,-428.6 393.8,-422.14 391.6,-428.78"/>
</a>
</g>
</g>
<!-- Node30&#45;&gt;Node26 -->
<g id="edge48_Node000030_Node000026" class="edge">
<title>Node30&#45;&gt;Node26</title>
<g id="a_edge48_Node000030_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-386.22C361.11,-389.12 379.92,-392.25 396,-394.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.24,-398.34 405.67,-396.53 396.38,-391.43 395.24,-398.34"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 38 KiB

After

Width:  |  Height:  |  Size: 40 KiB

550
d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="608pt" height="559pt"
viewBox="0.00 0.00 607.75 558.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 554.5)">
<svg width="608pt" height="616pt"
viewBox="0.00 0.00 607.75 615.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 611.5)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-377.25 0,-377.25 0,-358 37,-358 37,-377.25"/>
<text text-anchor="middle" x="18.5" y="-363.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-434.25 0,-434.25 0,-415 37,-415 37,-434.25"/>
<text text-anchor="middle" x="18.5" y="-420.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -21,10 +21,10 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6" target="_top" xlink:title="function that will create new node for insertion.">
<polygon fill="white" stroke="#666666" points="190.25,-550.5 73,-550.5 73,-508.75 190.25,-508.75 190.25,-550.5"/>
<text text-anchor="start" x="81" y="-537" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="81" y="-525.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="131.62" y="-514.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
<polygon fill="white" stroke="#666666" points="190.25,-607.5 73,-607.5 73,-565.75 190.25,-565.75 190.25,-607.5"/>
<text text-anchor="start" x="81" y="-594" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="81" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="131.62" y="-571.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
</a>
</g>
</g>
@@ -32,8 +32,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.09,-377.48C25.38,-401.25 39.23,-462.49 73,-499.62 73.36,-500.02 73.73,-500.41 74.1,-500.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.73,-503.38 81.56,-507.32 76.33,-498.1 71.73,-503.38"/>
<path fill="none" stroke="#63b8ff" d="M21.09,-434.48C25.38,-458.25 39.23,-519.49 73,-556.62 73.36,-557.02 73.73,-557.41 74.1,-557.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.73,-560.38 81.56,-564.32 76.33,-555.1 71.73,-560.38"/>
</a>
</g>
</g>
@@ -41,8 +41,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="175.25,-490.25 88,-490.25 88,-471 175.25,-471 175.25,-490.25"/>
<text text-anchor="middle" x="131.62" y="-476.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
<polygon fill="white" stroke="#666666" points="175.25,-547.25 88,-547.25 88,-528 175.25,-528 175.25,-547.25"/>
<text text-anchor="middle" x="131.62" y="-533.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
</a>
</g>
</g>
@@ -50,8 +50,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M22.37,-377.58C28.45,-396.88 44.45,-439.53 73,-462.62 74.48,-463.83 76.05,-464.95 77.68,-465.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.72,-468.92 86.2,-470.5 78.99,-462.73 75.72,-468.92"/>
<path fill="none" stroke="#63b8ff" d="M22.37,-434.58C28.45,-453.88 44.45,-496.53 73,-519.62 74.48,-520.83 76.05,-521.95 77.68,-522.99"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.72,-525.92 86.2,-527.5 78.99,-519.73 75.72,-525.92"/>
</a>
</g>
</g>
@@ -59,8 +59,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="311.62,-438.25 258.12,-438.25 258.12,-419 311.62,-419 311.62,-438.25"/>
<text text-anchor="middle" x="284.88" y="-424.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="311.62,-495.25 258.12,-495.25 258.12,-476 311.62,-476 311.62,-495.25"/>
<text text-anchor="middle" x="284.88" y="-481.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -68,8 +68,8 @@
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.13,-374.61C47.46,-378.52 60.84,-383.27 73,-386.62 133.03,-403.17 204.37,-415.99 246.79,-422.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.03,-426.33 256.46,-424.46 247.14,-419.42 246.03,-426.33"/>
<path fill="none" stroke="#63b8ff" d="M37.13,-431.61C47.46,-435.52 60.84,-440.27 73,-443.62 133.03,-460.17 204.37,-472.99 246.79,-479.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.03,-483.33 256.46,-481.46 247.14,-476.42 246.03,-483.33"/>
</a>
</g>
</g>
@@ -77,8 +77,8 @@
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
<polygon fill="white" stroke="#666666" points="150.5,-243.25 112.75,-243.25 112.75,-224 150.5,-224 150.5,-243.25"/>
<text text-anchor="middle" x="131.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
<polygon fill="white" stroke="#666666" points="150.5,-300.25 112.75,-300.25 112.75,-281 150.5,-281 150.5,-300.25"/>
<text text-anchor="middle" x="131.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
@@ -86,8 +86,8 @@
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.28,-357.6C25.77,-335.23 39.67,-280.9 73,-251.62 80.87,-244.71 91.37,-240.46 101.25,-237.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.86,-241.28 110.9,-235.76 100.38,-234.44 101.86,-241.28"/>
<path fill="none" stroke="#63b8ff" d="M21.28,-414.6C25.77,-392.23 39.67,-337.9 73,-308.62 80.87,-301.71 91.37,-297.46 101.25,-294.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.86,-298.28 110.9,-292.76 100.38,-291.44 101.86,-298.28"/>
</a>
</g>
</g>
@@ -95,8 +95,8 @@
<g id="Node000017" class="node">
<title>Node17</title>
<g id="a_Node000017"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
<polygon fill="white" stroke="#666666" points="150.5,-280.25 112.75,-280.25 112.75,-261 150.5,-261 150.5,-280.25"/>
<text text-anchor="middle" x="131.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
<polygon fill="white" stroke="#666666" points="150.5,-337.25 112.75,-337.25 112.75,-318 150.5,-318 150.5,-337.25"/>
<text text-anchor="middle" x="131.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
@@ -104,8 +104,8 @@
<g id="edge21_Node000001_Node000017" class="edge">
<title>Node1&#45;&gt;Node17</title>
<g id="a_edge21_Node000001_Node000017"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28.06,-357.56C38.22,-345.9 55.92,-326.41 73,-311.62 83.13,-302.86 95.1,-294.11 105.49,-286.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.27,-289.99 113.61,-281.5 103.36,-284.19 107.27,-289.99"/>
<path fill="none" stroke="#63b8ff" d="M28.06,-414.56C38.22,-402.9 55.92,-383.41 73,-368.62 83.13,-359.86 95.1,-351.11 105.49,-343.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.27,-346.99 113.61,-338.5 103.36,-341.19 107.27,-346.99"/>
</a>
</g>
</g>
@@ -113,8 +113,8 @@
<g id="Node000018" class="node">
<title>Node18</title>
<g id="a_Node000018"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="150.5,-168.25 112.75,-168.25 112.75,-149 150.5,-149 150.5,-168.25"/>
<text text-anchor="middle" x="131.62" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
<polygon fill="white" stroke="#666666" points="150.5,-160.25 112.75,-160.25 112.75,-141 150.5,-141 150.5,-160.25"/>
<text text-anchor="middle" x="131.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
</a>
</g>
</g>
@@ -122,62 +122,62 @@
<g id="edge25_Node000001_Node000018" class="edge">
<title>Node1&#45;&gt;Node18</title>
<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.33,-357.62C26.33,-332.11 41.97,-263.25 73,-214.62 82.57,-199.63 96.9,-185.68 108.88,-175.46"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.78,-178.42 116.29,-169.37 106.34,-173.01 110.78,-178.42"/>
<path fill="none" stroke="#63b8ff" d="M22.52,-414.82C30.15,-390.35 51.15,-324.71 73,-271.62 87.92,-235.38 108.15,-194.45 120.25,-170.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.33,-172.34 124.78,-161.85 117.1,-169.15 123.33,-172.34"/>
</a>
</g>
</g>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-453.25 112.75,-453.25 112.75,-434 150.5,-434 150.5,-453.25"/>
<text text-anchor="middle" x="131.62" y="-439.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
<!-- Node22 -->
<g id="Node000022" class="node">
<title>Node22</title>
<g id="a_Node000022"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-510.25 112.75,-510.25 112.75,-491 150.5,-491 150.5,-510.25"/>
<text text-anchor="middle" x="131.62" y="-496.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node21 -->
<g id="edge28_Node000001_Node000021" class="edge">
<title>Node1&#45;&gt;Node21</title>
<g id="a_edge28_Node000001_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M27.68,-377.59C37.47,-389 54.83,-407.65 73,-419.62 81.78,-425.41 92.18,-430.26 101.72,-434.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.35,-437.28 110.94,-437.48 102.79,-430.71 100.35,-437.28"/>
<!-- Node1&#45;&gt;Node22 -->
<g id="edge31_Node000001_Node000022" class="edge">
<title>Node1&#45;&gt;Node22</title>
<g id="a_edge31_Node000001_Node000022"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M27.68,-434.59C37.47,-446 54.83,-464.65 73,-476.62 81.78,-482.41 92.18,-487.26 101.72,-491.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.35,-494.28 110.94,-494.48 102.79,-487.71 100.35,-494.28"/>
</a>
</g>
</g>
<!-- Node26 -->
<g id="Node000026" class="node">
<title>Node26</title>
<g id="a_Node000026"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-377.25 112.75,-377.25 112.75,-358 150.5,-358 150.5,-377.25"/>
<text text-anchor="middle" x="131.62" y="-363.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
<!-- Node27 -->
<g id="Node000027" class="node">
<title>Node27</title>
<g id="a_Node000027"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-434.25 112.75,-434.25 112.75,-415 150.5,-415 150.5,-434.25"/>
<text text-anchor="middle" x="131.62" y="-420.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node26 -->
<g id="edge34_Node000001_Node000026" class="edge">
<title>Node1&#45;&gt;Node26</title>
<g id="a_edge34_Node000001_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-367.62C54.51,-367.62 80.73,-367.62 101.01,-367.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.93,-371.13 110.93,-367.63 100.93,-364.13 100.93,-371.13"/>
<!-- Node1&#45;&gt;Node27 -->
<g id="edge37_Node000001_Node000027" class="edge">
<title>Node1&#45;&gt;Node27</title>
<g id="a_edge37_Node000001_Node000027"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-424.62C54.51,-424.62 80.73,-424.62 101.01,-424.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.93,-428.13 110.93,-424.63 100.93,-421.13 100.93,-428.13"/>
</a>
</g>
</g>
<!-- Node28 -->
<g id="Node000028" class="node">
<title>Node28</title>
<g id="a_Node000028"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-340.25 112.75,-340.25 112.75,-321 150.5,-321 150.5,-340.25"/>
<text text-anchor="middle" x="131.62" y="-326.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
<!-- Node29 -->
<g id="Node000029" class="node">
<title>Node29</title>
<g id="a_Node000029"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
<polygon fill="white" stroke="#666666" points="150.5,-397.25 112.75,-397.25 112.75,-378 150.5,-378 150.5,-397.25"/>
<text text-anchor="middle" x="131.62" y="-383.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node28 -->
<g id="edge40_Node000001_Node000028" class="edge">
<title>Node1&#45;&gt;Node28</title>
<g id="a_edge40_Node000001_Node000028"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.27,-361.12C47.66,-357.37 61.03,-352.62 73,-348.62 82.23,-345.55 92.34,-342.33 101.48,-339.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="102.43,-342.86 110.95,-336.57 100.37,-336.17 102.43,-342.86"/>
<!-- Node1&#45;&gt;Node29 -->
<g id="edge43_Node000001_Node000029" class="edge">
<title>Node1&#45;&gt;Node29</title>
<g id="a_edge43_Node000001_Node000029"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.27,-418.12C47.66,-414.37 61.03,-409.62 73,-405.62 82.23,-402.55 92.34,-399.33 101.48,-396.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="102.43,-399.86 110.95,-393.57 100.37,-393.17 102.43,-399.86"/>
</a>
</g>
</g>
@@ -185,8 +185,8 @@
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="323.25,-280.25 246.5,-280.25 246.5,-261 323.25,-261 323.25,-280.25"/>
<text text-anchor="middle" x="284.88" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
<polygon fill="white" stroke="#666666" points="323.25,-337.25 246.5,-337.25 246.5,-318 323.25,-318 323.25,-337.25"/>
<text text-anchor="middle" x="284.88" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
</a>
</g>
</g>
@@ -194,8 +194,8 @@
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-238.09C171.61,-243.16 206.32,-251.65 235.08,-258.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.15,-262.06 244.7,-261.04 235.82,-255.27 234.15,-262.06"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-295.09C171.61,-300.16 206.32,-308.65 235.08,-315.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.15,-319.06 244.7,-318.04 235.82,-312.27 234.15,-319.06"/>
</a>
</g>
</g>
@@ -203,8 +203,8 @@
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
<polygon fill="white" stroke="#666666" points="310.5,-243.25 259.25,-243.25 259.25,-224 310.5,-224 310.5,-243.25"/>
<text text-anchor="middle" x="284.88" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
<polygon fill="white" stroke="#666666" points="310.5,-300.25 259.25,-300.25 259.25,-281 310.5,-281 310.5,-300.25"/>
<text text-anchor="middle" x="284.88" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
@@ -212,8 +212,8 @@
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-233.62C174.66,-233.62 216.83,-233.62 247.32,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="247.26,-237.13 257.26,-233.63 247.26,-230.13 247.26,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-290.62C174.66,-290.62 216.83,-290.62 247.32,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="247.26,-294.13 257.26,-290.63 247.26,-287.13 247.26,-294.13"/>
</a>
</g>
</g>
@@ -221,8 +221,8 @@
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
<polygon fill="white" stroke="#666666" points="324,-167.25 245.75,-167.25 245.75,-148 324,-148 324,-167.25"/>
<text text-anchor="middle" x="284.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
<polygon fill="white" stroke="#666666" points="324,-226.25 245.75,-226.25 245.75,-207 324,-207 324,-226.25"/>
<text text-anchor="middle" x="284.88" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
@@ -230,8 +230,8 @@
<g id="edge14_Node000005_Node000012" class="edge">
<title>Node5&#45;&gt;Node12</title>
<g id="a_edge14_Node000005_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-224.46C176.45,-211.6 223.29,-188.07 254,-172.64"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="255.41,-175.84 262.78,-168.23 252.27,-169.59 255.41,-175.84"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-281.7C176.31,-269.25 222.77,-246.52 253.49,-231.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="254.84,-234.73 262.28,-227.19 251.76,-228.44 254.84,-234.73"/>
</a>
</g>
</g>
@@ -239,8 +239,8 @@
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="475,-317.25 399.75,-317.25 399.75,-298 475,-298 475,-317.25"/>
<text text-anchor="middle" x="437.38" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
<polygon fill="white" stroke="#666666" points="475,-374.25 399.75,-374.25 399.75,-355 475,-355 475,-374.25"/>
<text text-anchor="middle" x="437.38" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
@@ -248,8 +248,8 @@
<g id="edge7_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.89,-238.48C321.48,-241.27 333.63,-245.47 343.5,-251.62 363.24,-263.94 359.78,-277.28 379.5,-289.62 382.43,-291.46 385.57,-293.13 388.81,-294.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="387.38,-297.83 397.96,-298.35 390.01,-291.34 387.38,-297.83"/>
<path fill="none" stroke="#63b8ff" d="M310.89,-295.48C321.48,-298.27 333.63,-302.47 343.5,-308.62 363.24,-320.94 359.78,-334.28 379.5,-346.62 382.43,-348.46 385.57,-350.13 388.81,-351.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="387.38,-354.83 397.96,-355.35 390.01,-348.34 387.38,-354.83"/>
</a>
</g>
</g>
@@ -257,8 +257,8 @@
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="473.5,-280.25 401.25,-280.25 401.25,-261 473.5,-261 473.5,-280.25"/>
<text text-anchor="middle" x="437.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
<polygon fill="white" stroke="#666666" points="473.5,-337.25 401.25,-337.25 401.25,-318 473.5,-318 473.5,-337.25"/>
<text text-anchor="middle" x="437.38" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
@@ -266,8 +266,8 @@
<g id="edge10_Node000007_Node000010" class="edge">
<title>Node7&#45;&gt;Node10</title>
<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.73,-239.73C332.11,-244.99 363.54,-252.72 389.61,-259.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.77,-262.53 399.32,-261.51 390.44,-255.73 388.77,-262.53"/>
<path fill="none" stroke="#63b8ff" d="M310.73,-296.73C332.11,-301.99 363.54,-309.72 389.61,-316.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="388.77,-319.53 399.32,-318.51 390.44,-312.73 388.77,-319.53"/>
</a>
</g>
</g>
@@ -275,8 +275,8 @@
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
<polygon fill="white" stroke="#666666" points="465.25,-243.25 409.5,-243.25 409.5,-224 465.25,-224 465.25,-243.25"/>
<text text-anchor="middle" x="437.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
<polygon fill="white" stroke="#666666" points="465.25,-300.25 409.5,-300.25 409.5,-281 465.25,-281 465.25,-300.25"/>
<text text-anchor="middle" x="437.38" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
@@ -284,8 +284,8 @@
<g id="edge12_Node000007_Node000011" class="edge">
<title>Node7&#45;&gt;Node11</title>
<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M310.73,-233.62C334.47,-233.62 370.6,-233.62 398.03,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-237.13 407.68,-233.63 397.68,-230.13 397.68,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M310.73,-290.62C334.47,-290.62 370.6,-290.62 398.03,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-294.13 407.68,-290.63 397.68,-287.13 397.68,-294.13"/>
</a>
</g>
</g>
@@ -293,8 +293,8 @@
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
<polygon fill="white" stroke="#666666" points="599.75,-243.25 531.25,-243.25 531.25,-224 599.75,-224 599.75,-243.25"/>
<text text-anchor="middle" x="565.5" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
<polygon fill="white" stroke="#666666" points="599.75,-300.25 531.25,-300.25 531.25,-281 599.75,-281 599.75,-300.25"/>
<text text-anchor="middle" x="565.5" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
@@ -302,8 +302,8 @@
<g id="edge8_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M475.31,-298.16C482.13,-295.79 489.05,-292.96 495.25,-289.62 514.28,-279.39 533.17,-263.64 546.4,-251.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.64,-254.15 553.49,-244.73 543.83,-249.07 548.64,-254.15"/>
<path fill="none" stroke="#63b8ff" d="M475.31,-355.16C482.13,-352.79 489.05,-349.96 495.25,-346.62 514.28,-336.39 533.17,-320.64 546.4,-308.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.64,-311.15 553.49,-301.73 543.83,-306.07 548.64,-311.15"/>
</a>
</g>
</g>
@@ -311,8 +311,8 @@
<g id="edge9_Node000009_Node000009" class="edge">
<title>Node9&#45;&gt;Node9</title>
<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M545.44,-243.54C536.29,-252.15 542.98,-261.25 565.5,-261.25 577.82,-261.25 585.4,-258.53 588.24,-254.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="591.66,-253.91 585.91,-245.01 584.86,-255.55 591.66,-253.91"/>
<path fill="none" stroke="#63b8ff" d="M545.44,-300.54C536.29,-309.15 542.98,-318.25 565.5,-318.25 577.82,-318.25 585.4,-315.53 588.24,-311.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="591.66,-310.91 585.91,-302.01 584.86,-312.55 591.66,-310.91"/>
</a>
</g>
</g>
@@ -320,8 +320,8 @@
<g id="edge11_Node000010_Node000009" class="edge">
<title>Node10&#45;&gt;Node9</title>
<g id="a_edge11_Node000010_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M472.84,-260.51C487.39,-256.24 504.53,-251.22 520.02,-246.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.89,-250.07 529.5,-243.89 518.92,-243.35 520.89,-250.07"/>
<path fill="none" stroke="#63b8ff" d="M472.84,-317.51C487.39,-313.24 504.53,-308.22 520.02,-303.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="520.89,-307.07 529.5,-300.89 518.92,-300.35 520.89,-307.07"/>
</a>
</g>
</g>
@@ -329,8 +329,8 @@
<g id="edge13_Node000011_Node000009" class="edge">
<title>Node11&#45;&gt;Node9</title>
<g id="a_edge13_Node000011_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M465.74,-233.62C481.43,-233.62 501.52,-233.62 519.47,-233.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.38,-237.13 529.38,-233.63 519.38,-230.13 519.38,-237.13"/>
<path fill="none" stroke="#63b8ff" d="M465.74,-290.62C481.43,-290.62 501.52,-290.62 519.47,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.38,-294.13 529.38,-290.63 519.38,-287.13 519.38,-294.13"/>
</a>
</g>
</g>
@@ -338,8 +338,8 @@
<g id="edge15_Node000012_Node000009" class="edge">
<title>Node12&#45;&gt;Node9</title>
<g id="a_edge15_Node000012_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M322.95,-167.69C364.8,-179.07 434.93,-198.14 495.25,-214.62 503.27,-216.82 511.81,-219.16 520.06,-221.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="519.01,-224.76 529.58,-224.03 520.86,-218.01 519.01,-224.76"/>
<path fill="none" stroke="#63b8ff" d="M310.01,-206.55C350.65,-191.25 434.25,-167 495.25,-197.62 525.28,-212.7 545.59,-247.65 556.09,-270.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="552.85,-271.48 560.07,-279.23 559.25,-268.66 552.85,-271.48"/>
</a>
</g>
</g>
@@ -347,8 +347,8 @@
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
<polygon fill="white" stroke="#666666" points="472.75,-167.25 402,-167.25 402,-148 472.75,-148 472.75,-167.25"/>
<text text-anchor="middle" x="437.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
<polygon fill="white" stroke="#666666" points="472.75,-150.25 402,-150.25 402,-131 472.75,-131 472.75,-150.25"/>
<text text-anchor="middle" x="437.38" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
@@ -356,8 +356,8 @@
<g id="edge16_Node000012_Node000013" class="edge">
<title>Node12&#45;&gt;Node13</title>
<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M324.24,-157.62C344.38,-157.62 369.19,-157.62 390.35,-157.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="390.17,-161.13 400.17,-157.63 390.17,-154.13 390.17,-161.13"/>
<path fill="none" stroke="#63b8ff" d="M302.5,-206.68C321,-195.78 351.92,-178.06 379.5,-164.62 386.3,-161.31 393.67,-158.01 400.78,-154.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.66,-158.38 409.52,-151.27 398.95,-151.92 401.66,-158.38"/>
</a>
</g>
</g>
@@ -365,8 +365,8 @@
<g id="Node000014" class="node">
<title>Node14</title>
<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="464.5,-56.25 410.25,-56.25 410.25,-37 464.5,-37 464.5,-56.25"/>
<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="592.62,-84.25 538.38,-84.25 538.38,-65 592.62,-65 592.62,-84.25"/>
<text text-anchor="middle" x="565.5" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
@@ -374,8 +374,8 @@
<g id="edge18_Node000012_Node000014" class="edge">
<title>Node12&#45;&gt;Node14</title>
<g id="a_edge18_Node000012_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M293.22,-147.66C307.67,-128.75 341.67,-87.52 379.5,-64.62 385.55,-60.96 392.41,-57.98 399.23,-55.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.86,-59.04 408.34,-52.68 397.75,-52.36 399.86,-59.04"/>
<path fill="none" stroke="#63b8ff" d="M292.83,-206.54C306.86,-187.01 340.53,-143.98 379.5,-121.62 404.41,-107.34 480.38,-90.85 526.86,-81.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="527.36,-85.16 536.51,-79.82 526.03,-78.29 527.36,-85.16"/>
</a>
</g>
</g>
@@ -383,8 +383,8 @@
<g id="Node000015" class="node">
<title>Node15</title>
<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="463,-130.25 411.75,-130.25 411.75,-111 463,-111 463,-130.25"/>
<text text-anchor="middle" x="437.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
<polygon fill="white" stroke="#666666" points="463,-263.25 411.75,-263.25 411.75,-244 463,-244 463,-263.25"/>
<text text-anchor="middle" x="437.38" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
@@ -392,8 +392,8 @@
<g id="edge19_Node000012_Node000015" class="edge">
<title>Node12&#45;&gt;Node15</title>
<g id="a_edge19_Node000012_Node000015"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M324.24,-148.19C347.64,-142.44 377.35,-135.14 400.31,-129.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="400.96,-132.94 409.84,-127.15 399.29,-126.14 400.96,-132.94"/>
<path fill="none" stroke="#63b8ff" d="M324.24,-226.06C347.64,-231.81 377.35,-239.11 400.31,-244.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-248.11 409.84,-247.1 400.96,-241.31 399.29,-248.11"/>
</a>
</g>
</g>
@@ -401,8 +401,8 @@
<g id="Node000016" class="node">
<title>Node16</title>
<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="466.75,-93.25 408,-93.25 408,-74 466.75,-74 466.75,-93.25"/>
<text text-anchor="middle" x="437.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
<polygon fill="white" stroke="#666666" points="466.75,-226.25 408,-226.25 408,-207 466.75,-207 466.75,-226.25"/>
<text text-anchor="middle" x="437.38" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
@@ -410,8 +410,8 @@
<g id="edge20_Node000012_Node000016" class="edge">
<title>Node12&#45;&gt;Node16</title>
<g id="a_edge20_Node000012_Node000016"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M300.22,-147.6C318.11,-135.44 349.96,-114.91 379.5,-101.62 385.05,-99.13 391.05,-96.83 396.99,-94.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.68,-98.23 406.1,-91.8 395.51,-91.57 397.68,-98.23"/>
<path fill="none" stroke="#63b8ff" d="M324.24,-216.62C346.24,-216.62 373.83,-216.62 396.13,-216.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-220.13 406.07,-216.63 396.07,-213.13 396.07,-220.13"/>
</a>
</g>
</g>
@@ -419,8 +419,8 @@
<g id="edge17_Node000013_Node000009" class="edge">
<title>Node13&#45;&gt;Node9</title>
<g id="a_edge17_Node000013_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M465.93,-167.67C475.46,-171.55 486.05,-176.34 495.25,-181.62 512.87,-191.75 531.19,-205.69 544.56,-216.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="542.25,-219.21 552.18,-222.91 546.72,-213.83 542.25,-219.21"/>
<path fill="none" stroke="#63b8ff" d="M472.44,-150.66C480.54,-154.16 488.72,-158.74 495.25,-164.62 527.87,-194.04 548.36,-242.55 557.99,-270"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="554.59,-270.87 561.08,-279.24 561.23,-268.65 554.59,-270.87"/>
</a>
</g>
</g>
@@ -428,8 +428,8 @@
<g id="edge22_Node000017_Node000006" class="edge">
<title>Node17&#45;&gt;Node6</title>
<g id="a_edge22_Node000017_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-270.62C171.52,-270.62 206.01,-270.62 234.69,-270.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-274.13 244.65,-270.63 234.65,-267.13 234.65,-274.13"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-327.62C171.52,-327.62 206.01,-327.62 234.69,-327.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-331.13 244.65,-327.63 234.65,-324.13 234.65,-331.13"/>
</a>
</g>
</g>
@@ -437,8 +437,8 @@
<g id="edge23_Node000017_Node000007" class="edge">
<title>Node17&#45;&gt;Node7</title>
<g id="a_edge23_Node000017_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-266.16C174.77,-260.32 217.21,-249.93 247.73,-242.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-245.9 257.31,-240.12 246.76,-239.1 248.42,-245.9"/>
<path fill="none" stroke="#63b8ff" d="M150.87,-323.16C174.77,-317.32 217.21,-306.93 247.73,-299.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-302.9 257.31,-297.12 246.76,-296.1 248.42,-302.9"/>
</a>
</g>
</g>
@@ -446,8 +446,8 @@
<g id="edge24_Node000017_Node000012" class="edge">
<title>Node17&#45;&gt;Node12</title>
<g id="a_edge24_Node000017_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.77,-267.44C162.65,-264.78 178.15,-260.17 190.25,-252.62 209.99,-240.31 209.98,-231.25 226.25,-214.62 239.27,-201.32 254.22,-186.55 265.63,-175.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.78,-178.16 272.49,-168.67 262.89,-173.16 267.78,-178.16"/>
<path fill="none" stroke="#63b8ff" d="M150.77,-324.44C162.65,-321.78 178.15,-317.17 190.25,-309.62 209.99,-297.31 209.83,-288.11 226.25,-271.62 238.88,-258.95 253.47,-245.03 264.8,-234.37"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.09,-237.03 271.99,-227.64 262.3,-231.92 267.09,-237.03"/>
</a>
</g>
</g>
@@ -455,8 +455,8 @@
<g id="Node000019" class="node">
<title>Node19</title>
<g id="a_Node000019"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="325.5,-75.25 244.25,-75.25 244.25,-56 325.5,-56 325.5,-75.25"/>
<text text-anchor="middle" x="284.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
<polygon fill="white" stroke="#666666" points="325.5,-56.25 244.25,-56.25 244.25,-37 325.5,-37 325.5,-56.25"/>
<text text-anchor="middle" x="284.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
</a>
</g>
</g>
@@ -464,17 +464,17 @@
<g id="edge26_Node000018_Node000019" class="edge">
<title>Node18&#45;&gt;Node19</title>
<g id="a_edge26_Node000018_Node000019"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M148.81,-148.67C174.97,-132.59 226.74,-100.75 258.04,-81.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="259.83,-84.52 266.52,-76.3 256.16,-78.56 259.83,-84.52"/>
<path fill="none" stroke="#63b8ff" d="M147.13,-140.65C173.15,-122.76 228,-85.04 259.76,-63.21"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="261.69,-66.13 267.95,-57.58 257.72,-60.36 261.69,-66.13"/>
</a>
</g>
</g>
<!-- Node20 -->
<g id="Node000020" class="node">
<title>Node20</title>
<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="495.25,-19.25 379.5,-19.25 379.5,0 495.25,0 495.25,-19.25"/>
<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_Node000020"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="458.5,-56.25 416.25,-56.25 416.25,-37 458.5,-37 458.5,-56.25"/>
<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
</a>
</g>
</g>
@@ -482,203 +482,239 @@
<g id="edge27_Node000019_Node000020" class="edge">
<title>Node19&#45;&gt;Node20</title>
<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M309.15,-55.58C327.97,-47.6 355.24,-36.37 379.5,-27.62 383.66,-26.13 388.01,-24.63 392.37,-23.17"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.28,-26.55 401.71,-20.13 391.11,-19.9 393.28,-26.55"/>
<path fill="none" stroke="#63b8ff" d="M325.81,-46.62C350.47,-46.62 381.66,-46.62 404.63,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="404.61,-50.13 414.61,-46.63 404.61,-43.13 404.61,-50.13"/>
</a>
</g>
</g>
<!-- Node21&#45;&gt;Node4 -->
<g id="edge29_Node000021_Node000004" class="edge">
<title>Node21&#45;&gt;Node4</title>
<g id="a_edge29_Node000021_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-441.82C174.38,-439.48 215.85,-435.37 246.25,-432.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-435.84 256.2,-431.37 245.9,-428.87 246.59,-435.84"/>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="495.25,-19.25 379.5,-19.25 379.5,0 495.25,0 495.25,-19.25"/>
<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node22 -->
<g id="Node000022" class="node">
<title>Node22</title>
<g id="a_Node000022"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-498.5 226.25,-498.5 226.25,-456.75 343.5,-456.75 343.5,-498.5"/>
<text text-anchor="start" x="234.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-462.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
<!-- Node19&#45;&gt;Node21 -->
<g id="edge30_Node000019_Node000021" class="edge">
<title>Node19&#45;&gt;Node21</title>
<g id="a_edge30_Node000019_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M325.81,-36.81C343.72,-32.4 365.08,-27.15 384.23,-22.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="384.86,-25.89 393.73,-20.11 383.19,-19.1 384.86,-25.89"/>
</a>
</g>
</g>
<!-- Node21&#45;&gt;Node22 -->
<g id="edge30_Node000021_Node000022" class="edge">
<title>Node21&#45;&gt;Node22</title>
<g id="a_edge30_Node000021_Node000022"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-447.73C166.88,-451.32 191.2,-456.79 214.7,-462.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-465.45 224.28,-464.23 215.29,-458.62 213.76,-465.45"/>
<!-- Node20&#45;&gt;Node14 -->
<g id="edge29_Node000020_Node000014" class="edge">
<title>Node20&#45;&gt;Node14</title>
<g id="a_edge29_Node000020_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M458.92,-51.19C477.35,-55.28 504.84,-61.38 527.15,-66.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="526.27,-69.72 536.79,-68.47 527.79,-62.89 526.27,-69.72"/>
</a>
</g>
</g>
<!-- Node20&#45;&gt;Node20 -->
<g id="edge28_Node000020_Node000020" class="edge">
<title>Node20&#45;&gt;Node20</title>
<g id="a_edge28_Node000020_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M417.32,-56.54C408.17,-65.15 414.85,-74.25 437.38,-74.25 449.69,-74.25 457.27,-71.53 460.12,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="463.54,-66.91 457.79,-58.01 456.73,-68.55 463.54,-66.91"/>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node4 -->
<g id="edge32_Node000022_Node000004" class="edge">
<title>Node22&#45;&gt;Node4</title>
<g id="a_edge32_Node000022_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-498.82C174.38,-496.48 215.85,-492.37 246.25,-489.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-492.84 256.2,-488.37 245.9,-485.87 246.59,-492.84"/>
</a>
</g>
</g>
<!-- Node23 -->
<g id="Node000023" class="node">
<title>Node23</title>
<g id="a_Node000023"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="468.25,-428.25 406.5,-428.25 406.5,-409 468.25,-409 468.25,-428.25"/>
<text text-anchor="middle" x="437.38" y="-414.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
<g id="a_Node000023"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-555.5 226.25,-555.5 226.25,-513.75 343.5,-513.75 343.5,-555.5"/>
<text text-anchor="start" x="234.25" y="-542" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-530.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-519.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node23 -->
<g id="edge31_Node000022_Node000023" class="edge">
<g id="edge33_Node000022_Node000023" class="edge">
<title>Node22&#45;&gt;Node23</title>
<g id="a_edge31_Node000022_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M340.21,-456.32C360.15,-448.51 382.22,-439.85 400.18,-432.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.34,-436.12 409.37,-429.21 398.78,-429.6 401.34,-436.12"/>
<g id="a_edge33_Node000022_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-504.73C166.88,-508.32 191.2,-513.79 214.7,-519.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-522.45 224.28,-521.23 215.29,-515.62 213.76,-522.45"/>
</a>
</g>
</g>
<!-- Node24 -->
<g id="Node000024" class="node">
<title>Node24</title>
<g id="a_Node000024"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="470.88,-391.25 403.88,-391.25 403.88,-372 470.88,-372 470.88,-391.25"/>
<text text-anchor="middle" x="437.38" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
<g id="a_Node000024"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="468.25,-485.25 406.5,-485.25 406.5,-466 468.25,-466 468.25,-485.25"/>
<text text-anchor="middle" x="437.38" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node24 -->
<g id="edge32_Node000022_Node000024" class="edge">
<title>Node22&#45;&gt;Node24</title>
<g id="a_edge32_Node000022_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.49,-456.4C335.72,-453.69 339.8,-450.76 343.5,-447.62 363.83,-430.37 357.75,-415.05 379.5,-399.62 383.6,-396.72 388.2,-394.26 392.94,-392.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.9,-395.58 402.04,-388.8 391.45,-389.02 393.9,-395.58"/>
<!-- Node23&#45;&gt;Node24 -->
<g id="edge34_Node000023_Node000024" class="edge">
<title>Node23&#45;&gt;Node24</title>
<g id="a_edge34_Node000023_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M340.21,-513.32C360.15,-505.51 382.22,-496.85 400.18,-489.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="401.34,-493.12 409.37,-486.21 398.78,-486.6 401.34,-493.12"/>
</a>
</g>
</g>
<!-- Node25 -->
<g id="Node000025" class="node">
<title>Node25</title>
<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="467.12,-354.25 407.62,-354.25 407.62,-335 467.12,-335 467.12,-354.25"/>
<text text-anchor="middle" x="437.38" y="-340.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="470.88,-448.25 403.88,-448.25 403.88,-429 470.88,-429 470.88,-448.25"/>
<text text-anchor="middle" x="437.38" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
</a>
</g>
</g>
<!-- Node22&#45;&gt;Node25 -->
<g id="edge33_Node000022_Node000025" class="edge">
<title>Node22&#45;&gt;Node25</title>
<g id="a_edge33_Node000022_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M333.74,-456.26C337.28,-453.65 340.59,-450.77 343.5,-447.62 371.34,-417.49 349.16,-390.24 379.5,-362.62 384.41,-358.16 390.42,-354.8 396.68,-352.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.46,-355.71 405.85,-349.24 395.26,-349.06 397.46,-355.71"/>
<!-- Node23&#45;&gt;Node25 -->
<g id="edge35_Node000023_Node000025" class="edge">
<title>Node23&#45;&gt;Node25</title>
<g id="a_edge35_Node000023_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.49,-513.4C335.72,-510.69 339.8,-507.76 343.5,-504.62 363.83,-487.37 357.75,-472.05 379.5,-456.62 383.6,-453.72 388.2,-451.26 392.94,-449.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="393.9,-452.58 402.04,-445.8 391.45,-446.02 393.9,-452.58"/>
</a>
</g>
</g>
<!-- Node26&#45;&gt;Node4 -->
<g id="edge35_Node000026_Node000004" class="edge">
<title>Node26&#45;&gt;Node4</title>
<g id="a_edge35_Node000026_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.93,-374.87C162.33,-379.48 177.24,-385.67 190.25,-391.62 206.52,-399.07 209.71,-402.81 226.25,-409.62 232.9,-412.37 240.1,-415 247.08,-417.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-420.62 256.33,-420.43 247.93,-413.97 245.74,-420.62"/>
<!-- Node26 -->
<g id="Node000026" class="node">
<title>Node26</title>
<g id="a_Node000026"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="467.12,-411.25 407.62,-411.25 407.62,-392 467.12,-392 467.12,-411.25"/>
<text text-anchor="middle" x="437.38" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
</a>
</g>
</g>
<!-- Node27 -->
<g id="Node000027" class="node">
<title>Node27</title>
<g id="a_Node000027"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-400.5 226.25,-400.5 226.25,-358.75 343.5,-358.75 343.5,-400.5"/>
<text text-anchor="start" x="234.25" y="-387" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-375.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-364.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
<!-- Node23&#45;&gt;Node26 -->
<g id="edge36_Node000023_Node000026" class="edge">
<title>Node23&#45;&gt;Node26</title>
<g id="a_edge36_Node000023_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M333.74,-513.26C337.28,-510.65 340.59,-507.77 343.5,-504.62 371.34,-474.49 349.16,-447.24 379.5,-419.62 384.41,-415.16 390.42,-411.8 396.68,-409.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="397.46,-412.71 405.85,-406.24 395.26,-406.06 397.46,-412.71"/>
</a>
</g>
</g>
<!-- Node26&#45;&gt;Node27 -->
<g id="edge36_Node000026_Node000027" class="edge">
<title>Node26&#45;&gt;Node27</title>
<g id="a_edge36_Node000026_Node000027"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-369.07C166.8,-370.34 190.98,-372.26 214.38,-374.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-377.59 224.25,-374.89 214.56,-370.61 214.01,-377.59"/>
<!-- Node27&#45;&gt;Node4 -->
<g id="edge38_Node000027_Node000004" class="edge">
<title>Node27&#45;&gt;Node4</title>
<g id="a_edge38_Node000027_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.93,-431.87C162.33,-436.48 177.24,-442.67 190.25,-448.62 206.52,-456.07 209.71,-459.81 226.25,-466.62 232.9,-469.37 240.1,-472 247.08,-474.38"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-477.62 256.33,-477.43 247.93,-470.97 245.74,-477.62"/>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node23 -->
<g id="edge37_Node000027_Node000023" class="edge">
<title>Node27&#45;&gt;Node23</title>
<g id="a_edge37_Node000027_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-394.59C360.84,-399.05 379.34,-403.85 395.26,-407.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.31,-411.34 404.87,-410.46 396.07,-404.56 394.31,-411.34"/>
<!-- Node28 -->
<g id="Node000028" class="node">
<title>Node28</title>
<g id="a_Node000028"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
<polygon fill="white" stroke="#666666" points="343.5,-457.5 226.25,-457.5 226.25,-415.75 343.5,-415.75 343.5,-457.5"/>
<text text-anchor="start" x="234.25" y="-444" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-432.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-421.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node24 -->
<g id="edge38_Node000027_Node000024" class="edge">
<title>Node27&#45;&gt;Node24</title>
<g id="a_edge38_Node000027_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-380.39C359.88,-380.61 377.28,-380.84 392.57,-381.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="392.24,-384.54 402.29,-381.17 392.33,-377.54 392.24,-384.54"/>
<!-- Node27&#45;&gt;Node28 -->
<g id="edge39_Node000027_Node000028" class="edge">
<title>Node27&#45;&gt;Node28</title>
<g id="a_edge39_Node000027_Node000028"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-426.07C166.8,-427.34 190.98,-429.26 214.38,-431.11"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-434.59 224.25,-431.89 214.56,-427.61 214.01,-434.59"/>
</a>
</g>
</g>
<!-- Node27&#45;&gt;Node25 -->
<g id="edge39_Node000027_Node000025" class="edge">
<title>Node27&#45;&gt;Node25</title>
<g id="a_edge39_Node000027_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-366.19C361.11,-362.13 379.92,-357.75 396,-354.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.75,-357.43 405.69,-351.76 395.16,-350.62 396.75,-357.43"/>
<!-- Node28&#45;&gt;Node24 -->
<g id="edge40_Node000028_Node000024" class="edge">
<title>Node28&#45;&gt;Node24</title>
<g id="a_edge40_Node000028_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-451.59C360.84,-456.05 379.34,-460.85 395.26,-464.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.31,-468.34 404.87,-467.46 396.07,-461.56 394.31,-468.34"/>
</a>
</g>
</g>
<!-- Node28&#45;&gt;Node4 -->
<g id="edge41_Node000028_Node000004" class="edge">
<title>Node28&#45;&gt;Node4</title>
<g id="a_edge41_Node000028_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.84,-332.85C163.06,-335.11 178.91,-339.64 190.25,-348.62 214.92,-368.18 201.73,-389.88 226.25,-409.62 232.31,-414.51 239.68,-418.16 247.09,-420.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-424.14 256.39,-423.78 247.88,-417.46 245.8,-424.14"/>
<!-- Node28&#45;&gt;Node25 -->
<g id="edge41_Node000028_Node000025" class="edge">
<title>Node28&#45;&gt;Node25</title>
<g id="a_edge41_Node000028_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-437.39C359.88,-437.61 377.28,-437.84 392.57,-438.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="392.24,-441.54 402.29,-438.17 392.33,-434.54 392.24,-441.54"/>
</a>
</g>
</g>
<!-- Node29 -->
<g id="Node000029" class="node">
<title>Node29</title>
<g id="a_Node000029"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
<polygon fill="white" stroke="#666666" points="343.5,-340.5 226.25,-340.5 226.25,-298.75 343.5,-298.75 343.5,-340.5"/>
<text text-anchor="start" x="234.25" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-315.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-304.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
<!-- Node28&#45;&gt;Node26 -->
<g id="edge42_Node000028_Node000026" class="edge">
<title>Node28&#45;&gt;Node26</title>
<g id="a_edge42_Node000028_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-423.19C361.11,-419.13 379.92,-414.75 396,-411.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="396.75,-414.43 405.69,-408.76 395.16,-407.62 396.75,-414.43"/>
</a>
</g>
</g>
<!-- Node28&#45;&gt;Node29 -->
<g id="edge42_Node000028_Node000029" class="edge">
<title>Node28&#45;&gt;Node29</title>
<g id="a_edge42_Node000028_Node000029"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-329.3C166.8,-328.14 190.98,-326.38 214.38,-324.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-328.18 224.25,-323.96 214.02,-321.2 214.53,-328.18"/>
<!-- Node29&#45;&gt;Node4 -->
<g id="edge44_Node000029_Node000004" class="edge">
<title>Node29&#45;&gt;Node4</title>
<g id="a_edge44_Node000029_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.84,-389.85C163.06,-392.11 178.91,-396.64 190.25,-405.62 214.92,-425.18 201.73,-446.88 226.25,-466.62 232.31,-471.51 239.68,-475.16 247.09,-477.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-481.14 256.39,-480.78 247.88,-474.46 245.8,-481.14"/>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node23 -->
<g id="edge43_Node000029_Node000023" class="edge">
<title>Node29&#45;&gt;Node23</title>
<g id="a_edge43_Node000029_Node000023"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.88,-340.93C335.98,-343.61 339.93,-346.51 343.5,-349.62 364.39,-367.88 357.1,-384.25 379.5,-400.62 384.24,-404.09 389.67,-406.9 395.25,-409.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394,-412.45 404.59,-412.44 396.3,-405.84 394,-412.45"/>
<!-- Node30 -->
<g id="Node000030" class="node">
<title>Node30</title>
<g id="a_Node000030"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
<polygon fill="white" stroke="#666666" points="343.5,-397.5 226.25,-397.5 226.25,-355.75 343.5,-355.75 343.5,-397.5"/>
<text text-anchor="start" x="234.25" y="-384" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="start" x="234.25" y="-372.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<text text-anchor="middle" x="284.88" y="-361.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node24 -->
<g id="edge44_Node000029_Node000024" class="edge">
<title>Node29&#45;&gt;Node24</title>
<g id="a_edge44_Node000029_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.23,-340.99C344.11,-348.61 362.44,-356.95 379.5,-363.62 383.84,-365.32 388.41,-366.98 393,-368.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.6,-371.78 402.2,-371.6 393.8,-365.14 391.6,-371.78"/>
<!-- Node29&#45;&gt;Node30 -->
<g id="edge45_Node000029_Node000030" class="edge">
<title>Node29&#45;&gt;Node30</title>
<g id="a_edge45_Node000029_Node000030"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M150.87,-386.3C166.8,-385.14 190.98,-383.38 214.38,-381.68"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-385.18 224.25,-380.96 214.02,-378.2 214.53,-385.18"/>
</a>
</g>
</g>
<!-- Node29&#45;&gt;Node25 -->
<g id="edge45_Node000029_Node000025" class="edge">
<title>Node29&#45;&gt;Node25</title>
<g id="a_edge45_Node000029_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-329.22C361.11,-332.12 379.92,-335.25 396,-337.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.24,-341.34 405.67,-339.53 396.38,-334.43 395.24,-341.34"/>
<!-- Node30&#45;&gt;Node24 -->
<g id="edge46_Node000030_Node000024" class="edge">
<title>Node30&#45;&gt;Node24</title>
<g id="a_edge46_Node000030_Node000024"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M331.88,-397.93C335.98,-400.61 339.93,-403.51 343.5,-406.62 364.39,-424.88 357.1,-441.25 379.5,-457.62 384.24,-461.09 389.67,-463.9 395.25,-466.18"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394,-469.45 404.59,-469.44 396.3,-462.84 394,-469.45"/>
</a>
</g>
</g>
<!-- Node30&#45;&gt;Node25 -->
<g id="edge47_Node000030_Node000025" class="edge">
<title>Node30&#45;&gt;Node25</title>
<g id="a_edge47_Node000030_Node000025"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M328.23,-397.99C344.11,-405.61 362.44,-413.95 379.5,-420.62 383.84,-422.32 388.41,-423.98 393,-425.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.6,-428.78 402.2,-428.6 393.8,-422.14 391.6,-428.78"/>
</a>
</g>
</g>
<!-- Node30&#45;&gt;Node26 -->
<g id="edge48_Node000030_Node000026" class="edge">
<title>Node30&#45;&gt;Node26</title>
<g id="a_edge48_Node000030_Node000026"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M343.63,-386.22C361.11,-389.12 379.92,-392.25 396,-394.92"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="395.24,-398.34 405.67,-396.53 396.38,-391.43 395.24,-398.34"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 35 KiB

After

Width:  |  Height:  |  Size: 36 KiB

14
d8/d93/namespacemagic__sequence.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: magic_sequence Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d93/namespacemagic__sequence.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d93/namespacemagic__sequence.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d93/namespacemagic__sequence.html',
<div class="contents">
<p>Functions for the <a href="https://www.csplib.org/Problems/prob019/" target="_blank">Magic sequence</a> implementation.
<a href="../../d8/d93/namespacemagic__sequence.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the <a href="https://www.csplib.org/Problems/prob019/" target="_blank">Magic sequence</a> implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d93/namespacemagic__sequence.html',
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d93/namespacemagic__sequence.html">magic_sequence</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/d95/vector__ops_8hpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: machine_learning/vector_ops.hpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d95/vector__ops_8hpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -209,7 +211,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

22
d8/d95/vector__ops_8hpp_source.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: machine_learning/vector_ops.hpp Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,14 +55,14 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function() { init_codefold(1); });
$(function() { codefold.init(1); });
/* @license-end */
</script>
</div><!-- top -->
@@ -76,7 +78,7 @@ $(document).ready(function() { init_codefold(1); });
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -137,7 +139,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment"> */</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7"> 32</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out,</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7"> 32</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out,</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; <span class="keyword">const</span> &amp;A) {</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
@@ -159,7 +161,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment"> */</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35"> 52</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;T, T&gt;</a> &amp;A) {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35"> 52</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;T, T&gt;</a> &amp;A) {</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// printing pair in the form (p, q)</span></div>
@@ -176,7 +178,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment"> */</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269"> 67</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A) {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269"> 67</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A) {</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) { <span class="comment">// For every element in the vector.</span></div>
@@ -681,6 +683,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:307</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:460</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a84260cb1be9b63d6e38107000ac4b7e7"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">machine_learning::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:32</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:382</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:193</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:102</div></div>
@@ -694,7 +697,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacemachine__learning_html_ae6ec42318d172b97fbdf45638d09d7b5"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:365</div></div>
<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:136</div></div>
<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a7075a0fccad9b2d79be0275bfe8948d4"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:22</div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
@@ -712,7 +714,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

63
d8/d99/connected__components__with__dsu_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: graph/connected_components_with_dsu.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d99/connected__components__with__dsu_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d99/connected__components__with__dsu_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -127,22 +129,22 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae91ed94113c56191b75fe45f688d6e62" id="r_ae91ed94113c56191b75fe45f688d6e62"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62">graph::disjoint_union::make_set</a> ()</td></tr>
<tr class="memitem:ae91ed94113c56191b75fe45f688d6e62" id="r_ae91ed94113c56191b75fe45f688d6e62"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae91ed94113c56191b75fe45f688d6e62">graph::disjoint_union::make_set</a> ()</td></tr>
<tr class="memdesc:ae91ed94113c56191b75fe45f688d6e62"><td class="mdescLeft">&#160;</td><td class="mdescRight">function the initialize every node as it's own parent <br /></td></tr>
<tr class="separator:ae91ed94113c56191b75fe45f688d6e62"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a469384d8a4197a9b24482ce7c321a85e" id="r_a469384d8a4197a9b24482ce7c321a85e"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a> (int64_t val)</td></tr>
<tr class="memitem:a469384d8a4197a9b24482ce7c321a85e" id="r_a469384d8a4197a9b24482ce7c321a85e"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a> (int64_t val)</td></tr>
<tr class="memdesc:a469384d8a4197a9b24482ce7c321a85e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the component where following node belongs to. <br /></td></tr>
<tr class="separator:a469384d8a4197a9b24482ce7c321a85e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a67cb7472f310a798f555fe45cdf50145" id="r_a67cb7472f310a798f555fe45cdf50145"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145">graph::disjoint_union::union_sets</a> (int64_t node1, int64_t node2)</td></tr>
<tr class="memitem:a67cb7472f310a798f555fe45cdf50145" id="r_a67cb7472f310a798f555fe45cdf50145"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a67cb7472f310a798f555fe45cdf50145">graph::disjoint_union::union_sets</a> (int64_t node1, int64_t node2)</td></tr>
<tr class="memdesc:a67cb7472f310a798f555fe45cdf50145"><td class="mdescLeft">&#160;</td><td class="mdescRight">Merge 2 components to become one. <br /></td></tr>
<tr class="separator:a67cb7472f310a798f555fe45cdf50145"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2d6698b71384a352ec4b81b31b13141" id="r_ac2d6698b71384a352ec4b81b31b13141"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141">graph::disjoint_union::no_of_connected_components</a> ()</td></tr>
<tr class="memitem:ac2d6698b71384a352ec4b81b31b13141" id="r_ac2d6698b71384a352ec4b81b31b13141"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac2d6698b71384a352ec4b81b31b13141">graph::disjoint_union::no_of_connected_components</a> ()</td></tr>
<tr class="memdesc:ac2d6698b71384a352ec4b81b31b13141"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find total no. of connected components. <br /></td></tr>
<tr class="separator:ac2d6698b71384a352ec4b81b31b13141"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test Implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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="../../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -151,9 +153,9 @@ Variables</h2></td></tr>
<tr class="memitem:a7ab30d5b9594d90071a53c6d147158ef" id="r_a7ab30d5b9594d90071a53c6d147158ef"><td class="memItemLeft" align="right" valign="top"><a id="a7ab30d5b9594d90071a53c6d147158ef" name="a7ab30d5b9594d90071a53c6d147158ef"></a>
uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>graph::disjoint_union::number_of_nodes</b> = 0</td></tr>
<tr class="separator:a7ab30d5b9594d90071a53c6d147158ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa93bd9d3409fe4eeb7e5658eddd75fa8" id="r_aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa93bd9d3409fe4eeb7e5658eddd75fa8">graph::disjoint_union::parent</a> {}</td></tr>
<tr class="memitem:aa93bd9d3409fe4eeb7e5658eddd75fa8" id="r_aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa93bd9d3409fe4eeb7e5658eddd75fa8">graph::disjoint_union::parent</a> {}</td></tr>
<tr class="separator:aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af675d8149b6a82cb7fa07f39210b8a2b" id="r_af675d8149b6a82cb7fa07f39210b8a2b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html#af675d8149b6a82cb7fa07f39210b8a2b">graph::disjoint_union::connected_set_size</a> {}</td></tr>
<tr class="memitem:af675d8149b6a82cb7fa07f39210b8a2b" id="r_af675d8149b6a82cb7fa07f39210b8a2b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af675d8149b6a82cb7fa07f39210b8a2b">graph::disjoint_union::connected_set_size</a> {}</td></tr>
<tr class="separator:af675d8149b6a82cb7fa07f39210b8a2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -178,8 +180,7 @@ Algorithm</h3>
<tr>
<td class="memname">int64_t graph::disjoint_union::find_set </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>val</em></td><td>)</td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -217,8 +218,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -227,10 +227,10 @@ Here is the call graph for this function:</div>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 115</span>}</div>
<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Implementations.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:92</div></div>
<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Implementations.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:92</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -248,7 +248,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::disjoint_union::make_set </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -279,7 +279,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint32_t graph::disjoint_union::no_of_connected_components </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -289,10 +289,10 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>Number of connected components </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 80</span> {</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;int64_t&gt;</a> temp; <span class="comment">// temp set to count number of connected components</span></div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/insert.html">insert</a>(<a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(i));</div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/insert.html">insert</a>(<a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(i));</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">return</span> temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/size.html">size</a>(); <span class="comment">// return the size of temp set</span></div>
<div class="line"><span class="lineno"> 84</span>}</div>
<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a469384d8a4197a9b24482ce7c321a85e"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a></div><div class="ttdeci">int64_t find_set(int64_t val)</div><div class="ttdoc">Find the component where following node belongs to.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:49</div></div>
<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a469384d8a4197a9b24482ce7c321a85e"><div class="ttname"><a href="#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a></div><div class="ttdeci">int64_t find_set(int64_t val)</div><div class="ttdoc">Find the component where following node belongs to.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:49</div></div>
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/insert.html">std::set::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/size.html">std::set::size</a></div><div class="ttdeci">T size(T... args)</div></div>
@@ -316,7 +316,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -365,19 +365,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::disjoint_union::union_sets </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>node1</em>, </td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>node1</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>node2</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>node2</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -392,8 +385,8 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> node1 = <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node1); <span class="comment">// find the parent of node1</span></div>
<div class="line"><span class="lineno"> 64</span> node2 = <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node2); <span class="comment">// find the parent of node2</span></div>
<div class="line"><span class="lineno"> 63</span> node1 = <a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node1); <span class="comment">// find the parent of node1</span></div>
<div class="line"><span class="lineno"> 64</span> node2 = <a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node2); <span class="comment">// find the parent of node2</span></div>
<div class="line"><span class="lineno"> 65</span> </div>
<div class="line"><span class="lineno"> 66</span> <span class="comment">// If parents of both nodes are not same, combine them</span></div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">if</span> (node1 != node2) {</div>
@@ -451,7 +444,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html">connected_components_with_dsu.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

33
d8/d9a/fast__fourier__transform_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: numerical_methods/fast_fourier_transform.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d9a/fast__fourier__transform_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d9a/fast__fourier__transform_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -128,10 +130,10 @@ Functions</h2></td></tr>
<tr class="memitem:a158fd271b9a53e8f3f60b08b18857150" id="r_a158fd271b9a53e8f3f60b08b18857150"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *p, uint8_t n)</td></tr>
<tr class="memdesc:a158fd271b9a53e8f3f60b08b18857150"><td class="mdescLeft">&#160;</td><td class="mdescRight">FastFourierTransform is a recursive function which returns list of complex numbers. <br /></td></tr>
<tr class="separator:a158fd271b9a53e8f3f60b08b18857150"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abf9e6b7e6f15df4b525a2e7705ba3089" id="r_abf9e6b7e6f15df4b525a2e7705ba3089"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">main</a> (int argc, char const *argv[])</td></tr>
<tr class="memitem:abf9e6b7e6f15df4b525a2e7705ba3089" id="r_abf9e6b7e6f15df4b525a2e7705ba3089"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf9e6b7e6f15df4b525a2e7705ba3089">main</a> (int argc, char const *argv[])</td></tr>
<tr class="memdesc:abf9e6b7e6f15df4b525a2e7705ba3089"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:abf9e6b7e6f15df4b525a2e7705ba3089"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -148,19 +150,12 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char const *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">char const *</td> <td class="paramname"><span class="paramname"><em>argv</em>[]</span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -175,11 +170,11 @@ Functions</h2></td></tr>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 162</span> {</div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_function" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 163</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 164</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 166</span>}</div>
<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> fast_fourier_transform.cpp:104</div></div>
<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> fast_fourier_transform.cpp:104</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -200,7 +195,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -290,7 +285,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp.html">fast_fourier_transform.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

25
d8/d9c/union__of__two__arrays_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures/union_of_two_arrays.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d9c/union__of__two__arrays_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d9c/union__of__two__arrays_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -151,10 +153,10 @@ Functions</h2></td></tr>
<tr class="memitem:aacafde185abd8670abee51157f273dc2" id="r_aacafde185abd8670abee51157f273dc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a> ()</td></tr>
<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>. <br /></td></tr>
<tr class="separator:aacafde185abd8670abee51157f273dc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of get_union() function. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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="../../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">main function <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -172,8 +174,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -182,10 +183,10 @@ Functions</h2></td></tr>
<p>main function </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 217</span> {</div>
<div class="line"><span class="lineno"> 218</span> <a class="code hl_function" href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 218</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 219</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 220</span>}</div>
<div class="ttc" id="aunion__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_union() function.</div><div class="ttdef"><b>Definition</b> union_of_two_arrays.cpp:204</div></div>
<div class="ttc" id="aunion__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_union() function.</div><div class="ttdef"><b>Definition</b> union_of_two_arrays.cpp:204</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -206,7 +207,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -247,7 +248,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp.html">union_of_two_arrays.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/d9f/namespacesudoku__solver.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sudoku_solver Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/d9f/namespacesudoku__solver.html','../../'); initResizable(); });
$(function(){initNavTree('d8/d9f/namespacesudoku__solver.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/d9f/namespacesudoku__solver.html','
<div class="contents">
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation.
<a href="../../d8/d9f/namespacesudoku__solver.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/d9f/namespacesudoku__solver.html','
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/da7/namespacedepth__first__search.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: depth_first_search Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/da7/namespacedepth__first__search.html','../../'); initResizable(); });
$(function(){initNavTree('d8/da7/namespacedepth__first__search.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/da7/namespacedepth__first__search.h
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm.
<a href="../../d8/da7/namespacedepth__first__search.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/da7/namespacedepth__first__search.h
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

50
d8/dab/classstatistics_1_1stats__computer2.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: statistics::stats_computer2&lt; T &gt; Class Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dab/classstatistics_1_1stats__computer2.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dab/classstatistics_1_1stats__computer2.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -108,13 +110,13 @@ $(document).ready(function(){initNavTree('d8/dab/classstatistics_1_1stats__compu
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ade6de704deea24fdc88077b3d9a0d534" id="r_ade6de704deea24fdc88077b3d9a0d534"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a> (T x)</td></tr>
<tr class="memitem:ade6de704deea24fdc88077b3d9a0d534" id="r_ade6de704deea24fdc88077b3d9a0d534"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade6de704deea24fdc88077b3d9a0d534">new_val</a> (T x)</td></tr>
<tr class="separator:ade6de704deea24fdc88077b3d9a0d534"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8290966ad468f2a8c266d008bc60720e" id="r_a8290966ad468f2a8c266d008bc60720e"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a> () const</td></tr>
<tr class="memitem:a8290966ad468f2a8c266d008bc60720e" id="r_a8290966ad468f2a8c266d008bc60720e"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8290966ad468f2a8c266d008bc60720e">mean</a> () const</td></tr>
<tr class="separator:a8290966ad468f2a8c266d008bc60720e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af6198817084276113b3c064e87ce0555" id="r_af6198817084276113b3c064e87ce0555"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a> () const</td></tr>
<tr class="memitem:af6198817084276113b3c064e87ce0555" id="r_af6198817084276113b3c064e87ce0555"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6198817084276113b3c064e87ce0555">variance</a> () const</td></tr>
<tr class="separator:af6198817084276113b3c064e87ce0555"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acf2e84df4fc386bb3295016ef8fd156e" id="r_acf2e84df4fc386bb3295016ef8fd156e"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a> () const</td></tr>
<tr class="memitem:acf2e84df4fc386bb3295016ef8fd156e" id="r_acf2e84df4fc386bb3295016ef8fd156e"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf2e84df4fc386bb3295016ef8fd156e">std</a> () const</td></tr>
<tr class="separator:acf2e84df4fc386bb3295016ef8fd156e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
@@ -134,7 +136,7 @@ double&#160;</td><td class="memItemRight" valign="bottom"><b>M</b> = 0</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:ab444d485c9e7db35bdc2ff6b7775291a" id="r_ab444d485c9e7db35bdc2ff6b7775291a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a">operator&gt;&gt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;input, <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> &amp;stat)</td></tr>
<tr class="memitem:ab444d485c9e7db35bdc2ff6b7775291a" id="r_ab444d485c9e7db35bdc2ff6b7775291a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab444d485c9e7db35bdc2ff6b7775291a">operator&gt;&gt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;input, <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> &amp;stat)</td></tr>
<tr class="separator:ab444d485c9e7db35bdc2ff6b7775291a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -155,7 +157,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::mean </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -184,8 +186,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::new_val </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -225,7 +226,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::std </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -236,8 +237,8 @@ template&lt;typename T &gt; </div>
</table>
</div><div class="memdoc">
<p>return sample standard deviation computed till last sample </p>
<div class="fragment"><div class="line"><span class="lineno"> 92</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(this-&gt;<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()); }</div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:89</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 92</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(this-&gt;<a class="code hl_function" href="#af6198817084276113b3c064e87ce0555">variance</a>()); }</div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:89</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -261,7 +262,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::variance </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -291,19 +292,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp; operator&gt;&gt; </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;&#160;</td>
<td class="paramname"><em>input</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;</td> <td class="paramname"><span class="paramname"><em>input</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a>&lt; T &gt; &amp;&#160;</td>
<td class="paramname"><em>stat</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>stat</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -317,10 +311,10 @@ template&lt;typename T &gt; </div>
<div class="fragment"><div class="line"><span class="lineno"> 98</span> {</div>
<div class="line"><span class="lineno"> 99</span> T val;</div>
<div class="line"><span class="lineno"> 100</span> input &gt;&gt; val;</div>
<div class="line"><span class="lineno"> 101</span> stat.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
<div class="line"><span class="lineno"> 101</span> stat.<a class="code hl_function" href="#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">return</span> input;</div>
<div class="line"><span class="lineno"> 103</span> }</div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:77</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:77</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -333,7 +327,7 @@ template&lt;typename T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d2/dcf/namespacestatistics.html">statistics</a></li><li class="navelem"><a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

50
d8/db1/binomial__calculate_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/binomial_calculate.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/db1/binomial__calculate_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/db1/binomial__calculate_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -127,13 +129,13 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aae407a2a13362c4c64fbe509ff325978" id="r_aae407a2a13362c4c64fbe509ff325978"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a> (int32_t n, int32_t k)</td></tr>
<tr class="memitem:aae407a2a13362c4c64fbe509ff325978" id="r_aae407a2a13362c4c64fbe509ff325978"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a> (int32_t n, int32_t k)</td></tr>
<tr class="memdesc:aae407a2a13362c4c64fbe509ff325978"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate binomial coefficients. <br /></td></tr>
<tr class="separator:aae407a2a13362c4c64fbe509ff325978"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0f2228420376f4db7e1274f2b41667c" id="r_ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
<tr class="memitem:ac0f2228420376f4db7e1274f2b41667c" id="r_ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
<tr class="memdesc:ac0f2228420376f4db7e1274f2b41667c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ac0f2228420376f4db7e1274f2b41667c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -150,19 +152,12 @@ Functions</h2></td></tr>
<tr>
<td class="memname">size_t math::binomial::calculate </td>
<td>(</td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>n</em>, </td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>n</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>k</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>k</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -212,19 +207,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const char *</td> <td class="paramname"><span class="paramname"><em>argv</em>[]</span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -239,7 +227,7 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 79</span> {</div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_function" href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 81</span> </div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">if</span> (argc &lt; 3) {</div>
<div class="line"><span class="lineno"> 83</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Usage ./binomial_calculate {n} {k}&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
@@ -249,13 +237,13 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 87</span> int32_t n = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[1]);</div>
<div class="line"><span class="lineno"> 88</span> int32_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[2]);</div>
<div class="line"><span class="lineno"> 89</span> </div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a>(n, k) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a>(n, k) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 92</span>}</div>
<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="abinomial__calculate_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:56</div></div>
<div class="ttc" id="abinomial__calculate_8cpp_html_aae407a2a13362c4c64fbe509ff325978"><div class="ttname"><a href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a></div><div class="ttdeci">size_t calculate(int32_t n, int32_t k)</div><div class="ttdoc">Function to calculate binomial coefficients.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:32</div></div>
<div class="ttc" id="abinomial__calculate_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:56</div></div>
<div class="ttc" id="abinomial__calculate_8cpp_html_aae407a2a13362c4c64fbe509ff325978"><div class="ttname"><a href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a></div><div class="ttdeci">size_t calculate(int32_t n, int32_t k)</div><div class="ttdoc">Function to calculate binomial coefficients.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:32</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -277,7 +265,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -320,7 +308,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/db1/binomial__calculate_8cpp.html">binomial_calculate.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/db9/structcompare-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d1/db3/structcompare.html','../../'); initResizable(); });
$(function(){initNavTree('d1/db3/structcompare.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('d1/db3/structcompare.html','../../');
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html','../../'); initResizable(); });
$(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -114,7 +116,7 @@ $(document).ready(function(){initNavTree('d6/d04/classdata__structures_1_1queue_
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/dc6/namespacemanacher.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: manacher Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dc6/namespacemanacher.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dc6/namespacemanacher.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/dc6/namespacemanacher.html','../../
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> implementation.
<a href="../../d8/dc6/namespacemanacher.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/dc6/namespacemanacher.html','../../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dc6/namespacemanacher.html">manacher</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

12
d8/dc8/class_compare-members.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/d4a/class_compare.html','../../'); initResizable(); });
$(function(){initNavTree('de/d4a/class_compare.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -109,7 +111,7 @@ $(document).ready(function(){initNavTree('de/d4a/class_compare.html','../../');
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

33
d8/dc8/struct_point.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Point Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dc8/struct_point.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dc8/struct_point.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d8/dc8/struct_point.html','../../'); i
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ae2d6fb1b3fd3a96169d963d62e37130a" id="r_ae2d6fb1b3fd3a96169d963d62e37130a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a> (double a=0.f, double b=0.f)</td></tr>
<tr class="memitem:ae2d6fb1b3fd3a96169d963d62e37130a" id="r_ae2d6fb1b3fd3a96169d963d62e37130a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a> (double a=0.f, double b=0.f)</td></tr>
<tr class="separator:ae2d6fb1b3fd3a96169d963d62e37130a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
@@ -119,9 +121,9 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
<tr class="memdesc:a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/dc8/struct_point.html">Point</a> respect to x coordinate. <br /></td></tr>
<tr class="separator:a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab99c56589bc8ad5fa5071387110a5bc7" id="r_ab99c56589bc8ad5fa5071387110a5bc7"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a></td></tr>
<tr class="memitem:ab99c56589bc8ad5fa5071387110a5bc7" id="r_ab99c56589bc8ad5fa5071387110a5bc7"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab99c56589bc8ad5fa5071387110a5bc7">x</a></td></tr>
<tr class="separator:ab99c56589bc8ad5fa5071387110a5bc7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afa38be143ae800e6ad69ce8ed4df62d8" id="r_afa38be143ae800e6ad69ce8ed4df62d8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a></td></tr>
<tr class="memitem:afa38be143ae800e6ad69ce8ed4df62d8" id="r_afa38be143ae800e6ad69ce8ed4df62d8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afa38be143ae800e6ad69ce8ed4df62d8">y</a></td></tr>
<tr class="separator:afa38be143ae800e6ad69ce8ed4df62d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -140,19 +142,12 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
<tr>
<td class="memname">Point::Point </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>a</em> = <code>0.f</code>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>a</em><span class="paramdefsep"> = </span><span class="paramdefval">0.f</span>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>b</em> = <code>0.f</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>b</em><span class="paramdefsep"> = </span><span class="paramdefval">0.f</span></span>&#160;)</td>
</tr>
</table>
</td>
@@ -170,9 +165,9 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 23</span> {</div>
<div class="line"><span class="lineno"> 24</span> x = a;</div>
<div class="line"><span class="lineno"> 25</span> <a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = b;</div>
<div class="line"><span class="lineno"> 25</span> <a class="code hl_variable" href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = b;</div>
<div class="line"><span class="lineno"> 26</span> }</div>
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -217,7 +212,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dc8/struct_point.html">Point</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

25
d8/dcc/binary__insertion__sort_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: sorting/binary_insertion_sort.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dcc/binary__insertion__sort_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dcc/binary__insertion__sort_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -132,10 +134,10 @@ Functions</h2></td></tr>
<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
<tr class="memdesc:a5f4bc75cca6dd8294af2d0e328006c68"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion sort function to sort the vector. <br /></td></tr>
<tr class="separator:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><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="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -180,8 +182,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -190,10 +191,10 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 143</span> {</div>
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 144</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 146</span>}</div>
<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:104</div></div>
<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:104</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -214,7 +215,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -282,7 +283,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp.html">binary_insertion_sort.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

15
d8/dcc/namespacestd.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: std Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dcc/namespacestd.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dcc/namespacestd.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d8/dcc/namespacestd.html','../../'); i
<div class="contents">
<p>STL namespace.
<a href="../../d8/dcc/namespacestd.html#details">More...</a></p>
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
@@ -765,6 +767,7 @@ Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/packaged_task.html">packaged_task</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">pair</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">peta</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -2742,7 +2745,7 @@ T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_b
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

14
d8/dcd/namespacelru__cache.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: lru_cache Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dcd/namespacelru__cache.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dcd/namespacelru__cache.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d8/dcd/namespacelru__cache.html','../.
<div class="contents">
<p>Implementation of the <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU caching algorithm</a>
<a href="../../d8/dcd/namespacelru__cache.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of the <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU caching algorithm</a> </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d8/dcd/namespacelru__cache.html','../.
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d8/dcd/namespacelru__cache.html">lru_cache</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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

25
d8/dd5/check__factorial_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/check_factorial.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/dd5/check__factorial_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dd5/check__factorial_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -125,10 +127,10 @@ Functions</h2></td></tr>
<tr class="memitem:a6c72f756a7bf1b9043c357e3fe7814ca" id="r_a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a> (uint64_t n)</td></tr>
<tr class="memdesc:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if the given number is factorial of some number or not. <br /></td></tr>
<tr class="separator:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><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="../../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -148,8 +150,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -158,10 +159,10 @@ Functions</h2></td></tr>
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 73</span>}</div>
<div class="ttc" id="acheck__factorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_factorial.cpp:55</div></div>
<div class="ttc" id="acheck__factorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_factorial.cpp:55</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -182,7 +183,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -222,7 +223,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/dd5/check__factorial_8cpp.html">check_factorial.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

54
d8/ddf/sieve__of__eratosthenes_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/sieve_of_eratosthenes.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -116,13 +118,13 @@ Include dependency graph for sieve_of_eratosthenes.cpp:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a7eebd5e7686a8db363f937b2f30d3818" id="r_a7eebd5e7686a8db363f937b2f30d3818"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818">sieve</a> (uint32_t N)</td></tr>
<tr class="memitem:a7eebd5e7686a8db363f937b2f30d3818" id="r_a7eebd5e7686a8db363f937b2f30d3818"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7eebd5e7686a8db363f937b2f30d3818">sieve</a> (uint32_t N)</td></tr>
<tr class="separator:a7eebd5e7686a8db363f937b2f30d3818"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a235843bdf82d2a6cc8596ae8fd3b8df9" id="r_a235843bdf82d2a6cc8596ae8fd3b8df9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a> (uint32_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;is_prime)</td></tr>
<tr class="memitem:a235843bdf82d2a6cc8596ae8fd3b8df9" id="r_a235843bdf82d2a6cc8596ae8fd3b8df9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a> (uint32_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;is_prime)</td></tr>
<tr class="separator:a235843bdf82d2a6cc8596ae8fd3b8df9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9" id="r_a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
<tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9" id="r_a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
<tr class="separator:a88ec9ad42717780d6caaff9d3d6977f9"><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="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
@@ -141,30 +143,30 @@ Space Complexity : \(O(N)\)</p>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 67</span> </div>
<div class="line"><span class="lineno"> 68</span> uint32_t <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 100;</div>
<div class="line"><span class="lineno"> 69</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a> = <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818">sieve</a>(N);</div>
<div class="line"><span class="lineno"> 70</span> print(N, is_prime);</div>
<div class="line"><span class="lineno"> 69</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a> = <a class="code hl_function" href="#a7eebd5e7686a8db363f937b2f30d3818">sieve</a>(N);</div>
<div class="line"><span class="lineno"> 70</span> <a class="code hl_function" href="#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(N, is_prime);</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 72</span>}</div>
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:47</div></div>
<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> check_prime.cpp:31</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a7eebd5e7686a8db363f937b2f30d3818"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818">sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:26</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:56</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector&lt; bool &gt; &amp;is_prime)</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:44</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a7eebd5e7686a8db363f937b2f30d3818"><div class="ttname"><a href="#a7eebd5e7686a8db363f937b2f30d3818">sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:26</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:56</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="259" height="62"><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" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -178,19 +180,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void print </td>
<td>(</td>
<td class="paramtype">uint32_t&#160;</td>
<td class="paramname"><em>N</em>, </td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>N</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;&#160;</td>
<td class="paramname"><em>is_prime</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>is_prime</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -228,8 +223,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; sieve </td>
<td>(</td>
<td class="paramtype">uint32_t&#160;</td>
<td class="paramname"><em>N</em></td><td>)</td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>N</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -265,7 +259,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -274,7 +268,7 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
<div class="line"><span class="lineno"> 57</span> <span class="comment">// 0 1 2 3 4 5 6 7 8 9 10</span></div>
<div class="line"><span class="lineno"> 58</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> ans{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>};</div>
<div class="line"><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818">sieve</a>(10) == ans);</div>
<div class="line"><span class="lineno"> 59</span> assert(<a class="code hl_function" href="#a7eebd5e7686a8db363f937b2f30d3818">sieve</a>(10) == ans);</div>
<div class="line"><span class="lineno"> 60</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -290,7 +284,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

16
d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,8 +1,12 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
<area shape="rect" id="Node000002" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818" title=" " alt="" coords="201,5,253,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,186,16,186,21,55,21"/>
<area shape="rect" id="Node000003" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,31,153,56"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,185,26,186,31,154,40"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,55,82"/>
<area shape="rect" id="Node000002" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="105,5,151,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,54,90,35,92,39,56,59"/>
<area shape="rect" id="Node000004" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818" title=" " alt="" coords="211,81,263,107"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,69,196,87,195,92,55,74"/>
<area shape="rect" id="Node000005" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,107,153,132"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,79,90,97,88,102,54,84"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="151,16,185,16,185,21,151,21"/>
<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="153,111,195,101,196,106,154,116"/>
</map>

2
d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
3e0cf28727cc40dd4e6df63332c53b53
28d240a537f2ca23120d67028f21597e

86
d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="194pt" height="46pt"
viewBox="0.00 0.00 194.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="208pt" height="103pt"
viewBox="0.00 0.00 208.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
@@ -16,23 +16,23 @@
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="186,-38.25 146.75,-38.25 146.75,-19 186,-19 186,-38.25"/>
<text text-anchor="middle" x="166.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">sieve</text>
<g id="a_Node000002"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="109.25,-95.25 74.5,-95.25 74.5,-76 109.25,-76 109.25,-95.25"/>
<text text-anchor="middle" x="91.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
</a>
</g>
</g>
@@ -40,35 +40,71 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.39,-28.62C61.73,-28.62 105.62,-28.62 135.13,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.9,-32.13 144.9,-28.63 134.9,-25.13 134.9,-32.13"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-57.02C45.33,-61.38 55.24,-66.65 64.31,-71.48"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.61,-74.54 73.08,-76.15 65.9,-68.36 62.61,-74.54"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a7eebd5e7686a8db363f937b2f30d3818" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="193.12,-38.25 153.88,-38.25 153.88,-19 193.12,-19 193.12,-38.25"/>
<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">sieve</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-45.41C63.21,-42.2 111.42,-36.21 142.72,-32.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="142.82,-35.84 152.31,-31.13 141.95,-28.89 142.82,-35.84"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-38.23C44.89,-34.11 54.18,-29.16 62.84,-24.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.42,-27.67 71.6,-19.89 61.13,-21.5 64.42,-27.67"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="200.25,-95.25 146.75,-95.25 146.75,-76 200.25,-76 200.25,-95.25"/>
<text text-anchor="middle" x="173.5" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M109.37,-85.62C116.78,-85.62 125.86,-85.62 134.79,-85.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.79,-89.13 144.79,-85.63 134.79,-82.13 134.79,-89.13"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.17,-14.42C118.47,-16.33 127.07,-18.59 135.24,-20.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.3,-24.1 144.86,-23.25 136.08,-17.33 134.3,-24.1"/>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge5_Node000005_Node000004" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C120.24,-16.16 131.83,-18.92 142.43,-21.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="141.38,-24.8 151.92,-23.71 143.01,-17.99 141.38,-24.8"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 5.3 KiB

Some files were not shown because too many files have changed in this diff Show More