backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +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

14
d5/d02/namespacehorspool.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++: horspool 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('d5/d02/namespacehorspool.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d02/namespacehorspool.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d02/namespacehorspool.html','../../
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm.
<a href="../../d5/d02/namespacehorspool.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/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm" target="_blank">Horspool's</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d02/namespacehorspool.html','../../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d02/namespacehorspool.html">horspool</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
d5/d08/classgraph_1_1_graph__coll__graph.map
View File

@@ -1,9 +1,9 @@
<map id="graph::Graph&lt; T &gt;" name="graph::Graph&lt; T &gt;">
<area shape="rect" id="Node000001" title=" " alt="" coords="127,198,255,223"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="5,94,147,135"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,146,121,172,160,195,157,199,118,176,94,149"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="127,213,255,238"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="5,109,147,150"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,161,121,187,160,210,157,214,118,191,94,164"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="57,5,95,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="79,46,79,93,73,93,73,46"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,94,328,135"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="231,149,200,199,196,196,227,147"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="79,47,79,109,73,109,73,47"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,109,328,150"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="231,164,200,214,196,211,227,162"/>
</map>

2
d5/d08/classgraph_1_1_graph__coll__graph.md5
View File

@@ -1 +1 @@
6a35da6b23d3b6fce9e62b6bd08a16d9
f4a0af6848acb60282c3cba3543ed8cb

17
d5/d08/classgraph_1_1_graph__coll__graph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::Graph&lt; T &gt; Pages: 1 -->
<svg width="250pt" height="172pt"
viewBox="0.00 0.00 250.00 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="250pt" height="183pt"
viewBox="0.00 0.00 250.00 182.75" 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 167.5)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
<title>graph::Graph&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -51,8 +51,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67.4,-163.5 38.6,-163.5 38.6,-144.25 67.4,-144.25 67.4,-163.5"/>
<text text-anchor="middle" x="53" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
<polygon fill="white" stroke="#bfbfbf" points="67.4,-174.75 38.6,-174.75 38.6,-155.5 67.4,-155.5 67.4,-174.75"/>
<text text-anchor="middle" x="53" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -60,11 +60,12 @@
<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="M53,-132.67C53,-121.41 53,-107.64 53,-97.42"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-132.48 53,-142.48 56.5,-132.48 49.5,-132.48"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-143.86C53,-129.39 53,-110.27 53,-97.29"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-143.59 53,-153.59 56.5,-143.59 49.5,-143.59"/>
</a>
</g>
<text text-anchor="middle" x="65" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
<text text-anchor="middle" x="74.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="74.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">keys</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.7 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

17
d5/d08/classgraph_1_1_graph__coll__graph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::Graph&lt; T &gt; Pages: 1 -->
<svg width="250pt" height="172pt"
viewBox="0.00 0.00 250.00 171.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 167.5)">
<svg width="250pt" height="183pt"
viewBox="0.00 0.00 250.00 182.75" 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 178.75)">
<title>graph::Graph&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -41,8 +41,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67.4,-163.5 38.6,-163.5 38.6,-144.25 67.4,-144.25 67.4,-163.5"/>
<text text-anchor="middle" x="53" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
<polygon fill="white" stroke="#bfbfbf" points="67.4,-174.75 38.6,-174.75 38.6,-155.5 67.4,-155.5 67.4,-174.75"/>
<text text-anchor="middle" x="53" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -50,11 +50,12 @@
<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="M53,-132.67C53,-121.41 53,-107.64 53,-97.42"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-132.48 53,-142.48 56.5,-132.48 49.5,-132.48"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-143.86C53,-129.39 53,-110.27 53,-97.29"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-143.59 53,-153.59 56.5,-143.59 49.5,-143.59"/>
</a>
</g>
<text text-anchor="middle" x="65" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
<text text-anchor="middle" x="74.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="74.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">keys</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 4.0 KiB

16
d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.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++: data_structures::trie_using_hashmap::Trie::Node 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('d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d12/structdata__structures_1_1trie_
<div class="contents">
<p>struct representing a trie node.
<a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:</div>
<div class="dyncontent">
@@ -114,7 +116,7 @@ Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a08212cdc99164b59da91b81f45e2f88e" id="r_a08212cdc99164b59da91b81f45e2f88e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; char16_t, <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/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">children</a></td></tr>
<tr class="memitem:a08212cdc99164b59da91b81f45e2f88e" id="r_a08212cdc99164b59da91b81f45e2f88e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; char16_t, <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/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a08212cdc99164b59da91b81f45e2f88e">children</a></td></tr>
<tr class="separator:a08212cdc99164b59da91b81f45e2f88e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3cdb077745d3dc97212d693132371219" id="r_a3cdb077745d3dc97212d693132371219"><td class="memItemLeft" align="right" valign="top"><a id="a3cdb077745d3dc97212d693132371219" name="a3cdb077745d3dc97212d693132371219"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><b>word_end</b> = false</td></tr>
@@ -148,7 +150,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>word_end</b> = false<
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>trie_using_hashmap</b></li><li class="navelem"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a></li><li class="navelem"><a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</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>

52
d5/d15/classcll.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++: cll 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('d5/d15/classcll.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d15/classcll.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,19 +114,19 @@ Collaboration diagram for cll:</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:ae957a9434f6d1ffef7461ea4d7c9a8fe" id="r_ae957a9434f6d1ffef7461ea4d7c9a8fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#ae957a9434f6d1ffef7461ea4d7c9a8fe">display</a> ()</td></tr>
<tr class="memitem:ae957a9434f6d1ffef7461ea4d7c9a8fe" id="r_ae957a9434f6d1ffef7461ea4d7c9a8fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae957a9434f6d1ffef7461ea4d7c9a8fe">display</a> ()</td></tr>
<tr class="separator:ae957a9434f6d1ffef7461ea4d7c9a8fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9434bf2d7deca6d7fe1efe06c5341df0" id="r_a9434bf2d7deca6d7fe1efe06c5341df0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#a9434bf2d7deca6d7fe1efe06c5341df0">insert_front</a> (int new_data)</td></tr>
<tr class="memitem:a9434bf2d7deca6d7fe1efe06c5341df0" id="r_a9434bf2d7deca6d7fe1efe06c5341df0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9434bf2d7deca6d7fe1efe06c5341df0">insert_front</a> (int new_data)</td></tr>
<tr class="separator:a9434bf2d7deca6d7fe1efe06c5341df0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2eb66b7c9d059dcf75090248fa521262" id="r_a2eb66b7c9d059dcf75090248fa521262"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#a2eb66b7c9d059dcf75090248fa521262">insert_tail</a> (int new_data)</td></tr>
<tr class="memitem:a2eb66b7c9d059dcf75090248fa521262" id="r_a2eb66b7c9d059dcf75090248fa521262"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2eb66b7c9d059dcf75090248fa521262">insert_tail</a> (int new_data)</td></tr>
<tr class="separator:a2eb66b7c9d059dcf75090248fa521262"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a04b61bb736525f28b8042c6145e1a265" id="r_a04b61bb736525f28b8042c6145e1a265"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#a04b61bb736525f28b8042c6145e1a265">get_size</a> ()</td></tr>
<tr class="memitem:a04b61bb736525f28b8042c6145e1a265" id="r_a04b61bb736525f28b8042c6145e1a265"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04b61bb736525f28b8042c6145e1a265">get_size</a> ()</td></tr>
<tr class="separator:a04b61bb736525f28b8042c6145e1a265"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb6fb5834563d077a4eaff1b7fdc5b44" id="r_abb6fb5834563d077a4eaff1b7fdc5b44"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#abb6fb5834563d077a4eaff1b7fdc5b44">find_item</a> (int item_to_find)</td></tr>
<tr class="memitem:abb6fb5834563d077a4eaff1b7fdc5b44" id="r_abb6fb5834563d077a4eaff1b7fdc5b44"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb6fb5834563d077a4eaff1b7fdc5b44">find_item</a> (int item_to_find)</td></tr>
<tr class="separator:abb6fb5834563d077a4eaff1b7fdc5b44"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3665c1dd793c23873f4d8238b86c2021" id="r_a3665c1dd793c23873f4d8238b86c2021"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#a3665c1dd793c23873f4d8238b86c2021">operator*</a> ()</td></tr>
<tr class="memitem:a3665c1dd793c23873f4d8238b86c2021" id="r_a3665c1dd793c23873f4d8238b86c2021"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3665c1dd793c23873f4d8238b86c2021">operator*</a> ()</td></tr>
<tr class="separator:a3665c1dd793c23873f4d8238b86c2021"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b49e807e33b6f11b2ea151df61a9f2f" id="r_a1b49e807e33b6f11b2ea151df61a9f2f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d15/classcll.html#a1b49e807e33b6f11b2ea151df61a9f2f">operator++</a> ()</td></tr>
<tr class="memitem:a1b49e807e33b6f11b2ea151df61a9f2f" id="r_a1b49e807e33b6f11b2ea151df61a9f2f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b49e807e33b6f11b2ea151df61a9f2f">operator++</a> ()</td></tr>
<tr class="separator:a1b49e807e33b6f11b2ea151df61a9f2f"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
@@ -146,7 +148,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">cll::cll </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -167,7 +169,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">cll::~cll </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -187,7 +189,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">void cll::display </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -221,8 +223,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">bool cll::find_item </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>item_to_find</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>item_to_find</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -253,7 +254,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">int cll::get_size </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -271,15 +272,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">void cll::insert_front </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>new_data</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>new_data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 33</span> {</div>
<div class="line"><span class="lineno"> 34</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
<div class="line"><span class="lineno"> 35</span> newNode = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 35</span> newNode = <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"> 36</span> newNode-&gt;data = new_data;</div>
<div class="line"><span class="lineno"> 37</span> newNode-&gt;next = NULL;</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (head == NULL) {</div>
@@ -296,6 +296,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> total++;</div>
<div class="line"><span class="lineno"> 51</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>
@@ -308,15 +309,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">void cll::insert_tail </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>new_data</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>new_data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 54</span> {</div>
<div class="line"><span class="lineno"> 55</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
<div class="line"><span class="lineno"> 56</span> newNode = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 56</span> newNode = <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"> 57</span> newNode-&gt;data = new_data;</div>
<div class="line"><span class="lineno"> 58</span> newNode-&gt;next = NULL;</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">if</span> (head == NULL) {</div>
@@ -344,7 +344,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">int cll::operator* </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -362,7 +362,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<tr>
<td class="memname">void cll::operator++ </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -393,7 +393,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d15/classcll.html">cll</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
d5/d1e/next__higher__number__with__same__number__of__set__bits_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++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.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('d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -125,10 +127,10 @@ Functions</h2></td></tr>
<tr class="memitem:a4b76571a2a04fa99c30a96eca9997f0e" id="r_a4b76571a2a04fa99c30a96eca9997f0e"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a> (uint64_t x)</td></tr>
<tr class="memdesc:a4b76571a2a04fa99c30a96eca9997f0e"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements checking the next number. <br /></td></tr>
<tr class="separator:a4b76571a2a04fa99c30a96eca9997f0e"><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="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_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="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_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>
@@ -146,8 +148,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>
@@ -156,10 +157,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"> 97</span> {</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 98</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"> 99</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 100</span>}</div>
<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_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> next_higher_number_with_same_number_of_set_bits.cpp:73</div></div>
<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_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> next_higher_number_with_same_number_of_set_bits.cpp:73</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -180,7 +181,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>
@@ -230,7 +231,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_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html">next_higher_number_with_same_number_of_set_bits.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
d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.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::is_unsigned&lt; uint128_t &gt; 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('d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -119,7 +121,7 @@ Collaboration diagram for std::is_unsigned&lt; uint128_t &gt;:</div>
<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="navelem"><a class="el" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</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
d5/d29/struct_min_heap_node.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++: MinHeapNode 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('d5/d29/struct_min_heap_node.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d29/struct_min_heap_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,7 +114,7 @@ Collaboration diagram for MinHeapNode:</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:a41f73e87e4ddf1fbe72ae0db2b4e674e" id="r_a41f73e87e4ddf1fbe72ae0db2b4e674e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d29/struct_min_heap_node.html#a41f73e87e4ddf1fbe72ae0db2b4e674e">MinHeapNode</a> (char data, unsigned freq)</td></tr>
<tr class="memitem:a41f73e87e4ddf1fbe72ae0db2b4e674e" id="r_a41f73e87e4ddf1fbe72ae0db2b4e674e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a41f73e87e4ddf1fbe72ae0db2b4e674e">MinHeapNode</a> (char data, unsigned freq)</td></tr>
<tr class="separator:a41f73e87e4ddf1fbe72ae0db2b4e674e"><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>
@@ -143,19 +145,12 @@ unsigned&#160;</td><td class="memItemRight" valign="bottom"><b>freq</b></td></tr
<tr>
<td class="memname">MinHeapNode::MinHeapNode </td>
<td>(</td>
<td class="paramtype">char&#160;</td>
<td class="paramname"><em>data</em>, </td>
<td class="paramtype">char</td> <td class="paramname"><span class="paramname"><em>data</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned&#160;</td>
<td class="paramname"><em>freq</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">unsigned</td> <td class="paramname"><span class="paramname"><em>freq</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -181,7 +176,7 @@ unsigned&#160;</td><td class="memItemRight" valign="bottom"><b>freq</b></td></tr
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</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
d5/d2c/namespacelayers.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++: layers 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('d5/d2c/namespacelayers.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d2c/namespacelayers.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d2c/namespacelayers.html','../../')
<div class="contents">
<p>This namespace contains layers used in MLP.
<a href="../../d5/d2c/namespacelayers.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>This namespace contains layers used in MLP. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d2c/namespacelayers.html','../../')
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d2c/namespacelayers.html">layers</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>

112
d5/d33/gram__schmidt_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/gram_schmidt.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('d5/d33/gram__schmidt_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d33/gram__schmidt_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -128,17 +130,17 @@ 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:ac4a4504924ecc9f12a2ebd80788ec01d" id="r_ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
<tr class="memitem:ac4a4504924ecc9f12a2ebd80788ec01d" id="r_ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
<tr class="separator:ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8eeaafdde8b56f459aadc6013cf078bc" id="r_a8eeaafdde8b56f459aadc6013cf078bc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
<tr class="memitem:a8eeaafdde8b56f459aadc6013cf078bc" id="r_a8eeaafdde8b56f459aadc6013cf078bc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
<tr class="separator:a8eeaafdde8b56f459aadc6013cf078bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae6b496dce691e04f7f95ba0f0d33a289" id="r_ae6b496dce691e04f7f95ba0f0d33a289"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289">numerical_methods::gram_schmidt::display</a> (const int &amp;r, const int &amp;c, 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; double, 10 &gt;, 20 &gt; &amp;B)</td></tr>
<tr class="memitem:ae6b496dce691e04f7f95ba0f0d33a289" id="r_ae6b496dce691e04f7f95ba0f0d33a289"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6b496dce691e04f7f95ba0f0d33a289">numerical_methods::gram_schmidt::display</a> (const int &amp;r, const int &amp;c, 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; double, 10 &gt;, 20 &gt; &amp;B)</td></tr>
<tr class="separator:ae6b496dce691e04f7f95ba0f0d33a289"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0837468e1a653ed056e2cce3c914afa5" id="r_a0837468e1a653ed056e2cce3c914afa5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a> (int r, const int &amp;c, 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; double, 10 &gt;, 20 &gt; &amp;A, <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; double, 10 &gt;, 20 &gt; B)</td></tr>
<tr class="memitem:a0837468e1a653ed056e2cce3c914afa5" id="r_a0837468e1a653ed056e2cce3c914afa5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a> (int r, const int &amp;c, 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; double, 10 &gt;, 20 &gt; &amp;A, <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; double, 10 &gt;, 20 &gt; B)</td></tr>
<tr class="separator:a0837468e1a653ed056e2cce3c914afa5"><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="../../d5/d33/gram__schmidt_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="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="../../d5/d33/gram__schmidt_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>
@@ -161,25 +163,17 @@ Algorithm</h3>
<tr>
<td class="memname">void numerical_methods::gram_schmidt::display </td>
<td>(</td>
<td class="paramtype">const int &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">const int &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 int &amp;&#160;</td>
<td class="paramname"><em>c</em>, </td>
<td class="paramtype">const int &amp;</td> <td class="paramname"><span class="paramname"><em>c</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/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; double, 10 &gt;, 20 &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/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; double, 10 &gt;, 20 &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -215,25 +209,17 @@ Algorithm</h3>
<tr>
<td class="memname">double numerical_methods::gram_schmidt::dot_product </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &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/array.html">std::array</a>&lt; double, 10 &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">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;&#160;</td>
<td class="paramname"><em>y</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>y</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int &amp;&#160;</td>
<td class="paramname"><em>c</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const int &amp;</td> <td class="paramname"><span class="paramname"><em>c</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -271,31 +257,22 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void numerical_methods::gram_schmidt::gram_schmidt </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int &amp;&#160;</td>
<td class="paramname"><em>c</em>, </td>
<td class="paramtype">const int &amp;</td> <td class="paramname"><span class="paramname"><em>c</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/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; double, 10 &gt;, 20 &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/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; double, 10 &gt;, 20 &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/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; double, 10 &gt;, 20 &gt;&#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/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; double, 10 &gt;, 20 &gt;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -347,7 +324,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 149</span> temp{}; <span class="comment">/// to store previous projected array</span></div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordtype">double</span> factor = NAN; <span class="comment">/// to store the factor by which the</span><span class="comment"></span></div>
<div class="line"><span class="lineno"> 151</span><span class="comment"> /// previous array will change</span></div>
<div class="line"><span class="lineno"> 152</span><span class="comment"></span> factor = <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(A[k - 1], B[l - 1], c);</div>
<div class="line"><span class="lineno"> 152</span><span class="comment"></span> factor = <a class="code hl_function" href="#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(A[k - 1], B[l - 1], c);</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
<div class="line"><span class="lineno"> 154</span> temp[i] = B[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> - 1][i] * factor; <span class="comment">/// projected array created</span></div>
<div class="line"><span class="lineno"> 155</span> }</div>
@@ -373,7 +350,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a8eeaafdde8b56f459aadc6013cf078bc"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:79</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a8eeaafdde8b56f459aadc6013cf078bc"><div class="ttname"><a href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:79</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -391,8 +368,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>
@@ -408,7 +384,7 @@ Here is the call graph for this function:</div>
<p>take make the process numerically stable, upper bound for the dot product take 0.1</p>
<div class="fragment"><div class="line"><span class="lineno"> 248</span> {</div>
<div class="line"><span class="lineno"> 249</span> <span class="keywordtype">int</span> r = 0, c = 0;</div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// perform self tests</span></div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// perform self tests</span></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;Enter the dimension of your vectors\n&quot;</span>;</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_istream.html">std::cin</a> &gt;&gt; c;</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;Enter the number of vectors you will enter\n&quot;</span>;</div>
@@ -429,7 +405,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 268</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="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><span class="lineno"> 269</span> }</div>
<div class="line"><span class="lineno"> 270</span> </div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(r, c, A, B);</div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(r, c, A, B);</div>
<div class="line"><span class="lineno"> 272</span> </div>
<div class="line"><span class="lineno"> 273</span> <span class="keywordtype">double</span> dot = 0;</div>
<div class="line"><span class="lineno"> 274</span> <span class="keywordtype">int</span> flag = 1; <span class="comment">/// To check whether vectors are orthogonal or not</span></div>
@@ -451,8 +427,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 290</span>}</div>
<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="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a0837468e1a653ed056e2cce3c914afa5"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:121</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:181</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a0837468e1a653ed056e2cce3c914afa5"><div class="ttname"><a href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:121</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:181</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -470,25 +446,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">double numerical_methods::gram_schmidt::projection </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &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/array.html">std::array</a>&lt; double, 10 &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">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;&#160;</td>
<td class="paramname"><em>y</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>y</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int &amp;&#160;</td>
<td class="paramname"><em>c</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const int &amp;</td> <td class="paramname"><span class="paramname"><em>c</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -507,16 +475,16 @@ Here is the call graph for this function:</div>
<p>multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.</p>
<div class="fragment"><div class="line"><span class="lineno"> 80</span> {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">double</span> dot =</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(x, y, c); <span class="comment">/// The dot product of two vectors is taken</span></div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(x, y, c); <span class="comment">/// The dot product of two vectors is taken</span></div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordtype">double</span> anorm =</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(y, y, c); <span class="comment">/// The norm of the second vector is taken.</span></div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(y, y, c); <span class="comment">/// The norm of the second vector is taken.</span></div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordtype">double</span> factor =</div>
<div class="line"><span class="lineno"> 86</span> dot /</div>
<div class="line"><span class="lineno"> 87</span> anorm; <span class="comment">/// multiply that factor with every element in a 3rd vector,</span><span class="comment"></span></div>
<div class="line"><span class="lineno"> 88</span><span class="comment"> /// whose initial values are same as the 2nd vector.</span></div>
<div class="line"><span class="lineno"> 89</span><span class="comment"></span> <span class="keywordflow">return</span> factor;</div>
<div class="line"><span class="lineno"> 90</span>}</div>
<div class="ttc" id="agram__schmidt_8cpp_html_ac4a4504924ecc9f12a2ebd80788ec01d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:59</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_ac4a4504924ecc9f12a2ebd80788ec01d"><div class="ttname"><a href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:59</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -537,7 +505,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>
@@ -553,7 +521,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 183</span> {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};</div>
<div class="line"><span class="lineno"> 184</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b1 = {{0}};</div>
<div class="line"><span class="lineno"> 185</span> <span class="keywordtype">double</span> dot1 = 0;</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(3, 4, a1, b1);</div>
<div class="line"><span class="lineno"> 186</span> <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(3, 4, a1, b1);</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordtype">int</span> flag = 1;</div>
<div class="line"><span class="lineno"> 188</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i) {</div>
<div class="line"><span class="lineno"> 189</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 3; ++j) {</div>
@@ -573,7 +541,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div>
<div class="line"><span class="lineno"> 204</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b2 = {{0}};</div>
<div class="line"><span class="lineno"> 205</span> <span class="keywordtype">double</span> dot2 = 0;</div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 2, a2, b2);</div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 2, a2, b2);</div>
<div class="line"><span class="lineno"> 207</span> flag = 1;</div>
<div class="line"><span class="lineno"> 208</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
@@ -593,7 +561,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 223</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div>
<div class="line"><span class="lineno"> 224</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b3 = {{0}};</div>
<div class="line"><span class="lineno"> 225</span> <span class="keywordtype">double</span> dot3 = 0;</div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 3, a3, b3);</div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 3, a3, b3);</div>
<div class="line"><span class="lineno"> 227</span> flag = 1;</div>
<div class="line"><span class="lineno"> 228</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
<div class="line"><span class="lineno"> 229</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
@@ -619,7 +587,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="../../d5/d33/gram__schmidt_8cpp.html">gram_schmidt.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
d5/d39/namespaceactivations.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++: activations 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('d5/d39/namespaceactivations.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d39/namespaceactivations.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d39/namespaceactivations.html','../
<div class="contents">
<p>Various activation functions used in Neural network.
<a href="../../d5/d39/namespaceactivations.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>Various activation functions used in Neural network. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d39/namespaceactivations.html','../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d39/namespaceactivations.html">activations</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>

34
d5/d3c/namespacedata__structures.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++: data_structures 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('d5/d3c/namespacedata__structures.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d3c/namespacedata__structures.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/d3c/namespacedata__structures.html'
<div class="contents">
<p>for IO operations
<a href="../../d5/d3c/namespacedata__structures.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>
@@ -129,16 +131,16 @@ 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:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">hashDJB2</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
<tr class="memitem:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a271c753baf6dc5ac6f19fa03c5873eb4">hashDJB2</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
<tr class="memdesc:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">Function djb2</a> to get hash for the given string. <br /></td></tr>
<tr class="separator:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">hashStr</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35eb2bc3edbb52f9c5f0b1e51046ef15">hashStr</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
<tr class="memdesc:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/8317508/hash-function-for-a-string" target="_blank">Hash function</a>, to get hash for the given string. <br /></td></tr>
<tr class="separator:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">hashInt_1</a> (int x)</td></tr>
<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6deb9d4a0f63ea97aef3dce4c6c6677">hashInt_1</a> (int x)</td></tr>
<tr class="memdesc:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a> <br /></td></tr>
<tr class="separator:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">hashInt_2</a> (int x)</td></tr>
<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ed236419034917c5270c1dccd220b5c">hashInt_2</a> (int x)</td></tr>
<tr class="memdesc:a9ed236419034917c5270c1dccd220b5c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a> <br /></td></tr>
<tr class="separator:a9ed236419034917c5270c1dccd220b5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -193,8 +195,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<tr>
<td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashDJB2 </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;&#160;</td>
<td class="paramname"><em>s</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;</td> <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -233,8 +234,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashInt_1 </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -266,8 +266,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashInt_2 </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -303,8 +302,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<tr>
<td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashStr </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;&#160;</td>
<td class="paramname"><em>s</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;</td> <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -341,7 +339,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</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>

79
d5/d45/sublist__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/sublist_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('d5/d45/sublist__search_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d45/sublist__search_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -136,19 +138,19 @@ 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:ad1028bc215281d62e344af99da57fab2" id="r_ad1028bc215281d62e344af99da57fab2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *start)</td></tr>
<tr class="memitem:ad1028bc215281d62e344af99da57fab2" id="r_ad1028bc215281d62e344af99da57fab2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *start)</td></tr>
<tr class="memdesc:ad1028bc215281d62e344af99da57fab2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple function to print the linked list. <br /></td></tr>
<tr class="separator:ad1028bc215281d62e344af99da57fab2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a70ca8d0267008e09cfa50b4e2ddfbe53" id="r_a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</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;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memitem:a70ca8d0267008e09cfa50b4e2ddfbe53" id="r_a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</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;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="mdescLeft">&#160;</td><td class="mdescRight">Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer. <br /></td></tr>
<tr class="separator:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4faee403e2758aaab682ed6622ae218c" id="r_a4faee403e2758aaab682ed6622ae218c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *sublist, <a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *mainList)</td></tr>
<tr class="memitem:a4faee403e2758aaab682ed6622ae218c" id="r_a4faee403e2758aaab682ed6622ae218c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *sublist, <a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *mainList)</td></tr>
<tr class="memdesc:a4faee403e2758aaab682ed6622ae218c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main searching function. <br /></td></tr>
<tr class="separator:a4faee403e2758aaab682ed6622ae218c"><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="../../d5/d45/sublist__search_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:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -178,19 +180,12 @@ Working</h3>
<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 *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">char *</td> <td class="paramname"><span class="paramname"><em>argv</em>[]</span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -209,28 +204,28 @@ Working</h3>
<p>&lt; Main list in which sublist is to be searched</p>
<p>&lt; boolean to check if the sublist exists or not</p>
<div class="fragment"><div class="line"><span class="lineno"> 339</span> {</div>
<div class="line"><span class="lineno"> 340</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 340</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"> 341</span> </div>
<div class="line"><span class="lineno"> 342</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> mainlistData = {</div>
<div class="line"><span class="lineno"> 343</span> 2, 5, 6, 7, 8}; <span class="comment">///&lt; Main list in which sublist is to be searched</span></div>
<div class="line"><span class="lineno"> 344</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> sublistData = {6, 8}; <span class="comment">///&lt; Sublist to be searched</span></div>
<div class="line"><span class="lineno"> 345</span> </div>
<div class="line"><span class="lineno"> 346</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
<div class="line"><span class="lineno"> 347</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(mainlistData);</div>
<div class="line"><span class="lineno"> 347</span> <a class="code hl_function" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(mainlistData);</div>
<div class="line"><span class="lineno"> 348</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
<div class="line"><span class="lineno"> 349</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
<div class="line"><span class="lineno"> 349</span> <a class="code hl_function" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
<div class="line"><span class="lineno"> 350</span> sublistData); <span class="comment">///&lt; Main list in which sublist is to be</span><span class="comment"></span></div>
<div class="line"><span class="lineno"> 351</span><span class="comment"> ///&lt; searched</span></div>
<div class="line"><span class="lineno"> 352</span><span class="comment"></span> </div>
<div class="line"><span class="lineno"> 353</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
<div class="line"><span class="lineno"> 353</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
<div class="line"><span class="lineno"> 354</span> sublistLL,</div>
<div class="line"><span class="lineno"> 355</span> mainlistLL); <span class="comment">///&lt; boolean to check if the sublist exists or not</span></div>
<div class="line"><span class="lineno"> 356</span> </div>
<div class="line"><span class="lineno"> 357</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;Sublist: &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"> 358</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(sublistLL);</div>
<div class="line"><span class="lineno"> 358</span> <a class="code hl_function" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(sublistLL);</div>
<div class="line"><span class="lineno"> 359</span> </div>
<div class="line"><span class="lineno"> 360</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;Main list: &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"> 361</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(mainlistLL);</div>
<div class="line"><span class="lineno"> 361</span> <a class="code hl_function" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(mainlistLL);</div>
<div class="line"><span class="lineno"> 362</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>
<div class="line"><span class="lineno"> 363</span> </div>
<div class="line"><span class="lineno"> 364</span> <span class="keywordflow">if</span> (exists) {</div>
@@ -243,10 +238,10 @@ Working</h3>
<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="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:47</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:100</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:73</div></div>
<div class="ttc" id="asublist__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d45/sublist__search_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> sublist_search.cpp:328</div></div>
<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:57</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:100</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:73</div></div>
<div class="ttc" id="asublist__search_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> sublist_search.cpp:328</div></div>
<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:57</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 class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> word_break.cpp:60</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -266,8 +261,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a> * search::sublist_search::makeLinkedList </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>data</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>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -292,15 +286,16 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = i;</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">if</span> (head == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 83</span> head = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 84</span> tail = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 83</span> head = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 84</span> tail = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 85</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 86</span> tail-&gt;next = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><span class="lineno"> 86</span> tail-&gt;next = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 87</span> tail = tail-&gt;next;</div>
<div class="line"><span class="lineno"> 88</span> }</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> head;</div>
<div class="line"><span class="lineno"> 91</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 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 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>
@@ -321,8 +316,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void search::sublist_search::printLinkedList </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>start</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>start</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -360,19 +354,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool search::sublist_search::sublistSearch </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>sublist</em>, </td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>sublist</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>mainList</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>mainList</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -461,7 +448,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>
@@ -494,7 +481,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_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_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
d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-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/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html','../../'); initResizable(); });
$(function(){initNavTree('d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('d3/d26/classdata__structures_1_1trie__
<!-- 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>

125
d5/d4c/group__sorting.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 Algorithm</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('d5/d4c/group__sorting.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d4c/group__sorting.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -123,24 +125,24 @@ Namespaces</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:gabd9a93f241c5c86f2ec0abf8b66b4145" id="r_gabd9a93f241c5c86f2ec0abf8b66b4145"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:gabd9a93f241c5c86f2ec0abf8b66b4145"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gabd9a93f241c5c86f2ec0abf8b66b4145">heapify</a> (T *arr, int n, int i)</td></tr>
<tr class="memitem:gabd9a93f241c5c86f2ec0abf8b66b4145"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#gabd9a93f241c5c86f2ec0abf8b66b4145">heapify</a> (T *arr, int n, int i)</td></tr>
<tr class="separator:gabd9a93f241c5c86f2ec0abf8b66b4145"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga29d28b140174dbdde7c9f5157758435f" id="r_ga29d28b140174dbdde7c9f5157758435f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ga29d28b140174dbdde7c9f5157758435f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a> (T *arr, int n)</td></tr>
<tr class="memitem:ga29d28b140174dbdde7c9f5157758435f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ga29d28b140174dbdde7c9f5157758435f">heapSort</a> (T *arr, int n)</td></tr>
<tr class="separator:ga29d28b140174dbdde7c9f5157758435f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga460c61cd948203b4816bef2accb3fc73" id="r_ga460c61cd948203b4816bef2accb3fc73"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a> (int *arr, int l, int m, int r)</td></tr>
<tr class="memitem:ga460c61cd948203b4816bef2accb3fc73" id="r_ga460c61cd948203b4816bef2accb3fc73"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga460c61cd948203b4816bef2accb3fc73">merge</a> (int *arr, int l, int m, int r)</td></tr>
<tr class="separator:ga460c61cd948203b4816bef2accb3fc73"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gab6b14fea48d9841e29b9fc26be6e05d7" id="r_gab6b14fea48d9841e29b9fc26be6e05d7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a> (int *arr, int l, int r)</td></tr>
<tr class="memitem:gab6b14fea48d9841e29b9fc26be6e05d7" id="r_gab6b14fea48d9841e29b9fc26be6e05d7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a> (int *arr, int l, int r)</td></tr>
<tr class="separator:gab6b14fea48d9841e29b9fc26be6e05d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga0a9a57a1f1bbba3d4822531d002b7e07" id="r_ga0a9a57a1f1bbba3d4822531d002b7e07"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07">show</a> (int *arr, int size)</td></tr>
<tr class="memitem:ga0a9a57a1f1bbba3d4822531d002b7e07" id="r_ga0a9a57a1f1bbba3d4822531d002b7e07"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga0a9a57a1f1bbba3d4822531d002b7e07">show</a> (int *arr, int size)</td></tr>
<tr class="separator:ga0a9a57a1f1bbba3d4822531d002b7e07"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gae66f6b31b5ad750f1fe042a706a4e3d4" id="r_gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:gae66f6b31b5ad750f1fe042a706a4e3d4" id="r_gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72" id="r_ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const <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="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const <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:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm. <br /></td></tr>
<tr class="separator:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:gaa8dca7b867074164d5f45b0f3851269d" id="r_gaa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memitem:gaa8dca7b867074164d5f45b0f3851269d" id="r_gaa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gaa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="separator:gaa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -149,7 +151,7 @@ Functions</h2></td></tr>
<table class="params">
<tr><td class="paramname">arr</td><td>array to be sorted </td></tr>
<tr><td class="paramname">n</td><td>size of array </td></tr>
<tr><td class="paramname">i</td><td>node position in Binary Tress or element position in Array to be compared with it's childern </td></tr>
<tr><td class="paramname">i</td><td>node position in Binary Tress or element position in Array to be compared with it's childern</td></tr>
</table>
</dd>
</dl>
@@ -168,8 +170,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">static void displayElements </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; T &gt; &amp;&#160;</td>
<td class="paramname"><em>arr</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; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -227,25 +228,17 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void heapify </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>i</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>i</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -280,19 +273,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void heapSort </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</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">
@@ -329,8 +315,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>
@@ -346,14 +331,14 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
<div class="line"><span class="lineno"> 98</span> }</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
<div class="line"><span class="lineno"> 100</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;Sorted array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 101</span> show(arr, size);</div>
<div class="line"><span class="lineno"> 102</span> <span class="keyword">delete</span>[] arr;</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 104</span>}</div>
<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="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -371,35 +356,26 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void merge </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></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>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">
<p>The <a class="el" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge()</a> function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.</p>
<p>The <a class="el" href="#ga460c61cd948203b4816bef2accb3fc73">merge()</a> function is used for merging two halves. The merge(arr, l, m, r) is key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>- array with two halves arr[l...m] and arr[m+1...r] </td></tr>
@@ -455,29 +431,21 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void mergeSort </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>l</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">
<p>Merge sort is a divide and conquer algorithm, it divides the input array into two halves and calls itself for the two halves and then calls <a class="el" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge()</a> to merge the two halves</p>
<p>Merge sort is a divide and conquer algorithm, it divides the input array into two halves and calls itself for the two halves and then calls <a class="el" href="#ga460c61cd948203b4816bef2accb3fc73">merge()</a> to merge the two halves</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>- array to be sorted </td></tr>
@@ -489,12 +457,12 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (l &lt; r) {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">int</span> m = l + (r - l) / 2;</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, l, m);</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, m + 1, r);</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, l, m);</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, m + 1, r);</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span>}</div>
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -512,19 +480,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void show </td>
<td>(</td>
<td class="paramtype">int *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>size</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>size</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -548,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>
@@ -569,7 +530,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 113</span> </div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
<div class="line"><span class="lineno"> 115</span> </div>
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
<div class="line"><span class="lineno"> 116</span> <a class="code hl_function" href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
<div class="line"><span class="lineno"> 117</span> </div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">for</span> (uint32_t j = 0; j &lt; data1.size(); j += 2) {</div>
<div class="line"><span class="lineno"> 119</span> assert(data1[j] &lt;= data1[j + 1] &amp;&amp;</div>
@@ -578,7 +539,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 122</span> </div>
<div class="line"><span class="lineno"> 123</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;Test 1 passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 124</span>}</div>
<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> wiggle_sort.cpp:85</div></div>
<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> wiggle_sort.cpp:85</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
@@ -596,7 +557,7 @@ Here is the call graph for this function:</div>
<!-- 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
d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-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/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html','../../'); initResizable(); });
$(function(){initNavTree('d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d6/d45/structciphers_1_1elliptic__curv
<!-- 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
d5/d55/classgraph_1_1_rooted_tree-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('d0/d58/classgraph_1_1_rooted_tree.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -120,7 +122,7 @@ $(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.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>

263
d5/d58/class_test_cases.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++: TestCases 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('d5/d58/class_test_cases.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d58/class_test_cases.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,59 +108,59 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
<div class="contents">
<p>class encapsulating the necessary test cases
<a href="../../d5/d58/class_test_cases.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="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, printing inorder successor of last node. <br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 100 elements and sublist of 20. <br /></td></tr>
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 50 elements and sublist of 20. <br /></td></tr>
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, Only contains one element. <br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 100 elements and sublist of 20. <br /></td></tr>
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 50 elements and sublist of 20. <br /></td></tr>
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23" id="r_aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008" id="r_ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case with single input. <br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3" id="r_abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case with input array of length 500. <br /></td></tr>
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5" id="r_ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case with array of length 1000. <br /></td></tr>
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><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:aa3aa3d5bf666f327ee8e2d11d397b06e" id="r_aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print given message on console. <br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e" id="r_aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print given message on console. <br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e" id="r_aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print64_t given message on console. <br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -180,8 +182,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void TestCases::log </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>msg</em></td><td>)</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>msg</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -228,8 +229,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void TestCases::log </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>msg</em></td><td>)</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>msg</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -274,8 +274,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void TestCases::log </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>msg</em></td><td>)</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>msg</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -318,7 +317,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::runTests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -332,19 +331,19 @@ Here is the call graph for this function:</div>
<p>Executes test cases. </p>
<dl class="section return"><dt>Returns</dt><dd>void </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_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 244</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 245</span> </div>
<div class="line"><span class="lineno"> 246</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 246</span> <a class="code hl_function" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 249</span> </div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</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; <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> }</div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:233</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:304</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:259</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:345</div></div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:233</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:304</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:259</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:345</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -365,7 +364,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::runTests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -379,13 +378,13 @@ Here is the call graph for this function:</div>
<p>Executes test cases. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 171</span> {</div>
<div class="line"><span class="lineno"> 172</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 172</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 173</span> </div>
<div class="line"><span class="lineno"> 174</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 175</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 174</span> <a class="code hl_function" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 175</span> <a class="code hl_function" href="#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 176</span> <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 177</span> </div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><span class="lineno"> 178</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><span class="lineno"> 179</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>
<div class="line"><span class="lineno"> 180</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -408,7 +407,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::runTests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -422,13 +421,13 @@ Here is the call graph for this function:</div>
<p>Executes test cases. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 199</span> {</div>
<div class="line"><span class="lineno"> 200</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 200</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><span class="lineno"> 201</span> </div>
<div class="line"><span class="lineno"> 202</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 202</span> <a class="code hl_function" href="#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><span class="lineno"> 205</span> </div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><span class="lineno"> 206</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><span class="lineno"> 207</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>
<div class="line"><span class="lineno"> 208</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -451,7 +450,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -474,10 +473,10 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 260</span> <span class="keyword">const</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><span class="lineno"> 261</span> *expectedOutput = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><span class="lineno"> 262</span> </div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 264</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Printing inorder successor for last node in the &quot;</span></div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 264</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Printing inorder successor for last node in the &quot;</span></div>
<div class="line"><span class="lineno"> 267</span> <span class="stringliteral">&quot;BST, Output will be nullptr.&quot;</span>);</div>
<div class="line"><span class="lineno"> 268</span> </div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
@@ -499,15 +498,15 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 285</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><span class="lineno"> 286</span> root, 78); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><span class="lineno"> 287</span> </div>
<div class="line"><span class="lineno"> 288</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 288</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 289</span> assert(inorderSuccessor == expectedOutput);</div>
<div class="line"><span class="lineno"> 290</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 290</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 291</span> </div>
<div class="line"><span class="lineno"> 292</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><span class="lineno"> 293</span> root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><span class="lineno"> 294</span> </div>
<div class="line"><span class="lineno"> 295</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 295</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 297</span> }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:56</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:155</div></div>
@@ -534,7 +533,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -556,11 +555,11 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 186</span> {</div>
<div class="line"><span class="lineno"> 187</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><span class="lineno"> 188</span> </div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 190</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 191</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Only contains one element&quot;</span>);</div>
<div class="line"><span class="lineno"> 191</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Only contains one element&quot;</span>);</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/vector.html">std::vector&lt;uint64_t&gt;</a> sublistData = {</div>
<div class="line"><span class="lineno"> 196</span> 6}; <span class="comment">///&lt; Data to make linked list which will be the sublist</span></div>
@@ -579,12 +578,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
<div class="line"><span class="lineno"> 210</span> sublistLL, mainlistLL); <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
<div class="line"><span class="lineno"> 211</span> </div>
<div class="line"><span class="lineno"> 212</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 212</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 213</span> assert(exists == expectedOutput);</div>
<div class="line"><span class="lineno"> 214</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 214</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 215</span> </div>
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 217</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 217</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 218</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 219</span> </div>
<div class="line"><span class="lineno"> 220</span> <span class="keyword">delete</span> (sublistLL);</div>
@@ -614,7 +613,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -629,28 +628,28 @@ 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"> 214</span> {</div>
<div class="line"><span class="lineno"> 215</span> <span class="keyword">const</span> int64_t inputSize = 1;</div>
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 217</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 218</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 219</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Only contains one element&quot;</span>);</div>
<div class="line"><span class="lineno"> 218</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 219</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Only contains one element&quot;</span>);</div>
<div class="line"><span class="lineno"> 221</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr{2};</div>
<div class="line"><span class="lineno"> 222</span> </div>
<div class="line"><span class="lineno"> 223</span> int64_t start = 0;</div>
<div class="line"><span class="lineno"> 224</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.size() - 1; <span class="comment">// length - 1</span></div>
<div class="line"><span class="lineno"> 225</span> </div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 50 ...&quot;</span>);</div>
<div class="line"><span class="lineno"> 226</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 50 ...&quot;</span>);</div>
<div class="line"><span class="lineno"> 227</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
<div class="line"><span class="lineno"> 228</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
<div class="line"><span class="lineno"> 229</span> end);</div>
<div class="line"><span class="lineno"> 230</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 230</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 231</span> </div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 233</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 235</span> </div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 238</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 239</span> }</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
@@ -678,7 +677,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -700,8 +699,8 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 304</span> {</div>
<div class="line"><span class="lineno"> 305</span> <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><span class="lineno"> 306</span> </div>
<div class="line"><span class="lineno"> 307</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 308</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 307</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 308</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 309</span> </div>
<div class="line"><span class="lineno"> 310</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><span class="lineno"> 311</span> <span class="keyword">nullptr</span>;</div>
@@ -722,15 +721,15 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 326</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><span class="lineno"> 327</span> root, 20); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><span class="lineno"> 328</span> </div>
<div class="line"><span class="lineno"> 329</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 329</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 330</span> assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><span class="lineno"> 331</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 331</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 332</span> </div>
<div class="line"><span class="lineno"> 333</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><span class="lineno"> 334</span> root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><span class="lineno"> 335</span> </div>
<div class="line"><span class="lineno"> 336</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 337</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 336</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 337</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 338</span> }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:58</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -753,7 +752,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -777,11 +776,11 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 229</span> {</div>
<div class="line"><span class="lineno"> 230</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">/// Expected output of this test</span></div>
<div class="line"><span class="lineno"> 231</span> </div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 233</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 235</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; contains main list of 100 elements and sublist of 20&quot;</span>);</div>
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 235</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; contains main list of 100 elements and sublist of 20&quot;</span>);</div>
<div class="line"><span class="lineno"> 237</span> </div>
<div class="line"><span class="lineno"> 238</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> sublistData(</div>
<div class="line"><span class="lineno"> 239</span> 20); <span class="comment">///&lt; Data to make linked list which will be the sublist</span></div>
@@ -811,12 +810,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 263</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
<div class="line"><span class="lineno"> 264</span> sublistLL, mainlistLL); <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
<div class="line"><span class="lineno"> 265</span> </div>
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 267</span> assert(exists == expectedOutput);</div>
<div class="line"><span class="lineno"> 268</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 268</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 269</span> </div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 272</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 273</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -839,7 +838,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -854,11 +853,11 @@ 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"> 245</span> {</div>
<div class="line"><span class="lineno"> 246</span> <span class="keyword">const</span> int64_t inputSize = 500;</div>
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 248</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; BIG INPUT : Contains 500 elements and repeated elements&quot;</span>);</div>
<div class="line"><span class="lineno"> 251</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; BIG INPUT : Contains 500 elements and repeated elements&quot;</span>);</div>
<div class="line"><span class="lineno"> 251</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 252</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr =</div>
<div class="line"><span class="lineno"> 253</span> sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
<div class="line"><span class="lineno"> 254</span> 1, 10000);</div>
@@ -866,18 +865,18 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 256</span> int64_t start = 0;</div>
<div class="line"><span class="lineno"> 257</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1; <span class="comment">// length - 1</span></div>
<div class="line"><span class="lineno"> 258</span> </div>
<div class="line"><span class="lineno"> 259</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 500 ...&quot;</span>);</div>
<div class="line"><span class="lineno"> 259</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 500 ...&quot;</span>);</div>
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
<div class="line"><span class="lineno"> 261</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
<div class="line"><span class="lineno"> 262</span> end);</div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 264</span> </div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 266</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
<div class="line"><span class="lineno"> 267</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 267</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 268</span> </div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 271</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 272</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -900,7 +899,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -922,8 +921,8 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 345</span> {</div>
<div class="line"><span class="lineno"> 346</span> <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><span class="lineno"> 347</span> </div>
<div class="line"><span class="lineno"> 348</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 349</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 348</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 349</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
<div class="line"><span class="lineno"> 350</span> </div>
<div class="line"><span class="lineno"> 351</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><span class="lineno"> 352</span> <span class="keyword">nullptr</span>;</div>
@@ -945,15 +944,15 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 368</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><span class="lineno"> 369</span> root, 90); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><span class="lineno"> 370</span> </div>
<div class="line"><span class="lineno"> 371</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 371</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 372</span> assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><span class="lineno"> 373</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 373</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 374</span> </div>
<div class="line"><span class="lineno"> 375</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><span class="lineno"> 376</span> root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><span class="lineno"> 377</span> </div>
<div class="line"><span class="lineno"> 378</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 379</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 378</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 379</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><span class="lineno"> 380</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -975,7 +974,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -999,11 +998,11 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 280</span> {</div>
<div class="line"><span class="lineno"> 281</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><span class="lineno"> 282</span> </div>
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 284</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 285</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 287</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; contains main list of 50 elements and sublist of 20&quot;</span>);</div>
<div class="line"><span class="lineno"> 285</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for sublist search Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 287</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; contains main list of 50 elements and sublist of 20&quot;</span>);</div>
<div class="line"><span class="lineno"> 288</span> </div>
<div class="line"><span class="lineno"> 289</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> sublistData(20); <span class="comment">///&lt; Sublist to be searched</span></div>
<div class="line"><span class="lineno"> 290</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> mainlistData(</div>
@@ -1030,12 +1029,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 311</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
<div class="line"><span class="lineno"> 312</span> sublistLL, mainlistLL); <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
<div class="line"><span class="lineno"> 313</span> </div>
<div class="line"><span class="lineno"> 314</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 314</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 315</span> assert(exists == expectedOutput);</div>
<div class="line"><span class="lineno"> 316</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 316</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 317</span> </div>
<div class="line"><span class="lineno"> 318</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 319</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 318</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 319</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 320</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 321</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -1058,7 +1057,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void TestCases::testCase_3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1073,11 +1072,11 @@ 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"> 278</span> {</div>
<div class="line"><span class="lineno"> 279</span> <span class="keyword">const</span> int64_t inputSize = 1000;</div>
<div class="line"><span class="lineno"> 280</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 280</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 281</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 282</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 284</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; LARGE INPUT : Contains 1000 elements and repeated elements&quot;</span>);</div>
<div class="line"><span class="lineno"> 282</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><span class="lineno"> 284</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; LARGE INPUT : Contains 1000 elements and repeated elements&quot;</span>);</div>
<div class="line"><span class="lineno"> 285</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr =</div>
<div class="line"><span class="lineno"> 286</span> sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
<div class="line"><span class="lineno"> 287</span> 1, 10000);</div>
@@ -1085,18 +1084,18 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 289</span> int64_t start = 0;</div>
<div class="line"><span class="lineno"> 290</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1; <span class="comment">// length - 1</span></div>
<div class="line"><span class="lineno"> 291</span> </div>
<div class="line"><span class="lineno"> 292</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm...&quot;</span>);</div>
<div class="line"><span class="lineno"> 292</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm...&quot;</span>);</div>
<div class="line"><span class="lineno"> 293</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
<div class="line"><span class="lineno"> 294</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
<div class="line"><span class="lineno"> 295</span> end);</div>
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
<div class="line"><span class="lineno"> 297</span> </div>
<div class="line"><span class="lineno"> 298</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 298</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><span class="lineno"> 299</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
<div class="line"><span class="lineno"> 300</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 300</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><span class="lineno"> 301</span> </div>
<div class="line"><span class="lineno"> 302</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 303</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 302</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><span class="lineno"> 303</span> <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
<div class="line"><span class="lineno"> 304</span> <span class="stringliteral">&quot;~&quot;</span>);</div>
<div class="line"><span class="lineno"> 305</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -1118,7 +1117,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="../../d5/d58/class_test_cases.html">TestCases</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>

29
d5/d58/persistent__seg__tree__lazy__prop_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++: range_queries/persistent_seg_tree_lazy_prop.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('d5/d58/persistent__seg__tree__lazy__prop_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d58/persistent__seg__tree__lazy__prop_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -132,10 +134,10 @@ 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:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_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="../../d5/d58/persistent__seg__tree__lazy__prop_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>
@@ -153,8 +155,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>
@@ -163,14 +164,14 @@ 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"> 318</span> {</div>
<div class="line"><span class="lineno"> 319</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 319</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"> 320</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 321</span>}</div>
<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_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> persistent_seg_tree_lazy_prop.cpp:268</div></div>
<div class="ttc" id="apersistent__seg__tree__lazy__prop_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> persistent_seg_tree_lazy_prop.cpp:268</div></div>
</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="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="559"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="577"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
@@ -187,7 +188,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>
@@ -256,7 +257,7 @@ Here is the call graph for this function:</div>
</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="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="559"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="577"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
</div>
</div>
@@ -267,7 +268,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_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.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>

29
d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -2,21 +2,22 @@
<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,160,49,185"/>
<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="97,29,274,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,157,57,120,75,99,95,81,103,76,106,80,98,85,79,103,62,123,38,160"/>
<area shape="rect" id="Node000003" 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="97,209,274,250"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="50,178,114,201,112,206,48,183"/>
<area shape="rect" id="Node000003" 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="97,233,274,274"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="51,181,132,224,130,228,48,186"/>
<area shape="rect" id="Node000006" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" title="Getting the number of versions after updates so far which is equal to the size of the pointers vector..." alt="" coords="97,95,274,135"/>
<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="48,162,112,139,114,144,50,167"/>
<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="48,162,112,139,114,144,50,167"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="353,132,468,157"/>
<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="49,168,338,147,338,152,49,173"/>
<area shape="rect" id="Node000008" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="97,299,274,339"/>
<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="39,184,63,220,98,260,135,288,132,292,95,264,59,223,34,187"/>
<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="49,168,338,147,338,152,49,173"/>
<area shape="rect" id="Node000008" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="97,323,274,363"/>
<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="36,184,60,231,78,258,99,284,133,312,130,316,95,288,73,262,55,234,32,187"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="155,29,153,19,158,11,169,5,185,3,203,5,213,11,210,16,201,10,185,8,171,10,162,14,158,20,160,28"/>
<area shape="rect" id="Node000004" 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="322,241,499,282"/>
<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="274,240,307,244,306,250,274,245"/>
<area shape="rect" id="Node000005" 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="547,271,725,311"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="500,271,532,275,531,280,499,276"/>
<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="274,124,338,132,337,137,274,129"/>
<area shape="poly" id="edge10_Node000008_Node000004" title=" " alt="" coords="267,296,313,284,314,289,268,301"/>
<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="274,311,532,295,532,300,275,316"/>
<area shape="poly" id="edge12_Node000008_Node000008" title=" " alt="" coords="155,298,153,289,158,280,169,274,185,272,203,274,213,281,210,285,201,279,185,277,171,279,162,284,158,290,160,298"/>
<area shape="poly" id="edge6_Node000003_Node000003" title=" " alt="" coords="155,233,153,223,158,215,169,209,185,207,203,209,213,215,210,220,201,214,185,212,171,214,162,218,158,224,160,232"/>
<area shape="rect" id="Node000004" 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="322,265,499,306"/>
<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="274,264,307,268,306,274,274,269"/>
<area shape="rect" id="Node000005" 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="547,295,725,335"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="500,295,532,299,531,304,499,300"/>
<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="274,124,338,132,337,137,274,129"/>
<area shape="poly" id="edge11_Node000008_Node000004" title=" " alt="" coords="267,320,313,308,314,313,268,325"/>
<area shape="poly" id="edge12_Node000008_Node000005" title=" " alt="" coords="274,335,532,319,532,324,275,340"/>
<area shape="poly" id="edge13_Node000008_Node000008" title=" " alt="" coords="155,322,153,313,158,304,169,298,185,296,203,298,213,305,210,309,201,303,185,301,171,303,162,308,158,314,160,322"/>
</map>

2
d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
0097962e588e98b2b178345844fc506d
4ceac9a6d05fe03748d7bde99bc85d27

89
d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 259 -->
<!--zoomable 277 -->
<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 = 548;
var viewHeight = 259;
var viewHeight = 277;
var sectionId = 'dynsection-2';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
@@ -58,8 +58,8 @@ var sectionId = 'dynsection-2';
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="#999999" stroke="#666666" points="32.5,-152.88 0,-152.88 0,-133.62 32.5,-133.62 32.5,-152.88"/>
<text text-anchor="middle" x="16.25" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -67,9 +67,9 @@ var sectionId = 'dynsection-2';
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
<polygon fill="white" stroke="#666666" points="201.5,-232.5 68.5,-232.5 68.5,-202 201.5,-202 201.5,-232.5"/>
<text text-anchor="start" x="76.5" y="-219" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
<polygon fill="white" stroke="#666666" points="201.5,-250.5 68.5,-250.5 68.5,-220 201.5,-220 201.5,-250.5"/>
<text text-anchor="start" x="76.5" y="-237" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-225.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
</a>
</g>
</g>
@@ -77,8 +77,8 @@ var sectionId = 'dynsection-2';
<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="M22.53,-135.29C30.62,-149.76 47.38,-176.48 68.5,-192.25 70.29,-193.59 72.16,-194.86 74.1,-196.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.39,-199.13 82.83,-200.91 75.78,-193.01 72.39,-199.13"/>
<path fill="none" stroke="#63b8ff" d="M22.53,-153.29C30.62,-167.76 47.38,-194.48 68.5,-210.25 70.29,-211.59 72.16,-212.86 74.1,-214.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.39,-217.13 82.83,-218.91 75.78,-211.01 72.39,-217.13"/>
</a>
</g>
</g>
@@ -96,8 +96,8 @@ var sectionId = 'dynsection-2';
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-119.45C45.37,-114.89 63.35,-108.27 80.73,-101.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.82,-105.2 90,-98.46 79.4,-98.63 81.82,-105.2"/>
<path fill="none" stroke="#63b8ff" d="M33,-135.02C48.61,-126.86 73.19,-114.02 94.18,-103.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="95.56,-106.28 102.81,-98.55 92.32,-100.08 95.56,-106.28"/>
</a>
</g>
</g>
@@ -105,18 +105,18 @@ var sectionId = 'dynsection-2';
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
<polygon fill="white" stroke="#666666" points="201.5,-183.5 68.5,-183.5 68.5,-153 201.5,-153 201.5,-183.5"/>
<text text-anchor="start" x="76.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
<polygon fill="white" stroke="#666666" points="201.5,-201.5 68.5,-201.5 68.5,-171 201.5,-171 201.5,-201.5"/>
<text text-anchor="start" x="76.5" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<g id="edge7_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-131.05C45.37,-135.61 63.35,-142.23 80.73,-148.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.4,-151.87 90,-152.04 81.82,-145.3 79.4,-151.87"/>
<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-149.05C45.37,-153.61 63.35,-160.23 80.73,-166.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.4,-169.87 90,-170.04 81.82,-163.3 79.4,-169.87"/>
</a>
</g>
</g>
@@ -124,17 +124,17 @@ var sectionId = 'dynsection-2';
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="347.25,-155.88 260.75,-155.88 260.75,-136.62 347.25,-136.62 347.25,-155.88"/>
<text text-anchor="middle" x="304" y="-142.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<polygon fill="white" stroke="#666666" points="347.25,-173.88 260.75,-173.88 260.75,-154.62 347.25,-154.62 347.25,-173.88"/>
<text text-anchor="middle" x="304" y="-160.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<g id="edge9_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="M32.61,-126.38C72.83,-129.33 182.69,-137.41 249.35,-142.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.72,-145.77 258.95,-143.01 249.24,-138.79 248.72,-145.77"/>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.61,-144.38C72.83,-147.33 182.69,-155.41 249.35,-160.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.72,-163.77 258.95,-161.01 249.24,-156.79 248.72,-163.77"/>
</a>
</g>
</g>
@@ -149,11 +149,11 @@ var sectionId = 'dynsection-2';
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge9_Node000001_Node000008" class="edge">
<g id="edge10_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M23.31,-115.33C32.09,-101.46 49.42,-76.01 68.5,-58.25 76.78,-50.55 86.59,-43.31 96.06,-37.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.89,-40.04 104.45,-31.72 94.13,-34.13 97.89,-40.04"/>
<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.42,-133.38C28.93,-116.49 46.04,-81.59 68.5,-58.25 76.13,-50.32 85.48,-43.11 94.7,-36.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.34,-40.06 102.9,-31.75 92.59,-34.15 96.34,-40.06"/>
</a>
</g>
</g>
@@ -161,8 +161,17 @@ var sectionId = 'dynsection-2';
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-232.99C109.66,-242.06 116.68,-250.5 135,-250.5 145.02,-250.5 151.66,-247.97 154.91,-244.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-244.79 155.89,-234.49 151.41,-244.09 158.37,-244.79"/>
<path fill="none" stroke="#63b8ff" d="M113.96,-250.99C109.66,-260.06 116.68,-268.5 135,-268.5 145.02,-268.5 151.66,-265.97 154.91,-262.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-262.79 155.89,-252.49 151.41,-262.09 158.37,-262.79"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge6_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge6_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-97.99C109.66,-107.06 116.68,-115.5 135,-115.5 145.02,-115.5 151.66,-112.97 154.91,-109.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-109.79 155.89,-99.49 151.41,-109.09 158.37,-109.79"/>
</a>
</g>
</g>
@@ -205,36 +214,36 @@ var sectionId = 'dynsection-2';
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge7_Node000006_Node000007" class="edge">
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.52,-159.62C217.25,-157.55 233.87,-155.36 249.01,-153.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.3,-156.85 258.76,-152.08 248.39,-149.91 249.3,-156.85"/>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.52,-177.62C217.25,-175.55 233.87,-173.36 249.01,-171.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.3,-174.85 258.76,-170.08 248.39,-167.91 249.3,-174.85"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge10_Node000008_Node000004" class="edge">
<g id="edge11_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M196.76,-30.9C207.93,-33.77 219.68,-36.8 231.14,-39.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.98,-43.06 240.54,-42.17 231.73,-36.28 229.98,-43.06"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11_Node000008_Node000005" class="edge">
<g id="edge12_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
<g id="a_edge12_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.98,-19.37C257.35,-22.83 336.5,-27.78 394.8,-31.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.46,-34.91 404.66,-32.04 394.9,-27.92 394.46,-34.91"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node8 -->
<g id="edge12_Node000008_Node000008" class="edge">
<g id="edge13_Node000008_Node000008" class="edge">
<title>Node8&#45;&gt;Node8</title>
<g id="a_edge12_Node000008_Node000008"><a xlink:title=" ">
<g id="a_edge13_Node000008_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-30.99C109.66,-40.06 116.68,-48.5 135,-48.5 145.02,-48.5 151.66,-45.97 154.91,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-42.79 155.89,-32.49 151.41,-42.09 158.37,-42.79"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 14 KiB

After

Width:  |  Height:  |  Size: 14 KiB

91
d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: test Pages: 1 -->
<svg width="548pt" height="259pt"
viewBox="0.00 0.00 547.50 258.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 254.5)">
<svg width="548pt" height="277pt"
viewBox="0.00 0.00 547.50 276.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 272.5)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Test implementations.">
<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="#999999" stroke="#666666" points="32.5,-152.88 0,-152.88 0,-133.62 32.5,-133.62 32.5,-152.88"/>
<text text-anchor="middle" x="16.25" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -21,9 +21,9 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
<polygon fill="white" stroke="#666666" points="201.5,-232.5 68.5,-232.5 68.5,-202 201.5,-202 201.5,-232.5"/>
<text text-anchor="start" x="76.5" y="-219" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
<polygon fill="white" stroke="#666666" points="201.5,-250.5 68.5,-250.5 68.5,-220 201.5,-220 201.5,-250.5"/>
<text text-anchor="start" x="76.5" y="-237" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-225.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
</a>
</g>
</g>
@@ -31,8 +31,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="M22.53,-135.29C30.62,-149.76 47.38,-176.48 68.5,-192.25 70.29,-193.59 72.16,-194.86 74.1,-196.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.39,-199.13 82.83,-200.91 75.78,-193.01 72.39,-199.13"/>
<path fill="none" stroke="#63b8ff" d="M22.53,-153.29C30.62,-167.76 47.38,-194.48 68.5,-210.25 70.29,-211.59 72.16,-212.86 74.1,-214.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.39,-217.13 82.83,-218.91 75.78,-211.01 72.39,-217.13"/>
</a>
</g>
</g>
@@ -50,8 +50,8 @@
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-119.45C45.37,-114.89 63.35,-108.27 80.73,-101.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.82,-105.2 90,-98.46 79.4,-98.63 81.82,-105.2"/>
<path fill="none" stroke="#63b8ff" d="M33,-135.02C48.61,-126.86 73.19,-114.02 94.18,-103.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="95.56,-106.28 102.81,-98.55 92.32,-100.08 95.56,-106.28"/>
</a>
</g>
</g>
@@ -59,18 +59,18 @@
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
<polygon fill="white" stroke="#666666" points="201.5,-183.5 68.5,-183.5 68.5,-153 201.5,-153 201.5,-183.5"/>
<text text-anchor="start" x="76.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
<polygon fill="white" stroke="#666666" points="201.5,-201.5 68.5,-201.5 68.5,-171 201.5,-171 201.5,-201.5"/>
<text text-anchor="start" x="76.5" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="135" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge6_Node000001_Node000006" class="edge">
<g id="edge7_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-131.05C45.37,-135.61 63.35,-142.23 80.73,-148.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.4,-151.87 90,-152.04 81.82,-145.3 79.4,-151.87"/>
<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33,-149.05C45.37,-153.61 63.35,-160.23 80.73,-166.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="79.4,-169.87 90,-170.04 81.82,-163.3 79.4,-169.87"/>
</a>
</g>
</g>
@@ -78,17 +78,17 @@
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="347.25,-155.88 260.75,-155.88 260.75,-136.62 347.25,-136.62 347.25,-155.88"/>
<text text-anchor="middle" x="304" y="-142.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<polygon fill="white" stroke="#666666" points="347.25,-173.88 260.75,-173.88 260.75,-154.62 347.25,-154.62 347.25,-173.88"/>
<text text-anchor="middle" x="304" y="-160.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge8_Node000001_Node000007" class="edge">
<g id="edge9_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="M32.61,-126.38C72.83,-129.33 182.69,-137.41 249.35,-142.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.72,-145.77 258.95,-143.01 249.24,-138.79 248.72,-145.77"/>
<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.61,-144.38C72.83,-147.33 182.69,-155.41 249.35,-160.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.72,-163.77 258.95,-161.01 249.24,-156.79 248.72,-163.77"/>
</a>
</g>
</g>
@@ -103,11 +103,11 @@
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge9_Node000001_Node000008" class="edge">
<g id="edge10_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M23.31,-115.33C32.09,-101.46 49.42,-76.01 68.5,-58.25 76.78,-50.55 86.59,-43.31 96.06,-37.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="97.89,-40.04 104.45,-31.72 94.13,-34.13 97.89,-40.04"/>
<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M21.42,-133.38C28.93,-116.49 46.04,-81.59 68.5,-58.25 76.13,-50.32 85.48,-43.11 94.7,-36.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.34,-40.06 102.9,-31.75 92.59,-34.15 96.34,-40.06"/>
</a>
</g>
</g>
@@ -115,8 +115,17 @@
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-232.99C109.66,-242.06 116.68,-250.5 135,-250.5 145.02,-250.5 151.66,-247.97 154.91,-244.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-244.79 155.89,-234.49 151.41,-244.09 158.37,-244.79"/>
<path fill="none" stroke="#63b8ff" d="M113.96,-250.99C109.66,-260.06 116.68,-268.5 135,-268.5 145.02,-268.5 151.66,-265.97 154.91,-262.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-262.79 155.89,-252.49 151.41,-262.09 158.37,-262.79"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge6_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge6_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-97.99C109.66,-107.06 116.68,-115.5 135,-115.5 145.02,-115.5 151.66,-112.97 154.91,-109.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-109.79 155.89,-99.49 151.41,-109.09 158.37,-109.79"/>
</a>
</g>
</g>
@@ -159,36 +168,36 @@
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge7_Node000006_Node000007" class="edge">
<g id="edge8_Node000006_Node000007" class="edge">
<title>Node6&#45;&gt;Node7</title>
<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.52,-159.62C217.25,-157.55 233.87,-155.36 249.01,-153.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.3,-156.85 258.76,-152.08 248.39,-149.91 249.3,-156.85"/>
<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.52,-177.62C217.25,-175.55 233.87,-173.36 249.01,-171.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.3,-174.85 258.76,-170.08 248.39,-167.91 249.3,-174.85"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node4 -->
<g id="edge10_Node000008_Node000004" class="edge">
<g id="edge11_Node000008_Node000004" class="edge">
<title>Node8&#45;&gt;Node4</title>
<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M196.76,-30.9C207.93,-33.77 219.68,-36.8 231.14,-39.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.98,-43.06 240.54,-42.17 231.73,-36.28 229.98,-43.06"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11_Node000008_Node000005" class="edge">
<g id="edge12_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
<g id="a_edge12_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M201.98,-19.37C257.35,-22.83 336.5,-27.78 394.8,-31.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.46,-34.91 404.66,-32.04 394.9,-27.92 394.46,-34.91"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node8 -->
<g id="edge12_Node000008_Node000008" class="edge">
<g id="edge13_Node000008_Node000008" class="edge">
<title>Node8&#45;&gt;Node8</title>
<g id="a_edge12_Node000008_Node000008"><a xlink:title=" ">
<g id="a_edge13_Node000008_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M113.96,-30.99C109.66,-40.06 116.68,-48.5 135,-48.5 145.02,-48.5 151.66,-45.97 154.91,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-42.79 155.89,-32.49 151.41,-42.09 158.37,-42.79"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 10 KiB

After

Width:  |  Height:  |  Size: 10 KiB

29
d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -4,21 +4,22 @@
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,170,87,170,87,175,55,175"/>
<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="194,29,371,70"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="130,157,155,120,172,99,192,81,200,76,203,80,196,85,176,103,159,123,135,160"/>
<area shape="rect" id="Node000004" 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="194,209,371,250"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="148,178,211,201,209,206,146,183"/>
<area shape="rect" id="Node000004" 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="194,233,371,274"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="148,181,229,224,227,228,145,186"/>
<area shape="rect" id="Node000007" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" title="Getting the number of versions after updates so far which is equal to the size of the pointers vector..." alt="" coords="194,95,371,135"/>
<area shape="poly" id="edge7_Node000002_Node000007" title=" " alt="" coords="146,162,209,139,211,144,148,167"/>
<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="146,162,209,139,211,144,148,167"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="450,132,566,157"/>
<area shape="poly" id="edge9_Node000002_Node000008" title=" " alt="" coords="146,168,435,147,435,152,146,173"/>
<area shape="rect" id="Node000009" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="194,299,371,339"/>
<area shape="poly" id="edge10_Node000002_Node000009" title=" " alt="" coords="136,184,161,220,196,260,232,288,229,292,192,264,157,223,132,187"/>
<area shape="poly" id="edge10_Node000002_Node000008" title=" " alt="" coords="146,168,435,147,435,152,146,173"/>
<area shape="rect" id="Node000009" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="194,323,371,363"/>
<area shape="poly" id="edge11_Node000002_Node000009" title=" " alt="" coords="134,184,157,231,175,258,196,284,231,312,227,316,192,288,171,262,153,234,129,187"/>
<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="252,29,251,19,255,11,266,5,283,3,300,5,311,11,308,16,298,10,283,8,268,10,259,14,256,20,257,28"/>
<area shape="rect" id="Node000005" 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="419,241,597,282"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="372,240,404,244,403,250,371,245"/>
<area shape="rect" id="Node000006" 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="645,271,822,311"/>
<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="597,271,629,275,629,280,596,276"/>
<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="372,124,435,132,434,137,371,129"/>
<area shape="poly" id="edge11_Node000009_Node000005" title=" " alt="" coords="364,296,410,284,412,289,366,301"/>
<area shape="poly" id="edge12_Node000009_Node000006" title=" " alt="" coords="372,311,629,295,629,300,372,316"/>
<area shape="poly" id="edge13_Node000009_Node000009" title=" " alt="" coords="252,298,251,289,255,280,266,274,283,272,300,274,311,281,308,285,298,279,283,277,268,279,259,284,256,290,257,298"/>
<area shape="poly" id="edge7_Node000004_Node000004" title=" " alt="" coords="252,233,251,223,255,215,266,209,283,207,300,209,311,215,308,220,298,214,283,212,268,214,259,218,256,224,257,232"/>
<area shape="rect" id="Node000005" 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="419,265,597,306"/>
<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="372,264,404,268,403,274,371,269"/>
<area shape="rect" id="Node000006" 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="645,295,822,335"/>
<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="597,295,629,299,629,304,596,300"/>
<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="372,124,435,132,434,137,371,129"/>
<area shape="poly" id="edge12_Node000009_Node000005" title=" " alt="" coords="364,320,410,308,412,313,366,325"/>
<area shape="poly" id="edge13_Node000009_Node000006" title=" " alt="" coords="372,335,629,319,629,324,372,340"/>
<area shape="poly" id="edge14_Node000009_Node000009" title=" " alt="" coords="252,322,251,313,255,304,266,298,283,296,300,298,311,305,308,309,298,303,283,301,268,303,259,308,256,314,257,322"/>
</map>

2
d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
7edf92feb0977b248d7d55034a6b799e
be3b97062df9139daa6648c1e941ae87

97
d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 259 -->
<!--zoomable 277 -->
<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 = 621;
var viewHeight = 259;
var viewHeight = 277;
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,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-152.88 0,-152.88 0,-133.62 37,-133.62 37,-152.88"/>
<text text-anchor="middle" x="18.5" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -67,8 +67,8 @@ var sectionId = 'dynsection-1';
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="white" stroke="#666666" points="105.5,-152.88 73,-152.88 73,-133.62 105.5,-133.62 105.5,-152.88"/>
<text text-anchor="middle" x="89.25" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
@@ -76,8 +76,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="M37.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-143.25C44.58,-143.25 53.31,-143.25 61.45,-143.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-146.75 71.2,-143.25 61.2,-139.75 61.2,-146.75"/>
</a>
</g>
</g>
@@ -85,9 +85,9 @@ var sectionId = 'dynsection-1';
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
<polygon fill="white" stroke="#666666" points="274.5,-232.5 141.5,-232.5 141.5,-202 274.5,-202 274.5,-232.5"/>
<text text-anchor="start" x="149.5" y="-219" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
<polygon fill="white" stroke="#666666" points="274.5,-250.5 141.5,-250.5 141.5,-220 274.5,-220 274.5,-250.5"/>
<text text-anchor="start" x="149.5" y="-237" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-225.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
</a>
</g>
</g>
@@ -95,8 +95,8 @@ var sectionId = 'dynsection-1';
<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="M95.53,-135.29C103.62,-149.76 120.38,-176.48 141.5,-192.25 143.29,-193.59 145.16,-194.86 147.1,-196.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.39,-199.13 155.83,-200.91 148.78,-193.01 145.39,-199.13"/>
<path fill="none" stroke="#63b8ff" d="M95.53,-153.29C103.62,-167.76 120.38,-194.48 141.5,-210.25 143.29,-211.59 145.16,-212.86 147.1,-214.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.39,-217.13 155.83,-218.91 148.78,-211.01 145.39,-217.13"/>
</a>
</g>
</g>
@@ -114,8 +114,8 @@ var sectionId = 'dynsection-1';
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-119.45C118.37,-114.89 136.35,-108.27 153.73,-101.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.82,-105.2 163,-98.46 152.4,-98.63 154.82,-105.2"/>
<path fill="none" stroke="#63b8ff" d="M106,-135.02C121.61,-126.86 146.19,-114.02 167.18,-103.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.56,-106.28 175.81,-98.55 165.32,-100.08 168.56,-106.28"/>
</a>
</g>
</g>
@@ -123,18 +123,18 @@ var sectionId = 'dynsection-1';
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
<polygon fill="white" stroke="#666666" points="274.5,-183.5 141.5,-183.5 141.5,-153 274.5,-153 274.5,-183.5"/>
<text text-anchor="start" x="149.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
<polygon fill="white" stroke="#666666" points="274.5,-201.5 141.5,-201.5 141.5,-171 274.5,-171 274.5,-201.5"/>
<text text-anchor="start" x="149.5" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge7_Node000002_Node000007" class="edge">
<g id="edge8_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge7_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-131.05C118.37,-135.61 136.35,-142.23 153.73,-148.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.4,-151.87 163,-152.04 154.82,-145.3 152.4,-151.87"/>
<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-149.05C118.37,-153.61 136.35,-160.23 153.73,-166.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.4,-169.87 163,-170.04 154.82,-163.3 152.4,-169.87"/>
</a>
</g>
</g>
@@ -142,17 +142,17 @@ var sectionId = 'dynsection-1';
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="420.25,-155.88 333.75,-155.88 333.75,-136.62 420.25,-136.62 420.25,-155.88"/>
<text text-anchor="middle" x="377" y="-142.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<polygon fill="white" stroke="#666666" points="420.25,-173.88 333.75,-173.88 333.75,-154.62 420.25,-154.62 420.25,-173.88"/>
<text text-anchor="middle" x="377" y="-160.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge9_Node000002_Node000008" class="edge">
<g id="edge10_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.61,-126.38C145.83,-129.33 255.69,-137.41 322.35,-142.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.72,-145.77 331.95,-143.01 322.24,-138.79 321.72,-145.77"/>
<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.61,-144.38C145.83,-147.33 255.69,-155.41 322.35,-160.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.72,-163.77 331.95,-161.01 322.24,-156.79 321.72,-163.77"/>
</a>
</g>
</g>
@@ -167,11 +167,11 @@ var sectionId = 'dynsection-1';
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge10_Node000002_Node000009" class="edge">
<g id="edge11_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge10_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M96.31,-115.33C105.09,-101.46 122.42,-76.01 141.5,-58.25 149.78,-50.55 159.59,-43.31 169.06,-37.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.89,-40.04 177.45,-31.72 167.13,-34.13 170.89,-40.04"/>
<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M94.42,-133.38C101.93,-116.49 119.04,-81.59 141.5,-58.25 149.13,-50.32 158.48,-43.11 167.7,-36.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.34,-40.06 175.9,-31.75 165.59,-34.15 169.34,-40.06"/>
</a>
</g>
</g>
@@ -179,8 +179,17 @@ var sectionId = 'dynsection-1';
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-232.99C182.66,-242.06 189.68,-250.5 208,-250.5 218.02,-250.5 224.66,-247.97 227.91,-244.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-244.79 228.89,-234.49 224.41,-244.09 231.37,-244.79"/>
<path fill="none" stroke="#63b8ff" d="M186.96,-250.99C182.66,-260.06 189.68,-268.5 208,-268.5 218.02,-268.5 224.66,-265.97 227.91,-262.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-262.79 228.89,-252.49 224.41,-262.09 231.37,-262.79"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge7_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge7_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-97.99C182.66,-107.06 189.68,-115.5 208,-115.5 218.02,-115.5 224.66,-112.97 227.91,-109.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-109.79 228.89,-99.49 224.41,-109.09 231.37,-109.79"/>
</a>
</g>
</g>
@@ -223,36 +232,36 @@ var sectionId = 'dynsection-1';
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<g id="edge9_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.52,-159.62C290.25,-157.55 306.87,-155.36 322.01,-153.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-156.85 331.76,-152.08 321.39,-149.91 322.3,-156.85"/>
<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.52,-177.62C290.25,-175.55 306.87,-173.36 322.01,-171.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-174.85 331.76,-170.08 321.39,-167.91 322.3,-174.85"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge11_Node000009_Node000005" class="edge">
<g id="edge12_Node000009_Node000005" class="edge">
<title>Node9&#45;&gt;Node5</title>
<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M269.76,-30.9C280.93,-33.77 292.68,-36.8 304.14,-39.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="302.98,-43.06 313.54,-42.17 304.73,-36.28 302.98,-43.06"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node6 -->
<g id="edge12_Node000009_Node000006" class="edge">
<g id="edge13_Node000009_Node000006" class="edge">
<title>Node9&#45;&gt;Node6</title>
<g id="a_edge12_Node000009_Node000006"><a xlink:title=" ">
<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.98,-19.37C330.35,-22.83 409.5,-27.78 467.8,-31.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="467.46,-34.91 477.66,-32.04 467.9,-27.92 467.46,-34.91"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node9 -->
<g id="edge13_Node000009_Node000009" class="edge">
<g id="edge14_Node000009_Node000009" class="edge">
<title>Node9&#45;&gt;Node9</title>
<g id="a_edge13_Node000009_Node000009"><a xlink:title=" ">
<g id="a_edge14_Node000009_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-30.99C182.66,-40.06 189.68,-48.5 208,-48.5 218.02,-48.5 224.66,-45.97 227.91,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-42.79 228.89,-32.49 224.41,-42.09 231.37,-42.79"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 15 KiB

After

Width:  |  Height:  |  Size: 15 KiB

99
d5/d58/persistent__seg__tree__lazy__prop_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="621pt" height="259pt"
viewBox="0.00 0.00 620.50 258.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 254.5)">
<svg width="621pt" height="277pt"
viewBox="0.00 0.00 620.50 276.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 272.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,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-152.88 0,-152.88 0,-133.62 37,-133.62 37,-152.88"/>
<text text-anchor="middle" x="18.5" y="-139.38" 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="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
<polygon fill="white" stroke="#666666" points="105.5,-152.88 73,-152.88 73,-133.62 105.5,-133.62 105.5,-152.88"/>
<text text-anchor="middle" x="89.25" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</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.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
<path fill="none" stroke="#63b8ff" d="M37.2,-143.25C44.58,-143.25 53.31,-143.25 61.45,-143.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-146.75 71.2,-143.25 61.2,-139.75 61.2,-146.75"/>
</a>
</g>
</g>
@@ -39,9 +39,9 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
<polygon fill="white" stroke="#666666" points="274.5,-232.5 141.5,-232.5 141.5,-202 274.5,-202 274.5,-232.5"/>
<text text-anchor="start" x="149.5" y="-219" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
<polygon fill="white" stroke="#666666" points="274.5,-250.5 141.5,-250.5 141.5,-220 274.5,-220 274.5,-250.5"/>
<text text-anchor="start" x="149.5" y="-237" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-225.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
</a>
</g>
</g>
@@ -49,8 +49,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="M95.53,-135.29C103.62,-149.76 120.38,-176.48 141.5,-192.25 143.29,-193.59 145.16,-194.86 147.1,-196.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.39,-199.13 155.83,-200.91 148.78,-193.01 145.39,-199.13"/>
<path fill="none" stroke="#63b8ff" d="M95.53,-153.29C103.62,-167.76 120.38,-194.48 141.5,-210.25 143.29,-211.59 145.16,-212.86 147.1,-214.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.39,-217.13 155.83,-218.91 148.78,-211.01 145.39,-217.13"/>
</a>
</g>
</g>
@@ -68,8 +68,8 @@
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-119.45C118.37,-114.89 136.35,-108.27 153.73,-101.87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.82,-105.2 163,-98.46 152.4,-98.63 154.82,-105.2"/>
<path fill="none" stroke="#63b8ff" d="M106,-135.02C121.61,-126.86 146.19,-114.02 167.18,-103.05"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.56,-106.28 175.81,-98.55 165.32,-100.08 168.56,-106.28"/>
</a>
</g>
</g>
@@ -77,18 +77,18 @@
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
<polygon fill="white" stroke="#666666" points="274.5,-183.5 141.5,-183.5 141.5,-153 274.5,-153 274.5,-183.5"/>
<text text-anchor="start" x="149.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
<polygon fill="white" stroke="#666666" points="274.5,-201.5 141.5,-201.5 141.5,-171 274.5,-171 274.5,-201.5"/>
<text text-anchor="start" x="149.5" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="208" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge7_Node000002_Node000007" class="edge">
<g id="edge8_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge7_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-131.05C118.37,-135.61 136.35,-142.23 153.73,-148.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.4,-151.87 163,-152.04 154.82,-145.3 152.4,-151.87"/>
<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106,-149.05C118.37,-153.61 136.35,-160.23 153.73,-166.63"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.4,-169.87 163,-170.04 154.82,-163.3 152.4,-169.87"/>
</a>
</g>
</g>
@@ -96,17 +96,17 @@
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="420.25,-155.88 333.75,-155.88 333.75,-136.62 420.25,-136.62 420.25,-155.88"/>
<text text-anchor="middle" x="377" y="-142.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<polygon fill="white" stroke="#666666" points="420.25,-173.88 333.75,-173.88 333.75,-154.62 420.25,-154.62 420.25,-173.88"/>
<text text-anchor="middle" x="377" y="-160.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge9_Node000002_Node000008" class="edge">
<g id="edge10_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.61,-126.38C145.83,-129.33 255.69,-137.41 322.35,-142.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.72,-145.77 331.95,-143.01 322.24,-138.79 321.72,-145.77"/>
<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M105.61,-144.38C145.83,-147.33 255.69,-155.41 322.35,-160.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.72,-163.77 331.95,-161.01 322.24,-156.79 321.72,-163.77"/>
</a>
</g>
</g>
@@ -121,11 +121,11 @@
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge10_Node000002_Node000009" class="edge">
<g id="edge11_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge10_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M96.31,-115.33C105.09,-101.46 122.42,-76.01 141.5,-58.25 149.78,-50.55 159.59,-43.31 169.06,-37.06"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.89,-40.04 177.45,-31.72 167.13,-34.13 170.89,-40.04"/>
<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M94.42,-133.38C101.93,-116.49 119.04,-81.59 141.5,-58.25 149.13,-50.32 158.48,-43.11 167.7,-36.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.34,-40.06 175.9,-31.75 165.59,-34.15 169.34,-40.06"/>
</a>
</g>
</g>
@@ -133,8 +133,17 @@
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-232.99C182.66,-242.06 189.68,-250.5 208,-250.5 218.02,-250.5 224.66,-247.97 227.91,-244.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-244.79 228.89,-234.49 224.41,-244.09 231.37,-244.79"/>
<path fill="none" stroke="#63b8ff" d="M186.96,-250.99C182.66,-260.06 189.68,-268.5 208,-268.5 218.02,-268.5 224.66,-265.97 227.91,-262.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-262.79 228.89,-252.49 224.41,-262.09 231.37,-262.79"/>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node4 -->
<g id="edge7_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge7_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-97.99C182.66,-107.06 189.68,-115.5 208,-115.5 218.02,-115.5 224.66,-112.97 227.91,-109.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-109.79 228.89,-99.49 224.41,-109.09 231.37,-109.79"/>
</a>
</g>
</g>
@@ -177,36 +186,36 @@
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<g id="edge9_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.52,-159.62C290.25,-157.55 306.87,-155.36 322.01,-153.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-156.85 331.76,-152.08 321.39,-149.91 322.3,-156.85"/>
<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.52,-177.62C290.25,-175.55 306.87,-173.36 322.01,-171.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-174.85 331.76,-170.08 321.39,-167.91 322.3,-174.85"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node5 -->
<g id="edge11_Node000009_Node000005" class="edge">
<g id="edge12_Node000009_Node000005" class="edge">
<title>Node9&#45;&gt;Node5</title>
<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M269.76,-30.9C280.93,-33.77 292.68,-36.8 304.14,-39.75"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="302.98,-43.06 313.54,-42.17 304.73,-36.28 302.98,-43.06"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node6 -->
<g id="edge12_Node000009_Node000006" class="edge">
<g id="edge13_Node000009_Node000006" class="edge">
<title>Node9&#45;&gt;Node6</title>
<g id="a_edge12_Node000009_Node000006"><a xlink:title=" ">
<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M274.98,-19.37C330.35,-22.83 409.5,-27.78 467.8,-31.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="467.46,-34.91 477.66,-32.04 467.9,-27.92 467.46,-34.91"/>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node9 -->
<g id="edge13_Node000009_Node000009" class="edge">
<g id="edge14_Node000009_Node000009" class="edge">
<title>Node9&#45;&gt;Node9</title>
<g id="a_edge13_Node000009_Node000009"><a xlink:title=" ">
<g id="a_edge14_Node000009_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M186.96,-30.99C182.66,-40.06 189.68,-48.5 208,-48.5 218.02,-48.5 224.66,-45.97 227.91,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-42.79 228.89,-32.49 224.41,-42.09 231.37,-42.79"/>
</a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 11 KiB

After

Width:  |  Height:  |  Size: 11 KiB

14
d5/d5f/namespacegeometry.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 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('d5/d5f/namespacegeometry.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d5f/namespacegeometry.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d5f/namespacegeometry.html','../../
<div class="contents">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
<a href="../../d5/d5f/namespacegeometry.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>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p>Geometry algorithms.</p>
@@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d5/d5f/namespacegeometry.html','../../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d5f/namespacegeometry.html">geometry</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
d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.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::Node 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('d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -135,7 +137,7 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>prop</b> = 0</td><
<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="navelem"><a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</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>

57
d5/d67/bayes__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++: probability/bayes_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('d5/d67/bayes__theorem_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d67/bayes__theorem_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -114,11 +116,11 @@ Include dependency graph for bayes_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:a655bfe51252468d232dc639a340656ba" id="r_a655bfe51252468d232dc639a340656ba"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a> (double BgivenA, double A, double B)</td></tr>
<tr class="memitem:a655bfe51252468d232dc639a340656ba" id="r_a655bfe51252468d232dc639a340656ba"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a> (double BgivenA, double A, double B)</td></tr>
<tr class="separator:a655bfe51252468d232dc639a340656ba"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb4f22dc05887c2259fdfc55c687598f" id="r_abb4f22dc05887c2259fdfc55c687598f"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a> (double AgivenB, double A, double B)</td></tr>
<tr class="memitem:abb4f22dc05887c2259fdfc55c687598f" id="r_abb4f22dc05887c2259fdfc55c687598f"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a> (double AgivenB, double A, double B)</td></tr>
<tr class="separator:abb4f22dc05887c2259fdfc55c687598f"><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="../../d5/d67/bayes__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>
@@ -135,25 +137,17 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
<tr>
<td class="memname">double bayes_AgivenB </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>BgivenA</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>BgivenA</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>B</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>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -173,25 +167,17 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
<tr>
<td class="memname">double bayes_BgivenA </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>AgivenB</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>AgivenB</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>A</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>B</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>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -211,8 +197,7 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
<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>
@@ -222,14 +207,14 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
<div class="line"><span class="lineno"> 27</span> <span class="keywordtype">double</span> A = 0.01;</div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordtype">double</span> B = 0.1;</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordtype">double</span> BgivenA = 0.9;</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">double</span> AgivenB = <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a>(BgivenA, A, B);</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordtype">double</span> AgivenB = <a class="code hl_function" href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a>(BgivenA, A, B);</div>
<div class="line"><span class="lineno"> 31</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;A given B = &quot;</span> &lt;&lt; AgivenB &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"> 32</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;B given A = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(AgivenB, A, B) &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"> 32</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;B given A = &quot;</span> &lt;&lt; <a class="code hl_function" href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(AgivenB, A, B) &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"> 33</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 34</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>
<div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:14</div></div>
<div class="ttc" id="abayes__theorem_8cpp_html_abb4f22dc05887c2259fdfc55c687598f"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a></div><div class="ttdeci">double bayes_BgivenA(double AgivenB, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:20</div></div>
<div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:14</div></div>
<div class="ttc" id="abayes__theorem_8cpp_html_abb4f22dc05887c2259fdfc55c687598f"><div class="ttname"><a href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a></div><div class="ttdeci">double bayes_BgivenA(double AgivenB, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:20</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>
@@ -245,7 +230,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_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d5/d67/bayes__theorem_8cpp.html">bayes_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>

61
d5/d67/complex__numbers_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/complex_numbers.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('d5/d67/complex__numbers_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d67/complex__numbers_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -126,18 +128,18 @@ 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:a5a73e9d4e68af8cedb95bd0864054b89" id="r_a5a73e9d4e68af8cedb95bd0864054b89"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a> (const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;a, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;b)</td></tr>
<tr class="memitem:a5a73e9d4e68af8cedb95bd0864054b89" id="r_a5a73e9d4e68af8cedb95bd0864054b89"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a> (const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;a, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;b)</td></tr>
<tr class="memdesc:a5a73e9d4e68af8cedb95bd0864054b89"><td class="mdescLeft">&#160;</td><td class="mdescRight">Operator overload of '==' on <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Logical Equal overload for our <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. <br /></td></tr>
<tr class="separator:a5a73e9d4e68af8cedb95bd0864054b89"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a44d5f25b573e870accdf26fd32b8484d" id="r_a44d5f25b573e870accdf26fd32b8484d"><td class="memItemLeft" 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="memItemRight" valign="bottom"><a class="el" href="../../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;os, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;num)</td></tr>
<tr class="memitem:a44d5f25b573e870accdf26fd32b8484d" id="r_a44d5f25b573e870accdf26fd32b8484d"><td class="memItemLeft" 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="memItemRight" valign="bottom"><a class="el" href="#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;os, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;num)</td></tr>
<tr class="memdesc:a44d5f25b573e870accdf26fd32b8484d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Operator overload of '&lt;&lt;' of ostream for <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Overloaded insersion operator to accommodate the printing of our complex number in their standard form. <br /></td></tr>
<tr class="separator:a44d5f25b573e870accdf26fd32b8484d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d4d5b8250b50703de888514c8e7a7a0" id="r_a5d4d5b8250b50703de888514c8e7a7a0"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a> ()</td></tr>
<tr class="memitem:a5d4d5b8250b50703de888514c8e7a7a0" id="r_a5d4d5b8250b50703de888514c8e7a7a0"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a> ()</td></tr>
<tr class="memdesc:a5d4d5b8250b50703de888514c8e7a7a0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to get random numbers to generate our complex numbers for test. <br /></td></tr>
<tr class="separator:a5d4d5b8250b50703de888514c8e7a7a0"><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="../../d5/d67/complex__numbers_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="../../d5/d67/complex__numbers_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>
@@ -154,7 +156,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">double get_rand </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -180,18 +182,17 @@ 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>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 268</span> {</div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 270</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 271</span>}</div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:206</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:206</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -209,19 +210,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/io/basic_ostream.html">std::ostream</a> &amp; 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>os</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>os</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;&#160;</td>
<td class="paramname"><em>num</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;</td> <td class="paramname"><span class="paramname"><em>num</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -249,7 +243,7 @@ Here is the call graph for this function:</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="../../d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg" width="379" 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="../../d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg" width="252" 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>
@@ -263,19 +257,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool operator== </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;&#160;</td>
<td class="paramname"><em>a</em>, </td>
<td class="paramtype">const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &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="el" href="../../da/d5a/class_complex.html">Complex</a> &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="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -311,7 +298,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>
@@ -319,7 +306,7 @@ Here is the call graph for this function:</div>
<p>Tests Function </p>
<div class="fragment"><div class="line"><span class="lineno"> 206</span> {</div>
<div class="line"><span class="lineno"> 207</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
<div class="line"><span class="lineno"> 208</span> <span class="keywordtype">double</span> x1 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y1 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), x2 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y2 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>();</div>
<div class="line"><span class="lineno"> 208</span> <span class="keywordtype">double</span> x1 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y1 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), x2 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y2 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>();</div>
<div class="line"><span class="lineno"> 209</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> num1(x1, y1), num2(x2, y2);</div>
<div class="line"><span class="lineno"> 210</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> cnum1(x1, y1), cnum2(x2, y2);</div>
<div class="line"><span class="lineno"> 211</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
@@ -377,7 +364,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 263</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>
<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:20</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:201</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:201</div></div>
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</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="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>
@@ -399,7 +386,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="../../d5/d67/complex__numbers_8cpp.html">complex_numbers.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>

21
d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.map
View File

@@ -1,18 +1,7 @@
<map id="operator&lt;&lt;" name="operator&lt;&lt;">
<area shape="rect" id="Node000001" title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ..." alt="" coords="5,80,90,106"/>
<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="138,7,247,32"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="70,77,136,41,145,37,148,42,139,46,73,82"/>
<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4" title=" " alt="" coords="150,80,235,106"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,90,135,90,135,96,90,96"/>
<area shape="rect" id="Node000008" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="141,129,244,155"/>
<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="89,104,139,121,137,126,87,109"/>
<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="168,81,163,71,166,62,176,56,192,53,210,56,219,63,216,67,208,61,192,59,178,61,170,65,168,71,173,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/endl.html#" title=" " alt="" coords="299,5,370,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="217,77,293,36,296,41,220,82"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="302,55,367,80"/>
<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="235,83,286,73,286,79,236,88"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="295,104,373,130"/>
<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="235,97,280,105,279,110,235,103"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="297,153,372,179"/>
<area shape="poly" id="edge7_Node000003_Node000007" title=" " alt="" coords="226,104,248,114,299,143,296,147,246,119,224,109"/>
<area shape="rect" id="Node000001" title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ..." alt="" coords="5,31,90,56"/>
<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="138,5,247,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="89,34,122,28,123,33,90,39"/>
<area shape="rect" id="Node000003" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="141,55,244,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,48,127,54,126,59,90,53"/>
</map>

2
d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.md5
View File

@@ -1 +1 @@
595c955230c815371cac03f031d6d315
eba71bf1f050efe6ed924d50aaf86a2a

127
d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: operator&lt;&lt; Pages: 1 -->
<svg width="284pt" height="138pt"
viewBox="0.00 0.00 284.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="189pt" height="64pt"
viewBox="0.00 0.00 189.25 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>operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ...">
<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -31,8 +31,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
<polygon fill="white" stroke="#666666" points="181.25,-129.25 99.25,-129.25 99.25,-110 181.25,-110 181.25,-129.25"/>
<text text-anchor="middle" x="140.25" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</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="M49.67,-74.61C63,-82.3 82.1,-93.02 99.25,-101.62 101.38,-102.69 103.58,-103.77 105.81,-104.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="104.33,-108 114.88,-109.04 107.28,-101.65 104.33,-108"/>
<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
</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="171.88,-74.25 108.62,-74.25 108.62,-55 171.88,-55 171.88,-74.25"/>
<text text-anchor="middle" x="140.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
</a>
</g>
</g>
@@ -58,107 +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="M63.47,-64.62C73.96,-64.62 85.89,-64.62 97.12,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.97,-68.13 106.97,-64.63 96.97,-61.13 96.97,-68.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
<polygon fill="white" stroke="#666666" points="178.62,-37.25 101.88,-37.25 101.88,-18 178.62,-18 178.62,-37.25"/>
<text text-anchor="middle" x="140.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M61.76,-54.51C73.4,-50.48 86.98,-45.76 99.5,-41.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.42,-44.8 108.72,-38.22 98.12,-38.19 100.42,-44.8"/>
</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="M123.6,-74.54C116,-83.15 121.55,-92.25 140.25,-92.25 150.48,-92.25 156.77,-89.53 159.13,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="162.6,-85.14 157.2,-76.02 155.73,-86.51 162.6,-85.14"/>
</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/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.38,-130.25 219.88,-130.25 219.88,-111 273.38,-111 273.38,-130.25"/>
<text text-anchor="middle" x="246.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M159.91,-74.64C175.69,-83.1 198.57,-95.38 216.72,-105.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.97,-108.15 225.44,-109.8 218.28,-101.98 214.97,-108.15"/>
</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/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="271.12,-93.25 222.12,-93.25 222.12,-74 271.12,-74 271.12,-93.25"/>
<text text-anchor="middle" x="246.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.28,-70.27C184.31,-72.46 198.13,-74.98 210.51,-77.23"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.88,-80.68 220.35,-79.02 211.14,-73.79 209.88,-80.68"/>
</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/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276,-56.25 217.25,-56.25 217.25,-37 276,-37 276,-56.25"/>
<text text-anchor="middle" x="246.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.28,-59.27C182.81,-57.46 194.72,-55.4 205.83,-53.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.28,-56.96 215.54,-51.81 205.09,-50.06 206.28,-56.96"/>
</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/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="274.88,-19.25 218.38,-19.25 218.38,0 274.88,0 274.88,-19.25"/>
<text text-anchor="middle" x="246.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge7_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.7,-54.54C170.18,-52.05 175.96,-49.33 181.25,-46.62 193.99,-40.12 207.79,-32.29 219.33,-25.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.09,-28.55 227.9,-20.44 217.51,-22.53 221.09,-28.55"/>
<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 8.2 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

127
d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: operator&lt;&lt; Pages: 1 -->
<svg width="284pt" height="138pt"
viewBox="0.00 0.00 284.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)">
<svg width="189pt" height="64pt"
viewBox="0.00 0.00 189.25 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>operator&lt;&lt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ...">
<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
</a>
</g>
</g>
@@ -21,8 +21,8 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
<polygon fill="white" stroke="#666666" points="181.25,-129.25 99.25,-129.25 99.25,-110 181.25,-110 181.25,-129.25"/>
<text text-anchor="middle" x="140.25" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</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="M49.67,-74.61C63,-82.3 82.1,-93.02 99.25,-101.62 101.38,-102.69 103.58,-103.77 105.81,-104.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="104.33,-108 114.88,-109.04 107.28,-101.65 104.33,-108"/>
<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
</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="171.88,-74.25 108.62,-74.25 108.62,-55 171.88,-55 171.88,-74.25"/>
<text text-anchor="middle" x="140.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
</a>
</g>
</g>
@@ -48,107 +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="M63.47,-64.62C73.96,-64.62 85.89,-64.62 97.12,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.97,-68.13 106.97,-64.63 96.97,-61.13 96.97,-68.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
<polygon fill="white" stroke="#666666" points="178.62,-37.25 101.88,-37.25 101.88,-18 178.62,-18 178.62,-37.25"/>
<text text-anchor="middle" x="140.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge8_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M61.76,-54.51C73.4,-50.48 86.98,-45.76 99.5,-41.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="100.42,-44.8 108.72,-38.22 98.12,-38.19 100.42,-44.8"/>
</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="M123.6,-74.54C116,-83.15 121.55,-92.25 140.25,-92.25 150.48,-92.25 156.77,-89.53 159.13,-85.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="162.6,-85.14 157.2,-76.02 155.73,-86.51 162.6,-85.14"/>
</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/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.38,-130.25 219.88,-130.25 219.88,-111 273.38,-111 273.38,-130.25"/>
<text text-anchor="middle" x="246.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M159.91,-74.64C175.69,-83.1 198.57,-95.38 216.72,-105.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="214.97,-108.15 225.44,-109.8 218.28,-101.98 214.97,-108.15"/>
</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/left.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="271.12,-93.25 222.12,-93.25 222.12,-74 271.12,-74 271.12,-93.25"/>
<text text-anchor="middle" x="246.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.28,-70.27C184.31,-72.46 198.13,-74.98 210.51,-77.23"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.88,-80.68 220.35,-79.02 211.14,-73.79 209.88,-80.68"/>
</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/setfill.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276,-56.25 217.25,-56.25 217.25,-37 276,-37 276,-56.25"/>
<text text-anchor="middle" x="246.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.28,-59.27C182.81,-57.46 194.72,-55.4 205.83,-53.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.28,-56.96 215.54,-51.81 205.09,-50.06 206.28,-56.96"/>
</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/manip/setw.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="274.88,-19.25 218.38,-19.25 218.38,0 274.88,0 274.88,-19.25"/>
<text text-anchor="middle" x="246.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge7_Node000003_Node000007" class="edge">
<title>Node3&#45;&gt;Node7</title>
<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M164.7,-54.54C170.18,-52.05 175.96,-49.33 181.25,-46.62 193.99,-40.12 207.79,-32.29 219.33,-25.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="221.09,-28.55 227.9,-20.44 217.51,-22.53 221.09,-28.55"/>
<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.4 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

25
d5/d7a/largest__power_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/largest_power.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('d5/d7a/largest__power_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d7a/largest__power_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -125,10 +127,10 @@ Functions</h2></td></tr>
<tr class="memitem:afa39ec943a4836c878e1614fd89b146f" id="r_afa39ec943a4836c878e1614fd89b146f"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a> (uint32_t n, const uint16_t &amp;p)</td></tr>
<tr class="memdesc:afa39ec943a4836c878e1614fd89b146f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate largest power. <br /></td></tr>
<tr class="separator:afa39ec943a4836c878e1614fd89b146f"><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="../../d5/d7a/largest__power_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 for testing largestPower function. test cases and assert statement. <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="../../d5/d7a/largest__power_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>
@@ -146,8 +148,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>
@@ -156,10 +157,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"> 75</span>{ </div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 78</span>} </div>
<div class="ttc" id="alargest__power_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing largestPower function. test cases and assert statement.</div><div class="ttdef"><b>Definition</b> largest_power.cpp:47</div></div>
<div class="ttc" id="alargest__power_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing largestPower function. test cases and assert statement.</div><div class="ttdef"><b>Definition</b> largest_power.cpp:47</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -180,7 +181,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>
@@ -231,7 +232,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="../../d5/d7a/largest__power_8cpp.html">largest_power.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
d5/d83/lcm__sum_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/lcm_sum.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('d5/d83/lcm__sum_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d83/lcm__sum_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -126,9 +128,9 @@ Namespaces</h2></td></tr>
Functions</h2></td></tr>
<tr class="memitem:a04065193d190d605e1f0d0d93a87e244" id="r_a04065193d190d605e1f0d0d93a87e244"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a> (const uint16_t &amp;num)</td></tr>
<tr class="separator:a04065193d190d605e1f0d0d93a87e244"><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="../../d5/d83/lcm__sum_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="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="../../d5/d83/lcm__sum_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>
@@ -151,8 +153,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>
@@ -161,10 +162,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"> 96</span> {</div>
<div class="line"><span class="lineno"> 97</span> <a class="code hl_function" href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 97</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 99</span>}</div>
<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> lcm_sum.cpp:65</div></div>
<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> lcm_sum.cpp:65</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -185,7 +186,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>
@@ -242,7 +243,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="../../d5/d83/lcm__sum_8cpp.html">lcm_sum.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
d5/d88/md__d_i_r_e_c_t_o_r_y.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++: Backtracking</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('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -556,7 +558,7 @@ Strings</h1>
<!-- 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
d5/d89/namespacepalindrome__partitioning.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++: palindrome_partitioning 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('d5/d89/namespacepalindrome__partitioning.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d89/namespacepalindrome__partitioning.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/d89/namespacepalindrome__partitioni
<div class="contents">
<p>Functions for <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm.
<a href="../../d5/d89/namespacepalindrome__partitioning.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://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/d89/namespacepalindrome__partitioni
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d89/namespacepalindrome__partitioning.html">palindrome_partitioning</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
d5/d8a/classothers_1_1postfix__expression_1_1_stack.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::postfix_expression::Stack 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('d5/d8a/classothers_1_1postfix__expression_1_1_stack.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d8a/classothers_1_1postfix__expression_1_1_stack.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/d8a/classothers_1_1postfix__express
<div class="contents">
<p>Creates an array to be used as stack for storing values.
<a href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for others::postfix_expression::Stack:</div>
<div class="dyncontent">
@@ -114,7 +116,7 @@ Collaboration diagram for others::postfix_expression::Stack:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:af06360122e20ce2ba32c574a27a20ba1" id="r_af06360122e20ce2ba32c574a27a20ba1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; float, 20 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">stack</a> {}</td></tr>
<tr class="memitem:af06360122e20ce2ba32c574a27a20ba1" id="r_af06360122e20ce2ba32c574a27a20ba1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; float, 20 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af06360122e20ce2ba32c574a27a20ba1">stack</a> {}</td></tr>
<tr class="memdesc:af06360122e20ce2ba32c574a27a20ba1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Array which will be used to store numbers in the input. <br /></td></tr>
<tr class="separator:af06360122e20ce2ba32c574a27a20ba1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6ae98710503b894b843d01cb69d5490c" id="r_a6ae98710503b894b843d01cb69d5490c"><td class="memItemLeft" align="right" valign="top"><a id="a6ae98710503b894b843d01cb69d5490c" name="a6ae98710503b894b843d01cb69d5490c"></a>
@@ -151,7 +153,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>stackTop</b> = -1</td>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d6f/namespaceothers.html">others</a></li><li class="navelem"><b>postfix_expression</b></li><li class="navelem"><a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</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
d5/d8a/trie__using__hashmap_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++: data_structures/trie_using_hashmap.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('d5/d8a/trie__using__hashmap_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d8a/trie__using__hashmap_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -139,10 +141,10 @@ 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:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d8a/trie__using__hashmap_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="../../d5/d8a/trie__using__hashmap_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>
@@ -160,8 +162,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>
@@ -170,10 +171,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"> 342</span> {</div>
<div class="line"><span class="lineno"> 343</span> <a class="code hl_function" href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementaions</span></div>
<div class="line"><span class="lineno"> 343</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementaions</span></div>
<div class="line"><span class="lineno"> 344</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 345</span>}</div>
<div class="ttc" id="atrie__using__hashmap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d8a/trie__using__hashmap_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> trie_using_hashmap.cpp:221</div></div>
<div class="ttc" id="atrie__using__hashmap_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> trie_using_hashmap.cpp:221</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -194,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>
@@ -348,7 +349,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_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.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
d5/d8b/structothers_1_1recursive__tree__traversals_1_1_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('d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/df7/structothers_1_1recursive__tree
<!-- 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>

34
d5/d90/palindrome__partitioning_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++: dynamic_programming/palindrome_partitioning.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('d5/d90/palindrome__partitioning_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d90/palindrome__partitioning_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -128,12 +130,12 @@ 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:a52ee22882858d2b1cf04293f02ed839a" id="r_a52ee22882858d2b1cf04293f02ed839a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
<tr class="memitem:a52ee22882858d2b1cf04293f02ed839a" id="r_a52ee22882858d2b1cf04293f02ed839a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
<tr class="separator:a52ee22882858d2b1cf04293f02ed839a"><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="../../d5/d90/palindrome__partitioning_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 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="../../d5/d90/palindrome__partitioning_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>
@@ -151,8 +153,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>
@@ -161,10 +162,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"> 128</span> {</div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
<div class="line"><span class="lineno"> 129</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 131</span>}</div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:98</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:98</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -182,8 +183,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int dynamic_programming::palindrome_partitioning::pal_part </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>str</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>str</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -265,7 +265,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>
@@ -287,7 +287,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 104</span> </div>
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
<div class="line"><span class="lineno"> 106</span> calculated_output[i] =</div>
<div class="line"><span class="lineno"> 107</span> <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a>(</div>
<div class="line"><span class="lineno"> 107</span> <a class="code hl_function" href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a>(</div>
<div class="line"><span class="lineno"> 108</span> custom_input[i]);</div>
<div class="line"><span class="lineno"> 109</span> }</div>
<div class="line"><span class="lineno"> 110</span> </div>
@@ -304,7 +304,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 121</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;All tests passed successfully!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 122</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>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:45</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:45</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -314,7 +314,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_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d5/d90/palindrome__partitioning_8cpp.html">palindrome_partitioning.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>

266
d5/d91/namespacesorting.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 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('d5/d91/namespacesorting.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d91/namespacesorting.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -104,76 +106,76 @@ $(document).ready(function(){initNavTree('d5/d91/namespacesorting.html','../../'
<div class="contents">
<p>for working with vectors
<a href="../../d5/d91/namespacesorting.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="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd" id="r_a034d8b276518a902962e87d3158b64fd"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a034d8b276518a902962e87d3158b64fd">binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
<tr class="memdesc:a034d8b276518a902962e87d3158b64fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Binary search function to find the most suitable pace for an element. <br /></td></tr>
<tr class="separator:a034d8b276518a902962e87d3158b64fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68" id="r_a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </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">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="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5f4bc75cca6dd8294af2d0e328006c68">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:a7bfe11bd4703eacd1dab93f25ec639c5" id="r_a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7bfe11bd4703eacd1dab93f25ec639c5">shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
<tr class="separator:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd" id="r_affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">randomized_bogosort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#affc6ee160142cd017f8c4b213437d0fd">randomized_bogosort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
<tr class="separator:affc6ee160142cd017f8c4b213437d0fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1" id="r_a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">gnomeSort</a> (T *arr, int size)</td></tr>
<tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2f8bc626eb57acae24a94636a23af6a1">gnomeSort</a> (T *arr, int size)</td></tr>
<tr class="separator:a2f8bc626eb57acae24a94636a23af6a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935" id="r_aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t size&gt; </td></tr>
<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935">gnomeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; arr)</td></tr>
<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3677f87b5b4756bc77e9e34c5f27935">gnomeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; arr)</td></tr>
<tr class="separator:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9" id="r_a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a> (T *arr, int n)</td></tr>
<tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a> (T *arr, int n)</td></tr>
<tr class="memdesc:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Function. <br /></td></tr>
<tr class="separator:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f" id="r_a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">insertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8fe6bac9e03f58abcc2ce26ef3de1b5f">insertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
<tr class="separator:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa26de383227859210f14dcf12201a079" id="r_aa26de383227859210f14dcf12201a079"><td class="memTemplParams" colspan="2">template&lt;class Iterator &gt; </td></tr>
<tr class="memitem:aa26de383227859210f14dcf12201a079"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">merge</a> (Iterator l, Iterator r, const Iterator e, char b[])</td></tr>
<tr class="memitem:aa26de383227859210f14dcf12201a079"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa26de383227859210f14dcf12201a079">merge</a> (Iterator l, Iterator r, const Iterator e, char b[])</td></tr>
<tr class="memdesc:aa26de383227859210f14dcf12201a079"><td class="mdescLeft">&#160;</td><td class="mdescRight">merges 2 sorted adjacent segments into a larger sorted segment <br /></td></tr>
<tr class="separator:aa26de383227859210f14dcf12201a079"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a140d913e42fb94176a0b2c8b29a80420" id="r_a140d913e42fb94176a0b2c8b29a80420"><td class="memTemplParams" colspan="2">template&lt;class Iterator &gt; </td></tr>
<tr class="memitem:a140d913e42fb94176a0b2c8b29a80420"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a> (const Iterator first, const Iterator last, const size_t n)</td></tr>
<tr class="memitem:a140d913e42fb94176a0b2c8b29a80420"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a> (const Iterator first, const Iterator last, const size_t n)</td></tr>
<tr class="memdesc:a140d913e42fb94176a0b2c8b29a80420"><td class="mdescLeft">&#160;</td><td class="mdescRight">bottom-up merge sort which sorts elements in a non-decreasing order <br /></td></tr>
<tr class="separator:a140d913e42fb94176a0b2c8b29a80420"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a27236b8d3df3832e1f1225576a122534" id="r_a27236b8d3df3832e1f1225576a122534"><td class="memTemplParams" colspan="2">template&lt;class Iterator &gt; </td></tr>
<tr class="memitem:a27236b8d3df3832e1f1225576a122534"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534">non_recursive_merge_sort</a> (const Iterator first, const size_t n)</td></tr>
<tr class="memitem:a27236b8d3df3832e1f1225576a122534"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a27236b8d3df3832e1f1225576a122534">non_recursive_merge_sort</a> (const Iterator first, const size_t n)</td></tr>
<tr class="memdesc:a27236b8d3df3832e1f1225576a122534"><td class="mdescLeft">&#160;</td><td class="mdescRight">bottom-up merge sort which sorts elements in a non-decreasing order <br /></td></tr>
<tr class="separator:a27236b8d3df3832e1f1225576a122534"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae97f4dd815654c4682f564afd718e824" id="r_ae97f4dd815654c4682f564afd718e824"><td class="memTemplParams" colspan="2">template&lt;class Iterator &gt; </td></tr>
<tr class="memitem:ae97f4dd815654c4682f564afd718e824"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824">non_recursive_merge_sort</a> (const Iterator first, const Iterator last)</td></tr>
<tr class="memitem:ae97f4dd815654c4682f564afd718e824"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae97f4dd815654c4682f564afd718e824">non_recursive_merge_sort</a> (const Iterator first, const Iterator last)</td></tr>
<tr class="memdesc:ae97f4dd815654c4682f564afd718e824"><td class="mdescLeft">&#160;</td><td class="mdescRight">bottom-up merge sort which sorts elements in a non-decreasing order <br /></td></tr>
<tr class="separator:ae97f4dd815654c4682f564afd718e824"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; arr)</td></tr>
<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; arr)</td></tr>
<tr class="separator:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168" id="r_a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
<tr class="separator:a9f59fe72dacc1f1218ef3c303d843168"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de" id="r_a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><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; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><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; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6eb67c2f91c98cf4464f75b5882022de">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
<tr class="separator:a6eb67c2f91c98cf4464f75b5882022de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf" id="r_ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *nums, uint64_t n)</td></tr>
<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *nums, uint64_t n)</td></tr>
<tr class="memdesc:ae3a775d99dbbb94c130a973df0cfddcf"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type <code>int</code> and name <code>n</code>, which is the size of the array. <br /></td></tr>
<tr class="separator:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a06af4f0dae2de2a2ae5b797d7aa26755" id="r_a06af4f0dae2de2a2ae5b797d7aa26755"><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="../../d5/d91/namespacesorting.html#a06af4f0dae2de2a2ae5b797d7aa26755">selectionSort</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;arr, uint64_t len)</td></tr>
<tr class="memitem:a06af4f0dae2de2a2ae5b797d7aa26755" id="r_a06af4f0dae2de2a2ae5b797d7aa26755"><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="#a06af4f0dae2de2a2ae5b797d7aa26755">selectionSort</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;arr, uint64_t len)</td></tr>
<tr class="separator:a06af4f0dae2de2a2ae5b797d7aa26755"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa" id="r_a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a> (T *arr, size_t LEN)</td></tr>
<tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a> (T *arr, size_t LEN)</td></tr>
<tr class="separator:a5669396c6a6b1e14b97589b6e37980aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4d76603c54d3dc56146e92d10a043924" id="r_a4d76603c54d3dc56146e92d10a043924"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:a4d76603c54d3dc56146e92d10a043924"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924">shell_sort</a> (T(&amp;arr)[N])</td></tr>
<tr class="memitem:a4d76603c54d3dc56146e92d10a043924"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a4d76603c54d3dc56146e92d10a043924">shell_sort</a> (T(&amp;arr)[N])</td></tr>
<tr class="separator:a4d76603c54d3dc56146e92d10a043924"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331" id="r_af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331">shell_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af2c5b92cbfe73f63f6074c61b0a45331">shell_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
<tr class="separator:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -218,31 +220,22 @@ template&lt;class T &gt; </div>
<tr>
<td class="memname">int64_t sorting::binary_search </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; T &gt; &amp;&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>val</em>, </td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>val</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>low</em>, </td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>low</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>high</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>high</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -297,8 +290,7 @@ template&lt;typename T , size_t size&gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; sorting::gnomeSort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;&#160;</td>
<td class="paramname"><em>arr</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -355,19 +347,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::gnomeSort </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>size</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>size</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -414,8 +399,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::insertionSort </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; T &gt; *&#160;</td>
<td class="paramname"><em>arr</em></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; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -466,19 +450,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::insertionSort </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</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">
@@ -522,8 +499,7 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::insertionSort_binsrch </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; T &gt; &amp;&#160;</td>
<td class="paramname"><em>arr</em></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; T &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -549,7 +525,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">for</span> (int64_t i = 1; i &lt; n; i++) {</div>
<div class="line"><span class="lineno"> 88</span> T key = arr[i];</div>
<div class="line"><span class="lineno"> 89</span> int64_t j = i - 1;</div>
<div class="line"><span class="lineno"> 90</span> int64_t loc = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a>(arr, key, 0, j);</div>
<div class="line"><span class="lineno"> 90</span> int64_t loc = <a class="code hl_function" href="#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a>(arr, key, 0, j);</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">while</span> (j &gt;= loc) {</div>
<div class="line"><span class="lineno"> 92</span> arr[j + 1] = arr[j];</div>
<div class="line"><span class="lineno"> 93</span> j--;</div>
@@ -557,7 +533,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 95</span> arr[j + 1] = key;</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="line"><span class="lineno"> 97</span>}</div>
<div class="ttc" id="anamespacesorting_html_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:63</div></div>
<div class="ttc" id="anamespacesorting_html_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:63</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -577,31 +553,22 @@ template&lt;class Iterator &gt; </div>
<tr>
<td class="memname">void sorting::merge </td>
<td>(</td>
<td class="paramtype">Iterator&#160;</td>
<td class="paramname"><em>l</em>, </td>
<td class="paramtype">Iterator</td> <td class="paramname"><span class="paramname"><em>l</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">Iterator&#160;</td>
<td class="paramname"><em>r</em>, </td>
<td class="paramtype">Iterator</td> <td class="paramname"><span class="paramname"><em>r</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>e</em>, </td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>e</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char&#160;</td>
<td class="paramname"><em>b</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">char</td> <td class="paramname"><span class="paramname"><em>b</em>[]</span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -650,19 +617,12 @@ template&lt;class Iterator &gt; </div>
<tr>
<td class="memname">void sorting::non_recursive_merge_sort </td>
<td>(</td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>first</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>last</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>last</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -676,13 +636,12 @@ template&lt;class Iterator &gt; </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_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(first, last, last - first);</div>
<div class="line"><span class="lineno"> 87</span> non_recursive_merge_sort(first, last, last - first);</div>
<div class="line"><span class="lineno"> 88</span>}</div>
<div class="ttc" id="anamespacesorting_html_a140d913e42fb94176a0b2c8b29a80420"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a></div><div class="ttdeci">void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)</div><div class="ttdoc">bottom-up merge sort which sorts elements in a non-decreasing order</div><div class="ttdef"><b>Definition</b> non_recursive_merge_sort.cpp:25</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="../../d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg" width="638" height="76"><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="../../d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg" width="638" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -698,25 +657,17 @@ template&lt;class Iterator &gt; </div>
<tr>
<td class="memname">void sorting::non_recursive_merge_sort </td>
<td>(</td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>first</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>last</em>, </td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>last</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const size_t&#160;</td>
<td class="paramname"><em>n</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const size_t</td> <td class="paramname"><span class="paramname"><em>n</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -756,7 +707,7 @@ template&lt;class Iterator &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="../../d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg" width="440" height="76"><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="../../d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg" width="440" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -772,19 +723,12 @@ template&lt;class Iterator &gt; </div>
<tr>
<td class="memname">void sorting::non_recursive_merge_sort </td>
<td>(</td>
<td class="paramtype">const Iterator&#160;</td>
<td class="paramname"><em>first</em>, </td>
<td class="paramtype">const Iterator</td> <td class="paramname"><span class="paramname"><em>first</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const size_t&#160;</td>
<td class="paramname"><em>n</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const size_t</td> <td class="paramname"><span class="paramname"><em>n</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -798,12 +742,12 @@ template&lt;class Iterator &gt; </div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 77</span> {</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(first, first + n, n);</div>
<div class="line"><span class="lineno"> 78</span> non_recursive_merge_sort(first, first + n, n);</div>
<div class="line"><span class="lineno"> 79</span>}</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="../../d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg" width="638" height="76"><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="../../d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg" width="638" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -819,8 +763,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; sorting::pigeonSort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td>
<td class="paramname"><em>arr</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -882,25 +825,17 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::quicksort </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; T &gt; *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>low</em>, </td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>low</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>high</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>high</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -951,25 +886,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; T &gt; sorting::quicksort </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; T &gt;&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>low</em>, </td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>low</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>high</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>high</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1023,8 +950,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; sorting::randomized_bogosort </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td>
<td class="paramname"><em>arr</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1071,19 +997,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::recursive_bubble_sort </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; T &gt; *&#160;</td>
<td class="paramname"><em>nums</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td> <td class="paramname"><span class="paramname"><em>nums</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>n</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>n</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1118,9 +1037,9 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 84</span> }</div>
<div class="line"><span class="lineno"> 85</span><span class="comment"></span> </div>
<div class="line"><span class="lineno"> 86</span><span class="comment"> //!&lt; calling the function after we have fixed the last element</span></div>
<div class="line"><span class="lineno"> 87</span><span class="comment"></span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(nums, n - 1);</div>
<div class="line"><span class="lineno"> 87</span><span class="comment"></span> <a class="code hl_function" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(nums, n - 1);</div>
<div class="line"><span class="lineno"> 88</span>}</div>
<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> recursive_bubble_sort.cpp:74</div></div>
<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> recursive_bubble_sort.cpp:74</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -1138,19 +1057,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::selectionSort </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>arr</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; uint64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>len</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>len</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1191,22 +1103,20 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::shell_sort </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; T &gt; *&#160;</td>
<td class="paramname"><em>arr</em></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; T &gt; *</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>function overload - when input array is of type <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>, simply send the data content and the data length to the above function. </p>
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(arr-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), arr-&gt;<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"> 76</span> shell_sort(arr-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), arr-&gt;<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"> 77</span>}</div>
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
<div class="ttc" id="anamespacesorting_html_a5669396c6a6b1e14b97589b6e37980aa"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">sorting::shell_sort</a></div><div class="ttdeci">void shell_sort(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:45</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="../../d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg" width="308" height="159"><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="../../d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg" width="308" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1222,19 +1132,12 @@ template&lt;typename T &gt; </div>
<tr>
<td class="memname">void sorting::shell_sort </td>
<td>(</td>
<td class="paramtype">T *&#160;</td>
<td class="paramname"><em>arr</em>, </td>
<td class="paramtype">T *</td> <td class="paramname"><span class="paramname"><em>arr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">size_t&#160;</td>
<td class="paramname"><em>LEN</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">size_t</td> <td class="paramname"><span class="paramname"><em>LEN</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -1257,12 +1160,7 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 60</span> }</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span>}</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="../../d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.svg" width="135" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><!-- fragment -->
</div>
</div>
<a id="a4d76603c54d3dc56146e92d10a043924" name="a4d76603c54d3dc56146e92d10a043924"></a>
@@ -1276,20 +1174,19 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">void sorting::shell_sort </td>
<td>(</td>
<td class="paramtype">T(&amp;)&#160;</td>
<td class="paramname"><em>arr</em>[N]</td><td>)</td>
<td class="paramtype">T(&amp;)</td> <td class="paramname"><span class="paramname"><em>arr</em>[N]</span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>function overload - when input array is of a known length array type </p>
<div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(arr, N);</div>
<div class="line"><span class="lineno"> 68</span> shell_sort(arr, N);</div>
<div class="line"><span class="lineno"> 69</span>}</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="../../d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg" width="308" height="60"><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="../../d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg" width="308" 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>
@@ -1305,8 +1202,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; sorting::shuffle </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td>
<td class="paramname"><em>arr</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -1347,7 +1243,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="../../d5/d91/namespacesorting.html">sorting</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>

11
d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map
View File

@@ -1,8 +1,7 @@
<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,29,155,70"/>
<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="46,29,45,19,50,10,62,5,80,3,99,5,111,11,108,16,98,10,80,8,64,10,54,14,50,20,52,28"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="203,37,307,63"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,47,187,47,187,52,155,52"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="355,37,434,63"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="308,47,339,47,339,52,308,52"/>
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="203,13,307,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="355,13,434,39"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="308,23,339,23,339,28,308,28"/>
</map>

2
d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
View File

@@ -1 +1 @@
19fa039014cc0372e81b3658367643c5
a3b514c723edd649aeae410f680d5978

15
d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="330pt" height="57pt"
viewBox="0.00 0.00 329.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="330pt" height="39pt"
viewBox="0.00 0.00 329.75 38.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 52.5)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -28,15 +28,6 @@
</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="M32.76,-30.99C28.02,-40.06 35.77,-48.5 56,-48.5 67.06,-48.5 74.39,-45.97 77.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.44,-42.82 79.07,-32.49 74.49,-42.04 81.44,-42.82"/>
</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: 3.5 KiB

15
d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="330pt" height="57pt"
viewBox="0.00 0.00 329.75 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)">
<svg width="330pt" height="39pt"
viewBox="0.00 0.00 329.75 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)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -18,15 +18,6 @@
</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="M32.76,-30.99C28.02,-40.06 35.77,-48.5 56,-48.5 67.06,-48.5 74.39,-45.97 77.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.44,-42.82 79.07,-32.49 74.49,-42.04 81.44,-42.82"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.2 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

15
d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
View File

@@ -1,10 +1,9 @@
<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,29,155,70"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,29,352,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,47,187,47,187,52,155,52"/>
<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="244,29,242,19,248,10,259,5,277,3,297,5,308,11,305,16,295,10,277,8,261,10,251,14,247,20,249,28"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,37,504,63"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,47,384,47,384,52,352,52"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,37,632,63"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,47,536,47,536,52,505,52"/>
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,5,352,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,13,504,39"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,384,23,384,28,352,28"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,13,632,39"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,23,536,23,536,28,505,28"/>
</map>

2
d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
View File

@@ -1 +1 @@
93979b499ce8c6abd1bef1cc44c4f39e
a19f33b868f3b01e094268cfb88500b5

15
d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="478pt" height="57pt"
viewBox="0.00 0.00 477.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="478pt" height="39pt"
viewBox="0.00 0.00 477.75 38.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 52.5)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -47,15 +47,6 @@
</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="M180.76,-30.99C176.02,-40.06 183.77,-48.5 204,-48.5 215.06,-48.5 222.39,-45.97 225.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.44,-42.82 227.07,-32.49 222.49,-42.04 229.44,-42.82"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB

15
d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="478pt" height="57pt"
viewBox="0.00 0.00 477.75 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)">
<svg width="478pt" height="39pt"
viewBox="0.00 0.00 477.75 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)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -37,15 +37,6 @@
</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="M180.76,-30.99C176.02,-40.06 183.77,-48.5 204,-48.5 215.06,-48.5 222.39,-45.97 225.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.44,-42.82 227.07,-32.49 222.49,-42.04 229.44,-42.82"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 3.8 KiB

7
d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
View File

@@ -1,6 +1,5 @@
<map id="sorting::shell_sort" name="sorting::shell_sort">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,130,55"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,29,302,55"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="130,40,162,40,162,45,130,45"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="211,30,205,21,208,11,220,5,240,3,261,5,272,12,269,16,259,10,240,8,222,10,212,15,210,20,215,28"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,130,31"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,5,302,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="130,16,162,16,162,21,130,21"/>
</map>

2
d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
View File

@@ -1 +1 @@
48c384bacc3e00b10c23a9298b8dbf8e
538fc8e222c1748c7c25300779c7c3dd

15
d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::shell_sort Pages: 1 -->
<svg width="231pt" height="45pt"
viewBox="0.00 0.00 230.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="231pt" height="27pt"
viewBox="0.00 0.00 230.50 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,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 41.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -45,15 +45,6 @@
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M155.64,-19.54C146.41,-28.15 153.16,-37.25 175.88,-37.25 188.3,-37.25 195.95,-34.53 198.82,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.24,-29.9 196.47,-21.01 195.43,-31.55 202.24,-29.9"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

15
d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::shell_sort Pages: 1 -->
<svg width="231pt" height="45pt"
viewBox="0.00 0.00 230.50 45.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 41.25)">
<svg width="231pt" height="27pt"
viewBox="0.00 0.00 230.50 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>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -35,14 +35,5 @@
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M155.64,-19.54C146.41,-28.15 153.16,-37.25 175.88,-37.25 188.3,-37.25 195.95,-34.53 198.82,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.24,-29.9 196.47,-21.01 195.43,-31.55 202.24,-29.9"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.1 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

4
d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.map
View File

@@ -1,4 +0,0 @@
<map id="sorting::shell_sort" name="sorting::shell_sort">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,130,55"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,30,42,21,44,11,53,5,68,3,83,5,91,12,88,16,81,10,67,8,55,10,48,14,47,20,50,28"/>
</map>

1
d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.md5
View File

@@ -1 +0,0 @@
2210290cd3408146fe6e503fc1ba5e44

55
d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph.svg
View File

@@ -1,55 +0,0 @@
<?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: sorting::shell_sort Pages: 1 -->
<svg width="101pt" height="45pt"
viewBox="0.00 0.00 101.25 45.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[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></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 41.25)">
<title>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="93.25,-19.25 0,-19.25 0,0 93.25,0 93.25,-19.25"/>
<text text-anchor="middle" x="46.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
</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="M32.03,-19.54C25.37,-28.15 30.23,-37.25 46.62,-37.25 55.59,-37.25 61.11,-34.53 63.18,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="66.66,-30.27 61.49,-21.03 59.77,-31.48 66.66,-30.27"/>
</a>
</g>
</g>
</g>
</svg>
</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

Before

Width:  |  Height:  |  Size: 2.1 KiB

30
d5/d91/namespacesorting_a5669396c6a6b1e14b97589b6e37980aa_cgraph_org.svg
View File

@@ -1,30 +0,0 @@
<?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: sorting::shell_sort Pages: 1 -->
<svg width="101pt" height="45pt"
viewBox="0.00 0.00 101.25 45.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 41.25)">
<title>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="93.25,-19.25 0,-19.25 0,0 93.25,0 93.25,-19.25"/>
<text text-anchor="middle" x="46.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
</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="M32.03,-19.54C25.37,-28.15 30.23,-37.25 46.62,-37.25 55.59,-37.25 61.11,-34.53 63.18,-30.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="66.66,-30.27 61.49,-21.03 59.77,-31.48 66.66,-30.27"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.3 KiB

15
d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
View File

@@ -1,10 +1,9 @@
<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,29,155,70"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,29,352,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,47,187,47,187,52,155,52"/>
<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="244,29,242,19,248,10,259,5,277,3,297,5,308,11,305,16,295,10,277,8,261,10,251,14,247,20,249,28"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,37,504,63"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,47,384,47,384,52,352,52"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,37,632,63"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,47,536,47,536,52,505,52"/>
<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,5,352,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,13,504,39"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,384,23,384,28,352,28"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,13,632,39"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,23,536,23,536,28,505,28"/>
</map>

2
d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
View File

@@ -1 +1 @@
93979b499ce8c6abd1bef1cc44c4f39e
a19f33b868f3b01e094268cfb88500b5

15
d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="478pt" height="57pt"
viewBox="0.00 0.00 477.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="478pt" height="39pt"
viewBox="0.00 0.00 477.75 38.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 52.5)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -47,15 +47,6 @@
</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="M180.76,-30.99C176.02,-40.06 183.77,-48.5 204,-48.5 215.06,-48.5 222.39,-45.97 225.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.44,-42.82 227.07,-32.49 222.49,-42.04 229.44,-42.82"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.0 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB

15
d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
<svg width="478pt" height="57pt"
viewBox="0.00 0.00 477.75 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)">
<svg width="478pt" height="39pt"
viewBox="0.00 0.00 477.75 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)">
<title>sorting::non_recursive_merge_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -37,15 +37,6 @@
</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="M180.76,-30.99C176.02,-40.06 183.77,-48.5 204,-48.5 215.06,-48.5 222.39,-45.97 225.99,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="229.44,-42.82 227.07,-32.49 222.49,-42.04 229.44,-42.82"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 3.8 KiB

13
d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
View File

@@ -1,10 +1,9 @@
<map id="sorting::shell_sort" name="sorting::shell_sort">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,79,130,104"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,130,80"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/data.html#" title=" " alt="" coords="182,5,298,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,76,177,40,189,35,191,40,179,45,98,81"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,79,302,104"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="130,89,162,89,162,94,130,94"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,128,298,154"/>
<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="116,102,178,121,177,126,114,108"/>
<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="211,80,205,70,208,60,220,54,240,52,261,55,272,61,269,66,259,60,240,57,222,59,212,64,210,69,215,77"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="114,51,177,33,178,38,116,57"/>
<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,55,302,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="130,65,162,65,162,70,130,70"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,104,298,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="116,78,178,97,177,102,114,84"/>
</map>

2
d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
View File

@@ -1 +1 @@
89f937537c49515816bb8c1e29d0314a
f728685de3c74cdc83b5b85362c1427c

27
d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::shell_sort Pages: 1 -->
<svg width="231pt" height="119pt"
viewBox="0.00 0.00 230.50 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="231pt" height="101pt"
viewBox="0.00 0.00 230.50 101.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,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 115.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
<title>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -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/container/vector/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="219.5,-111.25 132.25,-111.25 132.25,-92 219.5,-92 219.5,-111.25"/>
<text text-anchor="middle" x="175.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
<polygon fill="white" stroke="#666666" points="219.5,-93.25 132.25,-93.25 132.25,-74 219.5,-74 219.5,-93.25"/>
<text text-anchor="middle" x="175.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</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="M68.98,-56.66C85.37,-64.27 108.62,-74.89 129.25,-83.62 132.19,-84.87 135.25,-86.14 138.33,-87.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.74,-90.53 147.32,-91 139.35,-84.03 136.74,-90.53"/>
<path fill="none" stroke="#63b8ff" d="M82.4,-56.74C96.84,-60.94 113.81,-65.87 129.24,-70.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="128.11,-73.67 138.69,-73.1 130.07,-66.95 128.11,-73.67"/>
</a>
</g>
</g>
@@ -73,23 +73,14 @@
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4_Node000001_Node000004" class="edge">
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M82.4,-36.51C96.84,-32.31 113.81,-27.38 129.24,-22.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.07,-26.3 138.69,-20.15 128.11,-19.58 130.07,-26.3"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M155.64,-56.54C146.41,-65.15 153.16,-74.25 175.88,-74.25 188.3,-74.25 195.95,-71.53 198.82,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.24,-66.9 196.47,-58.01 195.43,-68.55 202.24,-66.9"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.6 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

27
d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: sorting::shell_sort Pages: 1 -->
<svg width="231pt" height="119pt"
viewBox="0.00 0.00 230.50 119.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 115.25)">
<svg width="231pt" height="101pt"
viewBox="0.00 0.00 230.50 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)">
<title>sorting::shell_sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -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/container/vector/data.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="219.5,-111.25 132.25,-111.25 132.25,-92 219.5,-92 219.5,-111.25"/>
<text text-anchor="middle" x="175.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
<polygon fill="white" stroke="#666666" points="219.5,-93.25 132.25,-93.25 132.25,-74 219.5,-74 219.5,-93.25"/>
<text text-anchor="middle" x="175.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</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="M68.98,-56.66C85.37,-64.27 108.62,-74.89 129.25,-83.62 132.19,-84.87 135.25,-86.14 138.33,-87.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.74,-90.53 147.32,-91 139.35,-84.03 136.74,-90.53"/>
<path fill="none" stroke="#63b8ff" d="M82.4,-56.74C96.84,-60.94 113.81,-65.87 129.24,-70.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="128.11,-73.67 138.69,-73.1 130.07,-66.95 128.11,-73.67"/>
</a>
</g>
</g>
@@ -63,22 +63,13 @@
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4_Node000001_Node000004" class="edge">
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M82.4,-36.51C96.84,-32.31 113.81,-27.38 129.24,-22.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="130.07,-26.3 138.69,-20.15 128.11,-19.58 130.07,-26.3"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M155.64,-56.54C146.41,-65.15 153.16,-74.25 175.88,-74.25 188.3,-74.25 195.95,-71.53 198.82,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.24,-66.9 196.47,-58.01 195.43,-68.55 202.24,-66.9"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.8 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

259
d5/d95/structdata__structures_1_1treap_1_1_treap.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++: data_structures::treap::Treap 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('d5/d95/structdata__structures_1_1treap_1_1_treap.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d95/structdata__structures_1_1treap_1_1_treap.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/d95/structdata__structures_1_1treap
<div class="contents">
<p>Struct representation of the treap.
<a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for data_structures::treap::Treap:</div>
<div class="dyncontent">
@@ -115,43 +117,43 @@ Collaboration diagram for data_structures::treap::Treap:</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:a5d200493aeaa02a269f6b6deda39a683" id="r_a5d200493aeaa02a269f6b6deda39a683"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683">Treap</a> ()</td></tr>
<tr class="memitem:a5d200493aeaa02a269f6b6deda39a683" id="r_a5d200493aeaa02a269f6b6deda39a683"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d200493aeaa02a269f6b6deda39a683">Treap</a> ()</td></tr>
<tr class="memdesc:a5d200493aeaa02a269f6b6deda39a683"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initialization. <br /></td></tr>
<tr class="separator:a5d200493aeaa02a269f6b6deda39a683"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aae9facaede462ad924856c4d707646d7" id="r_aae9facaede462ad924856c4d707646d7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a> (int x)</td></tr>
<tr class="memitem:aae9facaede462ad924856c4d707646d7" id="r_aae9facaede462ad924856c4d707646d7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aae9facaede462ad924856c4d707646d7">update</a> (int x)</td></tr>
<tr class="memdesc:aae9facaede462ad924856c4d707646d7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Update the subtree size of the node. <br /></td></tr>
<tr class="separator:aae9facaede462ad924856c4d707646d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a75a48584a6560de20484fbba6229fd29" id="r_a75a48584a6560de20484fbba6229fd29"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a> (int &amp;x, int t)</td></tr>
<tr class="memitem:a75a48584a6560de20484fbba6229fd29" id="r_a75a48584a6560de20484fbba6229fd29"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75a48584a6560de20484fbba6229fd29">rotate</a> (int &amp;x, int t)</td></tr>
<tr class="memdesc:a75a48584a6560de20484fbba6229fd29"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotate without breaking the property of BST. <br /></td></tr>
<tr class="separator:a75a48584a6560de20484fbba6229fd29"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6a023a4f0c42fb8ed5b3368fba1a5f2c" id="r_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a> (int &amp;x, int k)</td></tr>
<tr class="memitem:a6a023a4f0c42fb8ed5b3368fba1a5f2c" id="r_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a> (int &amp;x, int k)</td></tr>
<tr class="memdesc:a6a023a4f0c42fb8ed5b3368fba1a5f2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a value into the specified subtree (internal method) <br /></td></tr>
<tr class="separator:a6a023a4f0c42fb8ed5b3368fba1a5f2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeb4bb0db68c7c04ef9498c88c3777887" id="r_aeb4bb0db68c7c04ef9498c88c3777887"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a> (int &amp;x, int k)</td></tr>
<tr class="memitem:aeb4bb0db68c7c04ef9498c88c3777887" id="r_aeb4bb0db68c7c04ef9498c88c3777887"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a> (int &amp;x, int k)</td></tr>
<tr class="memdesc:aeb4bb0db68c7c04ef9498c88c3777887"><td class="mdescLeft">&#160;</td><td class="mdescRight">Erase a value from the specified subtree (internal method) <br /></td></tr>
<tr class="separator:aeb4bb0db68c7c04ef9498c88c3777887"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad08520c0617eb8dcfcbfa90d258aa6b2" id="r_ad08520c0617eb8dcfcbfa90d258aa6b2"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a> (int &amp;x, int k)</td></tr>
<tr class="memitem:ad08520c0617eb8dcfcbfa90d258aa6b2" id="r_ad08520c0617eb8dcfcbfa90d258aa6b2"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a> (int &amp;x, int k)</td></tr>
<tr class="memdesc:ad08520c0617eb8dcfcbfa90d258aa6b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the KTH largest value (internal method) <br /></td></tr>
<tr class="separator:ad08520c0617eb8dcfcbfa90d258aa6b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9a77d22f97add119123108211c6655ec" id="r_a9a77d22f97add119123108211c6655ec"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a> (int x, int k)</td></tr>
<tr class="memitem:a9a77d22f97add119123108211c6655ec" id="r_a9a77d22f97add119123108211c6655ec"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a> (int x, int k)</td></tr>
<tr class="memdesc:a9a77d22f97add119123108211c6655ec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Query the rank of specified element (internal method) <br /></td></tr>
<tr class="separator:a9a77d22f97add119123108211c6655ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab8b9899f22070cfa01db5bf874296126" id="r_ab8b9899f22070cfa01db5bf874296126"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a> (int k)</td></tr>
<tr class="memitem:ab8b9899f22070cfa01db5bf874296126" id="r_ab8b9899f22070cfa01db5bf874296126"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a> (int k)</td></tr>
<tr class="memdesc:ab8b9899f22070cfa01db5bf874296126"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the predecessor node of element k. <br /></td></tr>
<tr class="separator:ab8b9899f22070cfa01db5bf874296126"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a767b28f9911fc32b8462862be058a4a4" id="r_a767b28f9911fc32b8462862be058a4a4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">get_next</a> (int k)</td></tr>
<tr class="memitem:a767b28f9911fc32b8462862be058a4a4" id="r_a767b28f9911fc32b8462862be058a4a4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a767b28f9911fc32b8462862be058a4a4">get_next</a> (int k)</td></tr>
<tr class="memdesc:a767b28f9911fc32b8462862be058a4a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the successor node of element k. <br /></td></tr>
<tr class="separator:a767b28f9911fc32b8462862be058a4a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5e884d2686aff501ef589b0d1185492f" id="r_a5e884d2686aff501ef589b0d1185492f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a> (int k)</td></tr>
<tr class="memitem:a5e884d2686aff501ef589b0d1185492f" id="r_a5e884d2686aff501ef589b0d1185492f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e884d2686aff501ef589b0d1185492f">insert</a> (int k)</td></tr>
<tr class="memdesc:a5e884d2686aff501ef589b0d1185492f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert element (External method) <br /></td></tr>
<tr class="separator:a5e884d2686aff501ef589b0d1185492f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9ea2becd904e2e7d22f23a001b444469" id="r_a9ea2becd904e2e7d22f23a001b444469"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">erase</a> (int k)</td></tr>
<tr class="memitem:a9ea2becd904e2e7d22f23a001b444469" id="r_a9ea2becd904e2e7d22f23a001b444469"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ea2becd904e2e7d22f23a001b444469">erase</a> (int k)</td></tr>
<tr class="memdesc:a9ea2becd904e2e7d22f23a001b444469"><td class="mdescLeft">&#160;</td><td class="mdescRight">Erase element (External method) <br /></td></tr>
<tr class="separator:a9ea2becd904e2e7d22f23a001b444469"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab2db3ad3aecc240011e0c8b8604d2c69" id="r_ab2db3ad3aecc240011e0c8b8604d2c69"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a> (int k)</td></tr>
<tr class="memitem:ab2db3ad3aecc240011e0c8b8604d2c69" id="r_ab2db3ad3aecc240011e0c8b8604d2c69"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a> (int k)</td></tr>
<tr class="memdesc:ab2db3ad3aecc240011e0c8b8604d2c69"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the KTH largest value (External method) <br /></td></tr>
<tr class="separator:ab2db3ad3aecc240011e0c8b8604d2c69"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac94e9d69305940f6d8804031455af039" id="r_ac94e9d69305940f6d8804031455af039"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a> (int k)</td></tr>
<tr class="memitem:ac94e9d69305940f6d8804031455af039" id="r_ac94e9d69305940f6d8804031455af039"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac94e9d69305940f6d8804031455af039">get_rank</a> (int k)</td></tr>
<tr class="memdesc:ac94e9d69305940f6d8804031455af039"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the rank of specified element (External method) <br /></td></tr>
<tr class="separator:ac94e9d69305940f6d8804031455af039"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -165,18 +167,18 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>root</b> = 0</td></tr>
int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td></tr>
<tr class="memdesc:a1ab082fe0aa95a238bbbc68ab6a72425"><td class="mdescLeft">&#160;</td><td class="mdescRight">Total number of current nodes in the treap. <br /></td></tr>
<tr class="separator:a1ab082fe0aa95a238bbbc68ab6a72425"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a32db3ba3b2630943faacd27b2ecd1b04" id="r_a32db3ba3b2630943faacd27b2ecd1b04"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a> = {}</td></tr>
<tr class="memitem:a32db3ba3b2630943faacd27b2ecd1b04" id="r_a32db3ba3b2630943faacd27b2ecd1b04"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a> = {}</td></tr>
<tr class="memdesc:a32db3ba3b2630943faacd27b2ecd1b04"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> identifier. <br /></td></tr>
<tr class="separator:a32db3ba3b2630943faacd27b2ecd1b04"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8be70f0a25e53e870e97d8d23968d723" id="r_a8be70f0a25e53e870e97d8d23968d723"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a> = {}</td></tr>
<tr class="memitem:a8be70f0a25e53e870e97d8d23968d723" id="r_a8be70f0a25e53e870e97d8d23968d723"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a> = {}</td></tr>
<tr class="memdesc:a8be70f0a25e53e870e97d8d23968d723"><td class="mdescLeft">&#160;</td><td class="mdescRight">Random priority. <br /></td></tr>
<tr class="separator:a8be70f0a25e53e870e97d8d23968d723"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab99f68b79e1c4ff0f1cd6f2f0b6a545f" id="r_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memItemLeft" align="right" valign="top"><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; int, 2 &gt;, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a></td></tr>
<tr class="memitem:ab99f68b79e1c4ff0f1cd6f2f0b6a545f" id="r_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memItemLeft" align="right" valign="top"><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; int, 2 &gt;, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a></td></tr>
<tr class="separator:ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af7e6c6620ab32bc96633d101245fa919" id="r_af7e6c6620ab32bc96633d101245fa919"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a></td></tr>
<tr class="memitem:af7e6c6620ab32bc96633d101245fa919" id="r_af7e6c6620ab32bc96633d101245fa919"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a></td></tr>
<tr class="memdesc:af7e6c6620ab32bc96633d101245fa919"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maintains the subtree size for ranking query. <br /></td></tr>
<tr class="separator:af7e6c6620ab32bc96633d101245fa919"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af5f0b8263339485989f8a02ae026114c" id="r_af5f0b8263339485989f8a02ae026114c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a> = {}</td></tr>
<tr class="memitem:af5f0b8263339485989f8a02ae026114c" id="r_af5f0b8263339485989f8a02ae026114c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5f0b8263339485989f8a02ae026114c">size</a> = {}</td></tr>
<tr class="memdesc:af5f0b8263339485989f8a02ae026114c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of copies per node. <br /></td></tr>
<tr class="separator:af5f0b8263339485989f8a02ae026114c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -195,7 +197,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
<tr>
<td class="memname">data_structures::treap::Treap::Treap </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -207,13 +209,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
</div><div class="memdoc">
<p>Initialization. </p>
<div class="fragment"><div class="line"><span class="lineno"> 54</span> : <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>(1) {</div>
<div class="line"><span class="lineno"> 55</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[0] = INT32_MAX;</div>
<div class="line"><span class="lineno"> 56</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[0] = 0;</div>
<div class="fragment"><div class="line"><span class="lineno"> 54</span> : <a class="code hl_variable" href="#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>(1) {</div>
<div class="line"><span class="lineno"> 55</span> <a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[0] = INT32_MAX;</div>
<div class="line"><span class="lineno"> 56</span> <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[0] = 0;</div>
<div class="line"><span class="lineno"> 57</span> }</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a1ab082fe0aa95a238bbbc68ab6a72425"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap::treapCnt</a></div><div class="ttdeci">int treapCnt</div><div class="ttdoc">Total number of current nodes in the treap.</div><div class="ttdef"><b>Definition</b> treap.cpp:41</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a8be70f0a25e53e870e97d8d23968d723"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap::priority</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; priority</div><div class="ttdoc">Random priority.</div><div class="ttdef"><b>Definition</b> treap.cpp:43</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af5f0b8263339485989f8a02ae026114c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap::size</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; size</div><div class="ttdoc">The number of copies per node.</div><div class="ttdef"><b>Definition</b> treap.cpp:50</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a1ab082fe0aa95a238bbbc68ab6a72425"><div class="ttname"><a href="#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap::treapCnt</a></div><div class="ttdeci">int treapCnt</div><div class="ttdoc">Total number of current nodes in the treap.</div><div class="ttdef"><b>Definition</b> treap.cpp:41</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a8be70f0a25e53e870e97d8d23968d723"><div class="ttname"><a href="#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap::priority</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; priority</div><div class="ttdoc">Random priority.</div><div class="ttdef"><b>Definition</b> treap.cpp:43</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af5f0b8263339485989f8a02ae026114c"><div class="ttname"><a href="#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap::size</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; size</div><div class="ttdoc">The number of copies per node.</div><div class="ttdef"><b>Definition</b> treap.cpp:50</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -230,19 +232,12 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
<tr>
<td class="memname">void data_structures::treap::Treap::_erase </td>
<td>(</td>
<td class="paramtype">int &amp;&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">int &amp;</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</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>k</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -261,32 +256,32 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 111</span> {</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] &gt; 1) {</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]--;</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] &gt; 1) {</div>
<div class="line"><span class="lineno"> 114</span> <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]--;</div>
<div class="line"><span class="lineno"> 115</span> } <span class="comment">// If the node has more than one copy, the number of copies --</span></div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] == 0 &amp;&amp; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] == 0) {</div>
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] == 0 &amp;&amp; <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] == 0) {</div>
<div class="line"><span class="lineno"> 118</span> x = 0;</div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 120</span> } <span class="comment">// If there are no children, delete and return</span></div>
<div class="line"><span class="lineno"> 121</span> <span class="comment">// Otherwise, we need to rotate the sons and delete them</span></div>
<div class="line"><span class="lineno"> 122</span> <span class="comment">// recursively</span></div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] &gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]]);</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(x, k);</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] &gt; <a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]]);</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_function" href="#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
<div class="line"><span class="lineno"> 125</span> <a class="code hl_function" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(x, k);</div>
<div class="line"><span class="lineno"> 126</span> }</div>
<div class="line"><span class="lineno"> 127</span> } <span class="keywordflow">else</span> { <span class="comment">// Find the target value based on BST properties</span></div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k], k);</div>
<div class="line"><span class="lineno"> 128</span> <a class="code hl_function" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k], k);</div>
<div class="line"><span class="lineno"> 129</span> }</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 131</span> }</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a32db3ba3b2630943faacd27b2ecd1b04"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">data_structures::treap::Treap::key</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; key</div><div class="ttdoc">Node identifier.</div><div class="ttdef"><b>Definition</b> treap.cpp:42</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a75a48584a6560de20484fbba6229fd29"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">data_structures::treap::Treap::rotate</a></div><div class="ttdeci">void rotate(int &amp;x, int t)</div><div class="ttdoc">Rotate without breaking the property of BST.</div><div class="ttdef"><b>Definition</b> treap.cpp:70</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aae9facaede462ad924856c4d707646d7"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">data_structures::treap::Treap::update</a></div><div class="ttdeci">void update(int x)</div><div class="ttdoc">Update the subtree size of the node.</div><div class="ttdef"><b>Definition</b> treap.cpp:62</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">data_structures::treap::Treap::childs</a></div><div class="ttdeci">std::array&lt; std::array&lt; int, 2 &gt;, maxNode &gt; childs</div><div class="ttdef"><b>Definition</b> treap.cpp:44</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aeb4bb0db68c7c04ef9498c88c3777887"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap::_erase</a></div><div class="ttdeci">void _erase(int &amp;x, int k)</div><div class="ttdoc">Erase a value from the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:111</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af7e6c6620ab32bc96633d101245fa919"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">data_structures::treap::Treap::cnt</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; cnt</div><div class="ttdoc">Maintains the subtree size for ranking query.</div><div class="ttdef"><b>Definition</b> treap.cpp:48</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a32db3ba3b2630943faacd27b2ecd1b04"><div class="ttname"><a href="#a32db3ba3b2630943faacd27b2ecd1b04">data_structures::treap::Treap::key</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; key</div><div class="ttdoc">Node identifier.</div><div class="ttdef"><b>Definition</b> treap.cpp:42</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a75a48584a6560de20484fbba6229fd29"><div class="ttname"><a href="#a75a48584a6560de20484fbba6229fd29">data_structures::treap::Treap::rotate</a></div><div class="ttdeci">void rotate(int &amp;x, int t)</div><div class="ttdoc">Rotate without breaking the property of BST.</div><div class="ttdef"><b>Definition</b> treap.cpp:70</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aae9facaede462ad924856c4d707646d7"><div class="ttname"><a href="#aae9facaede462ad924856c4d707646d7">data_structures::treap::Treap::update</a></div><div class="ttdeci">void update(int x)</div><div class="ttdoc">Update the subtree size of the node.</div><div class="ttdef"><b>Definition</b> treap.cpp:62</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><div class="ttname"><a href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">data_structures::treap::Treap::childs</a></div><div class="ttdeci">std::array&lt; std::array&lt; int, 2 &gt;, maxNode &gt; childs</div><div class="ttdef"><b>Definition</b> treap.cpp:44</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aeb4bb0db68c7c04ef9498c88c3777887"><div class="ttname"><a href="#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap::_erase</a></div><div class="ttdeci">void _erase(int &amp;x, int k)</div><div class="ttdoc">Erase a value from the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:111</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af7e6c6620ab32bc96633d101245fa919"><div class="ttname"><a href="#af7e6c6620ab32bc96633d101245fa919">data_structures::treap::Treap::cnt</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; cnt</div><div class="ttdoc">Maintains the subtree size for ranking query.</div><div class="ttdef"><b>Definition</b> treap.cpp:48</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -307,19 +302,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::_get_k_th </td>
<td>(</td>
<td class="paramtype">int &amp;&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">int &amp;</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</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>k</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -339,17 +327,17 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The element ranked number k </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">if</span> (k &lt;= <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]]) {</div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">if</span> (k &lt;= <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]]) {</div>
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
<div class="line"><span class="lineno"> 141</span> }</div>
<div class="line"><span class="lineno"> 142</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> -= <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x];</div>
<div class="line"><span class="lineno"> 142</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> -= <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x];</div>
<div class="line"><span class="lineno"> 143</span> <span class="keywordflow">if</span> (k &lt;= 0) {</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x];</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x];</div>
<div class="line"><span class="lineno"> 145</span> }</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
<div class="line"><span class="lineno"> 147</span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ad08520c0617eb8dcfcbfa90d258aa6b2"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap::_get_k_th</a></div><div class="ttdeci">int _get_k_th(int &amp;x, int k)</div><div class="ttdoc">Find the KTH largest value (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:138</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ad08520c0617eb8dcfcbfa90d258aa6b2"><div class="ttname"><a href="#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap::_get_k_th</a></div><div class="ttdeci">int _get_k_th(int &amp;x, int k)</div><div class="ttdoc">Find the KTH largest value (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:138</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -370,19 +358,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::_get_rank </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</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>k</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -405,17 +386,17 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 155</span> <span class="keywordflow">if</span> (!x) {</div>
<div class="line"><span class="lineno"> 156</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 157</span> }</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">if</span> (k == <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + 1;</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">if</span> (k == <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + 1;</div>
<div class="line"><span class="lineno"> 160</span> }</div>
<div class="line"><span class="lineno"> 161</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k &lt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
<div class="line"><span class="lineno"> 161</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k &lt; <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
<div class="line"><span class="lineno"> 162</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
<div class="line"><span class="lineno"> 163</span> }</div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
<div class="line"><span class="lineno"> 166</span> }</div>
<div class="line"><span class="lineno"> 167</span> }</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9a77d22f97add119123108211c6655ec"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">data_structures::treap::Treap::_get_rank</a></div><div class="ttdeci">int _get_rank(int x, int k)</div><div class="ttdoc">Query the rank of specified element (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:154</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9a77d22f97add119123108211c6655ec"><div class="ttname"><a href="#a9a77d22f97add119123108211c6655ec">data_structures::treap::Treap::_get_rank</a></div><div class="ttdeci">int _get_rank(int x, int k)</div><div class="ttdoc">Query the rank of specified element (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:154</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -436,19 +417,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::treap::Treap::_insert </td>
<td>(</td>
<td class="paramtype">int &amp;&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">int &amp;</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</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>k</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -468,28 +442,27 @@ Here is the call graph for this function:</div>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (x) {</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]++;</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]++;</div>
<div class="line"><span class="lineno"> 88</span> } <span class="comment">// If the node already exists, the number of copies is ++</span></div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>); <span class="comment">// Insert according to BST properties</span></div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t], k);</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>); <span class="comment">// Insert according to BST properties</span></div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_function" href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t], k);</div>
<div class="line"><span class="lineno"> 92</span> <span class="comment">// After insertion, the heap properties are retained by rotation</span></div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t]] &lt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x]) {</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t]] &lt; <a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x]) {</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_function" href="#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
<div class="line"><span class="lineno"> 95</span> }</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="line"><span class="lineno"> 97</span> } <span class="keywordflow">else</span> { <span class="comment">// Create a new node</span></div>
<div class="line"><span class="lineno"> 98</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>++;</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
<div class="line"><span class="lineno"> 100</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] = 1;</div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>(); <span class="comment">// Random priority</span></div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] = 0;</div>
<div class="line"><span class="lineno"> 98</span> x = <a class="code hl_variable" href="#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>++;</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
<div class="line"><span class="lineno"> 100</span> <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] = 1;</div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x] = rand(); <span class="comment">// Random priority</span></div>
<div class="line"><span class="lineno"> 102</span> <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] = 0;</div>
<div class="line"><span class="lineno"> 103</span> }</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">data_structures::treap::Treap::_insert</a></div><div class="ttdeci">void _insert(int &amp;x, int k)</div><div class="ttdoc">Insert a value into the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:84</div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><div class="ttname"><a href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">data_structures::treap::Treap::_insert</a></div><div class="ttdeci">void _insert(int &amp;x, int k)</div><div class="ttdoc">Insert a value into the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:84</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -510,8 +483,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::treap::Treap::erase </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -529,8 +501,8 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 209</span>{ <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a3081969b2714a8101f7df28b1ce5ed2c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">data_structures::treap::Treap::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">root of the treap</div><div class="ttdef"><b>Definition</b> treap.cpp:40</div></div>
<div class="fragment"><div class="line"><span class="lineno"> 209</span>{ <a class="code hl_function" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a3081969b2714a8101f7df28b1ce5ed2c"><div class="ttname"><a href="#a3081969b2714a8101f7df28b1ce5ed2c">data_structures::treap::Treap::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">root of the treap</div><div class="ttdef"><b>Definition</b> treap.cpp:40</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -551,8 +523,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::get_k_th </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -571,7 +542,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The element ranked number x </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 215</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 215</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -592,8 +563,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::get_next </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -613,12 +583,12 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The successor </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 189</span> {</div>
<div class="line"><span class="lineno"> 190</span> <span class="keywordtype">int</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = -1;</div>
<div class="line"><span class="lineno"> 190</span> <span class="keywordtype">int</span> x = <a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = -1;</div>
<div class="line"><span class="lineno"> 191</span> <span class="keywordflow">while</span> (x) {</div>
<div class="line"><span class="lineno"> 192</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &gt; k) {</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
<div class="line"><span class="lineno"> 192</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &gt; k) {</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
<div class="line"><span class="lineno"> 194</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 195</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
<div class="line"><span class="lineno"> 195</span> x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
<div class="line"><span class="lineno"> 196</span> }</div>
<div class="line"><span class="lineno"> 197</span> }</div>
<div class="line"><span class="lineno"> 198</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
@@ -639,8 +609,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::get_predecessor </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -660,12 +629,12 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The predecessor </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> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, pre = -1;</div>
<div class="line"><span class="lineno"> 174</span> <span class="keywordtype">int</span> x = <a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, pre = -1;</div>
<div class="line"><span class="lineno"> 175</span> <span class="keywordflow">while</span> (x) {</div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k) {</div>
<div class="line"><span class="lineno"> 177</span> pre = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k) {</div>
<div class="line"><span class="lineno"> 177</span> pre = <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
<div class="line"><span class="lineno"> 178</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 179</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
<div class="line"><span class="lineno"> 179</span> x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</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> pre;</div>
@@ -685,8 +654,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int data_structures::treap::Treap::get_rank </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -705,7 +673,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The rank of element k </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 221</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 221</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -726,8 +694,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::treap::Treap::insert </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>k</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -745,7 +712,7 @@ Here is the call graph for this function:</div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 204</span>{ <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 204</span>{ <a class="code hl_function" href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -766,19 +733,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::treap::Treap::rotate </td>
<td>(</td>
<td class="paramtype">int &amp;&#160;</td>
<td class="paramname"><em>x</em>, </td>
<td class="paramtype">int &amp;</td> <td class="paramname"><span class="paramname"><em>x</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>t</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>t</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -797,12 +757,12 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">int</span> y = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t];</div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t];</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t] = x;</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">int</span> y = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t];</div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t] = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t];</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t] = x;</div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// The rotation will only change itself and its son nodes</span></div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(y);</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(y);</div>
<div class="line"><span class="lineno"> 77</span> x = y;</div>
<div class="line"><span class="lineno"> 78</span> }</div>
</div><!-- fragment --><div class="dynheader">
@@ -825,8 +785,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::treap::Treap::update </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -845,7 +804,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[x] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]];</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[x] = <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]];</div>
<div class="line"><span class="lineno"> 64</span> }</div>
</div><!-- fragment -->
</div>
@@ -949,7 +908,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="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>treap</b></li><li class="navelem"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">Treap</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>

143
d5/d96/md5_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/md5.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('d5/d96/md5_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d96/md5_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -130,34 +132,34 @@ 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:add2bf982d5dd64a45d13cba52c2b371d" id="r_add2bf982d5dd64a45d13cba52c2b371d"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::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:add2bf982d5dd64a45d13cba52c2b371d" id="r_add2bf982d5dd64a45d13cba52c2b371d"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::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:add2bf982d5dd64a45d13cba52c2b371d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotates the bits of a 32-bit unsigned integer. <br /></td></tr>
<tr class="separator:add2bf982d5dd64a45d13cba52c2b371d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af8e96bde0183c4b0a7ff04668f11e446" id="r_af8e96bde0183c4b0a7ff04668f11e446"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a> ()</td></tr>
<tr class="memitem:af8e96bde0183c4b0a7ff04668f11e446" id="r_af8e96bde0183c4b0a7ff04668f11e446"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a> ()</td></tr>
<tr class="memdesc:af8e96bde0183c4b0a7ff04668f11e446"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether integers are stored as big endian or not. <br /></td></tr>
<tr class="separator:af8e96bde0183c4b0a7ff04668f11e446"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a694712c9665051ba52b686387b87a689" id="r_a694712c9665051ba52b686387b87a689"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a> (uint32_t n)</td></tr>
<tr class="memitem:a694712c9665051ba52b686387b87a689" id="r_a694712c9665051ba52b686387b87a689"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a> (uint32_t n)</td></tr>
<tr class="memdesc:a694712c9665051ba52b686387b87a689"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets 32-bit integer to little-endian if needed. <br /></td></tr>
<tr class="separator:a694712c9665051ba52b686387b87a689"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6be48c1e6e742f9bd329f501d61dcaef" id="r_a6be48c1e6e742f9bd329f501d61dcaef"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a> (uint64_t n)</td></tr>
<tr class="memitem:a6be48c1e6e742f9bd329f501d61dcaef" id="r_a6be48c1e6e742f9bd329f501d61dcaef"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a> (uint64_t n)</td></tr>
<tr class="memdesc:a6be48c1e6e742f9bd329f501d61dcaef"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets 64-bit integer to little-endian if needed. <br /></td></tr>
<tr class="separator:a6be48c1e6e742f9bd329f501d61dcaef"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaee69c6136a841043f956de32116e348" id="r_aaee69c6136a841043f956de32116e348"><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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a> (void *sig)</td></tr>
<tr class="memitem:aaee69c6136a841043f956de32116e348" id="r_aaee69c6136a841043f956de32116e348"><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="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a> (void *sig)</td></tr>
<tr class="memdesc:aaee69c6136a841043f956de32116e348"><td class="mdescLeft">&#160;</td><td class="mdescRight">Transforms the 128-bit <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> signature into a 32 char hex string. <br /></td></tr>
<tr class="separator:aaee69c6136a841043f956de32116e348"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5341431cef7fcfc33794326e1deb2425" id="r_a5341431cef7fcfc33794326e1deb2425"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
<tr class="memitem:a5341431cef7fcfc33794326e1deb2425" id="r_a5341431cef7fcfc33794326e1deb2425"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
<tr class="memdesc:a5341431cef7fcfc33794326e1deb2425"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> algorithm itself, taking in a bytestring. <br /></td></tr>
<tr class="separator:a5341431cef7fcfc33794326e1deb2425"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88705fab5f92adf3427b4cf76ff33edb" id="r_a88705fab5f92adf3427b4cf76ff33edb"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::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:a88705fab5f92adf3427b4cf76ff33edb" id="r_a88705fab5f92adf3427b4cf76ff33edb"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::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:a88705fab5f92adf3427b4cf76ff33edb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Converts the string to bytestring and calls the main algorithm. <br /></td></tr>
<tr class="separator:a88705fab5f92adf3427b4cf76ff33edb"><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="../../d5/d96/md5_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 <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> 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="../../d5/d96/md5_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 <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> 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="../../d5/d96/md5_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>
@@ -185,8 +187,7 @@ Algorithm</h3>
<tr>
<td class="memname">void * hashing::md5::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>
@@ -201,9 +202,9 @@ Algorithm</h3>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void* Pointer to the <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> signature </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 287</span> {</div>
<div class="line"><span class="lineno"> 288</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
<div class="line"><span class="lineno"> 288</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
<div class="line"><span class="lineno"> 289</span>}</div>
<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> md5.cpp:138</div></div>
<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> md5.cpp:138</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -222,19 +223,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void * hashing::md5::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">
@@ -322,7 +316,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 205</span> <span class="comment">// We then have to add the 64-bit size of the message at the end</span></div>
<div class="line"><span class="lineno"> 206</span> <span class="comment">// When there is a conversion from int to bytestring or vice-versa</span></div>
<div class="line"><span class="lineno"> 207</span> <span class="comment">// We always need to make sure it is little endian</span></div>
<div class="line"><span class="lineno"> 208</span> uint64_t input_bitsize_le = <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">toLittleEndian64</a>(input_size * 8);</div>
<div class="line"><span class="lineno"> 208</span> uint64_t input_bitsize_le = <a class="code hl_function" href="#a6be48c1e6e742f9bd329f501d61dcaef">toLittleEndian64</a>(input_size * 8);</div>
<div class="line"><span class="lineno"> 209</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 8; i++) {</div>
<div class="line"><span class="lineno"> 210</span> padded_message[padded_message_size - 8 + i] =</div>
<div class="line"><span class="lineno"> 211</span> (input_bitsize_le &gt;&gt; (56 - 8 * i)) &amp; 0xFF;</div>
@@ -368,12 +362,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 251</span> }</div>
<div class="line"><span class="lineno"> 252</span> </div>
<div class="line"><span class="lineno"> 253</span> <span class="comment">// Update the accumulators</span></div>
<div class="line"><span class="lineno"> 254</span> F += A + K[i] + <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">toLittleEndian32</a>(blocks[g]);</div>
<div class="line"><span class="lineno"> 254</span> F += A + K[i] + <a class="code hl_function" href="#a694712c9665051ba52b686387b87a689">toLittleEndian32</a>(blocks[g]);</div>
<div class="line"><span class="lineno"> 255</span> </div>
<div class="line"><span class="lineno"> 256</span> A = D;</div>
<div class="line"><span class="lineno"> 257</span> D = C;</div>
<div class="line"><span class="lineno"> 258</span> C = B;</div>
<div class="line"><span class="lineno"> 259</span> B += <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">leftRotate32bits</a>(F, s[i]);</div>
<div class="line"><span class="lineno"> 259</span> B += <a class="code hl_function" href="#add2bf982d5dd64a45d13cba52c2b371d">leftRotate32bits</a>(F, s[i]);</div>
<div class="line"><span class="lineno"> 260</span> }</div>
<div class="line"><span class="lineno"> 261</span> <span class="comment">// Update the state with this chunk&#39;s hash</span></div>
<div class="line"><span class="lineno"> 262</span> a0 += A;</div>
@@ -399,9 +393,9 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</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="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:89</div></div>
<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:102</div></div>
<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> md5.cpp:66</div></div>
<div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:89</div></div>
<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:102</div></div>
<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> md5.cpp:66</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>
@@ -423,7 +417,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>
@@ -442,8 +436,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 354</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"> 355</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"> 356</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"> 357</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(input);</div>
<div class="line"><span class="lineno"> 358</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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 357</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(input);</div>
<div class="line"><span class="lineno"> 358</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="#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 359</span> </div>
<div class="line"><span class="lineno"> 360</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><span class="lineno"> 361</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>
@@ -462,8 +456,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="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::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> md5.cpp:287</div></div>
<div class="ttc" id="amd5_8cpp_html_aaee69c6136a841043f956de32116e348"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 128-bit MD5 signature into a 32 char hex string.</div><div class="ttdef"><b>Definition</b> md5.cpp:122</div></div>
<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::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> md5.cpp:287</div></div>
<div class="ttc" id="amd5_8cpp_html_aaee69c6136a841043f956de32116e348"><div class="ttname"><a href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 128-bit MD5 signature into a 32 char hex string.</div><div class="ttdef"><b>Definition</b> md5.cpp:122</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -481,7 +475,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool hashing::md5::isBigEndian </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -517,19 +511,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint32_t hashing::md5::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">
@@ -564,8 +551,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>
@@ -574,19 +560,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"> 376</span> {</div>
<div class="line"><span class="lineno"> 377</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 377</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"> 378</span> </div>
<div class="line"><span class="lineno"> 379</span> <span class="comment">// Launch interactive mode where user can input messages and see</span></div>
<div class="line"><span class="lineno"> 380</span> <span class="comment">// their hash</span></div>
<div class="line"><span class="lineno"> 381</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
<div class="line"><span class="lineno"> 381</span> <a class="code hl_function" href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
<div class="line"><span class="lineno"> 382</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 383</span>}</div>
<div class="ttc" id="amd5_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known MD5 hashes.</div><div class="ttdef"><b>Definition</b> md5.cpp:297</div></div>
<div class="ttc" id="amd5_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="../../d5/d96/md5_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 MD5 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> md5.cpp:351</div></div>
<div class="ttc" id="amd5_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 MD5 hashes.</div><div class="ttdef"><b>Definition</b> md5.cpp:297</div></div>
<div class="ttc" id="amd5_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 MD5 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> md5.cpp:351</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="../../d5/d96/md5_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="../../d5/d96/md5_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>
@@ -600,8 +586,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::md5::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>
@@ -646,7 +631,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>
@@ -661,57 +646,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"> 297</span> {</div>
<div class="line"><span class="lineno"> 298</span> <span class="comment">// Hashes empty string and stores signature</span></div>
<div class="line"><span class="lineno"> 299</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 299</span> <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 300</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"> 301</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 302</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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 302</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="#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 303</span> <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
<div class="line"><span class="lineno"> 304</span> assert(hashing::md5::sig2hex(sig).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 304</span> assert(hashing::md5::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 305</span> <span class="stringliteral">&quot;d41d8cd98f00b204e9800998ecf8427e&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 306</span> </div>
<div class="line"><span class="lineno"> 307</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"> 308</span> <span class="keywordtype">void</span>* sig2 =</div>
<div class="line"><span class="lineno"> 309</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
<div class="line"><span class="lineno"> 309</span> <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
<div class="line"><span class="lineno"> 310</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"> 311</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"> 312</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 313</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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 313</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="#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 314</span> <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
<div class="line"><span class="lineno"> 315</span> assert(hashing::md5::sig2hex(sig2).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 315</span> assert(hashing::md5::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 316</span> <span class="stringliteral">&quot;9e107d9d372bb6826bd81d3542a419d6&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 317</span> </div>
<div class="line"><span class="lineno"> 318</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"> 319</span> <span class="comment">// additional period) and stores signature</span></div>
<div class="line"><span class="lineno"> 320</span> <span class="keywordtype">void</span>* sig3 =</div>
<div class="line"><span class="lineno"> 321</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
<div class="line"><span class="lineno"> 321</span> <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
<div class="line"><span class="lineno"> 322</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"> 323</span> <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
<div class="line"><span class="lineno"> 324</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"> 325</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 326</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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 326</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="#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 327</span> <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
<div class="line"><span class="lineno"> 328</span> assert(hashing::md5::sig2hex(sig3).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 328</span> assert(hashing::md5::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 329</span> <span class="stringliteral">&quot;e4d909c290d0fb1ca068ffaddf22cbd0&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 330</span> </div>
<div class="line"><span class="lineno"> 331</span> <span class="comment">// Hashes &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
<div class="line"><span class="lineno"> 332</span> <span class="comment">// and stores signature</span></div>
<div class="line"><span class="lineno"> 333</span> <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(</div>
<div class="line"><span class="lineno"> 333</span> <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(</div>
<div class="line"><span class="lineno"> 334</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
<div class="line"><span class="lineno"> 335</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"> 336</span> &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
<div class="line"><span class="lineno"> 337</span> <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
<div class="line"><span class="lineno"> 338</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"> 339</span> <span class="comment">// Prints signature hex representation</span></div>
<div class="line"><span class="lineno"> 340</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="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 340</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="#aaee69c6136a841043f956de32116e348">hashing::md5::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"> 341</span> <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
<div class="line"><span class="lineno"> 342</span> assert(hashing::md5::sig2hex(sig4).<a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>(</div>
<div class="line"><span class="lineno"> 342</span> assert(hashing::md5::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
<div class="line"><span class="lineno"> 343</span> <span class="stringliteral">&quot;d174ab98d277d9f5a5611c2c9f419d9f&quot;</span>) == 0);</div>
<div class="line"><span class="lineno"> 344</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="../../d5/d96/md5_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="../../d5/d96/md5_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>
@@ -725,8 +710,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint32_t hashing::md5::toLittleEndian32 </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>
@@ -741,14 +725,14 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>uint32_t param n with binary representation as little-endian </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 89</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> ((n &lt;&lt; 24) &amp; 0xFF000000) | ((n &lt;&lt; 8) &amp; 0x00FF0000) |</div>
<div class="line"><span class="lineno"> 92</span> ((n &gt;&gt; 8) &amp; 0x0000FF00) | ((n &gt;&gt; 24) &amp; 0x000000FF);</div>
<div class="line"><span class="lineno"> 93</span> }</div>
<div class="line"><span class="lineno"> 94</span> <span class="comment">// Machine works on little endian, no need to change anything</span></div>
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">return</span> n;</div>
<div class="line"><span class="lineno"> 96</span>}</div>
<div class="ttc" id="amd5_8cpp_html_af8e96bde0183c4b0a7ff04668f11e446"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a></div><div class="ttdeci">bool isBigEndian()</div><div class="ttdoc">Checks whether integers are stored as big endian or not.</div><div class="ttdef"><b>Definition</b> md5.cpp:76</div></div>
<div class="ttc" id="amd5_8cpp_html_af8e96bde0183c4b0a7ff04668f11e446"><div class="ttname"><a href="#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a></div><div class="ttdeci">bool isBigEndian()</div><div class="ttdoc">Checks whether integers are stored as big endian or not.</div><div class="ttdef"><b>Definition</b> md5.cpp:76</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -766,8 +750,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint64_t hashing::md5::toLittleEndian64 </td>
<td>(</td>
<td class="paramtype">uint64_t&#160;</td>
<td class="paramname"><em>n</em></td><td>)</td>
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -782,7 +765,7 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>uint64_t param n with binary representation as little-endian </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 102</span> {</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> ((n &lt;&lt; 56) &amp; 0xFF00000000000000) |</div>
<div class="line"><span class="lineno"> 105</span> ((n &lt;&lt; 40) &amp; 0x00FF000000000000) |</div>
<div class="line"><span class="lineno"> 106</span> ((n &lt;&lt; 24) &amp; 0x0000FF0000000000) |</div>
@@ -810,7 +793,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="../../d5/d96/md5_8cpp.html">md5.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
d5/d96/md5_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 MD5 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 MD5 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
d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
0599599396fb22085f970483d20d91d7
9765448a7ce92ef05584fe32008f3e3a

38
d5/d96/md5_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 MD5 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
d5/d96/md5_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 MD5 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
d5/d96/md5_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
d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
eeab4aa51b36d3583b18561e5c95b512
3d8b2b9cd69f1ea490052a32c17a74f8

76
d5/d96/md5_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="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and MD5 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="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known MD5 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
d5/d96/md5_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="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and MD5 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="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known MD5 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.2 KiB

17
d5/da1/structnode.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++: node 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('d5/da1/structnode.html','../../'); initResizable(); });
$(function(){initNavTree('d5/da1/structnode.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,7 +114,7 @@ Collaboration diagram for node:</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:aa2c7b5711cccdc70afa02d02bd6d2586" id="r_aa2c7b5711cccdc70afa02d02bd6d2586"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html#aa2c7b5711cccdc70afa02d02bd6d2586">node</a> (int d)</td></tr>
<tr class="memitem:aa2c7b5711cccdc70afa02d02bd6d2586" id="r_aa2c7b5711cccdc70afa02d02bd6d2586"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa2c7b5711cccdc70afa02d02bd6d2586">node</a> (int d)</td></tr>
<tr class="separator:aa2c7b5711cccdc70afa02d02bd6d2586"><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>
@@ -164,8 +166,7 @@ char&#160;</td><td class="memItemRight" valign="bottom"><b>color</b></td></tr>
<tr>
<td class="memname">node::node </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>d</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>d</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -201,7 +202,7 @@ char&#160;</td><td class="memItemRight" valign="bottom"><b>color</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/da1/structnode.html">node</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
d5/da7/namespacejarvis.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++: jarvis 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('d5/da7/namespacejarvis.html','../../'); initResizable(); });
$(function(){initNavTree('d5/da7/namespacejarvis.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/da7/namespacejarvis.html','../../')
<div class="contents">
<p>Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm.
<a href="../../d5/da7/namespacejarvis.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/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/da7/namespacejarvis.html','../../')
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/da7/namespacejarvis.html">jarvis</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>

83
d5/dab/structdata__structures_1_1list__array_1_1list.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++: data_structures::list_array::list&lt; N &gt; Struct 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('d5/dab/structdata__structures_1_1list__array_1_1list.html','../../'); initResizable(); });
$(function(){initNavTree('d5/dab/structdata__structures_1_1list__array_1_1list.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +108,7 @@ $(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list_
<div class="contents">
<p>Structure of List with supporting methods.
<a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for data_structures::list_array::list&lt; N &gt;:</div>
<div class="dyncontent">
@@ -115,30 +117,30 @@ Collaboration diagram for data_structures::list_array::list&lt; N &gt;:</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:a412bdb3910181f3c384d86aee7e217cf" id="r_a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
<tr class="memitem:a412bdb3910181f3c384d86aee7e217cf" id="r_a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
<tr class="memdesc:a412bdb3910181f3c384d86aee7e217cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element in the list using binarySearch. <br /></td></tr>
<tr class="separator:a412bdb3910181f3c384d86aee7e217cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9" id="r_ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9" id="r_ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
<tr class="memdesc:ad202ae68fe8d98082afa9dafea9e22b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element using linear search. <br /></td></tr>
<tr class="separator:ad202ae68fe8d98082afa9dafea9e22b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b5d794b245ba8e126220171cc8ef7fb" id="r_a0b5d794b245ba8e126220171cc8ef7fb"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b5d794b245ba8e126220171cc8ef7fb">search</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:a0b5d794b245ba8e126220171cc8ef7fb" id="r_a0b5d794b245ba8e126220171cc8ef7fb"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b5d794b245ba8e126220171cc8ef7fb">search</a> (const uint64_t &amp;val)</td></tr>
<tr class="separator:a0b5d794b245ba8e126220171cc8ef7fb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a133635ad53bd89e3947ca02448819180" id="r_a133635ad53bd89e3947ca02448819180"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">sort</a> ()</td></tr>
<tr class="memitem:a133635ad53bd89e3947ca02448819180" id="r_a133635ad53bd89e3947ca02448819180"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a133635ad53bd89e3947ca02448819180">sort</a> ()</td></tr>
<tr class="memdesc:a133635ad53bd89e3947ca02448819180"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sort the list. <br /></td></tr>
<tr class="separator:a133635ad53bd89e3947ca02448819180"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa960d714d449612f25256850d72325f1" id="r_aa960d714d449612f25256850d72325f1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:aa960d714d449612f25256850d72325f1" id="r_aa960d714d449612f25256850d72325f1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa960d714d449612f25256850d72325f1">insert</a> (const uint64_t &amp;val)</td></tr>
<tr class="memdesc:aa960d714d449612f25256850d72325f1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert the new element in the list. <br /></td></tr>
<tr class="separator:aa960d714d449612f25256850d72325f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a98f7d9079c0868e0f4e67d5c52174fb6" id="r_a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a> (const uint64_t &amp;val)</td></tr>
<tr class="memitem:a98f7d9079c0868e0f4e67d5c52174fb6" id="r_a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a> (const uint64_t &amp;val)</td></tr>
<tr class="memdesc:a98f7d9079c0868e0f4e67d5c52174fb6"><td class="mdescLeft">&#160;</td><td class="mdescRight">To remove the element from the list. <br /></td></tr>
<tr class="separator:a98f7d9079c0868e0f4e67d5c52174fb6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b7acf65026df1e9dd13eebf309dda5e" id="r_a0b7acf65026df1e9dd13eebf309dda5e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a> ()</td></tr>
<tr class="memitem:a0b7acf65026df1e9dd13eebf309dda5e" id="r_a0b7acf65026df1e9dd13eebf309dda5e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b7acf65026df1e9dd13eebf309dda5e">show</a> ()</td></tr>
<tr class="memdesc:a0b7acf65026df1e9dd13eebf309dda5e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print array. <br /></td></tr>
<tr class="separator:a0b7acf65026df1e9dd13eebf309dda5e"><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>
Public Attributes</h2></td></tr>
<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00" id="r_a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0c9737eb5b4938531d3633b4915e9e00">data</a> {}</td></tr>
<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00" id="r_a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0c9737eb5b4938531d3633b4915e9e00">data</a> {}</td></tr>
<tr class="separator:a0c9737eb5b4938531d3633b4915e9e00"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad6835623d5397d0c22e68bf0cdd7c3dc" id="r_ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memItemLeft" align="right" valign="top"><a id="ad6835623d5397d0c22e68bf0cdd7c3dc" name="ad6835623d5397d0c22e68bf0cdd7c3dc"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
@@ -165,31 +167,22 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::BinarySearch </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;&#160;</td>
<td class="paramname"><em>dataArr</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>dataArr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>first</em>, </td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>first</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>last</em>, </td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>last</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_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 uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -221,16 +214,16 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">return</span> mid;</div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// if current mid value is greater than element we have to search in first half</span></div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &lt; dataArr[mid])</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// if current mid value is greater than element we have to search in second half</span></div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &gt; dataArr[mid])</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
<div class="line"><span class="lineno"> 61</span> </div>
<div class="line"><span class="lineno"> 62</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: Undefined condition\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 64</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::cerr</a></div></div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition</b> list_array.cpp:45</div></div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition</b> list_array.cpp:45</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -253,8 +246,7 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::insert </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em></td><td>)</td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -323,19 +315,12 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::LinearSearch </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;&#160;</td>
<td class="paramname"><em>dataArr</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>dataArr</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span>&#160;) const</td>
</tr>
</table>
</td>
@@ -381,8 +366,7 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::remove </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em></td><td>)</td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -434,8 +418,7 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::search </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em></td><td>)</td>
<td class="paramtype">const uint64_t &amp;</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -449,9 +432,9 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 89</span> uint64_t pos; <span class="comment">// pos variable to store index value of element.</span></div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// if list is sorted, binary search works efficiently else linear search is the only option</span></div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (isSorted) {</div>
<div class="line"><span class="lineno"> 92</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(data, 0, top - 1, val);</div>
<div class="line"><span class="lineno"> 92</span> pos = <a class="code hl_function" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(data, 0, top - 1, val);</div>
<div class="line"><span class="lineno"> 93</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 94</span> pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a>(data, val);</div>
<div class="line"><span class="lineno"> 94</span> pos = <a class="code hl_function" href="#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a>(data, val);</div>
<div class="line"><span class="lineno"> 95</span> }</div>
<div class="line"><span class="lineno"> 96</span> <span class="comment">// if index is equal to -1 means element does not present</span></div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// else print the index of that element</span></div>
@@ -463,7 +446,7 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 103</span> <span class="comment">// return the index of element or -1.</span></div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> pos;</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> list_array.cpp:72</div></div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> list_array.cpp:72</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -481,7 +464,7 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::show </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -518,7 +501,7 @@ template&lt;uint64_t N&gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::sort </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -583,7 +566,7 @@ template&lt;uint64_t N&gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>list_array</b></li><li class="navelem"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.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>

40
d5/db0/adaline__learning_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++: machine_learning/adaline_learning.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('d5/db0/adaline__learning_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/db0/adaline__learning_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -136,13 +138,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:a52053d88ea1bcbbed9aca67ab4eeb499" id="r_a52053d88ea1bcbbed9aca67ab4eeb499"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a> (double eta=0.01)</td></tr>
<tr class="memitem:a52053d88ea1bcbbed9aca67ab4eeb499" id="r_a52053d88ea1bcbbed9aca67ab4eeb499"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a> (double eta=0.01)</td></tr>
<tr class="separator:a52053d88ea1bcbbed9aca67ab4eeb499"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a379f7488a305f2571f2932b319931f82" id="r_a379f7488a305f2571f2932b319931f82"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">test2</a> (double eta=0.01)</td></tr>
<tr class="memitem:a379f7488a305f2571f2932b319931f82" id="r_a379f7488a305f2571f2932b319931f82"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a379f7488a305f2571f2932b319931f82">test2</a> (double eta=0.01)</td></tr>
<tr class="separator:a379f7488a305f2571f2932b319931f82"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a992bdf1fdb0b9d414bcf7981d2d87aa9" id="r_a992bdf1fdb0b9d414bcf7981d2d87aa9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a> (double eta=0.01)</td></tr>
<tr class="memitem:a992bdf1fdb0b9d414bcf7981d2d87aa9" id="r_a992bdf1fdb0b9d414bcf7981d2d87aa9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a> (double eta=0.01)</td></tr>
<tr class="separator:a992bdf1fdb0b9d414bcf7981d2d87aa9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
<tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
<tr class="separator:a3c04138a5bfe5d72780bb7e82a18e627"><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>
@@ -170,19 +172,12 @@ Variables</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 **&#160;</td>
<td class="paramname"><em>argv</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">char **</td> <td class="paramname"><span class="paramname"><em>argv</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -235,8 +230,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test1 </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>eta</em> = <code>0.01</code></td><td>)</td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>eta</em><span class="paramdefsep"> = </span><span class="paramdefval">0.01</span></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -298,8 +292,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test2 </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>eta</em> = <code>0.01</code></td><td>)</td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>eta</em><span class="paramdefsep"> = </span><span class="paramdefval">0.01</span></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -367,8 +360,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test3 </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>eta</em> = <code>0.01</code></td><td>)</td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>eta</em><span class="paramdefsep"> = </span><span class="paramdefval">0.01</span></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -436,7 +428,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_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html">adaline_learning.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
d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
View File

@@ -1,49 +1,53 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,204,55,230"/>
<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="107,80,178,106"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,202,62,161,101,115,102,113,106,117,105,119,66,164,41,205"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,129,182,155"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,201,101,164,105,162,108,166,104,168,51,206"/>
<area shape="rect" id="Node000004" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="117,179,168,204"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,209,101,198,103,203,56,214"/>
<area shape="rect" id="Node000016" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="117,228,168,254"/>
<area shape="poly" id="edge20_Node000001_Node000016" title=" " alt="" coords="56,219,103,230,101,235,55,225"/>
<area shape="rect" id="Node000017" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="117,277,168,303"/>
<area shape="poly" id="edge24_Node000001_Node000017" title=" " alt="" coords="51,228,104,264,108,267,105,271,101,268,48,232"/>
<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,327,179,352"/>
<area shape="poly" id="edge27_Node000001_Node000020" title=" " alt="" coords="41,229,67,269,105,314,106,315,102,319,101,317,62,272,36,232"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/at.html#" title=" " alt="" coords="233,129,335,155"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="167,180,230,158,232,163,169,185"/>
<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="250,255,318,280"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="169,202,246,245,244,249,167,207"/>
<area shape="rect" id="Node000011" 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="232,179,336,204"/>
<area shape="poly" id="edge13_Node000004_Node000011" title=" " alt="" coords="168,189,217,189,217,194,168,194"/>
<area shape="rect" id="Node000007" 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="413,304,514,330"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="319,274,400,297,399,302,318,279"/>
<area shape="rect" id="Node000009" 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="415,353,512,379"/>
<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="302,279,339,309,388,340,402,346,400,351,385,345,336,313,298,283"/>
<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="426,255,501,280"/>
<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="319,265,411,265,411,270,319,270"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="589,255,680,280"/>
<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="510,301,573,282,574,287,512,306"/>
<area shape="poly" id="edge8_Node000008_Node000008" title=" " alt="" coords="605,256,600,246,603,236,615,230,634,228,655,231,666,237,663,242,653,236,634,233,617,235,607,240,605,245,610,253"/>
<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="511,352,539,340,576,316,607,289,611,293,579,320,542,345,513,357"/>
<area shape="poly" id="edge12_Node000010_Node000008" title=" " alt="" coords="501,265,573,265,573,270,501,270"/>
<area shape="poly" id="edge14_Node000011_Node000008" title=" " alt="" coords="337,198,541,240,574,248,573,253,540,245,336,203"/>
<area shape="rect" id="Node000012" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="416,5,511,31"/>
<area shape="poly" id="edge15_Node000011_Node000012" title=" " alt="" coords="323,176,336,166,348,150,354,135,359,103,364,72,371,56,385,40,400,29,403,34,388,44,376,59,369,74,364,104,360,136,353,153,340,169,326,180"/>
<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="427,55,500,80"/>
<area shape="poly" id="edge17_Node000011_Node000013" title=" " alt="" coords="321,176,337,166,352,147,359,128,367,109,385,89,411,75,414,80,388,94,372,111,364,130,356,149,340,169,324,180"/>
<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="429,104,498,130"/>
<area shape="poly" id="edge18_Node000011_Node000014" title=" " alt="" coords="315,176,337,165,385,138,413,128,415,133,387,143,340,170,317,181"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="5,155,55,180"/>
<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="107,31,178,56"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,153,62,112,101,66,102,64,106,68,105,69,66,115,41,156"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,80,182,106"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,152,101,115,105,112,108,117,104,119,51,156"/>
<area shape="rect" id="Node000004" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="117,129,168,155"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,159,101,149,103,154,56,165"/>
<area shape="rect" id="Node000016" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="117,179,168,204"/>
<area shape="poly" id="edge20_Node000001_Node000016" title=" " alt="" coords="56,170,103,180,101,186,55,175"/>
<area shape="rect" id="Node000017" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="117,228,168,254"/>
<area shape="poly" id="edge24_Node000001_Node000017" title=" " alt="" coords="51,179,104,215,108,217,105,222,101,219,48,183"/>
<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,277,179,303"/>
<area shape="poly" id="edge30_Node000001_Node000021" title=" " alt="" coords="41,179,67,220,105,264,106,266,102,270,101,268,62,223,36,182"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/at.html#" title=" " alt="" coords="233,80,335,106"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="167,131,230,109,232,114,169,136"/>
<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="250,129,318,155"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="168,140,235,140,235,145,168,145"/>
<area shape="rect" id="Node000011" 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="232,204,336,230"/>
<area shape="poly" id="edge13_Node000004_Node000011" title=" " alt="" coords="169,153,246,194,243,199,167,158"/>
<area shape="rect" id="Node000007" 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="413,5,514,31"/>
<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="317,128,337,116,352,97,359,78,367,59,385,40,398,32,400,37,388,44,372,62,364,80,356,100,340,120,320,133"/>
<area shape="rect" id="Node000009" 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="415,55,512,80"/>
<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="315,126,337,116,385,89,399,83,401,88,387,94,340,121,317,131"/>
<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="426,104,501,130"/>
<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="318,135,411,122,412,127,319,140"/>
<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="589,104,680,130"/>
<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="515,28,542,40,579,65,611,91,607,95,576,69,539,45,513,33"/>
<area shape="poly" id="edge8_Node000008_Node000008" title=" " alt="" coords="605,105,600,95,603,86,615,80,634,77,655,80,666,87,663,91,653,85,634,83,617,85,607,89,605,95,610,102"/>
<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="512,78,574,97,573,102,510,84"/>
<area shape="poly" id="edge12_Node000010_Node000008" title=" " alt="" coords="501,114,573,114,573,120,501,120"/>
<area shape="poly" id="edge14_Node000011_Node000008" title=" " alt="" coords="337,218,433,214,488,205,540,189,578,166,609,139,613,143,581,171,542,194,489,210,434,219,337,223"/>
<area shape="rect" id="Node000012" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="416,255,511,280"/>
<area shape="poly" id="edge15_Node000011_Node000012" title=" " alt="" coords="333,228,402,247,401,253,332,233"/>
<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="598,367,671,392"/>
<area shape="poly" id="edge17_Node000011_Node000013" title=" " alt="" coords="301,228,339,259,388,290,429,309,463,319,541,341,587,358,585,363,540,346,461,324,427,314,385,295,336,263,298,232"/>
<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="429,356,498,382"/>
<area shape="poly" id="edge18_Node000011_Node000014" title=" " alt="" coords="296,229,332,279,358,309,388,335,416,351,413,355,385,339,354,312,328,283,291,232"/>
<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="424,153,503,179"/>
<area shape="poly" id="edge19_Node000011_Node000015" title=" " alt="" coords="336,182,409,171,409,176,337,187"/>
<area shape="poly" id="edge16_Node000012_Node000008" title=" " alt="" coords="512,24,542,40,563,62,580,88,606,142,623,196,632,239,627,240,618,197,601,144,576,90,559,66,539,44,510,28"/>
<area shape="poly" id="edge21_Node000016_Node000005" title=" " alt="" coords="165,225,180,215,204,189,228,164,233,161,236,165,232,168,207,193,184,219,169,230"/>
<area shape="poly" id="edge22_Node000016_Node000006" title=" " alt="" coords="168,243,235,256,234,261,167,248"/>
<area shape="poly" id="edge23_Node000016_Node000011" title=" " alt="" coords="167,230,230,207,232,212,169,235"/>
<area shape="rect" id="Node000018" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="230,353,338,379"/>
<area shape="poly" id="edge25_Node000017_Node000018" title=" " alt="" coords="169,301,246,343,244,348,167,306"/>
<area shape="rect" id="Node000019" 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="386,403,541,428"/>
<area shape="poly" id="edge26_Node000018_Node000019" title=" " alt="" coords="334,377,400,395,399,401,333,382"/>
<area shape="poly" id="edge19_Node000011_Node000015" title=" " alt="" coords="332,201,409,179,410,184,333,206"/>
<area shape="poly" id="edge16_Node000012_Node000008" title=" " alt="" coords="506,252,539,233,563,212,584,188,616,142,620,145,588,191,566,216,542,238,508,256"/>
<area shape="poly" id="edge21_Node000016_Node000005" title=" " alt="" coords="165,176,180,166,204,140,228,115,233,111,236,116,232,119,207,143,184,169,169,180"/>
<area shape="poly" id="edge22_Node000016_Node000006" title=" " alt="" coords="167,180,234,157,236,162,169,185"/>
<area shape="poly" id="edge23_Node000016_Node000011" title=" " alt="" coords="168,193,218,202,217,208,167,199"/>
<area shape="rect" id="Node000018" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="230,429,338,455"/>
<area shape="poly" id="edge25_Node000017_Node000018" title=" " alt="" coords="170,252,184,263,214,301,240,341,275,414,270,416,235,344,210,304,180,267,166,256"/>
<area shape="rect" id="Node000019" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="435,429,492,455"/>
<area shape="poly" id="edge26_Node000018_Node000019" title=" " alt="" coords="339,440,420,440,420,445,339,445"/>
<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="386,479,541,504"/>
<area shape="poly" id="edge29_Node000018_Node000020" title=" " alt="" coords="334,453,400,471,399,477,333,458"/>
<area shape="poly" id="edge28_Node000019_Node000013" title=" " alt="" coords="491,429,583,395,585,400,493,434"/>
<area shape="poly" id="edge27_Node000019_Node000019" title=" " alt="" coords="434,430,429,421,432,411,444,405,464,403,484,405,495,412,492,416,483,410,463,408,446,410,436,415,434,420,439,428"/>
</map>

2
d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
View File

@@ -1 +1 @@
26cfac60c49e214268fcb6aee8cbc5fe
2d746614e5391ad72fa6def9f273d066

238
d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 325 -->
<!--zoomable 382 -->
<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 = 514;
var viewHeight = 325;
var viewHeight = 382;
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=" ">
<polygon fill="#999999" stroke="#666666" points="37,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-262.25 0,-262.25 0,-243 37,-243 37,-262.25"/>
<text text-anchor="middle" x="18.5" y="-248.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -67,8 +67,8 @@ var sectionId = 'dynsection-1';
<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="129.5,-261.25 76,-261.25 76,-242 129.5,-242 129.5,-261.25"/>
<text text-anchor="middle" x="102.75" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="129.5,-355.25 76,-355.25 76,-336 129.5,-336 129.5,-355.25"/>
<text text-anchor="middle" x="102.75" y="-341.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
@@ -76,8 +76,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="M24.87,-168.55C33.51,-183.86 51.69,-213.56 73,-233.62 73.39,-233.99 73.78,-234.35 74.18,-234.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-237.46 82.12,-240.69 76.24,-231.87 72.03,-237.46"/>
<path fill="none" stroke="#63b8ff" d="M24.87,-262.55C33.51,-277.86 51.69,-307.56 73,-327.62 73.39,-327.99 73.78,-328.35 74.18,-328.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-331.46 82.12,-334.69 76.24,-325.87 72.03,-331.46"/>
</a>
</g>
</g>
@@ -85,8 +85,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/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.5,-224.25 73,-224.25 73,-205 132.5,-205 132.5,-224.25"/>
<text text-anchor="middle" x="102.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
<polygon fill="white" stroke="#666666" points="132.5,-318.25 73,-318.25 73,-299 132.5,-299 132.5,-318.25"/>
<text text-anchor="middle" x="102.75" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
@@ -94,8 +94,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="M32.98,-168.53C43.71,-176.33 59.16,-187.39 73,-196.62 73.86,-197.2 74.73,-197.78 75.62,-198.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-201.25 83.95,-203.69 77.42,-195.35 73.64,-201.25"/>
<path fill="none" stroke="#63b8ff" d="M32.98,-262.53C43.71,-270.33 59.16,-281.39 73,-290.62 73.86,-291.2 74.73,-291.78 75.62,-292.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-295.25 83.95,-297.69 77.42,-289.35 73.64,-295.25"/>
</a>
</g>
</g>
@@ -103,8 +103,8 @@ var sectionId = 'dynsection-1';
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><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="121.62,-187.25 83.88,-187.25 83.88,-168 121.62,-168 121.62,-187.25"/>
<text text-anchor="middle" x="102.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
<polygon fill="white" stroke="#666666" points="121.62,-281.25 83.88,-281.25 83.88,-262 121.62,-262 121.62,-281.25"/>
<text text-anchor="middle" x="102.75" y="-267.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
@@ -112,8 +112,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.35,-162.75C47.62,-165.12 60.79,-168.16 72.54,-170.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-174.26 82.18,-173.1 73.22,-167.44 71.65,-174.26"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-256.75C47.62,-259.12 60.79,-262.16 72.54,-264.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-268.26 82.18,-267.1 73.22,-261.44 71.65,-268.26"/>
</a>
</g>
</g>
@@ -121,8 +121,8 @@ var sectionId = 'dynsection-1';
<g id="Node000016" class="node">
<title>Node16</title>
<g id="a_Node000016"><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="121.62,-150.25 83.88,-150.25 83.88,-131 121.62,-131 121.62,-150.25"/>
<text text-anchor="middle" x="102.75" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
<polygon fill="white" stroke="#666666" points="121.62,-244.25 83.88,-244.25 83.88,-225 121.62,-225 121.62,-244.25"/>
<text text-anchor="middle" x="102.75" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
@@ -130,8 +130,8 @@ var sectionId = 'dynsection-1';
<g id="edge20_Node000001_Node000016" class="edge">
<title>Node1&#45;&gt;Node16</title>
<g id="a_edge20_Node000001_Node000016"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-154.72C47.62,-152.47 60.79,-149.59 72.54,-147.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-150.47 82.18,-144.91 71.66,-143.63 73.15,-150.47"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-248.72C47.62,-246.47 60.79,-243.59 72.54,-241.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-244.47 82.18,-238.91 71.66,-237.63 73.15,-244.47"/>
</a>
</g>
</g>
@@ -139,8 +139,8 @@ var sectionId = 'dynsection-1';
<g id="Node000017" class="node">
<title>Node17</title>
<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="121.62,-113.25 83.88,-113.25 83.88,-94 121.62,-94 121.62,-113.25"/>
<text text-anchor="middle" x="102.75" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
<polygon fill="white" stroke="#666666" points="121.62,-207.25 83.88,-207.25 83.88,-188 121.62,-188 121.62,-207.25"/>
<text text-anchor="middle" x="102.75" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
</a>
</g>
</g>
@@ -148,26 +148,26 @@ var sectionId = 'dynsection-1';
<g id="edge24_Node000001_Node000017" class="edge">
<title>Node1&#45;&gt;Node17</title>
<g id="a_edge24_Node000001_Node000017"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.46,-148.71C44.19,-141.16 59.42,-130.57 73,-121.62 74.01,-120.96 75.04,-120.29 76.08,-119.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-122.72 84.27,-114.4 73.96,-116.82 77.72,-122.72"/>
<path fill="none" stroke="#63b8ff" d="M33.46,-242.71C44.19,-235.16 59.42,-224.57 73,-215.62 74.01,-214.96 75.04,-214.29 76.08,-213.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-216.72 84.27,-208.4 73.96,-210.82 77.72,-216.72"/>
</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/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-76.25 75.62,-76.25 75.62,-57 129.88,-57 129.88,-76.25"/>
<text text-anchor="middle" x="102.75" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-170.25 75.62,-170.25 75.62,-151 129.88,-151 129.88,-170.25"/>
<text text-anchor="middle" x="102.75" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node20 -->
<g id="edge27_Node000001_Node000020" class="edge">
<title>Node1&#45;&gt;Node20</title>
<g id="a_edge27_Node000001_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.04,-148.59C33.78,-133.42 51.93,-104.34 73,-84.62 73.39,-84.26 73.78,-83.9 74.19,-83.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-86.38 82.13,-77.57 72.04,-80.79 76.24,-86.38"/>
<!-- Node1&#45;&gt;Node21 -->
<g id="edge30_Node000001_Node000021" class="edge">
<title>Node1&#45;&gt;Node21</title>
<g id="a_edge30_Node000001_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.04,-242.59C33.78,-227.42 51.93,-198.34 73,-178.62 73.39,-178.26 73.78,-177.9 74.19,-177.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-180.38 82.13,-171.57 72.04,-174.79 76.24,-180.38"/>
</a>
</g>
</g>
@@ -175,8 +175,8 @@ var sectionId = 'dynsection-1';
<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/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="247.5,-224.25 170.75,-224.25 170.75,-205 247.5,-205 247.5,-224.25"/>
<text text-anchor="middle" x="209.12" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
<polygon fill="white" stroke="#666666" points="247.5,-318.25 170.75,-318.25 170.75,-299 247.5,-299 247.5,-318.25"/>
<text text-anchor="middle" x="209.12" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
</a>
</g>
</g>
@@ -184,8 +184,8 @@ var sectionId = 'dynsection-1';
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-184.07C134.93,-188.68 152.92,-195.06 169.11,-200.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-204.09 178.51,-204.13 170.26,-197.49 167.92,-204.09"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-278.07C134.93,-282.68 152.92,-289.06 169.11,-294.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-298.09 178.51,-298.13 170.26,-291.49 167.92,-298.09"/>
</a>
</g>
</g>
@@ -193,8 +193,8 @@ var sectionId = 'dynsection-1';
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><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="234.75,-130.25 183.5,-130.25 183.5,-111 234.75,-111 234.75,-130.25"/>
<text text-anchor="middle" x="209.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
<polygon fill="white" stroke="#666666" points="234.75,-281.25 183.5,-281.25 183.5,-262 234.75,-262 234.75,-281.25"/>
<text text-anchor="middle" x="209.12" y="-267.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
@@ -202,8 +202,8 @@ var sectionId = 'dynsection-1';
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-167.7C137.92,-158.96 161.46,-146.11 179.9,-136.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="181.38,-139.22 188.47,-131.36 178.02,-133.08 181.38,-139.22"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-271.62C135.69,-271.62 155.04,-271.62 171.92,-271.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.6,-275.13 181.6,-271.63 171.6,-268.13 171.6,-275.13"/>
</a>
</g>
</g>
@@ -211,8 +211,8 @@ var sectionId = 'dynsection-1';
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><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="248.25,-187.25 170,-187.25 170,-168 248.25,-168 248.25,-187.25"/>
<text text-anchor="middle" x="209.12" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
<polygon fill="white" stroke="#666666" points="248.25,-225.25 170,-225.25 170,-206 248.25,-206 248.25,-225.25"/>
<text text-anchor="middle" x="209.12" y="-211.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
@@ -220,8 +220,8 @@ var sectionId = 'dynsection-1';
<g id="edge13_Node000004_Node000011" class="edge">
<title>Node4&#45;&gt;Node11</title>
<g id="a_edge13_Node000004_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-177.62C132.14,-177.62 145.42,-177.62 158.49,-177.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.33,-181.13 168.33,-177.63 158.33,-174.13 158.33,-181.13"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-261.87C137.82,-253.34 161.17,-240.82 179.56,-230.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.96,-234.17 188.12,-226.36 177.65,-228 180.96,-234.17"/>
</a>
</g>
</g>
@@ -229,8 +229,8 @@ var sectionId = 'dynsection-1';
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><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="381.25,-93.25 306,-93.25 306,-74 381.25,-74 381.25,-93.25"/>
<text text-anchor="middle" x="343.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
<polygon fill="white" stroke="#666666" points="381.25,-374.25 306,-374.25 306,-355 381.25,-355 381.25,-374.25"/>
<text text-anchor="middle" x="343.62" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
@@ -238,8 +238,8 @@ var sectionId = 'dynsection-1';
<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="M235.05,-113.67C252.06,-108.91 275.13,-102.47 295.54,-96.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="296.41,-100.16 305.1,-94.1 294.53,-93.42 296.41,-100.16"/>
<path fill="none" stroke="#63b8ff" d="M234.93,-280.21C240.17,-282.73 245.42,-285.85 249.75,-289.62 272.34,-309.31 262.02,-328.33 285.75,-346.62 288.66,-348.87 291.86,-350.84 295.21,-352.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.61,-355.69 304.18,-356.45 296.39,-349.26 293.61,-355.69"/>
</a>
</g>
</g>
@@ -247,8 +247,8 @@ var sectionId = 'dynsection-1';
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><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="379.75,-56.25 307.5,-56.25 307.5,-37 379.75,-37 379.75,-56.25"/>
<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
<polygon fill="white" stroke="#666666" points="379.75,-337.25 307.5,-337.25 307.5,-318 379.75,-318 379.75,-337.25"/>
<text text-anchor="middle" x="343.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
@@ -256,8 +256,8 @@ var sectionId = 'dynsection-1';
<g id="edge9_Node000006_Node000009" class="edge">
<title>Node6&#45;&gt;Node9</title>
<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M221.12,-110.62C235.19,-98.29 260.72,-77.4 285.75,-64.62 289.17,-62.88 292.8,-61.26 296.5,-59.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="297.41,-63.16 305.59,-56.42 295,-56.59 297.41,-63.16"/>
<path fill="none" stroke="#63b8ff" d="M232.91,-281.59C238.46,-284.13 244.35,-286.91 249.75,-289.62 266.1,-297.86 268.94,-302.38 285.75,-309.62 289.13,-311.08 292.66,-312.48 296.24,-313.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295,-317.08 305.6,-317.07 297.31,-310.47 295,-317.08"/>
</a>
</g>
</g>
@@ -265,8 +265,8 @@ var sectionId = 'dynsection-1';
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><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="371.5,-130.25 315.75,-130.25 315.75,-111 371.5,-111 371.5,-130.25"/>
<text text-anchor="middle" x="343.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
<polygon fill="white" stroke="#666666" points="371.5,-300.25 315.75,-300.25 315.75,-281 371.5,-281 371.5,-300.25"/>
<text text-anchor="middle" x="343.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
@@ -274,8 +274,8 @@ var sectionId = 'dynsection-1';
<g id="edge11_Node000006_Node000010" class="edge">
<title>Node6&#45;&gt;Node10</title>
<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M235.05,-120.62C254.49,-120.62 281.84,-120.62 304.1,-120.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="304.02,-124.13 314.02,-120.63 304.02,-117.13 304.02,-124.13"/>
<path fill="none" stroke="#63b8ff" d="M235.05,-275.2C254.58,-278 282.1,-281.95 304.41,-285.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="303.64,-288.57 314.04,-286.53 304.63,-281.64 303.64,-288.57"/>
</a>
</g>
</g>
@@ -283,8 +283,8 @@ var sectionId = 'dynsection-1';
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><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="506,-130.25 437.5,-130.25 437.5,-111 506,-111 506,-130.25"/>
<text text-anchor="middle" x="471.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
<polygon fill="white" stroke="#666666" points="506,-300.25 437.5,-300.25 437.5,-281 506,-281 506,-300.25"/>
<text text-anchor="middle" x="471.75" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
@@ -292,8 +292,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="M379.09,-93.74C393.64,-98.01 410.78,-103.03 426.27,-107.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.17,-110.9 435.75,-110.36 427.14,-104.18 425.17,-110.9"/>
<path fill="none" stroke="#63b8ff" d="M381.56,-355.16C388.38,-352.79 395.3,-349.96 401.5,-346.62 420.53,-336.39 439.42,-320.64 452.65,-308.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="454.89,-311.15 459.74,-301.73 450.08,-306.07 454.89,-311.15"/>
</a>
</g>
</g>
@@ -301,8 +301,8 @@ var sectionId = 'dynsection-1';
<g id="edge8_Node000008_Node000008" class="edge">
<title>Node8&#45;&gt;Node8</title>
<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M451.69,-130.54C442.54,-139.15 449.23,-148.25 471.75,-148.25 484.07,-148.25 491.65,-145.53 494.49,-141.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-140.91 492.16,-132.01 491.11,-142.55 497.91,-140.91"/>
<path fill="none" stroke="#63b8ff" d="M451.69,-300.54C442.54,-309.15 449.23,-318.25 471.75,-318.25 484.07,-318.25 491.65,-315.53 494.49,-311.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-310.91 492.16,-302.01 491.11,-312.55 497.91,-310.91"/>
</a>
</g>
</g>
@@ -310,8 +310,8 @@ var sectionId = 'dynsection-1';
<g id="edge10_Node000009_Node000008" class="edge">
<title>Node9&#45;&gt;Node8</title>
<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M380.05,-55.58C387.35,-58.04 394.84,-61.05 401.5,-64.62 420.53,-74.86 439.42,-90.61 452.65,-102.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="450.08,-105.18 459.74,-109.52 454.89,-100.1 450.08,-105.18"/>
<path fill="none" stroke="#63b8ff" d="M379.09,-317.51C393.64,-313.24 410.78,-308.22 426.27,-303.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="427.14,-307.07 435.75,-300.89 425.17,-300.35 427.14,-307.07"/>
</a>
</g>
</g>
@@ -319,8 +319,8 @@ var sectionId = 'dynsection-1';
<g id="edge12_Node000010_Node000008" class="edge">
<title>Node10&#45;&gt;Node8</title>
<g id="a_edge12_Node000010_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M371.99,-120.62C387.68,-120.62 407.77,-120.62 425.72,-120.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-124.13 435.63,-120.63 425.63,-117.13 425.63,-124.13"/>
<path fill="none" stroke="#63b8ff" d="M371.99,-290.62C387.68,-290.62 407.77,-290.62 425.72,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-294.13 435.63,-290.63 425.63,-287.13 425.63,-294.13"/>
</a>
</g>
</g>
@@ -328,8 +328,8 @@ var sectionId = 'dynsection-1';
<g id="edge14_Node000011_Node000008" class="edge">
<title>Node11&#45;&gt;Node8</title>
<g id="a_edge14_Node000011_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.42,-170.86C287.18,-163.81 348.75,-152.08 401.5,-139.62 409.51,-137.73 417.99,-135.56 426.17,-133.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="426.88,-136.8 435.6,-130.79 425.03,-130.04 426.88,-136.8"/>
<path fill="none" stroke="#63b8ff" d="M248.71,-213.11C288.51,-211.95 351.62,-214.15 401.5,-234.62 421.95,-243.02 441.17,-259.51 454.14,-272.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="451.56,-274.8 461.01,-279.57 456.6,-269.94 451.56,-274.8"/>
</a>
</g>
</g>
@@ -337,8 +337,8 @@ var sectionId = 'dynsection-1';
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><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="379,-317.25 308.25,-317.25 308.25,-298 379,-298 379,-317.25"/>
<text text-anchor="middle" x="343.62" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
<polygon fill="white" stroke="#666666" points="379,-187.25 308.25,-187.25 308.25,-168 379,-168 379,-187.25"/>
<text text-anchor="middle" x="343.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
@@ -346,8 +346,8 @@ var sectionId = 'dynsection-1';
<g id="edge15_Node000011_Node000012" class="edge">
<title>Node11&#45;&gt;Node12</title>
<g id="a_edge15_Node000011_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M239.18,-187.54C243.07,-189.76 246.75,-192.43 249.75,-195.62 280.41,-228.2 253.19,-258.94 285.75,-289.62 289.18,-292.86 293.2,-295.52 297.47,-297.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.81,-300.79 306.39,-301.38 298.48,-294.32 295.81,-300.79"/>
<path fill="none" stroke="#63b8ff" d="M245.28,-205.54C261.13,-201 280.05,-195.57 296.98,-190.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="297.66,-194.16 306.31,-188.04 295.73,-187.43 297.66,-194.16"/>
</a>
</g>
</g>
@@ -355,8 +355,8 @@ var sectionId = 'dynsection-1';
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="370.75,-280.25 316.5,-280.25 316.5,-261 370.75,-261 370.75,-280.25"/>
<text text-anchor="middle" x="343.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="498.88,-103.25 444.62,-103.25 444.62,-84 498.88,-84 498.88,-103.25"/>
<text text-anchor="middle" x="471.75" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
@@ -364,8 +364,8 @@ var sectionId = 'dynsection-1';
<g id="edge17_Node000011_Node000013" class="edge">
<title>Node11&#45;&gt;Node13</title>
<g id="a_edge17_Node000011_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M237.82,-187.67C242.07,-189.9 246.22,-192.55 249.75,-195.62 272.34,-215.31 262.02,-234.33 285.75,-252.62 291.51,-257.07 298.39,-260.43 305.34,-262.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="304.14,-266.25 314.72,-265.86 306.2,-259.57 304.14,-266.25"/>
<path fill="none" stroke="#63b8ff" d="M220.63,-205.91C234.57,-193.45 260.4,-171.87 285.75,-158.62 333.74,-133.55 350.54,-138.91 401.5,-120.62 412.61,-116.64 424.63,-112.05 435.48,-107.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="436.45,-111.19 444.46,-104.26 433.88,-104.67 436.45,-111.19"/>
</a>
</g>
</g>
@@ -373,8 +373,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/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="369.25,-243.25 318,-243.25 318,-224 369.25,-224 369.25,-243.25"/>
<text text-anchor="middle" x="343.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
<polygon fill="white" stroke="#666666" points="369.25,-111.25 318,-111.25 318,-92 369.25,-92 369.25,-111.25"/>
<text text-anchor="middle" x="343.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
@@ -382,8 +382,8 @@ var sectionId = 'dynsection-1';
<g id="edge18_Node000011_Node000014" class="edge">
<title>Node11&#45;&gt;Node14</title>
<g id="a_edge18_Node000011_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M232.91,-187.59C238.46,-190.13 244.35,-192.91 249.75,-195.62 266.1,-203.86 268.94,-208.38 285.75,-215.62 292.43,-218.5 299.72,-221.16 306.79,-223.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="305.56,-226.77 316.15,-226.43 307.66,-220.1 305.56,-226.77"/>
<path fill="none" stroke="#63b8ff" d="M216.21,-205.64C227.72,-187.48 254.38,-148.77 285.75,-125.62 292.18,-120.88 299.69,-116.86 307.11,-113.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.43,-116.79 316.37,-109.78 305.79,-110.31 308.43,-116.79"/>
</a>
</g>
</g>
@@ -391,8 +391,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/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="373,-206.25 314.25,-206.25 314.25,-187 373,-187 373,-206.25"/>
<text text-anchor="middle" x="343.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
<polygon fill="white" stroke="#666666" points="373,-263.25 314.25,-263.25 314.25,-244 373,-244 373,-263.25"/>
<text text-anchor="middle" x="343.62" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
@@ -400,8 +400,8 @@ var sectionId = 'dynsection-1';
<g id="edge19_Node000011_Node000015" class="edge">
<title>Node11&#45;&gt;Node15</title>
<g id="a_edge19_Node000011_Node000015"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.45,-183.12C265.46,-185.56 285.49,-188.43 302.69,-190.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="302.18,-194.36 312.57,-192.32 303.17,-187.43 302.18,-194.36"/>
<path fill="none" stroke="#63b8ff" d="M245.28,-225.71C263.06,-230.81 284.7,-237.01 303.06,-242.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="301.97,-245.61 312.55,-245 303.9,-238.88 301.97,-245.61"/>
</a>
</g>
</g>
@@ -409,8 +409,8 @@ var sectionId = 'dynsection-1';
<g id="edge16_Node000012_Node000008" class="edge">
<title>Node12&#45;&gt;Node8</title>
<g id="a_edge16_Node000012_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.37,-301.86C387.37,-299.2 395.33,-295.31 401.5,-289.62 445.32,-249.28 462.12,-177.14 467.96,-141.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="471.35,-142.57 469.37,-132.16 464.43,-141.53 471.35,-142.57"/>
<path fill="none" stroke="#63b8ff" d="M376.29,-187.65C384.96,-191.25 394.02,-195.88 401.5,-201.62 426.53,-220.83 447.49,-251.13 459.59,-270.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="456.5,-272.59 464.59,-279.42 462.53,-269.03 456.5,-272.59"/>
</a>
</g>
</g>
@@ -418,8 +418,8 @@ var sectionId = 'dynsection-1';
<g id="edge21_Node000016_Node000005" class="edge">
<title>Node16&#45;&gt;Node5</title>
<g id="a_edge21_Node000016_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.27,-150.6C125.1,-153.05 129.04,-155.79 132.5,-158.62 150.5,-173.36 149.56,-183.12 168.5,-196.62 169.68,-197.46 170.9,-198.28 172.15,-199.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-202.1 180.85,-203.86 173.78,-195.96 170.4,-202.1"/>
<path fill="none" stroke="#63b8ff" d="M121.27,-244.6C125.1,-247.05 129.04,-249.79 132.5,-252.62 150.5,-267.36 149.56,-277.12 168.5,-290.62 169.68,-291.46 170.9,-292.28 172.15,-293.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-296.1 180.85,-297.86 173.78,-289.96 170.4,-296.1"/>
</a>
</g>
</g>
@@ -427,8 +427,8 @@ var sectionId = 'dynsection-1';
<g id="edge22_Node000016_Node000006" class="edge">
<title>Node16&#45;&gt;Node6</title>
<g id="a_edge22_Node000016_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-137.14C135.69,-134.5 155.04,-130.8 171.92,-127.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="172.47,-131.02 181.63,-125.7 171.15,-124.15 172.47,-131.02"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-241.07C135.83,-246 155.42,-252.94 172.41,-258.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.09,-262.21 181.69,-262.25 173.43,-255.61 171.09,-262.21"/>
</a>
</g>
</g>
@@ -436,8 +436,8 @@ var sectionId = 'dynsection-1';
<g id="edge23_Node000016_Node000011" class="edge">
<title>Node16&#45;&gt;Node11</title>
<g id="a_edge23_Node000016_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-147.07C134.93,-151.68 152.92,-158.06 169.11,-163.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-167.09 178.51,-167.13 170.26,-160.49 167.92,-167.09"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-231.32C132.24,-229.44 145.69,-226.99 158.89,-224.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.14,-228.1 168.35,-222.86 157.89,-221.21 159.14,-228.1"/>
</a>
</g>
</g>
@@ -454,17 +454,17 @@ var sectionId = 'dynsection-1';
<g id="edge25_Node000017_Node000018" class="edge">
<title>Node17&#45;&gt;Node18</title>
<g id="a_edge25_Node000017_Node000018"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-93.7C137.92,-84.96 161.46,-72.11 179.9,-62.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="181.38,-65.22 188.47,-57.36 178.02,-59.08 181.38,-65.22"/>
<path fill="none" stroke="#63b8ff" d="M122.11,-188.04C125.81,-185.6 129.48,-182.77 132.5,-179.62 164.99,-145.73 188.66,-95.24 200.21,-67.23"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="203.39,-68.7 203.84,-58.12 196.89,-66.11 203.39,-68.7"/>
</a>
</g>
</g>
<!-- Node19 -->
<g id="Node000019" class="node">
<title>Node19</title>
<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_Node000019"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="364.75,-56.25 322.5,-56.25 322.5,-37 364.75,-37 364.75,-56.25"/>
<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
</a>
</g>
</g>
@@ -472,11 +472,47 @@ 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="M250.24,-46.62C269.64,-46.62 292.6,-46.62 310.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="310.71,-50.13 320.71,-46.63 310.71,-43.13 310.71,-50.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="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node18&#45;&gt;Node20 -->
<g id="edge29_Node000018_Node000020" class="edge">
<title>Node18&#45;&gt;Node20</title>
<g id="a_edge29_Node000018_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M246.33,-36.51C261.52,-32.27 279.39,-27.28 295.58,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="296.31,-26.19 305,-20.13 294.43,-19.45 296.31,-26.19"/>
</a>
</g>
</g>
<!-- Node19&#45;&gt;Node13 -->
<g id="edge28_Node000019_Node000013" class="edge">
<title>Node19&#45;&gt;Node13</title>
<g id="a_edge28_Node000019_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M365.17,-54.28C383.77,-61.21 411.59,-71.58 434.01,-79.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="432.51,-83.11 443.1,-83.32 434.95,-76.55 432.51,-83.11"/>
</a>
</g>
</g>
<!-- Node19&#45;&gt;Node19 -->
<g id="edge27_Node000019_Node000019" class="edge">
<title>Node19&#45;&gt;Node19</title>
<g id="a_edge27_Node000019_Node000019"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M323.57,-56.54C314.42,-65.15 321.1,-74.25 343.62,-74.25 355.94,-74.25 363.52,-71.53 366.37,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="369.79,-66.91 364.04,-58.01 362.98,-68.55 369.79,-66.91"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 25 KiB

After

Width:  |  Height:  |  Size: 27 KiB

240
d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="514pt" height="325pt"
viewBox="0.00 0.00 514.00 325.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 321.25)">
<svg width="514pt" height="382pt"
viewBox="0.00 0.00 514.00 382.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 378.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,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#999999" stroke="#666666" points="37,-262.25 0,-262.25 0,-243 37,-243 37,-262.25"/>
<text text-anchor="middle" x="18.5" y="-248.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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.5,-261.25 76,-261.25 76,-242 129.5,-242 129.5,-261.25"/>
<text text-anchor="middle" x="102.75" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="#666666" points="129.5,-355.25 76,-355.25 76,-336 129.5,-336 129.5,-355.25"/>
<text text-anchor="middle" x="102.75" y="-341.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M24.87,-168.55C33.51,-183.86 51.69,-213.56 73,-233.62 73.39,-233.99 73.78,-234.35 74.18,-234.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-237.46 82.12,-240.69 76.24,-231.87 72.03,-237.46"/>
<path fill="none" stroke="#63b8ff" d="M24.87,-262.55C33.51,-277.86 51.69,-307.56 73,-327.62 73.39,-327.99 73.78,-328.35 74.18,-328.7"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-331.46 82.12,-334.69 76.24,-325.87 72.03,-331.46"/>
</a>
</g>
</g>
@@ -39,8 +39,8 @@
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="132.5,-224.25 73,-224.25 73,-205 132.5,-205 132.5,-224.25"/>
<text text-anchor="middle" x="102.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
<polygon fill="white" stroke="#666666" points="132.5,-318.25 73,-318.25 73,-299 132.5,-299 132.5,-318.25"/>
<text text-anchor="middle" x="102.75" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
@@ -48,8 +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="M32.98,-168.53C43.71,-176.33 59.16,-187.39 73,-196.62 73.86,-197.2 74.73,-197.78 75.62,-198.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-201.25 83.95,-203.69 77.42,-195.35 73.64,-201.25"/>
<path fill="none" stroke="#63b8ff" d="M32.98,-262.53C43.71,-270.33 59.16,-281.39 73,-290.62 73.86,-291.2 74.73,-291.78 75.62,-292.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-295.25 83.95,-297.69 77.42,-289.35 73.64,-295.25"/>
</a>
</g>
</g>
@@ -57,8 +57,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><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="121.62,-187.25 83.88,-187.25 83.88,-168 121.62,-168 121.62,-187.25"/>
<text text-anchor="middle" x="102.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
<polygon fill="white" stroke="#666666" points="121.62,-281.25 83.88,-281.25 83.88,-262 121.62,-262 121.62,-281.25"/>
<text text-anchor="middle" x="102.75" y="-267.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
</a>
</g>
</g>
@@ -66,8 +66,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.35,-162.75C47.62,-165.12 60.79,-168.16 72.54,-170.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-174.26 82.18,-173.1 73.22,-167.44 71.65,-174.26"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-256.75C47.62,-259.12 60.79,-262.16 72.54,-264.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-268.26 82.18,-267.1 73.22,-261.44 71.65,-268.26"/>
</a>
</g>
</g>
@@ -75,8 +75,8 @@
<g id="Node000016" class="node">
<title>Node16</title>
<g id="a_Node000016"><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="121.62,-150.25 83.88,-150.25 83.88,-131 121.62,-131 121.62,-150.25"/>
<text text-anchor="middle" x="102.75" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
<polygon fill="white" stroke="#666666" points="121.62,-244.25 83.88,-244.25 83.88,-225 121.62,-225 121.62,-244.25"/>
<text text-anchor="middle" x="102.75" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
</a>
</g>
</g>
@@ -84,8 +84,8 @@
<g id="edge20_Node000001_Node000016" class="edge">
<title>Node1&#45;&gt;Node16</title>
<g id="a_edge20_Node000001_Node000016"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-154.72C47.62,-152.47 60.79,-149.59 72.54,-147.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-150.47 82.18,-144.91 71.66,-143.63 73.15,-150.47"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-248.72C47.62,-246.47 60.79,-243.59 72.54,-241.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-244.47 82.18,-238.91 71.66,-237.63 73.15,-244.47"/>
</a>
</g>
</g>
@@ -93,8 +93,8 @@
<g id="Node000017" class="node">
<title>Node17</title>
<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="121.62,-113.25 83.88,-113.25 83.88,-94 121.62,-94 121.62,-113.25"/>
<text text-anchor="middle" x="102.75" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
<polygon fill="white" stroke="#666666" points="121.62,-207.25 83.88,-207.25 83.88,-188 121.62,-188 121.62,-207.25"/>
<text text-anchor="middle" x="102.75" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
</a>
</g>
</g>
@@ -102,26 +102,26 @@
<g id="edge24_Node000001_Node000017" class="edge">
<title>Node1&#45;&gt;Node17</title>
<g id="a_edge24_Node000001_Node000017"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.46,-148.71C44.19,-141.16 59.42,-130.57 73,-121.62 74.01,-120.96 75.04,-120.29 76.08,-119.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-122.72 84.27,-114.4 73.96,-116.82 77.72,-122.72"/>
<path fill="none" stroke="#63b8ff" d="M33.46,-242.71C44.19,-235.16 59.42,-224.57 73,-215.62 74.01,-214.96 75.04,-214.29 76.08,-213.61"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-216.72 84.27,-208.4 73.96,-210.82 77.72,-216.72"/>
</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/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-76.25 75.62,-76.25 75.62,-57 129.88,-57 129.88,-76.25"/>
<text text-anchor="middle" x="102.75" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
<!-- Node21 -->
<g id="Node000021" class="node">
<title>Node21</title>
<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="129.88,-170.25 75.62,-170.25 75.62,-151 129.88,-151 129.88,-170.25"/>
<text text-anchor="middle" x="102.75" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node20 -->
<g id="edge27_Node000001_Node000020" class="edge">
<title>Node1&#45;&gt;Node20</title>
<g id="a_edge27_Node000001_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.04,-148.59C33.78,-133.42 51.93,-104.34 73,-84.62 73.39,-84.26 73.78,-83.9 74.19,-83.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-86.38 82.13,-77.57 72.04,-80.79 76.24,-86.38"/>
<!-- Node1&#45;&gt;Node21 -->
<g id="edge30_Node000001_Node000021" class="edge">
<title>Node1&#45;&gt;Node21</title>
<g id="a_edge30_Node000001_Node000021"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.04,-242.59C33.78,-227.42 51.93,-198.34 73,-178.62 73.39,-178.26 73.78,-177.9 74.19,-177.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-180.38 82.13,-171.57 72.04,-174.79 76.24,-180.38"/>
</a>
</g>
</g>
@@ -129,8 +129,8 @@
<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/at.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="247.5,-224.25 170.75,-224.25 170.75,-205 247.5,-205 247.5,-224.25"/>
<text text-anchor="middle" x="209.12" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
<polygon fill="white" stroke="#666666" points="247.5,-318.25 170.75,-318.25 170.75,-299 247.5,-299 247.5,-318.25"/>
<text text-anchor="middle" x="209.12" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
</a>
</g>
</g>
@@ -138,8 +138,8 @@
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-184.07C134.93,-188.68 152.92,-195.06 169.11,-200.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-204.09 178.51,-204.13 170.26,-197.49 167.92,-204.09"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-278.07C134.93,-282.68 152.92,-289.06 169.11,-294.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-298.09 178.51,-298.13 170.26,-291.49 167.92,-298.09"/>
</a>
</g>
</g>
@@ -147,8 +147,8 @@
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><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="234.75,-130.25 183.5,-130.25 183.5,-111 234.75,-111 234.75,-130.25"/>
<text text-anchor="middle" x="209.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
<polygon fill="white" stroke="#666666" points="234.75,-281.25 183.5,-281.25 183.5,-262 234.75,-262 234.75,-281.25"/>
<text text-anchor="middle" x="209.12" y="-267.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
</a>
</g>
</g>
@@ -156,8 +156,8 @@
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-167.7C137.92,-158.96 161.46,-146.11 179.9,-136.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="181.38,-139.22 188.47,-131.36 178.02,-133.08 181.38,-139.22"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-271.62C135.69,-271.62 155.04,-271.62 171.92,-271.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.6,-275.13 181.6,-271.63 171.6,-268.13 171.6,-275.13"/>
</a>
</g>
</g>
@@ -165,8 +165,8 @@
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><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="248.25,-187.25 170,-187.25 170,-168 248.25,-168 248.25,-187.25"/>
<text text-anchor="middle" x="209.12" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
<polygon fill="white" stroke="#666666" points="248.25,-225.25 170,-225.25 170,-206 248.25,-206 248.25,-225.25"/>
<text text-anchor="middle" x="209.12" y="-211.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
</a>
</g>
</g>
@@ -174,8 +174,8 @@
<g id="edge13_Node000004_Node000011" class="edge">
<title>Node4&#45;&gt;Node11</title>
<g id="a_edge13_Node000004_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-177.62C132.14,-177.62 145.42,-177.62 158.49,-177.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.33,-181.13 168.33,-177.63 158.33,-174.13 158.33,-181.13"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-261.87C137.82,-253.34 161.17,-240.82 179.56,-230.95"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="180.96,-234.17 188.12,-226.36 177.65,-228 180.96,-234.17"/>
</a>
</g>
</g>
@@ -183,8 +183,8 @@
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><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="381.25,-93.25 306,-93.25 306,-74 381.25,-74 381.25,-93.25"/>
<text text-anchor="middle" x="343.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
<polygon fill="white" stroke="#666666" points="381.25,-374.25 306,-374.25 306,-355 381.25,-355 381.25,-374.25"/>
<text text-anchor="middle" x="343.62" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
</a>
</g>
</g>
@@ -192,8 +192,8 @@
<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="M235.05,-113.67C252.06,-108.91 275.13,-102.47 295.54,-96.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="296.41,-100.16 305.1,-94.1 294.53,-93.42 296.41,-100.16"/>
<path fill="none" stroke="#63b8ff" d="M234.93,-280.21C240.17,-282.73 245.42,-285.85 249.75,-289.62 272.34,-309.31 262.02,-328.33 285.75,-346.62 288.66,-348.87 291.86,-350.84 295.21,-352.57"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.61,-355.69 304.18,-356.45 296.39,-349.26 293.61,-355.69"/>
</a>
</g>
</g>
@@ -201,8 +201,8 @@
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><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="379.75,-56.25 307.5,-56.25 307.5,-37 379.75,-37 379.75,-56.25"/>
<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
<polygon fill="white" stroke="#666666" points="379.75,-337.25 307.5,-337.25 307.5,-318 379.75,-318 379.75,-337.25"/>
<text text-anchor="middle" x="343.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
</a>
</g>
</g>
@@ -210,8 +210,8 @@
<g id="edge9_Node000006_Node000009" class="edge">
<title>Node6&#45;&gt;Node9</title>
<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M221.12,-110.62C235.19,-98.29 260.72,-77.4 285.75,-64.62 289.17,-62.88 292.8,-61.26 296.5,-59.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="297.41,-63.16 305.59,-56.42 295,-56.59 297.41,-63.16"/>
<path fill="none" stroke="#63b8ff" d="M232.91,-281.59C238.46,-284.13 244.35,-286.91 249.75,-289.62 266.1,-297.86 268.94,-302.38 285.75,-309.62 289.13,-311.08 292.66,-312.48 296.24,-313.81"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295,-317.08 305.6,-317.07 297.31,-310.47 295,-317.08"/>
</a>
</g>
</g>
@@ -219,8 +219,8 @@
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><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="371.5,-130.25 315.75,-130.25 315.75,-111 371.5,-111 371.5,-130.25"/>
<text text-anchor="middle" x="343.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
<polygon fill="white" stroke="#666666" points="371.5,-300.25 315.75,-300.25 315.75,-281 371.5,-281 371.5,-300.25"/>
<text text-anchor="middle" x="343.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
</a>
</g>
</g>
@@ -228,8 +228,8 @@
<g id="edge11_Node000006_Node000010" class="edge">
<title>Node6&#45;&gt;Node10</title>
<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M235.05,-120.62C254.49,-120.62 281.84,-120.62 304.1,-120.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="304.02,-124.13 314.02,-120.63 304.02,-117.13 304.02,-124.13"/>
<path fill="none" stroke="#63b8ff" d="M235.05,-275.2C254.58,-278 282.1,-281.95 304.41,-285.15"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="303.64,-288.57 314.04,-286.53 304.63,-281.64 303.64,-288.57"/>
</a>
</g>
</g>
@@ -237,8 +237,8 @@
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><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="506,-130.25 437.5,-130.25 437.5,-111 506,-111 506,-130.25"/>
<text text-anchor="middle" x="471.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
<polygon fill="white" stroke="#666666" points="506,-300.25 437.5,-300.25 437.5,-281 506,-281 506,-300.25"/>
<text text-anchor="middle" x="471.75" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
</a>
</g>
</g>
@@ -246,8 +246,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="M379.09,-93.74C393.64,-98.01 410.78,-103.03 426.27,-107.58"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.17,-110.9 435.75,-110.36 427.14,-104.18 425.17,-110.9"/>
<path fill="none" stroke="#63b8ff" d="M381.56,-355.16C388.38,-352.79 395.3,-349.96 401.5,-346.62 420.53,-336.39 439.42,-320.64 452.65,-308.45"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="454.89,-311.15 459.74,-301.73 450.08,-306.07 454.89,-311.15"/>
</a>
</g>
</g>
@@ -255,8 +255,8 @@
<g id="edge8_Node000008_Node000008" class="edge">
<title>Node8&#45;&gt;Node8</title>
<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M451.69,-130.54C442.54,-139.15 449.23,-148.25 471.75,-148.25 484.07,-148.25 491.65,-145.53 494.49,-141.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-140.91 492.16,-132.01 491.11,-142.55 497.91,-140.91"/>
<path fill="none" stroke="#63b8ff" d="M451.69,-300.54C442.54,-309.15 449.23,-318.25 471.75,-318.25 484.07,-318.25 491.65,-315.53 494.49,-311.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-310.91 492.16,-302.01 491.11,-312.55 497.91,-310.91"/>
</a>
</g>
</g>
@@ -264,8 +264,8 @@
<g id="edge10_Node000009_Node000008" class="edge">
<title>Node9&#45;&gt;Node8</title>
<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M380.05,-55.58C387.35,-58.04 394.84,-61.05 401.5,-64.62 420.53,-74.86 439.42,-90.61 452.65,-102.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="450.08,-105.18 459.74,-109.52 454.89,-100.1 450.08,-105.18"/>
<path fill="none" stroke="#63b8ff" d="M379.09,-317.51C393.64,-313.24 410.78,-308.22 426.27,-303.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="427.14,-307.07 435.75,-300.89 425.17,-300.35 427.14,-307.07"/>
</a>
</g>
</g>
@@ -273,8 +273,8 @@
<g id="edge12_Node000010_Node000008" class="edge">
<title>Node10&#45;&gt;Node8</title>
<g id="a_edge12_Node000010_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M371.99,-120.62C387.68,-120.62 407.77,-120.62 425.72,-120.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-124.13 435.63,-120.63 425.63,-117.13 425.63,-124.13"/>
<path fill="none" stroke="#63b8ff" d="M371.99,-290.62C387.68,-290.62 407.77,-290.62 425.72,-290.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-294.13 435.63,-290.63 425.63,-287.13 425.63,-294.13"/>
</a>
</g>
</g>
@@ -282,8 +282,8 @@
<g id="edge14_Node000011_Node000008" class="edge">
<title>Node11&#45;&gt;Node8</title>
<g id="a_edge14_Node000011_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.42,-170.86C287.18,-163.81 348.75,-152.08 401.5,-139.62 409.51,-137.73 417.99,-135.56 426.17,-133.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="426.88,-136.8 435.6,-130.79 425.03,-130.04 426.88,-136.8"/>
<path fill="none" stroke="#63b8ff" d="M248.71,-213.11C288.51,-211.95 351.62,-214.15 401.5,-234.62 421.95,-243.02 441.17,-259.51 454.14,-272.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="451.56,-274.8 461.01,-279.57 456.6,-269.94 451.56,-274.8"/>
</a>
</g>
</g>
@@ -291,8 +291,8 @@
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><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="379,-317.25 308.25,-317.25 308.25,-298 379,-298 379,-317.25"/>
<text text-anchor="middle" x="343.62" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
<polygon fill="white" stroke="#666666" points="379,-187.25 308.25,-187.25 308.25,-168 379,-168 379,-187.25"/>
<text text-anchor="middle" x="343.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
</a>
</g>
</g>
@@ -300,8 +300,8 @@
<g id="edge15_Node000011_Node000012" class="edge">
<title>Node11&#45;&gt;Node12</title>
<g id="a_edge15_Node000011_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M239.18,-187.54C243.07,-189.76 246.75,-192.43 249.75,-195.62 280.41,-228.2 253.19,-258.94 285.75,-289.62 289.18,-292.86 293.2,-295.52 297.47,-297.69"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="295.81,-300.79 306.39,-301.38 298.48,-294.32 295.81,-300.79"/>
<path fill="none" stroke="#63b8ff" d="M245.28,-205.54C261.13,-201 280.05,-195.57 296.98,-190.72"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="297.66,-194.16 306.31,-188.04 295.73,-187.43 297.66,-194.16"/>
</a>
</g>
</g>
@@ -309,8 +309,8 @@
<g id="Node000013" class="node">
<title>Node13</title>
<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="370.75,-280.25 316.5,-280.25 316.5,-261 370.75,-261 370.75,-280.25"/>
<text text-anchor="middle" x="343.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
<polygon fill="white" stroke="#666666" points="498.88,-103.25 444.62,-103.25 444.62,-84 498.88,-84 498.88,-103.25"/>
<text text-anchor="middle" x="471.75" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
@@ -318,8 +318,8 @@
<g id="edge17_Node000011_Node000013" class="edge">
<title>Node11&#45;&gt;Node13</title>
<g id="a_edge17_Node000011_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M237.82,-187.67C242.07,-189.9 246.22,-192.55 249.75,-195.62 272.34,-215.31 262.02,-234.33 285.75,-252.62 291.51,-257.07 298.39,-260.43 305.34,-262.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="304.14,-266.25 314.72,-265.86 306.2,-259.57 304.14,-266.25"/>
<path fill="none" stroke="#63b8ff" d="M220.63,-205.91C234.57,-193.45 260.4,-171.87 285.75,-158.62 333.74,-133.55 350.54,-138.91 401.5,-120.62 412.61,-116.64 424.63,-112.05 435.48,-107.8"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="436.45,-111.19 444.46,-104.26 433.88,-104.67 436.45,-111.19"/>
</a>
</g>
</g>
@@ -327,8 +327,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/min.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="369.25,-243.25 318,-243.25 318,-224 369.25,-224 369.25,-243.25"/>
<text text-anchor="middle" x="343.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
<polygon fill="white" stroke="#666666" points="369.25,-111.25 318,-111.25 318,-92 369.25,-92 369.25,-111.25"/>
<text text-anchor="middle" x="343.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
</a>
</g>
</g>
@@ -336,8 +336,8 @@
<g id="edge18_Node000011_Node000014" class="edge">
<title>Node11&#45;&gt;Node14</title>
<g id="a_edge18_Node000011_Node000014"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M232.91,-187.59C238.46,-190.13 244.35,-192.91 249.75,-195.62 266.1,-203.86 268.94,-208.38 285.75,-215.62 292.43,-218.5 299.72,-221.16 306.79,-223.49"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="305.56,-226.77 316.15,-226.43 307.66,-220.1 305.56,-226.77"/>
<path fill="none" stroke="#63b8ff" d="M216.21,-205.64C227.72,-187.48 254.38,-148.77 285.75,-125.62 292.18,-120.88 299.69,-116.86 307.11,-113.55"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="308.43,-116.79 316.37,-109.78 305.79,-110.31 308.43,-116.79"/>
</a>
</g>
</g>
@@ -345,8 +345,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/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="373,-206.25 314.25,-206.25 314.25,-187 373,-187 373,-206.25"/>
<text text-anchor="middle" x="343.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
<polygon fill="white" stroke="#666666" points="373,-263.25 314.25,-263.25 314.25,-244 373,-244 373,-263.25"/>
<text text-anchor="middle" x="343.62" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
@@ -354,8 +354,8 @@
<g id="edge19_Node000011_Node000015" class="edge">
<title>Node11&#45;&gt;Node15</title>
<g id="a_edge19_Node000011_Node000015"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M248.45,-183.12C265.46,-185.56 285.49,-188.43 302.69,-190.9"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="302.18,-194.36 312.57,-192.32 303.17,-187.43 302.18,-194.36"/>
<path fill="none" stroke="#63b8ff" d="M245.28,-225.71C263.06,-230.81 284.7,-237.01 303.06,-242.28"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="301.97,-245.61 312.55,-245 303.9,-238.88 301.97,-245.61"/>
</a>
</g>
</g>
@@ -363,8 +363,8 @@
<g id="edge16_Node000012_Node000008" class="edge">
<title>Node12&#45;&gt;Node8</title>
<g id="a_edge16_Node000012_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.37,-301.86C387.37,-299.2 395.33,-295.31 401.5,-289.62 445.32,-249.28 462.12,-177.14 467.96,-141.6"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="471.35,-142.57 469.37,-132.16 464.43,-141.53 471.35,-142.57"/>
<path fill="none" stroke="#63b8ff" d="M376.29,-187.65C384.96,-191.25 394.02,-195.88 401.5,-201.62 426.53,-220.83 447.49,-251.13 459.59,-270.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="456.5,-272.59 464.59,-279.42 462.53,-269.03 456.5,-272.59"/>
</a>
</g>
</g>
@@ -372,8 +372,8 @@
<g id="edge21_Node000016_Node000005" class="edge">
<title>Node16&#45;&gt;Node5</title>
<g id="a_edge21_Node000016_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.27,-150.6C125.1,-153.05 129.04,-155.79 132.5,-158.62 150.5,-173.36 149.56,-183.12 168.5,-196.62 169.68,-197.46 170.9,-198.28 172.15,-199.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-202.1 180.85,-203.86 173.78,-195.96 170.4,-202.1"/>
<path fill="none" stroke="#63b8ff" d="M121.27,-244.6C125.1,-247.05 129.04,-249.79 132.5,-252.62 150.5,-267.36 149.56,-277.12 168.5,-290.62 169.68,-291.46 170.9,-292.28 172.15,-293.07"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-296.1 180.85,-297.86 173.78,-289.96 170.4,-296.1"/>
</a>
</g>
</g>
@@ -381,8 +381,8 @@
<g id="edge22_Node000016_Node000006" class="edge">
<title>Node16&#45;&gt;Node6</title>
<g id="a_edge22_Node000016_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-137.14C135.69,-134.5 155.04,-130.8 171.92,-127.56"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="172.47,-131.02 181.63,-125.7 171.15,-124.15 172.47,-131.02"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-241.07C135.83,-246 155.42,-252.94 172.41,-258.96"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="171.09,-262.21 181.69,-262.25 173.43,-255.61 171.09,-262.21"/>
</a>
</g>
</g>
@@ -390,8 +390,8 @@
<g id="edge23_Node000016_Node000011" class="edge">
<title>Node16&#45;&gt;Node11</title>
<g id="a_edge23_Node000016_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-147.07C134.93,-151.68 152.92,-158.06 169.11,-163.79"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.92,-167.09 178.51,-167.13 170.26,-160.49 167.92,-167.09"/>
<path fill="none" stroke="#63b8ff" d="M121.93,-231.32C132.24,-229.44 145.69,-226.99 158.89,-224.59"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="159.14,-228.1 168.35,-222.86 157.89,-221.21 159.14,-228.1"/>
</a>
</g>
</g>
@@ -408,17 +408,17 @@
<g id="edge25_Node000017_Node000018" class="edge">
<title>Node17&#45;&gt;Node18</title>
<g id="a_edge25_Node000017_Node000018"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.93,-93.7C137.92,-84.96 161.46,-72.11 179.9,-62.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="181.38,-65.22 188.47,-57.36 178.02,-59.08 181.38,-65.22"/>
<path fill="none" stroke="#63b8ff" d="M122.11,-188.04C125.81,-185.6 129.48,-182.77 132.5,-179.62 164.99,-145.73 188.66,-95.24 200.21,-67.23"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="203.39,-68.7 203.84,-58.12 196.89,-66.11 203.39,-68.7"/>
</a>
</g>
</g>
<!-- Node19 -->
<g id="Node000019" class="node">
<title>Node19</title>
<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_Node000019"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="364.75,-56.25 322.5,-56.25 322.5,-37 364.75,-37 364.75,-56.25"/>
<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
</a>
</g>
</g>
@@ -426,10 +426,46 @@
<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="M250.24,-46.62C269.64,-46.62 292.6,-46.62 310.78,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="310.71,-50.13 320.71,-46.63 310.71,-43.13 310.71,-50.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="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node18&#45;&gt;Node20 -->
<g id="edge29_Node000018_Node000020" class="edge">
<title>Node18&#45;&gt;Node20</title>
<g id="a_edge29_Node000018_Node000020"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M246.33,-36.51C261.52,-32.27 279.39,-27.28 295.58,-22.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="296.31,-26.19 305,-20.13 294.43,-19.45 296.31,-26.19"/>
</a>
</g>
</g>
<!-- Node19&#45;&gt;Node13 -->
<g id="edge28_Node000019_Node000013" class="edge">
<title>Node19&#45;&gt;Node13</title>
<g id="a_edge28_Node000019_Node000013"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M365.17,-54.28C383.77,-61.21 411.59,-71.58 434.01,-79.94"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="432.51,-83.11 443.1,-83.32 434.95,-76.55 432.51,-83.11"/>
</a>
</g>
</g>
<!-- Node19&#45;&gt;Node19 -->
<g id="edge27_Node000019_Node000019" class="edge">
<title>Node19&#45;&gt;Node19</title>
<g id="a_edge27_Node000019_Node000019"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M323.57,-56.54C314.42,-65.15 321.1,-74.25 343.62,-74.25 355.94,-74.25 363.52,-71.53 366.37,-67.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="369.79,-66.91 364.04,-58.01 362.98,-68.55 369.79,-66.91"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 21 KiB

After

Width:  |  Height:  |  Size: 23 KiB

14
d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.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::inorder_traversal_of_bst::Node 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('d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -105,7 +107,7 @@ $(document).ready(function(){initNavTree('d5/db5/classoperations__on__datastruct
<div class="contents">
<p>A <a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST.
<a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for operations_on_datastructures::inorder_traversal_of_bst::Node:</div>
<div class="dyncontent">
@@ -138,7 +140,7 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<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>inorder_traversal_of_bst</b></li><li class="navelem"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</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>

38
d5/db5/set__kth__bit_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++: bit_manipulation/set_kth_bit.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('d5/db5/set__kth__bit_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/db5/set__kth__bit_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -125,13 +127,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:ad4d0ffd9331242c42a28834ee19f5fd9" id="r_ad4d0ffd9331242c42a28834ee19f5fd9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9">bit_manipulation::set_kth_bit::setKthBit</a> (std ::int64_t N, std ::int64_t k)</td></tr>
<tr class="memitem:ad4d0ffd9331242c42a28834ee19f5fd9" id="r_ad4d0ffd9331242c42a28834ee19f5fd9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4d0ffd9331242c42a28834ee19f5fd9">bit_manipulation::set_kth_bit::setKthBit</a> (std ::int64_t N, std ::int64_t k)</td></tr>
<tr class="memdesc:ad4d0ffd9331242c42a28834ee19f5fd9"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements set kth bit. <br /></td></tr>
<tr class="separator:ad4d0ffd9331242c42a28834ee19f5fd9"><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="../../d5/db5/set__kth__bit_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="../../d5/db5/set__kth__bit_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>
@@ -150,8 +152,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>
@@ -160,10 +161,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"> 76</span> {</div>
<div class="line"><span class="lineno"> 77</span> <a class="code hl_function" href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 77</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"> 78</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 79</span>}</div>
<div class="ttc" id="aset__kth__bit_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/db5/set__kth__bit_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> set_kth_bit.cpp:60</div></div>
<div class="ttc" id="aset__kth__bit_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> set_kth_bit.cpp:60</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -181,19 +182,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/types/integer.html">std::uint64_t</a> bit_manipulation::set_kth_bit::setKthBit </td>
<td>(</td>
<td class="paramtype">std ::int64_t&#160;</td>
<td class="paramname"><em>N</em>, </td>
<td class="paramtype">std ::int64_t</td> <td class="paramname"><span class="paramname"><em>N</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std ::int64_t&#160;</td>
<td class="paramname"><em>k</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">std ::int64_t</td> <td class="paramname"><span class="paramname"><em>k</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -233,7 +227,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>
@@ -274,7 +268,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_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d5/db5/set__kth__bit_8cpp.html">set_kth_bit.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
d5/db8/namespacemincoins__topdown.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++: mincoins_topdown 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('d5/db8/namespacemincoins__topdown.html','../../'); initResizable(); });
$(function(){initNavTree('d5/db8/namespacemincoins__topdown.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/db8/namespacemincoins__topdown.html
<div class="contents">
<p>Functions for <a href="https://leetcode.com/problems/coin-change/" target="_blank">minimum coin exchange</a> problem.
<a href="../../d5/db8/namespacemincoins__topdown.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://leetcode.com/problems/coin-change/" target="_blank">minimum coin exchange</a> problem. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d5/db8/namespacemincoins__topdown.html
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/db8/namespacemincoins__topdown.html">mincoins_topdown</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
d5/dca/classrange__queries_1_1per_seg_tree_1_1_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('d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d5/d66/classrange__queries_1_1per_seg_
<!-- 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
d5/dd0/namespacephysics.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++: physics 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('d5/dd0/namespacephysics.html','../../'); initResizable(); });
$(function(){initNavTree('d5/dd0/namespacephysics.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d5/dd0/namespacephysics.html','../../'
<div class="contents">
<p>for IO operations
<a href="../../d5/dd0/namespacephysics.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>for IO operations </p>
<p>for assert() for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin()</a>, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos()</a></p>
@@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d5/dd0/namespacephysics.html','../../'
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/dd0/namespacephysics.html">physics</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>

44
d5/ddb/bogo__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/bogo_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('d5/ddb/bogo__sort_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/ddb/bogo__sort_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -131,11 +133,11 @@ Functions</h2></td></tr>
<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
<tr class="separator:affc6ee160142cd017f8c4b213437d0fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859" id="r_ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
<tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;arr)</td></tr>
<tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;arr)</td></tr>
<tr class="separator:ae8adaeff66471f9ed84f2e673b38a859"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
<tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><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="../../d5/ddb/bogo__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>
@@ -155,8 +157,7 @@ Algorithm</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>
@@ -164,19 +165,19 @@ Algorithm</h3>
<p>Driver Code </p>
<div class="fragment"><div class="line"><span class="lineno"> 104</span> {</div>
<div class="line"><span class="lineno"> 105</span> <span class="comment">// Testing</span></div>
<div class="line"><span class="lineno"> 106</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 106</span> <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 107</span> <span class="comment">// Example Usage</span></div>
<div class="line"><span class="lineno"> 108</span> std::array &lt;int, 5&gt; arr = {3, 7, 10, 4, 1}; <span class="comment">// Defining array which we want to sort</span></div>
<div class="line"><span class="lineno"> 109</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 Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 110</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr);</div>
<div class="line"><span class="lineno"> 110</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr);</div>
<div class="line"><span class="lineno"> 111</span> arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr); <span class="comment">// Callling bogo sort on it</span></div>
<div class="line"><span class="lineno"> 112</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;Sorted Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr); <span class="comment">// Printing sorted array</span></div>
<div class="line"><span class="lineno"> 113</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr); <span class="comment">// Printing sorted array</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="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="abogo__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:78</div></div>
<div class="ttc" id="abogo__sort_8cpp_html_ae8adaeff66471f9ed84f2e673b38a859"><div class="ttname"><a href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a></div><div class="ttdeci">void show_array(const std::array&lt; T, N &gt; &amp;arr)</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:68</div></div>
<div class="ttc" id="abogo__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:78</div></div>
<div class="ttc" id="abogo__sort_8cpp_html_ae8adaeff66471f9ed84f2e673b38a859"><div class="ttname"><a href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a></div><div class="ttdeci">void show_array(const std::array&lt; T, N &gt; &amp;arr)</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:68</div></div>
<div class="ttc" id="anamespacesorting_html_affc6ee160142cd017f8c4b213437d0fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a></div><div class="ttdeci">std::array&lt; T, N &gt; randomized_bogosort(std::array&lt; T, N &gt; arr)</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:51</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -197,8 +198,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">void show_array </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;&#160;</td>
<td class="paramname"><em>arr</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -234,7 +234,7 @@ template&lt;typename T , size_t N&gt; </div>
<tr>
<td class="memname">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,10 +247,10 @@ template&lt;typename T , size_t N&gt; </div>
<div class="line"><span class="lineno"> 82</span> x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100;</div>
<div class="line"><span class="lineno"> 83</span> }</div>
<div class="line"><span class="lineno"> 84</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 Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 85</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
<div class="line"><span class="lineno"> 85</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
<div class="line"><span class="lineno"> 86</span> arr1 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr1);</div>
<div class="line"><span class="lineno"> 87</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;Sorted Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
<div class="line"><span class="lineno"> 89</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/begin.html">begin</a>(), arr1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/end.html">end</a>()));</div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// Test 2</span></div>
<div class="line"><span class="lineno"> 91</span> std::array &lt;int, 5&gt; arr2;</div>
@@ -258,10 +258,10 @@ template&lt;typename T , size_t N&gt; </div>
<div class="line"><span class="lineno"> 93</span> x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100;</div>
<div class="line"><span class="lineno"> 94</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;Original Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
<div class="line"><span class="lineno"> 97</span> arr2 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr2);</div>
<div class="line"><span class="lineno"> 98</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;Sorted Array : &quot;</span>;</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
<div class="line"><span class="lineno"> 100</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/begin.html">begin</a>(), arr2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/end.html">end</a>()));</div>
<div class="line"><span class="lineno"> 101</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/begin.html">std::array::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
@@ -282,7 +282,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="../../d5/ddb/bogo__sort_8cpp.html">bogo_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>

12
d5/ddf/struct_btree-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('d9/d90/struct_btree.html','../../'); initResizable(); });
$(function(){initNavTree('d9/d90/struct_btree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d9/d90/struct_btree.html','../../'); i
<!-- 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
d5/de0/classuint128__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('db/d9a/classuint128__t.html','../../'); initResizable(); });
$(function(){initNavTree('db/d9a/classuint128__t.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -190,7 +192,7 @@ $(document).ready(function(){initNavTree('db/d9a/classuint128__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
d5/de2/structtower-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('d2/d2c/structtower.html','../../'); initResizable(); });
$(function(){initNavTree('d2/d2c/structtower.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -110,7 +112,7 @@ $(document).ready(function(){initNavTree('d2/d2c/structtower.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>

17
d5/def/stairs__pattern_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/stairs_pattern.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('d5/def/stairs__pattern_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d5/def/stairs__pattern_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -114,7 +116,7 @@ Include dependency graph for stairs_pattern.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="../../d5/def/stairs__pattern_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>
@@ -182,7 +183,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="../../d5/def/stairs__pattern_8cpp.html">stairs_pattern.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
d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map
View File

@@ -1,5 +1,7 @@
<map id="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;" name="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;">
<area shape="rect" id="Node000001" title="Matrix class." alt="" coords="5,109,175,165"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="11,5,169,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,62,93,109,87,109,87,62"/>
<area shape="rect" id="Node000001" title="Matrix class." alt="" coords="5,198,175,253"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="11,94,169,135"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,150,93,197,87,197,87,150"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="71,5,109,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="93,46,93,93,87,93,87,46"/>
</map>

2
d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5
View File

@@ -1 +1 @@
05200ace2b2bcb88a067457cbe1cec7c
1ce33d930a5524844e630f176be3475a

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