backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-27 03:53:12 +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

127
d0/d01/smallest__circle_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/smallest_circle.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('d0/d01/smallest__circle_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d01/smallest__circle_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -122,21 +124,21 @@ 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:a3cbebd6f4d2cdf227663c67fe41ba12a" id="r_a3cbebd6f4d2cdf227663c67fe41ba12a"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a> (const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;B)</td></tr>
<tr class="memitem:a3cbebd6f4d2cdf227663c67fe41ba12a" id="r_a3cbebd6f4d2cdf227663c67fe41ba12a"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a> (const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;B)</td></tr>
<tr class="separator:a3cbebd6f4d2cdf227663c67fe41ba12a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a94682a4a70d5906857ca09de5b9fb2cc" id="r_a94682a4a70d5906857ca09de5b9fb2cc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a> (const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;B, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;C)</td></tr>
<tr class="memitem:a94682a4a70d5906857ca09de5b9fb2cc" id="r_a94682a4a70d5906857ca09de5b9fb2cc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a> (const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;B, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;C)</td></tr>
<tr class="separator:a94682a4a70d5906857ca09de5b9fb2cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aee6d48762c1dfb9f14627927f0c16fad" id="r_aee6d48762c1dfb9f14627927f0c16fad"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;Center, double R)</td></tr>
<tr class="memitem:aee6d48762c1dfb9f14627927f0c16fad" id="r_aee6d48762c1dfb9f14627927f0c16fad"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;Center, double R)</td></tr>
<tr class="separator:aee6d48762c1dfb9f14627927f0c16fad"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0b0676df8e4da7a08c7ccaecea344903" id="r_a0b0676df8e4da7a08c7ccaecea344903"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P)</td></tr>
<tr class="memitem:a0b0676df8e4da7a08c7ccaecea344903" id="r_a0b0676df8e4da7a08c7ccaecea344903"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P)</td></tr>
<tr class="separator:a0b0676df8e4da7a08c7ccaecea344903"><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="../../d0/d01/smallest__circle_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:a0283886819c7c140a023582b7269e2d0" id="r_a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
<tr class="memitem:a0283886819c7c140a023582b7269e2d0" id="r_a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
<tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e" id="r_a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
<tr class="memitem:a6d0455dd5c30adda100e95f0423c786e" id="r_a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
<tr class="separator:a6d0455dd5c30adda100e95f0423c786e"><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="../../d0/d01/smallest__circle_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>
@@ -152,8 +154,7 @@ Functions</h2></td></tr>
<tr>
<td class="memname">double circle </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>P</em></td><td>)</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>P</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -200,10 +201,10 @@ The function returns the radius of the circle and prints the coordinated of the
<div class="line"><span class="lineno"> 118</span> (P[i].x * (P[j].y - P[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>].y) +</div>
<div class="line"><span class="lineno"> 119</span> P[j].x * (P[k].y - P[i].y) +</div>
<div class="line"><span class="lineno"> 120</span> P[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>].x * (P[i].y - P[j].y)));</div>
<div class="line"><span class="lineno"> 121</span> R = (<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], P[j]) * <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[j], P[k]) *</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[k], P[i])) /</div>
<div class="line"><span class="lineno"> 123</span> (4 * <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a>(P[i], P[j], P[k]));</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
<div class="line"><span class="lineno"> 121</span> R = (<a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], P[j]) * <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[j], P[k]) *</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[k], P[i])) /</div>
<div class="line"><span class="lineno"> 123</span> (4 * <a class="code hl_function" href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a>(P[i], P[j], P[k]));</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
<div class="line"><span class="lineno"> 125</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 126</span> }</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (R &lt;= minR) {</div>
@@ -219,8 +220,8 @@ The function returns the radius of the circle and prints the coordinated of the
<div class="line"><span class="lineno"> 137</span> <span class="comment">// check for diameterically opposite points</span></div>
<div class="line"><span class="lineno"> 138</span> C.x = (P[i].x + P[j].x) / 2;</div>
<div class="line"><span class="lineno"> 139</span> C.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = (P[i].y + P[j].y) / 2;</div>
<div class="line"><span class="lineno"> 140</span> R = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, P[i]);</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
<div class="line"><span class="lineno"> 140</span> R = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, P[i]);</div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">continue</span>;</div>
<div class="line"><span class="lineno"> 143</span> }</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">if</span> (R &lt;= minR) {</div>
@@ -235,9 +236,9 @@ The function returns the radius of the circle and prints the coordinated of the
<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="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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:37</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:54</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_aee6d48762c1dfb9f14627927f0c16fad"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a></div><div class="ttdeci">bool PointInCircle(const std::vector&lt; Point &gt; &amp;P, const Point &amp;Center, double R)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:72</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:37</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:54</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_aee6d48762c1dfb9f14627927f0c16fad"><div class="ttname"><a href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a></div><div class="ttdeci">bool PointInCircle(const std::vector&lt; Point &gt; &amp;P, const Point &amp;Center, double R)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:72</div></div>
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -257,19 +258,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">double LenghtLine </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</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="../../d8/dc8/struct_point.html">Point</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="../../d8/dc8/struct_point.html">Point</a> &amp;</td> <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -307,24 +301,23 @@ 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 program </p>
<div class="fragment"><div class="line"><span class="lineno"> 198</span> {</div>
<div class="line"><span class="lineno"> 199</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 199</span> <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
<div class="line"><span class="lineno"> 200</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"> 201</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
<div class="line"><span class="lineno"> 201</span> <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
<div class="line"><span class="lineno"> 202</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"> 203</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
<div class="line"><span class="lineno"> 204</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 205</span>}</div>
<div class="ttc" id="asmallest__circle_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:173</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:188</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:158</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:173</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:188</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:158</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -342,25 +335,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool PointInCircle </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>P</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>P</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;&#160;</td>
<td class="paramname"><em>Center</em>, </td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;</td> <td class="paramname"><span class="paramname"><em>Center</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>R</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>R</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -377,7 +362,7 @@ Here is the call graph for this function:</div>
False if P lies outside the circle </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 72</span> {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], Center) &gt; R)</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], Center) &gt; R)</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -399,7 +384,7 @@ Here is the call graph for this function:</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>
@@ -415,10 +400,10 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 162</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(1, 3));</div>
<div class="line"><span class="lineno"> 163</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(4, 1));</div>
<div class="line"><span class="lineno"> 164</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3, -2));</div>
<div class="line"><span class="lineno"> 165</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="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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"> 165</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="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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"> 166</span>}</div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector&lt; Point &gt; &amp;P)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:87</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector&lt; Point &gt; &amp;P)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:87</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>
@@ -437,7 +422,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -452,7 +437,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 176</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 2));</div>
<div class="line"><span class="lineno"> 177</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 2));</div>
<div class="line"><span class="lineno"> 178</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 0));</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_function" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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"> 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_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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">
Here is the call graph for this function:</div>
@@ -471,7 +456,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -479,14 +464,14 @@ Here is the call graph for this function:</div>
<p>Test case: result should be: <br />
Circle with <br />
radius 1.821078397711709 <br />
centre at (2.142857142857143, 1.7857142857142856) </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000010">Todo:</a></b></dt><dd>This test fails </dd></dl>
centre at (2.142857142857143, 1.7857142857142856) </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000010">Todo</a></b></dt><dd>This test fails </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 188</span> {</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> Pv;</div>
<div class="line"><span class="lineno"> 190</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0.5, 1));</div>
<div class="line"><span class="lineno"> 191</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3.5, 3));</div>
<div class="line"><span class="lineno"> 192</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2.5, 0));</div>
<div class="line"><span class="lineno"> 193</span> Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 1.5));</div>
<div class="line"><span class="lineno"> 194</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="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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"> 194</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="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &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"> 195</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -505,25 +490,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">double TriangleArea </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;&#160;</td>
<td class="paramname"><em>A</em>, </td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</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="../../d8/dc8/struct_point.html">Point</a> &amp;&#160;</td>
<td class="paramname"><em>B</em>, </td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;</td> <td class="paramname"><span class="paramname"><em>B</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &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 <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;</td> <td class="paramname"><span class="paramname"><em>C</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -540,9 +517,9 @@ Here is the call graph for this function:</div>
</dl>
<dl class="section return"><dt>Returns</dt><dd>area of triangle </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 54</span> {</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">double</span> a = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(A, B);</div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordtype">double</span> b = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(B, C);</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">double</span> c = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, A);</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">double</span> a = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(A, B);</div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordtype">double</span> b = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(B, C);</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">double</span> c = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, A);</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordtype">double</span> p = (a + b + c) / 2;</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(p * (p - a) * (p - b) * (p - c));</div>
<div class="line"><span class="lineno"> 60</span>}</div>
@@ -560,7 +537,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="../../d0/d01/smallest__circle_8cpp.html">smallest_circle.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>

42
d0/d08/realtime__stats_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/realtime_stats.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('d0/d08/realtime__stats_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d08/realtime__stats_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -131,9 +133,9 @@ 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:aa54c915581fcc495489175a4386d59fd" id="r_aa54c915581fcc495489175a4386d59fd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a> (const float *test_data, const int number_of_samples)</td></tr>
<tr class="memitem:aa54c915581fcc495489175a4386d59fd" id="r_aa54c915581fcc495489175a4386d59fd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa54c915581fcc495489175a4386d59fd">test_function</a> (const float *test_data, const int number_of_samples)</td></tr>
<tr class="separator:aa54c915581fcc495489175a4386d59fd"><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="../../d0/d08/realtime__stats_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>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -149,26 +151,19 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char **&#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">
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 158</span> {</div>
<div class="line"><span class="lineno"> 159</span> <span class="keyword">const</span> <span class="keywordtype">float</span> test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a>(test_data1, <span class="keyword">sizeof</span>(test_data1) / <span class="keyword">sizeof</span>(test_data1[0]));</div>
<div class="line"><span class="lineno"> 160</span> <a class="code hl_function" href="#aa54c915581fcc495489175a4386d59fd">test_function</a>(test_data1, <span class="keyword">sizeof</span>(test_data1) / <span class="keyword">sizeof</span>(test_data1[0]));</div>
<div class="line"><span class="lineno"> 161</span> </div>
<div class="line"><span class="lineno"> 162</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"> 163</span> &lt;&lt; <span class="stringliteral">&quot;Enter data. Any non-numeric data will terminate the data input.&quot;</span></div>
@@ -215,7 +210,7 @@ Functions</h2></td></tr>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:77</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:89</div></div>
<div class="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="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:118</div></div>
<div class="ttc" id="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:118</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -233,19 +228,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void test_function </td>
<td>(</td>
<td class="paramtype">const float *&#160;</td>
<td class="paramname"><em>test_data</em>, </td>
<td class="paramtype">const float *</td> <td class="paramname"><span class="paramname"><em>test_data</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const int&#160;</td>
<td class="paramname"><em>number_of_samples</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const int</td> <td class="paramname"><span class="paramname"><em>number_of_samples</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -307,7 +295,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="../../d0/d08/realtime__stats_8cpp.html">realtime_stats.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
d0/d0d/structmst-members.html
View File

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

20
d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
View File

@@ -1,13 +1,13 @@
<map id="graph::RootedTree" name="graph::RootedTree">
<area shape="rect" id="Node000001" title=" " alt="" coords="173,301,302,327"/>
<area shape="rect" id="Node000002" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="99,198,227,223"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,234,231,299,226,302,178,237"/>
<area shape="rect" id="Node000003" 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="edge2_Node000002_Node000003" title=" " alt="" coords="106,144,154,196,150,199,102,148"/>
<area shape="rect" id="Node000001" title=" " alt="" coords="173,316,302,342"/>
<area shape="rect" id="Node000002" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="99,213,227,238"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,249,231,314,226,317,178,252"/>
<area shape="rect" id="Node000003" 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="edge2_Node000002_Node000003" title=" " alt="" coords="106,159,154,211,150,214,102,163"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="57,5,95,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="79,46,79,93,73,93,73,46"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,94,328,135"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="239,150,222,176,190,199,187,195,218,172,234,148"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="251,198,373,223"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="296,237,248,302,244,299,292,234"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="79,47,79,109,73,109,73,47"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,109,328,150"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="239,165,222,191,190,214,187,210,218,187,234,163"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="251,213,373,238"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="296,252,248,317,244,314,292,249"/>
</map>

2
d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
View File

@@ -1 +1 @@
050eb78f2fe068cc94e311fbe15511ee
c3f294eaa860a6b1bc98890ece84713d

17
d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::RootedTree Pages: 1 -->
<svg width="284pt" height="249pt"
viewBox="0.00 0.00 283.50 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="284pt" height="261pt"
viewBox="0.00 0.00 283.50 260.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 245.25)">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 256.5)">
<title>graph::RootedTree</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -69,8 +69,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67.4,-241.25 38.6,-241.25 38.6,-222 67.4,-222 67.4,-241.25"/>
<text text-anchor="middle" x="53" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
<polygon fill="white" stroke="#bfbfbf" points="67.4,-252.5 38.6,-252.5 38.6,-233.25 67.4,-233.25 67.4,-252.5"/>
<text text-anchor="middle" x="53" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -78,11 +78,12 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-210.42C53,-199.16 53,-185.39 53,-175.17"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-210.23 53,-220.23 56.5,-210.23 49.5,-210.23"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-221.61C53,-207.14 53,-188.02 53,-175.04"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-221.34 53,-231.34 56.5,-221.34 49.5,-221.34"/>
</a>
</g>
<text text-anchor="middle" x="65" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
<text text-anchor="middle" x="74.38" y="-205.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="74.38" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">keys</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.6 KiB

After

Width:  |  Height:  |  Size: 6.7 KiB

17
d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg
View File

@@ -4,9 +4,9 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::RootedTree Pages: 1 -->
<svg width="284pt" height="249pt"
viewBox="0.00 0.00 283.50 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
<svg width="284pt" height="261pt"
viewBox="0.00 0.00 283.50 260.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 256.5)">
<title>graph::RootedTree</title>
<!-- Node1 -->
<g id="Node000001" class="node">
@@ -59,8 +59,8 @@
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67.4,-241.25 38.6,-241.25 38.6,-222 67.4,-222 67.4,-241.25"/>
<text text-anchor="middle" x="53" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
<polygon fill="white" stroke="#bfbfbf" points="67.4,-252.5 38.6,-252.5 38.6,-233.25 67.4,-233.25 67.4,-252.5"/>
<text text-anchor="middle" x="53" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
@@ -68,11 +68,12 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-210.42C53,-199.16 53,-185.39 53,-175.17"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-210.23 53,-220.23 56.5,-210.23 49.5,-210.23"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53,-221.61C53,-207.14 53,-188.02 53,-175.04"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.5,-221.34 53,-231.34 56.5,-221.34 49.5,-221.34"/>
</a>
</g>
<text text-anchor="middle" x="65" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
<text text-anchor="middle" x="74.38" y="-205.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="74.38" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">keys</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.8 KiB

After

Width:  |  Height:  |  Size: 6.0 KiB

14
d0/d2b/namespacequick__sort.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++: quick_sort 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('d0/d2b/namespacequick__sort.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d2b/namespacequick__sort.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d2b/namespacequick__sort.html','../
<div class="contents">
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++.
<a href="../../d0/d2b/namespacequick__sort.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the <a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d2b/namespacequick__sort.html','../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d2b/namespacequick__sort.html">quick_sort</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
d0/d2e/namespaceneural__network.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++: neural_network 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('d0/d2e/namespaceneural__network.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d2e/namespaceneural__network.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d2e/namespaceneural__network.html',
<div class="contents">
<p>Neural Network or Multilayer Perceptron.
<a href="../../d0/d2e/namespaceneural__network.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>Neural Network or Multilayer Perceptron. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d2e/namespaceneural__network.html',
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d2e/namespaceneural__network.html">neural_network</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>

124
d0/d3e/classdata__structures_1_1trie.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 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('d0/d3e/classdata__structures_1_1trie.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d3e/classdata__structures_1_1trie.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -108,7 +110,7 @@ $(document).ready(function(){initNavTree('d0/d3e/classdata__structures_1_1trie.h
<div class="contents">
<p><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code>
<a href="../../d0/d3e/classdata__structures_1_1trie.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>
@@ -116,25 +118,25 @@ Public Member Functions</h2></td></tr>
&#160;</td><td class="memItemRight" valign="bottom"><b>trie</b> ()=default</td></tr>
<tr class="memdesc:a87d8bf99aea936f9381141753f1e90a8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class default constructor. <br /></td></tr>
<tr class="separator:a87d8bf99aea936f9381141753f1e90a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ab94bc6417e3f59fab33cea5b64d546" id="r_a0ab94bc6417e3f59fab33cea5b64d546"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">insert</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:a0ab94bc6417e3f59fab33cea5b64d546" id="r_a0ab94bc6417e3f59fab33cea5b64d546"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ab94bc6417e3f59fab33cea5b64d546">insert</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:a0ab94bc6417e3f59fab33cea5b64d546"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a499f87fd833203ef9492b4870aa6d42d" id="r_a499f87fd833203ef9492b4870aa6d42d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="memitem:a499f87fd833203ef9492b4870aa6d42d" id="r_a499f87fd833203ef9492b4870aa6d42d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a499f87fd833203ef9492b4870aa6d42d">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="separator:a499f87fd833203ef9492b4870aa6d42d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeac27cfd397d2dd3f2f519efffafeeab" id="r_aeac27cfd397d2dd3f2f519efffafeeab"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="memitem:aeac27cfd397d2dd3f2f519efffafeeab" id="r_aeac27cfd397d2dd3f2f519efffafeeab"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="separator:aeac27cfd397d2dd3f2f519efffafeeab"><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:aab373beb3f618b90922528c68797d988" id="r_aab373beb3f618b90922528c68797d988"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a> (const char &amp;ch) const</td></tr>
<tr class="memitem:aab373beb3f618b90922528c68797d988" id="r_aab373beb3f618b90922528c68797d988"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aab373beb3f618b90922528c68797d988">char_to_int</a> (const char &amp;ch) const</td></tr>
<tr class="memdesc:aab373beb3f618b90922528c68797d988"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convert a character to integer for indexing. <br /></td></tr>
<tr class="separator:aab373beb3f618b90922528c68797d988"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a961eb5d576d2420f2036009154397c63" id="r_a961eb5d576d2420f2036009154397c63"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">search</a> (const <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="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="memitem:a961eb5d576d2420f2036009154397c63" id="r_a961eb5d576d2420f2036009154397c63"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a961eb5d576d2420f2036009154397c63">search</a> (const <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="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
<tr class="separator:a961eb5d576d2420f2036009154397c63"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a362dd78748a1f01ab019e55fd6098a8b" id="r_a362dd78748a1f01ab019e55fd6098a8b"><td class="memItemLeft" align="right" valign="top"><a id="a362dd78748a1f01ab019e55fd6098a8b" name="a362dd78748a1f01ab019e55fd6098a8b"></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/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt;, <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>&lt;&lt; 1 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>arr</b></td></tr>
<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/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt;, <a class="el" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>&lt;&lt; 1 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>arr</b></td></tr>
<tr class="memdesc:a362dd78748a1f01ab019e55fd6098a8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive tree nodes as an array of shared-pointers. <br /></td></tr>
<tr class="separator:a362dd78748a1f01ab019e55fd6098a8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4cb0f775b5a4bc14a6d39b5c93883eb6" id="r_a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="memItemLeft" align="right" valign="top"><a id="a4cb0f775b5a4bc14a6d39b5c93883eb6" name="a4cb0f775b5a4bc14a6d39b5c93883eb6"></a>
@@ -164,8 +166,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>N
<tr>
<td class="memname">uint8_t data_structures::trie::char_to_int </td>
<td>(</td>
<td class="paramtype">const char &amp;&#160;</td>
<td class="paramname"><em>ch</em></td><td>)</td>
<td class="paramtype">const char &amp;</td> <td class="paramname"><span class="paramname"><em>ch</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -188,7 +189,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>N
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (ch &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; ch &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;A&#39;</span>;</div>
<div class="line"><span class="lineno"> 41</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch &gt;= <span class="charliteral">&#39;a&#39;</span> &amp;&amp; ch &lt;= <span class="charliteral">&#39;z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;a&#39;</span> + <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>;</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;a&#39;</span> + <a class="code hl_variable" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>;</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> </div>
<div class="line"><span class="lineno"> 45</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid character present. Exiting...&quot;</span>;</div>
@@ -196,7 +197,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>N
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 48</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="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:27</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:27</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -218,19 +219,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool data_structures::trie::deleteString </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 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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>index</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>index</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -240,7 +234,7 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>removes the string if it is not a prefix of any other string, if it is then just sets the ::data_structure::trie::isEndofWord to false, else removes the given string </p><dl class="section note"><dt>Note</dt><dd>the function ::data_structure::trie::deleteString might be erroneous </dd></dl>
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000005">Todo:</a></b></dt><dd>review the function ::data_structure::trie::deleteString and the commented lines </dd></dl>
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000005">Todo</a></b></dt><dd>review the function ::data_structure::trie::deleteString and the commented lines </dd></dl>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">str</td><td>string to remove </td></tr>
@@ -253,29 +247,29 @@ Here is the call graph for this function:</div>
<code>false</code> if unsuccessful </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 134</span> {</div>
<div class="line"><span class="lineno"> 135</span> <span class="keywordflow">if</span> (index == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 138</span> }</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a> = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a> = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 140</span> <span class="comment">// following lines - possible source of error?</span></div>
<div class="line"><span class="lineno"> 141</span> <span class="comment">// for (int i = 0; i &lt; NUM_CHARS; i++)</span></div>
<div class="line"><span class="lineno"> 142</span> <span class="comment">// if (!arr[i])</span></div>
<div class="line"><span class="lineno"> 143</span> <span class="comment">// return false;</span></div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 145</span> }</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 148</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 149</span> }</div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordtype">bool</span> var = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a>(str, index + 1);</div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordtype">bool</span> var = <a class="code hl_function" href="#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a>(str, index + 1);</div>
<div class="line"><span class="lineno"> 151</span> <span class="keywordflow">if</span> (var) {</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j].reset();</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 152</span> <a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j].reset();</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 154</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 155</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 156</span> <span class="keywordtype">int</span> i = 0;</div>
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>; i++) {</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[i]) {</div>
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>; i++) {</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[i]) {</div>
<div class="line"><span class="lineno"> 159</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 160</span> }</div>
<div class="line"><span class="lineno"> 161</span> }</div>
@@ -288,10 +282,10 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 168</span> &lt;&lt; <span class="stringliteral">&quot;Should not reach this line\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 169</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 170</span> }</div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array&lt; std::shared_ptr&lt; trie &gt;, NUM_CHARS&lt;&lt; 1 &gt; arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:29</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:30</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &amp;ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:38</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:134</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array&lt; std::shared_ptr&lt; trie &gt;, NUM_CHARS&lt;&lt; 1 &gt; arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:29</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:30</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &amp;ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:38</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:134</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::length</a></div><div class="ttdeci">T length(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -313,8 +307,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void data_structures::trie::insert </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>
@@ -334,26 +327,26 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> root(<span class="keyword">nullptr</span>);</div>
<div class="line"><span class="lineno"> 79</span> </div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span>&amp; ch : str) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(ch);</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="#aab373beb3f618b90922528c68797d988">char_to_int</a>(ch);</div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">if</span> (root) {</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (root-&gt;arr[j]) {</div>
<div class="line"><span class="lineno"> 84</span> root = root-&gt;arr[j];</div>
<div class="line"><span class="lineno"> 85</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
<div class="line"><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
<div class="line"><span class="lineno"> 87</span> root-&gt;arr[j] = temp;</div>
<div class="line"><span class="lineno"> 88</span> root = temp;</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 91</span> root = <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j];</div>
<div class="line"><span class="lineno"> 90</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 91</span> root = <a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j];</div>
<div class="line"><span class="lineno"> 92</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j] = temp;</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
<div class="line"><span class="lineno"> 94</span> <a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j] = temp;</div>
<div class="line"><span class="lineno"> 95</span> root = temp;</div>
<div class="line"><span class="lineno"> 96</span> }</div>
<div class="line"><span class="lineno"> 97</span> }</div>
<div class="line"><span class="lineno"> 98</span> root-&gt;isEndofWord = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a87d8bf99aea936f9381141753f1e90a8"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">data_structures::trie::trie</a></div><div class="ttdeci">trie()=default</div><div class="ttdoc">Class default constructor.</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_a87d8bf99aea936f9381141753f1e90a8"><div class="ttname"><a href="#a87d8bf99aea936f9381141753f1e90a8">data_structures::trie::trie</a></div><div class="ttdeci">trie()=default</div><div class="ttdoc">Class default constructor.</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -375,25 +368,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool data_structures::trie::search </td>
<td>(</td>
<td class="paramtype">const <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="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>root</em>, </td>
<td class="paramtype">const <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="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>root</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/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>str</em>, </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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>index</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>index</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -419,7 +404,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 63</span> }</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">if</span> (!root-&gt;arr[j]) {</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 67</span> }</div>
@@ -446,19 +431,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool data_structures::trie::search </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 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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>index</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>index</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -479,16 +457,16 @@ Here is the call graph for this function:</div>
<code>false</code> if not found </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 107</span> {</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (index == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 111</span> }</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 113</span> }</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 114</span> <span class="keywordtype">int</span> j = <a class="code hl_function" href="#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 117</span> }</div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j], str, index + 1);</div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j], str, index + 1);</div>
<div class="line"><span class="lineno"> 119</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -507,7 +485,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"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</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>

71
d0/d46/finding__number__of__digits__in__a__number_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/finding_number_of_digits_in_a_number.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('d0/d46/finding__number__of__digits__in__a__number_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d46/finding__number__of__digits__in__a__number_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -116,18 +118,18 @@ Include dependency graph for finding_number_of_digits_in_a_number.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:a8a3b522a675ab4cdec2d275f6f7798a1" id="r_a8a3b522a675ab4cdec2d275f6f7798a1"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a> (uint64_t n)</td></tr>
<tr class="memitem:a8a3b522a675ab4cdec2d275f6f7798a1" id="r_a8a3b522a675ab4cdec2d275f6f7798a1"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a> (uint64_t n)</td></tr>
<tr class="memdesc:a8a3b522a675ab4cdec2d275f6f7798a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr>
<tr class="separator:a8a3b522a675ab4cdec2d275f6f7798a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0862b67cf73651707ece04673e1ae49" id="r_ac0862b67cf73651707ece04673e1ae49"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a> (double n)</td></tr>
<tr class="memitem:ac0862b67cf73651707ece04673e1ae49" id="r_ac0862b67cf73651707ece04673e1ae49"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a> (double n)</td></tr>
<tr class="memdesc:ac0862b67cf73651707ece04673e1ae49"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function finds the number of digits in constant time using logarithmic function TC: O(1) <br /></td></tr>
<tr class="separator:ac0862b67cf73651707ece04673e1ae49"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab4c15b7f1aedd4419a65cd49562cc300" id="r_ab4c15b7f1aedd4419a65cd49562cc300"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a> ()</td></tr>
<tr class="memitem:ab4c15b7f1aedd4419a65cd49562cc300" id="r_ab4c15b7f1aedd4419a65cd49562cc300"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a> ()</td></tr>
<tr class="memdesc:ab4c15b7f1aedd4419a65cd49562cc300"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:ab4c15b7f1aedd4419a65cd49562cc300"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8b222ea7f3e6e3128e67d546b654d3a9" id="r_a8b222ea7f3e6e3128e67d546b654d3a9"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8b222ea7f3e6e3128e67d546b654d3a9">second_test</a> ()</td></tr>
<tr class="memitem:a8b222ea7f3e6e3128e67d546b654d3a9" id="r_a8b222ea7f3e6e3128e67d546b654d3a9"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b222ea7f3e6e3128e67d546b654d3a9">second_test</a> ()</td></tr>
<tr class="separator:a8b222ea7f3e6e3128e67d546b654d3a9"><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="../../d0/d46/finding__number__of__digits__in__a__number_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 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
<tr>
<td class="memname">uint64_t finding_number_of_digits_in_a_number </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>
@@ -190,8 +191,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
<tr>
<td class="memname">double finding_number_of_digits_in_a_number_using_log </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>n</em></td><td>)</td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -237,7 +237,7 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
<tr>
<td class="memname">static void first_test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -251,15 +251,15 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 73</span> {</div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(5492) == 4);</div>
<div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(-0) == 0);</div>
<div class="line"><span class="lineno"> 76</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(10000) == 5);</div>
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(9) == 1);</div>
<div class="line"><span class="lineno"> 78</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(100000) == 6);</div>
<div class="line"><span class="lineno"> 79</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(13) == 2);</div>
<div class="line"><span class="lineno"> 80</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(564) == 3);</div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(5492) == 4);</div>
<div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(-0) == 0);</div>
<div class="line"><span class="lineno"> 76</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(10000) == 5);</div>
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(9) == 1);</div>
<div class="line"><span class="lineno"> 78</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(100000) == 6);</div>
<div class="line"><span class="lineno"> 79</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(13) == 2);</div>
<div class="line"><span class="lineno"> 80</span> assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(564) == 3);</div>
<div class="line"><span class="lineno"> 81</span>}</div>
<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_a8a3b522a675ab4cdec2d275f6f7798a1"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a></div><div class="ttdeci">uint64_t finding_number_of_digits_in_a_number(uint64_t n)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:30</div></div>
<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_a8a3b522a675ab4cdec2d275f6f7798a1"><div class="ttname"><a href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a></div><div class="ttdeci">uint64_t finding_number_of_digits_in_a_number(uint64_t n)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:30</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -277,8 +277,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>
@@ -288,13 +287,13 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 96</span> {</div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a>();</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a>();</div>
<div class="line"><span class="lineno"> 99</span> second_test();</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;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 102</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="afinding__number__of__digits__in__a__number_8cpp_html_ab4c15b7f1aedd4419a65cd49562cc300"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a></div><div class="ttdeci">static void first_test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:73</div></div>
<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ab4c15b7f1aedd4419a65cd49562cc300"><div class="ttname"><a href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a></div><div class="ttdeci">static void first_test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:73</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -315,7 +314,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void second_test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -326,15 +325,15 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 83</span> {</div>
<div class="line"><span class="lineno"> 84</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(5492) == 4);</div>
<div class="line"><span class="lineno"> 85</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(-0) == 0);</div>
<div class="line"><span class="lineno"> 86</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(10000) == 5);</div>
<div class="line"><span class="lineno"> 87</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(9) == 1);</div>
<div class="line"><span class="lineno"> 88</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(100000) == 6);</div>
<div class="line"><span class="lineno"> 89</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(13) == 2);</div>
<div class="line"><span class="lineno"> 90</span> assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(564) == 3);</div>
<div class="line"><span class="lineno"> 84</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(5492) == 4);</div>
<div class="line"><span class="lineno"> 85</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(-0) == 0);</div>
<div class="line"><span class="lineno"> 86</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(10000) == 5);</div>
<div class="line"><span class="lineno"> 87</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(9) == 1);</div>
<div class="line"><span class="lineno"> 88</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(100000) == 6);</div>
<div class="line"><span class="lineno"> 89</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(13) == 2);</div>
<div class="line"><span class="lineno"> 90</span> assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(564) == 3);</div>
<div class="line"><span class="lineno"> 91</span>}</div>
<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ac0862b67cf73651707ece04673e1ae49"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a></div><div class="ttdeci">double finding_number_of_digits_in_a_number_using_log(double n)</div><div class="ttdoc">This function finds the number of digits in constant time using logarithmic function TC: O(1)</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:53</div></div>
<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ac0862b67cf73651707ece04673e1ae49"><div class="ttname"><a href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a></div><div class="ttdeci">double finding_number_of_digits_in_a_number_using_log(double n)</div><div class="ttdoc">This function finds the number of digits in constant time using logarithmic function TC: O(1)</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:53</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -344,7 +343,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="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html">finding_number_of_digits_in_a_number.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>

52
d0/d51/approximate__pi_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/approximate_pi.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('d0/d51/approximate__pi_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d51/approximate__pi_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -100,8 +102,7 @@ $(document).ready(function(){initNavTree('d0/d51/approximate__pi_8cpp.html','../
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">approximate_pi.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -126,28 +127,21 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a937dc0c826acf3e6c0d2785527f7e9d7" id="r_a937dc0c826acf3e6c0d2785527f7e9d7"><td class="memItemLeft" align="right" valign="top"><a id="a937dc0c826acf3e6c0d2785527f7e9d7" name="a937dc0c826acf3e6c0d2785527f7e9d7"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>math::Point</b> = { double x</td></tr>
<tr class="memdesc:a937dc0c826acf3e6c0d2785527f7e9d7"><td class="mdescLeft">&#160;</td><td class="mdescRight">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. <br /></td></tr>
<tr class="separator:a937dc0c826acf3e6c0d2785527f7e9d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a006c8ebd11bb1e035815dc835a1a7a85" id="r_a006c8ebd11bb1e035815dc835a1a7a85"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a></td></tr>
<tr class="memdesc:a006c8ebd11bb1e035815dc835a1a7a85"><td class="mdescLeft">&#160;</td><td class="mdescRight">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. <br /></td></tr>
<tr class="separator:a006c8ebd11bb1e035815dc835a1a7a85"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d47/namespacemath.html#a937dc0c826acf3e6c0d2785527f7e9d7">Point</a> &gt; &amp;pts)</td></tr>
<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;pts)</td></tr>
<tr class="memdesc:abf7f2a6d91f1ca6c89698792aea3f188"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π. <br /></td></tr>
<tr class="separator:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a7d9210f6c94ea8c936a8162dc16c829a" id="r_a7d9210f6c94ea8c936a8162dc16c829a"><td class="memItemLeft" align="right" valign="top"><a id="a7d9210f6c94ea8c936a8162dc16c829a" name="a7d9210f6c94ea8c936a8162dc16c829a"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><b>math::y</b></td></tr>
<tr class="separator:a7d9210f6c94ea8c936a8162dc16c829a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. </p>
@@ -163,8 +157,7 @@ double&#160;</td><td class="memItemRight" valign="bottom"><b>math::y</b></td></t
<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>
@@ -173,10 +166,10 @@ double&#160;</td><td class="memItemRight" valign="bottom"><b>math::y</b></td></t
<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"> 80</span> {</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_function" href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 83</span>}</div>
<div class="ttc" id="aapproximate__pi_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:62</div></div>
<div class="ttc" id="aapproximate__pi_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:62</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -197,7 +190,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -213,9 +206,9 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;math::Point&gt;</a> rands;</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; 100000; i++) {</div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_typedef" href="../../dd/d47/namespacemath.html#a937dc0c826acf3e6c0d2785527f7e9d7">math::Point</a> p;</div>
<div class="line"><span class="lineno"> 66</span> p.x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX); <span class="comment">// 0 &lt;= x &lt;= 1</span></div>
<div class="line"><span class="lineno"> 67</span> p.y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX); <span class="comment">// 0 &lt;= y &lt;= 1</span></div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_typedef" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a> p;</div>
<div class="line"><span class="lineno"> 66</span> p.x = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX); <span class="comment">// 0 &lt;= x &lt;= 1</span></div>
<div class="line"><span class="lineno"> 67</span> p.y = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX); <span class="comment">// 0 &lt;= y &lt;= 1</span></div>
<div class="line"><span class="lineno"> 68</span> rands.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(p);</div>
<div class="line"><span class="lineno"> 69</span> }</div>
<div class="line"><span class="lineno"> 70</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &gt; 3.135);</div>
@@ -225,10 +218,9 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 74</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="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="anamespacemath_html_a937dc0c826acf3e6c0d2785527f7e9d7"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a937dc0c826acf3e6c0d2785527f7e9d7">math::Point</a></div><div class="ttdeci">{ double x Point</div><div class="ttdoc">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:36</div></div>
<div class="ttc" id="anamespacemath_html_a006c8ebd11bb1e035815dc835a1a7a85"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a></div><div class="ttdeci">struct { double x; double y;} Point</div><div class="ttdoc">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:35</div></div>
<div class="ttc" id="anamespacemath_html_abf7f2a6d91f1ca6c89698792aea3f188"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a></div><div class="ttdeci">double approximate_pi(const std::vector&lt; Point &gt; &amp;pts)</div><div class="ttdoc">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:47</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="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="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
<div class="ttc" id="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">
@@ -245,7 +237,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="../../d0/d51/approximate__pi_8cpp.html">approximate_pi.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>

2
d0/d51/approximate__pi_8cpp.js
View File

@@ -1,6 +1,6 @@
var approximate__pi_8cpp =
[
[ "Point", "d0/d51/approximate__pi_8cpp.html#a937dc0c826acf3e6c0d2785527f7e9d7", null ],
[ "Point", "d0/d51/approximate__pi_8cpp.html#a006c8ebd11bb1e035815dc835a1a7a85", null ],
[ "approximate_pi", "d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188", null ],
[ "main", "d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]

14
d0/d52/namespacewiggle__sort.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++: wiggle_sort 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('d0/d52/namespacewiggle__sort.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d52/namespacewiggle__sort.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/d52/namespacewiggle__sort.html','..
<div class="contents">
<p>Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm.
<a href="../../d0/d52/namespacewiggle__sort.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/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/d52/namespacewiggle__sort.html','..
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</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
d0/d55/classcll-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/d15/classcll.html','../../'); initResizable(); });
$(function(){initNavTree('d5/d15/classcll.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -119,7 +121,7 @@ $(document).ready(function(){initNavTree('d5/d15/classcll.html','../../'); initR
<!-- 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>

63
d0/d58/classgraph_1_1_rooted_tree.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: graph::RootedTree 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('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">
@@ -113,15 +115,15 @@ Inheritance diagram for graph::RootedTree:</div>
<div class="dynheader">
Collaboration diagram for graph::RootedTree:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg" width="379" height="332"><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="../../d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg" width="379" height="348"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></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:aacdeecac857623e9fbfe92590f3c504d" id="r_aacdeecac857623e9fbfe92590f3c504d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</td></tr>
<tr class="memitem:aacdeecac857623e9fbfe92590f3c504d" id="r_aacdeecac857623e9fbfe92590f3c504d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</td></tr>
<tr class="memdesc:aacdeecac857623e9fbfe92590f3c504d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided. <br /></td></tr>
<tr class="separator:aacdeecac857623e9fbfe92590f3c504d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
<tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:dynsection.toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
<tr class="memitem:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph" id="r_a877b2cba40d8d46dde6fb4209effed19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr>
<tr class="separator:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a3755ec9e6a842238c7f4aac10b661981 inherit pub_methods_classgraph_1_1_graph" id="r_a3755ec9e6a842238c7f4aac10b661981"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a> (T src)</td></tr>
@@ -146,7 +148,7 @@ Public Attributes</h2></td></tr>
int&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
<tr class="memdesc:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of the root vertex. <br /></td></tr>
<tr class="separator:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="inherit_header pub_attribs_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_attribs_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Attributes inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
<tr class="inherit_header pub_attribs_classgraph_1_1_graph"><td colspan="2" onclick="javascript:dynsection.toggleInherit('pub_attribs_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Attributes inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
<tr class="memitem:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph" id="r_a59940c462861f2fcf4951d1b6c084e6a"><td class="memItemLeft" align="right" valign="top">
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>neighbors</b></td></tr>
<tr class="memdesc:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors <br /></td></tr>
@@ -154,7 +156,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:ae6928f3ebd491541e9570e746b877c1e" id="r_ae6928f3ebd491541e9570e746b877c1e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a> ()</td></tr>
<tr class="memitem:ae6928f3ebd491541e9570e746b877c1e" id="r_ae6928f3ebd491541e9570e746b877c1e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a> ()</td></tr>
<tr class="memdesc:ae6928f3ebd491541e9570e746b877c1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices. <br /></td></tr>
<tr class="separator:ae6928f3ebd491541e9570e746b877c1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -173,19 +175,12 @@ Protected Member Functions</h2></td></tr>
<tr>
<td class="memname">graph::RootedTree::RootedTree </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;&#160;</td>
<td class="paramname"><em>undirected_edges</em>, </td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>undirected_edges</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>root_</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>root_</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -203,12 +198,12 @@ Protected Member Functions</h2></td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 95</span> : <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(undirected_edges.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() + 1, undirected_edges), <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>();</div>
<div class="fragment"><div class="line"><span class="lineno"> 95</span> : <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(undirected_edges.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() + 1, undirected_edges), <a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
<div class="line"><span class="lineno"> 96</span> <a class="code hl_function" href="#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>();</div>
<div class="line"><span class="lineno"> 97</span> }</div>
<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> bellman_ford.cpp:13</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:108</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:117</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:108</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:117</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -231,7 +226,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void graph::RootedTree::populate_parents </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -247,20 +242,20 @@ Here is the call graph for this function:</div>
<div class="fragment"><div class="line"><span class="lineno"> 117</span> {</div>
<div class="line"><span class="lineno"> 118</span> <span class="comment">// Initialize the vector with -1 which indicates the vertex</span></div>
<div class="line"><span class="lineno"> 119</span> <span class="comment">// wasn&#39;t yet visited.</span></div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(), -1);</div>
<div class="line"><span class="lineno"> 121</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
<div class="line"><span class="lineno"> 123</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = 0;</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(), -1);</div>
<div class="line"><span class="lineno"> 121</span> <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = <a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
<div class="line"><span class="lineno"> 123</span> <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = 0;</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> queue_of_vertices;</div>
<div class="line"><span class="lineno"> 125</span> queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
<div class="line"><span class="lineno"> 125</span> queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">while</span> (!queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordtype">int</span> vertex = queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
<div class="line"><span class="lineno"> 128</span> queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbor : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[vertex]) {</div>
<div class="line"><span class="lineno"> 130</span> <span class="comment">// As long as the vertex was not yet visited.</span></div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] == -1) {</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] = vertex;</div>
<div class="line"><span class="lineno"> 133</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[neighbor] = <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[vertex] + 1;</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] == -1) {</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] = vertex;</div>
<div class="line"><span class="lineno"> 133</span> <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[neighbor] = <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[vertex] + 1;</div>
<div class="line"><span class="lineno"> 134</span> queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbor);</div>
<div class="line"><span class="lineno"> 135</span> }</div>
<div class="line"><span class="lineno"> 136</span> }</div>
@@ -268,8 +263,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 138</span> }</div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:77</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:74</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:106</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:104</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:106</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:104</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
@@ -293,7 +288,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></li><li class="navelem"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.10.0 </li>
</ul>
</div>
</body>

17
d0/d5a/skip__list_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/skip_list.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('d0/d5a/skip__list_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d5a/skip__list_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -135,7 +137,7 @@ 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:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5a/skip__list_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><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
@@ -165,8 +167,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_struc
<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>
@@ -208,7 +209,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="../../d0/d5a/skip__list_8cpp.html">skip_list.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>

137
d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.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::trie_operations::Tnode 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('d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d0/d5f/classoperations__on__datastruct
<div class="contents">
<p>Class defining the structure of trie node and containing the methods to perform operations on them.
<a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for operations_on_datastructures::trie_operations::Tnode:</div>
<div class="dyncontent">
@@ -116,7 +118,7 @@ Collaboration diagram for operations_on_datastructures::trie_operations::Tnode:<
<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:a6f73ac06a639956cdef90f8c8dbe9187" id="r_a6f73ac06a639956cdef90f8c8dbe9187"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a6f73ac06a639956cdef90f8c8dbe9187">Tnode</a> (const <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memitem:a6f73ac06a639956cdef90f8c8dbe9187" id="r_a6f73ac06a639956cdef90f8c8dbe9187"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6f73ac06a639956cdef90f8c8dbe9187">Tnode</a> (const <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="separator:a6f73ac06a639956cdef90f8c8dbe9187"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e710662a70560d2f1cf24e5df78ba1e" id="r_a1e710662a70560d2f1cf24e5df78ba1e"><td class="memItemLeft" align="right" valign="top"><a id="a1e710662a70560d2f1cf24e5df78ba1e" name="a1e710662a70560d2f1cf24e5df78ba1e"></a>
<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (const <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)=default</td></tr>
@@ -127,34 +129,34 @@ Public Member Functions</h2></td></tr>
<tr class="memitem:a72c3d60c8afaf31a9b490030fa9cffb4" id="r_a72c3d60c8afaf31a9b490030fa9cffb4"><td class="memItemLeft" align="right" valign="top"><a id="a72c3d60c8afaf31a9b490030fa9cffb4" name="a72c3d60c8afaf31a9b490030fa9cffb4"></a>
<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&amp;)=default</td></tr>
<tr class="separator:a72c3d60c8afaf31a9b490030fa9cffb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afca808362c13273ca8c8ae7d58e8eee0" id="r_afca808362c13273ca8c8ae7d58e8eee0"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memitem:afca808362c13273ca8c8ae7d58e8eee0" id="r_afca808362c13273ca8c8ae7d58e8eee0"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:afca808362c13273ca8c8ae7d58e8eee0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to count the number of children a node in the trie has. <br /></td></tr>
<tr class="separator:afca808362c13273ca8c8ae7d58e8eee0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7ecb75b985b1ffc575a880274f855b1c" id="r_a7ecb75b985b1ffc575a880274f855b1c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">Insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;entry)</td></tr>
<tr class="memitem:a7ecb75b985b1ffc575a880274f855b1c" id="r_a7ecb75b985b1ffc575a880274f855b1c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ecb75b985b1ffc575a880274f855b1c">Insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;entry)</td></tr>
<tr class="memdesc:a7ecb75b985b1ffc575a880274f855b1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to insert a word in the trie. <br /></td></tr>
<tr class="separator:a7ecb75b985b1ffc575a880274f855b1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aefd24626ac47277431c9b8604e064340" id="r_aefd24626ac47277431c9b8604e064340"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">Delete</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> entry)</td></tr>
<tr class="memitem:aefd24626ac47277431c9b8604e064340" id="r_aefd24626ac47277431c9b8604e064340"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefd24626ac47277431c9b8604e064340">Delete</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> entry)</td></tr>
<tr class="memdesc:aefd24626ac47277431c9b8604e064340"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to verify presence and hence delete an entry from the trie. <br /></td></tr>
<tr class="separator:aefd24626ac47277431c9b8604e064340"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adef6940391f981ab86767775176b7169" id="r_adef6940391f981ab86767775176b7169"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> delete_string, int remove_index)</td></tr>
<tr class="memitem:adef6940391f981ab86767775176b7169" id="r_adef6940391f981ab86767775176b7169"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> delete_string, int remove_index)</td></tr>
<tr class="memdesc:adef6940391f981ab86767775176b7169"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call. <br /></td></tr>
<tr class="separator:adef6940391f981ab86767775176b7169"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4a624fcdf3c3beb2025d69f2cfda8023" id="r_a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memitem:a4a624fcdf3c3beb2025d69f2cfda8023" id="r_a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check a word's presence in the trie (Basic) <br /></td></tr>
<tr class="separator:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a097913c4badec2b60d50a171ecc299fe" id="r_a097913c4badec2b60d50a171ecc299fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memitem:a097913c4badec2b60d50a171ecc299fe" id="r_a097913c4badec2b60d50a171ecc299fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
<tr class="memdesc:a097913c4badec2b60d50a171ecc299fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest all the entries of trie which have a given common prefix. <br /></td></tr>
<tr class="separator:a097913c4badec2b60d50a171ecc299fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a18b70172ca4fb2811dbfb9a86e48b34c" id="r_a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memitem:a18b70172ca4fb2811dbfb9a86e48b34c" id="r_a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg". <br /></td></tr>
<tr class="separator:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9e556f52c837190ecf4265b1f05cfe9c" id="r_a9e556f52c837190ecf4265b1f05cfe9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memitem:a9e556f52c837190ecf4265b1f05cfe9c" id="r_a9e556f52c837190ecf4265b1f05cfe9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memdesc:a9e556f52c837190ecf4265b1f05cfe9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest most frequently searched entries of trie which have a given common prefix. <br /></td></tr>
<tr class="separator:a9e556f52c837190ecf4265b1f05cfe9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7c5ab271d8042540f64ef16d259d1503" id="r_a7c5ab271d8042540f64ef16d259d1503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memitem:a7c5ab271d8042540f64ef16d259d1503" id="r_a7c5ab271d8042540f64ef16d259d1503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
<tr class="memdesc:a7c5ab271d8042540f64ef16d259d1503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg". <br /></td></tr>
<tr class="separator:a7c5ab271d8042540f64ef16d259d1503"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aacafb8c9f3ebac7ac6c01d9645bb67b6" id="r_aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memitem:aacafb8c9f3ebac7ac6c01d9645bb67b6" id="r_aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
<tr class="memdesc:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to display the 3 suggestions with highest frequency of search hits. <br /></td></tr>
<tr class="separator:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -191,7 +193,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<tr>
<td class="memname">operations_on_datastructures::trie_operations::Tnode::Tnode </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 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<tr>
<td class="memname">operations_on_datastructures::trie_operations::Tnode::Tnode </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&#160;</td>
<td class="paramname"><em>node</em></td><td>)</td>
<td class="paramtype">const <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;</td> <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -253,7 +254,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<tr>
<td class="memname">operations_on_datastructures::trie_operations::Tnode::~Tnode </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -284,8 +285,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::Delete </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>&#160;</td>
<td class="paramname"><em>entry</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></td> <td class="paramname"><span class="paramname"><em>entry</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -315,7 +315,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<div class="line"><span class="lineno"> 164</span> <span class="comment">// If the current node is end of word for the current prefix or if it</span></div>
<div class="line"><span class="lineno"> 165</span> <span class="comment">// has 2 or more branches It cannot be deleted while deleting the</span></div>
<div class="line"><span class="lineno"> 166</span> <span class="comment">// required entry.</span></div>
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos) &gt; 1 || cur_pos-&gt;endOfWord) {</div>
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos) &gt; 1 || cur_pos-&gt;endOfWord) {</div>
<div class="line"><span class="lineno"> 168</span> delete_from = cur_pos; <span class="comment">// denotes the beginning of the shortest</span></div>
<div class="line"><span class="lineno"> 169</span> <span class="comment">// suffix that is allowed to be deleted</span></div>
<div class="line"><span class="lineno"> 170</span> delete_from_index = i - 1; <span class="comment">// Beginning index of the suffix</span></div>
@@ -335,7 +335,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<div class="line"><span class="lineno"> 184</span> </div>
<div class="line"><span class="lineno"> 185</span> <span class="comment">// If cur_pos is not a leaf node, unmark end of word and assign 0 to it&#39;s</span></div>
<div class="line"><span class="lineno"> 186</span> <span class="comment">// frequency for deletion</span></div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos)) {</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos)) {</div>
<div class="line"><span class="lineno"> 188</span> cur_pos-&gt;endOfWord = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 189</span> cur_pos-&gt;frequency = 0;</div>
<div class="line"><span class="lineno"> 190</span> <span class="keywordflow">return</span>;</div>
@@ -351,7 +351,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<div class="line"><span class="lineno"> 200</span> <span class="comment">// If number of characters in the suffix are more than 1, recursively delete</span></div>
<div class="line"><span class="lineno"> 201</span> <span class="comment">// each character starting from cur_pos using the helper function</span></div>
<div class="line"><span class="lineno"> 202</span> <span class="keywordflow">if</span> (n &gt; delete_from_index + 2) {</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a>(cur_pos, entry, delete_from_index + 2);</div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a>(cur_pos, entry, delete_from_index + 2);</div>
<div class="line"><span class="lineno"> 204</span> }</div>
<div class="line"><span class="lineno"> 205</span> <span class="comment">// If the suffix is only 1 char in length</span></div>
<div class="line"><span class="lineno"> 206</span> <span class="keywordflow">else</span> {</div>
@@ -359,8 +359,8 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
<div class="line"><span class="lineno"> 208</span> }</div>
<div class="line"><span class="lineno"> 209</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="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_adef6940391f981ab86767775176b7169"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">operations_on_datastructures::trie_operations::Tnode::DeleteFrom</a></div><div class="ttdeci">void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)</div><div class="ttdoc">Function recursively deletes the substring character by character iterating through the string to be ...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:134</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_afca808362c13273ca8c8ae7d58e8eee0"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">operations_on_datastructures::trie_operations::Tnode::numberOfChildren</a></div><div class="ttdeci">uint8_t numberOfChildren(Tnode *node)</div><div class="ttdoc">Function to count the number of children a node in the trie has.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:69</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_adef6940391f981ab86767775176b7169"><div class="ttname"><a href="#adef6940391f981ab86767775176b7169">operations_on_datastructures::trie_operations::Tnode::DeleteFrom</a></div><div class="ttdeci">void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)</div><div class="ttdoc">Function recursively deletes the substring character by character iterating through the string to be ...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:134</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_afca808362c13273ca8c8ae7d58e8eee0"><div class="ttname"><a href="#afca808362c13273ca8c8ae7d58e8eee0">operations_on_datastructures::trie_operations::Tnode::numberOfChildren</a></div><div class="ttdeci">uint8_t numberOfChildren(Tnode *node)</div><div class="ttdoc">Function to count the number of children a node in the trie has.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:69</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="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 class="ttc" id="atolower_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">std::tolower</a></div><div class="ttdeci">T tolower(T... args)</div></div>
@@ -381,25 +381,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::DeleteFrom </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *&#160;</td>
<td class="paramname"><em>delete_from</em>, </td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *</td> <td class="paramname"><span class="paramname"><em>delete_from</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/string/basic_string.html">std::string</a>&#160;</td>
<td class="paramname"><em>delete_string</em>, </td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td> <td class="paramname"><span class="paramname"><em>delete_string</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>remove_index</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>remove_index</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -417,7 +409,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (delete_string.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() == remove_index) {</div>
<div class="line"><span class="lineno"> 137</span> <span class="keywordtype">int</span> letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(delete_string[remove_index]) - 97;</div>
<div class="line"><span class="lineno"> 138</span> </div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a>(delete_from-&gt;english[letter_index], delete_string,</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a>(delete_from-&gt;english[letter_index], delete_string,</div>
<div class="line"><span class="lineno"> 140</span> remove_index + 1);</div>
<div class="line"><span class="lineno"> 141</span> </div>
<div class="line"><span class="lineno"> 142</span> <span class="keyword">delete</span> delete_from;</div>
@@ -440,8 +432,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::Insert </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>entry</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>entry</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -488,8 +479,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint8_t operations_on_datastructures::trie_operations::Tnode::numberOfChildren </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *&#160;</td>
<td class="paramname"><em>node</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *</td> <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -530,8 +520,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions </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>key</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>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -565,9 +554,9 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 383</span> <span class="comment">// When the node for the character does not exist, longest prefix has</span></div>
<div class="line"><span class="lineno"> 384</span> <span class="comment">// been determined and SuggestFreqAutocomplete is called</span></div>
<div class="line"><span class="lineno"> 385</span> <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 386</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(prev_pos, prefix, Suggestions);</div>
<div class="line"><span class="lineno"> 386</span> <a class="code hl_function" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(prev_pos, prefix, Suggestions);</div>
<div class="line"><span class="lineno"> 387</span> <span class="comment">// To display the top 3 results</span></div>
<div class="line"><span class="lineno"> 388</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
<div class="line"><span class="lineno"> 388</span> <a class="code hl_function" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
<div class="line"><span class="lineno"> 389</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
<div class="line"><span class="lineno"> 390</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"> 391</span> <span class="keywordflow">return</span>;</div>
@@ -586,17 +575,17 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 404</span> </div>
<div class="line"><span class="lineno"> 405</span> <span class="comment">// Call for Suggestions when the search key is present as an entry/a prefix</span></div>
<div class="line"><span class="lineno"> 406</span> <span class="comment">// in the trie</span></div>
<div class="line"><span class="lineno"> 407</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(cur_pos, prefix, Suggestions);</div>
<div class="line"><span class="lineno"> 407</span> <a class="code hl_function" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(cur_pos, prefix, Suggestions);</div>
<div class="line"><span class="lineno"> 408</span> <span class="comment">// Display the top 3 results</span></div>
<div class="line"><span class="lineno"> 409</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
<div class="line"><span class="lineno"> 409</span> <a class="code hl_function" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
<div class="line"><span class="lineno"> 410</span> </div>
<div class="line"><span class="lineno"> 411</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;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
<div class="line"><span class="lineno"> 412</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"> 413</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 414</span>}</div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a9e556f52c837190ecf4265b1f05cfe9c"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</a></div><div class="ttdeci">void SuggestFreqAutocomplete(Tnode *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Recursive function to suggest most frequently searched entries of trie which have a given common pref...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:337</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aacafb8c9f3ebac7ac6c01d9645bb67b6"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</a></div><div class="ttdeci">void SelectionTop_3(std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Function to display the 3 suggestions with highest frequency of search hits.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:317</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a9e556f52c837190ecf4265b1f05cfe9c"><div class="ttname"><a href="#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</a></div><div class="ttdeci">void SuggestFreqAutocomplete(Tnode *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Recursive function to suggest most frequently searched entries of trie which have a given common pref...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:337</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aacafb8c9f3ebac7ac6c01d9645bb67b6"><div class="ttname"><a href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</a></div><div class="ttdeci">void SelectionTop_3(std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Function to display the 3 suggestions with highest frequency of search hits.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:317</div></div>
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -615,8 +604,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool operations_on_datastructures::trie_operations::Tnode::SearchPresence </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>key</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>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -665,8 +653,7 @@ false if the key is not found </dd></dl>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::SearchSuggestions </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>key</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>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -694,7 +681,7 @@ false if the key is not found </dd></dl>
<div class="line"><span class="lineno"> 283</span> <span class="comment">// When the node for the character does not exist, longest prefix has</span></div>
<div class="line"><span class="lineno"> 284</span> <span class="comment">// been determined and SuggestAutocomplete is called</span></div>
<div class="line"><span class="lineno"> 285</span> <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(prev_pos, prefix);</div>
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(prev_pos, prefix);</div>
<div class="line"><span class="lineno"> 287</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;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
<div class="line"><span class="lineno"> 288</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"> 289</span> <span class="keywordflow">return</span>;</div>
@@ -713,12 +700,12 @@ false if the key is not found </dd></dl>
<div class="line"><span class="lineno"> 302</span> </div>
<div class="line"><span class="lineno"> 303</span> <span class="comment">// Call for suggestions when the search key is present as an entry/a prefix</span></div>
<div class="line"><span class="lineno"> 304</span> <span class="comment">// in the trie</span></div>
<div class="line"><span class="lineno"> 305</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(cur_pos, prefix);</div>
<div class="line"><span class="lineno"> 305</span> <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(cur_pos, prefix);</div>
<div class="line"><span class="lineno"> 306</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;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
<div class="line"><span class="lineno"> 307</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"> 308</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 309</span>}</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a097913c4badec2b60d50a171ecc299fe"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</a></div><div class="ttdeci">void SuggestAutocomplete(Tnode *new_root, const std::string &amp;prefix)</div><div class="ttdoc">Recursive function to suggest all the entries of trie which have a given common prefix.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:246</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a097913c4badec2b60d50a171ecc299fe"><div class="ttname"><a href="#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</a></div><div class="ttdeci">void SuggestAutocomplete(Tnode *new_root, const std::string &amp;prefix)</div><div class="ttdoc">Recursive function to suggest all the entries of trie which have a given common prefix.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:246</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -736,8 +723,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *&#160;</td>
<td class="paramname"><em>suggestions</em></td><td>)</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>suggestions</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -778,19 +764,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *&#160;</td>
<td class="paramname"><em>new_root</em>, </td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *</td> <td class="paramname"><span class="paramname"><em>new_root</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/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>prefix</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/string/basic_string.html">std::string</a> &amp;</td> <td class="paramname"><span class="paramname"><em>prefix</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -815,7 +794,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 255</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; prefix + char(i + 97) &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"> 256</span> }</div>
<div class="line"><span class="lineno"> 257</span> </div>
<div class="line"><span class="lineno"> 258</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97));</div>
<div class="line"><span class="lineno"> 258</span> <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97));</div>
<div class="line"><span class="lineno"> 259</span> }</div>
<div class="line"><span class="lineno"> 260</span> }</div>
<div class="line"><span class="lineno"> 261</span>}</div>
@@ -836,25 +815,17 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *&#160;</td>
<td class="paramname"><em>new_root</em>, </td>
<td class="paramtype"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *</td> <td class="paramname"><span class="paramname"><em>new_root</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/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>prefix</em>, </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>prefix</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/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *&#160;</td>
<td class="paramname"><em>suggestions</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/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>suggestions</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -879,7 +850,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 347</span> new_root-&gt;english[i]-&gt;frequency, prefix + <span class="keywordtype">char</span>(i + 97)));</div>
<div class="line"><span class="lineno"> 348</span> }</div>
<div class="line"><span class="lineno"> 349</span> </div>
<div class="line"><span class="lineno"> 350</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97),</div>
<div class="line"><span class="lineno"> 350</span> <a class="code hl_function" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97),</div>
<div class="line"><span class="lineno"> 351</span> suggestions);</div>
<div class="line"><span class="lineno"> 352</span> }</div>
<div class="line"><span class="lineno"> 353</span> }</div>
@@ -903,7 +874,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>trie_operations</b></li><li class="navelem"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</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
d0/d62/struct_queue-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('dc/db5/struct_queue.html','../../'); initResizable(); });
$(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -118,7 +120,7 @@ $(document).ready(function(){initNavTree('dc/db5/struct_queue.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>

129
d0/d65/namespacedouble__hashing.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++: double_hashing 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('d0/d65/namespacedouble__hashing.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d65/namespacedouble__hashing.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('d0/d65/namespacedouble__hashing.html',
<div class="contents">
<p>An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm.
<a href="../../d0/d65/namespacedouble__hashing.html#details">More...</a></p>
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
@@ -116,36 +118,36 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:aa5f416c3d658d09e41cab50c8fb7b756" id="r_aa5f416c3d658d09e41cab50c8fb7b756"><td class="memItemLeft" align="right" valign="top"><a id="aa5f416c3d658d09e41cab50c8fb7b756" name="aa5f416c3d658d09e41cab50c8fb7b756"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> = <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a></td></tr>
<tr class="separator:aa5f416c3d658d09e41cab50c8fb7b756"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top"><a id="a92054ec26cd6907c163fb00a596bebdd" name="a92054ec26cd6907c163fb00a596bebdd"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> = struct Entry</td></tr>
<tr class="separator:a92054ec26cd6907c163fb00a596bebdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac2adfce49ac57f6dbd1778d2c1ce0d2b" id="r_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="memitem:ac2adfce49ac57f6dbd1778d2c1ce0d2b" id="r_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:ac2adfce49ac57f6dbd1778d2c1ce0d2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a29f543e2626bad58907661e1e45028a6" id="r_a29f543e2626bad58907661e1e45028a6"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="memitem:a29f543e2626bad58907661e1e45028a6" id="r_a29f543e2626bad58907661e1e45028a6"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a29f543e2626bad58907661e1e45028a6">searchingProber</a> (const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;entry, int key)</td></tr>
<tr class="separator:a29f543e2626bad58907661e1e45028a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a79a9c914a6c68275b3640303d7faad8a" id="r_a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a> (int key)</td></tr>
<tr class="memitem:a79a9c914a6c68275b3640303d7faad8a" id="r_a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a79a9c914a6c68275b3640303d7faad8a">add</a> (int key)</td></tr>
<tr class="separator:a79a9c914a6c68275b3640303d7faad8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0d90726ed1de7b3d2ae261baed048003" id="r_a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a> (int key)</td></tr>
<tr class="memitem:a0d90726ed1de7b3d2ae261baed048003" id="r_a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a> (int key)</td></tr>
<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. <br /></td></tr>
<tr class="separator:a0d90726ed1de7b3d2ae261baed048003"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a33968a1178289ab61445dd4000df7082" id="r_a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a> (int key)</td></tr>
<tr class="memitem:a33968a1178289ab61445dd4000df7082" id="r_a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33968a1178289ab61445dd4000df7082">otherHashFxn</a> (int key)</td></tr>
<tr class="memdesc:a33968a1178289ab61445dd4000df7082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Used for second hash function. <br /></td></tr>
<tr class="separator:a33968a1178289ab61445dd4000df7082"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8f8ff4fb018e1bb32d67d8a1885d3200" id="r_a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a> (int key, bool searching)</td></tr>
<tr class="memitem:a8f8ff4fb018e1bb32d67d8a1885d3200" id="r_a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a> (int key, bool searching)</td></tr>
<tr class="memdesc:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs double hashing to resolve collisions. <br /></td></tr>
<tr class="separator:a8f8ff4fb018e1bb32d67d8a1885d3200"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1e901418c759627557eff359b8db38cd" id="r_a1e901418c759627557eff359b8db38cd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a> ()</td></tr>
<tr class="memitem:a1e901418c759627557eff359b8db38cd" id="r_a1e901418c759627557eff359b8db38cd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e901418c759627557eff359b8db38cd">display</a> ()</td></tr>
<tr class="separator:a1e901418c759627557eff359b8db38cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4981819aae8bc7e7beeaef02615e30d" id="r_af4981819aae8bc7e7beeaef02615e30d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a> ()</td></tr>
<tr class="memitem:af4981819aae8bc7e7beeaef02615e30d" id="r_af4981819aae8bc7e7beeaef02615e30d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af4981819aae8bc7e7beeaef02615e30d">rehash</a> ()</td></tr>
<tr class="separator:af4981819aae8bc7e7beeaef02615e30d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a28083ecac6eb94b643281875c8665931" id="r_a28083ecac6eb94b643281875c8665931"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a> (int key)</td></tr>
<tr class="memitem:a28083ecac6eb94b643281875c8665931" id="r_a28083ecac6eb94b643281875c8665931"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28083ecac6eb94b643281875c8665931">remove</a> (int key)</td></tr>
<tr class="separator:a28083ecac6eb94b643281875c8665931"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9c652b2e467e5d250dfe3bed83b12560" id="r_a9c652b2e467e5d250dfe3bed83b12560"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">addInfo</a> (int key)</td></tr>
<tr class="memitem:a9c652b2e467e5d250dfe3bed83b12560" id="r_a9c652b2e467e5d250dfe3bed83b12560"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9c652b2e467e5d250dfe3bed83b12560">addInfo</a> (int key)</td></tr>
<tr class="separator:a9c652b2e467e5d250dfe3bed83b12560"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d06e4598569526294f10104875f6824" id="r_a5d06e4598569526294f10104875f6824"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">removalInfo</a> (int key)</td></tr>
<tr class="memitem:a5d06e4598569526294f10104875f6824" id="r_a5d06e4598569526294f10104875f6824"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d06e4598569526294f10104875f6824">removalInfo</a> (int key)</td></tr>
<tr class="separator:a5d06e4598569526294f10104875f6824"><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>
@@ -181,8 +183,7 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
<tr>
<td class="memname">void double_hashing::add </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -196,15 +197,15 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
<div class="fragment"><div class="line"><span class="lineno"> 185</span> {</div>
<div class="line"><span class="lineno"> 186</span> <span class="comment">// auto* entry = new Entry();</span></div>
<div class="line"><span class="lineno"> 187</span> <span class="comment">// entry-&gt;key = key;</span></div>
<div class="line"><span class="lineno"> 188</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 188</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 189</span> table[index].key = key;</div>
<div class="line"><span class="lineno"> 190</span> <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
<div class="line"><span class="lineno"> 191</span> <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(totalSize) &gt;= 0.5) {</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a>();</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="#af4981819aae8bc7e7beeaef02615e30d">rehash</a>();</div>
<div class="line"><span class="lineno"> 193</span> }</div>
<div class="line"><span class="lineno"> 194</span>}</div>
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:71</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:161</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:71</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:161</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -222,8 +223,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void double_hashing::addInfo </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -238,8 +238,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 213</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;Initial table: &quot;</span>;</div>
<div class="line"><span class="lineno"> 214</span> display();</div>
<div class="line"><span class="lineno"> 215</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"> 216</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 of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
<div class="line"><span class="lineno"> 217</span> &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
<div class="line"><span class="lineno"> 216</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 of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
<div class="line"><span class="lineno"> 217</span> &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
<div class="line"><span class="lineno"> 218</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"> 219</span> <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(key);</div>
<div class="line"><span class="lineno"> 220</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;New table: &quot;</span>;</div>
@@ -247,7 +247,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 222</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="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="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:47</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:47</div></div>
<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:37</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -266,7 +266,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void double_hashing::display </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -303,19 +303,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int double_hashing::doubleHash </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool&#160;</td>
<td class="paramname"><em>searching</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">bool</td> <td class="paramname"><span class="paramname"><em>searching</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -332,12 +325,12 @@ Here is the call graph for this function:</div>
<dd>
new hash if no conflicts present </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key));</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key));</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">int</span> i = 0;</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry;</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordtype">int</span> index =</div>
<div class="line"><span class="lineno"> 77</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hash + (i * <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) % totalSize;</div>
<div class="line"><span class="lineno"> 77</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hash + (i * <a class="code hl_function" href="#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) % totalSize;</div>
<div class="line"><span class="lineno"> 78</span> entry = table[index];</div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">if</span> (searching) {</div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent) {</div>
@@ -351,7 +344,7 @@ new hash if no conflicts present </dd></dl>
<div class="line"><span class="lineno"> 88</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"> 89</span> i++;</div>
<div class="line"><span class="lineno"> 90</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">if</span> (!rehashing) {</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
@@ -360,7 +353,7 @@ new hash if no conflicts present </dd></dl>
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">if</span> (!rehashing) {</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;Spot taken, looking at next (next index:&quot;</span></div>
<div class="line"><span class="lineno"> 99</span> &lt;&lt; <span class="stringliteral">&quot; &quot;</span></div>
<div class="line"><span class="lineno"> 100</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> + (i * <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) %</div>
<div class="line"><span class="lineno"> 100</span> &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> + (i * <a class="code hl_function" href="#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) %</div>
<div class="line"><span class="lineno"> 101</span> totalSize</div>
<div class="line"><span class="lineno"> 102</span> &lt;&lt; <span class="stringliteral">&quot;)&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"> 103</span> }</div>
@@ -374,8 +367,8 @@ new hash if no conflicts present </dd></dl>
<div class="line"><span class="lineno"> 111</span> <span class="keywordflow">return</span> notPresent;</div>
<div class="line"><span class="lineno"> 112</span>}</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="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:58</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:58</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:36</div></div>
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:38</div></div>
</div><!-- fragment --><div class="dynheader">
@@ -395,8 +388,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">size_t double_hashing::hashFxn </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -427,8 +419,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">size_t double_hashing::otherHashFxn </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -458,19 +449,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool double_hashing::putProber </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;&#160;</td>
<td class="paramname"><em>entry</em>, </td>
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;</td> <td class="paramname"><span class="paramname"><em>entry</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -502,7 +486,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void double_hashing::rehash </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -546,8 +530,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void double_hashing::removalInfo </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -562,8 +545,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 228</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;Initial table: &quot;</span>;</div>
<div class="line"><span class="lineno"> 229</span> display();</div>
<div class="line"><span class="lineno"> 230</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"> 231</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 of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
<div class="line"><span class="lineno"> 232</span> &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
<div class="line"><span class="lineno"> 231</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 of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
<div class="line"><span class="lineno"> 232</span> &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
<div class="line"><span class="lineno"> 233</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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"> 234</span> remove(key);</div>
<div class="line"><span class="lineno"> 235</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;New table: &quot;</span>;</div>
@@ -586,8 +569,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void double_hashing::remove </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -599,7 +581,7 @@ Here is the call graph for this function:</div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 199</span> {</div>
<div class="line"><span class="lineno"> 200</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 200</span> <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 201</span> <span class="keywordflow">if</span> (index == notPresent) {</div>
<div class="line"><span class="lineno"> 202</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 203</span> }</div>
@@ -624,19 +606,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">bool double_hashing::searchingProber </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;&#160;</td>
<td class="paramname"><em>entry</em>, </td>
<td class="paramtype">const <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &amp;</td> <td class="paramname"><span class="paramname"><em>entry</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>key</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -665,7 +640,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="../../d0/d65/namespacedouble__hashing.html">double_hashing</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
d0/d6d/modular__exponentiation_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/modular_exponentiation.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('d0/d6d/modular__exponentiation_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d6d/modular__exponentiation_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -125,9 +127,9 @@ Functions</h2></td></tr>
<tr class="memitem:afcd07701d73ed65cd616bcba02737f3d" id="r_afcd07701d73ed65cd616bcba02737f3d"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a> (uint64_t a, uint64_t b, uint64_t c)</td></tr>
<tr class="memdesc:afcd07701d73ed65cd616bcba02737f3d"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function calculates a raised to exponent b under modulo c using modular exponentiation. <br /></td></tr>
<tr class="separator:afcd07701d73ed65cd616bcba02737f3d"><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="../../d0/d6d/modular__exponentiation_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="../../d0/d6d/modular__exponentiation_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"> 86</span> {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 89</span>}</div>
<div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> modular_exponentiation.cpp:60</div></div>
<div class="ttc" id="amodular__exponentiation_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> modular_exponentiation.cpp:60</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>
@@ -229,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_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d6d/modular__exponentiation_8cpp.html">modular_exponentiation.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>

35
d0/d6f/namespaceothers.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 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('d0/d6f/namespaceothers.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d6f/namespaceothers.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -104,14 +106,14 @@ $(document).ready(function(){initNavTree('d0/d6f/namespaceothers.html','../../')
<div class="contents">
<p>for <code>vector</code>
<a href="../../d0/d6f/namespaceothers.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:aa17dc6d061dff34f6b9a610bc5e26703" id="r_aa17dc6d061dff34f6b9a610bc5e26703"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">are_almost_equal</a> (double a, double b, double absolute_tolerance=0.0001)</td></tr>
<tr class="memitem:aa17dc6d061dff34f6b9a610bc5e26703" id="r_aa17dc6d061dff34f6b9a610bc5e26703"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa17dc6d061dff34f6b9a610bc5e26703">are_almost_equal</a> (double a, double b, double absolute_tolerance=0.0001)</td></tr>
<tr class="memdesc:aa17dc6d061dff34f6b9a610bc5e26703"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../de/d4a/class_compare.html" title="Comparator class for priority queue.">Compare</a> two floating point numbers with a certain tolerance. This is needed as with some values, the result (e.g.: -196.15) might be a bit lower (in this case, -196.499999...). <br /></td></tr>
<tr class="separator:aa17dc6d061dff34f6b9a610bc5e26703"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a48677fae5d683070432b1a905722d9ec" id="r_a48677fae5d683070432b1a905722d9ec"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">kelvin_to_celsius</a> (double temperature_in_k)</td></tr>
<tr class="memitem:a48677fae5d683070432b1a905722d9ec" id="r_a48677fae5d683070432b1a905722d9ec"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48677fae5d683070432b1a905722d9ec">kelvin_to_celsius</a> (double temperature_in_k)</td></tr>
<tr class="memdesc:a48677fae5d683070432b1a905722d9ec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Conversion from Kelvin to Celsius algorithm. <br /></td></tr>
<tr class="separator:a48677fae5d683070432b1a905722d9ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -136,25 +138,17 @@ Functions</h2></td></tr>
<tr>
<td class="memname">bool others::are_almost_equal </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>, </td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>b</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>absolute_tolerance</em> = <code>0.0001</code>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>absolute_tolerance</em><span class="paramdefsep"> = </span><span class="paramdefval">0.0001</span></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -186,8 +180,7 @@ false if the numbers are NOT equal within the given tolerance otherwise </dd></d
<tr>
<td class="memname">double others::kelvin_to_celsius </td>
<td>(</td>
<td class="paramtype">double&#160;</td>
<td class="paramname"><em>temperature_in_k</em></td><td>)</td>
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>temperature_in_k</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -218,7 +211,7 @@ false if the numbers are NOT equal within the given tolerance otherwise </dd></d
<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="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
d0/d77/longest__palindromic__subsequence_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/longest_palindromic_subsequence.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('d0/d77/longest__palindromic__subsequence_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/d77/longest__palindromic__subsequence_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -126,10 +128,10 @@ Functions</h2></td></tr>
<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><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="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a)</td></tr>
<tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string. <br /></td></tr>
<tr class="separator:afe9f45b6e30ee187509da2d1d0093412"><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="../../d0/d77/longest__palindromic__subsequence_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="../../d0/d77/longest__palindromic__subsequence_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>
@@ -147,8 +149,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>
@@ -157,10 +158,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="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</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="alongest__palindromic__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_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> longest_palindromic_subsequence.cpp:86</div></div>
<div class="ttc" id="alongest__palindromic__subsequence_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> longest_palindromic_subsequence.cpp:86</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -181,7 +182,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>
@@ -215,7 +216,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="../../d0/d77/longest__palindromic__subsequence_8cpp.html">longest_palindromic_subsequence.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
d0/d78/classstatistics_1_1stats__computer1-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('d7/d7c/classstatistics_1_1stats__computer1.html','../../'); initResizable(); });
$(function(){initNavTree('d7/d7c/classstatistics_1_1stats__computer1.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -117,7 +119,7 @@ $(document).ready(function(){initNavTree('d7/d7c/classstatistics_1_1stats__compu
<!-- 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
d0/d8b/structoperations__on__datastructures_1_1reverse__binary__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('d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -112,7 +114,7 @@ $(document).ready(function(){initNavTree('d8/dfd/structoperations__on__datastruc
<!-- 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>

44
d0/da2/number__of__positive__divisors_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/number_of_positive_divisors.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('d0/da2/number__of__positive__divisors_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/da2/number__of__positive__divisors_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -115,11 +117,11 @@ Include dependency graph for number_of_positive_divisors.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:ad89ccced8504b5116046cfa03066ffeb" id="r_ad89ccced8504b5116046cfa03066ffeb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a> (int n)</td></tr>
<tr class="memitem:ad89ccced8504b5116046cfa03066ffeb" id="r_ad89ccced8504b5116046cfa03066ffeb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a> (int n)</td></tr>
<tr class="separator:ad89ccced8504b5116046cfa03066ffeb"><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="../../d0/da2/number__of__positive__divisors_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="../../d0/da2/number__of__positive__divisors_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>
@@ -143,30 +145,29 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.</p>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordtype">int</span> n;</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_istream.html">std::cin</a> &gt;&gt; n;</div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (n == 0) {</div>
<div class="line"><span class="lineno"> 86</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 non-zero numbers are divisors of 0 !&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"> 87</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 90</span> }</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 92</span>}</div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:70</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:33</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:70</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:33</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -184,8 +185,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int number_of_positive_divisors </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>n</em></td><td>)</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -242,18 +242,18 @@ 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>
</div><div class="memdoc">
<p>Test implementations </p>
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
<div class="line"><span class="lineno"> 71</span> assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(36) == 9);</div>
<div class="line"><span class="lineno"> 72</span> assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(-36) == 9);</div>
<div class="line"><span class="lineno"> 73</span> assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(1) == 1);</div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(2011) == 2); <span class="comment">// 2011 is a prime</span></div>
<div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(756) == 24); <span class="comment">// 756 = 2^2 * 3^3 * 7</span></div>
<div class="line"><span class="lineno"> 71</span> assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(36) == 9);</div>
<div class="line"><span class="lineno"> 72</span> assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(-36) == 9);</div>
<div class="line"><span class="lineno"> 73</span> assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(1) == 1);</div>
<div class="line"><span class="lineno"> 74</span> assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(2011) == 2); <span class="comment">// 2011 is a prime</span></div>
<div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(756) == 24); <span class="comment">// 756 = 2^2 * 3^3 * 7</span></div>
<div class="line"><span class="lineno"> 76</span>}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -269,7 +269,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="../../d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.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
d0/da4/namespacemonte__carlo.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++: monte_carlo 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('d0/da4/namespacemonte__carlo.html','../../'); initResizable(); });
$(function(){initNavTree('d0/da4/namespacemonte__carlo.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/da4/namespacemonte__carlo.html','..
<div class="contents">
<p>Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation.
<a href="../../d0/da4/namespacemonte__carlo.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/da4/namespacemonte__carlo.html','..
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/da4/namespacemonte__carlo.html">monte_carlo</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>

28
d0/db6/non__recursive__merge__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/non_recursive_merge_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('d0/db6/non__recursive__merge__sort_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/db6/non__recursive__merge__sort_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -136,7 +138,7 @@ Functions</h2></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">sorting::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:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/db6/non__recursive__merge__sort_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>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -152,19 +154,12 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>argc</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char **&#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">
@@ -177,7 +172,7 @@ Functions</h2></td></tr>
<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;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span>;</div>
<div class="line"><span class="lineno"> 101</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"> 102</span> }</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(arr, size);</div>
<div class="line"><span class="lineno"> 103</span> non_recursive_merge_sort(arr, size);</div>
<div class="line"><span class="lineno"> 104</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\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i)</div>
<div class="line"><span class="lineno"> 106</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;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span> &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
@@ -186,7 +181,6 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 109</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="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="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>
</div>
@@ -196,7 +190,7 @@ Functions</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp.html">non_recursive_merge_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
d0/dc4/struct_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('d8/dc8/struct_point.html','../../'); initResizable(); });
$(function(){initNavTree('d8/dc8/struct_point.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -113,7 +115,7 @@ $(document).ready(function(){initNavTree('d8/dc8/struct_point.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
d0/dc9/classrange__queries_1_1fenwick__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('de/d0d/classrange__queries_1_1fenwick__tree.html','../../'); initResizable(); });
$(function(){initNavTree('de/d0d/classrange__queries_1_1fenwick__tree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -116,7 +118,7 @@ $(document).ready(function(){initNavTree('de/d0d/classrange__queries_1_1fenwick_
<!-- 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
d0/dcb/classdsu-members.html
View File

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

25
d0/dd2/treap_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/treap.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('d0/dd2/treap_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/dd2/treap_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -131,10 +133,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="../../d0/dd2/treap_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="../../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -161,8 +163,7 @@ const int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures:
<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>
@@ -171,10 +172,10 @@ const int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures:
<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"> 256</span> {</div>
<div class="line"><span class="lineno"> 257</span> <a class="code hl_function" href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 257</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"> 258</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 259</span>}</div>
<div class="ttc" id="atreap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/dd2/treap_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> treap.cpp:230</div></div>
<div class="ttc" id="atreap_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> treap.cpp:230</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -195,7 +196,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>
@@ -253,7 +254,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="../../d0/dd2/treap_8cpp.html">treap.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
d0/dd5/classciphers_1_1_hill_cipher-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/d26/classciphers_1_1_hill_cipher.html','../../'); initResizable(); });
$(function(){initNavTree('d6/d26/classciphers_1_1_hill_cipher.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -122,7 +124,7 @@ $(document).ready(function(){initNavTree('d6/d26/classciphers_1_1_hill_cipher.ht
<!-- 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
d0/dda/namespacesaddleback.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++: saddleback 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('d0/dda/namespacesaddleback.html','../../'); initResizable(); });
$(function(){initNavTree('d0/dda/namespacesaddleback.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/dda/namespacesaddleback.html','../.
<div class="contents">
<p>Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>.
<a href="../../d0/dda/namespacesaddleback.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>Function for implementing <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a>. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/dda/namespacesaddleback.html','../.
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/dda/namespacesaddleback.html">saddleback</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.10.0 </li>
</ul>
</div>
</body>

17
d0/de2/gaussian__elimination_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/gaussian_elimination.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('d0/de2/gaussian__elimination_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/de2/gaussian__elimination_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -114,7 +116,7 @@ Include dependency graph for gaussian_elimination.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="../../d0/de2/gaussian__elimination_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>
@@ -129,8 +131,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>
@@ -223,7 +224,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="../../d0/de2/gaussian__elimination_8cpp.html">gaussian_elimination.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
d0/df8/namespaceabbreviation.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++: abbreviation 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('d0/df8/namespaceabbreviation.html','../../'); initResizable(); });
$(function(){initNavTree('d0/df8/namespaceabbreviation.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -102,7 +104,7 @@ $(document).ready(function(){initNavTree('d0/df8/namespaceabbreviation.html','..
<div class="contents">
<p>Functions for <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbreviation</a> implementation.
<a href="../../d0/df8/namespaceabbreviation.html#details">More...</a></p>
<a href="#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbreviation</a> implementation. </p>
</div></div><!-- contents -->
@@ -111,7 +113,7 @@ $(document).ready(function(){initNavTree('d0/df8/namespaceabbreviation.html','..
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/df8/namespaceabbreviation.html">abbreviation</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
d0/dfe/backtracking_2subset__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++: backtracking/subset_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('d0/dfe/backtracking_2subset__sum_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d0/dfe/backtracking_2subset__sum_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -126,13 +128,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:a7cb50d36a59427a33f64a266dac83d99" id="r_a7cb50d36a59427a33f64a266dac83d99"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dfe/backtracking_2subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99">backtracking::subset_sum::number_of_subsets</a> (int32_t sum, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;in_arr)</td></tr>
<tr class="memitem:a7cb50d36a59427a33f64a266dac83d99" id="r_a7cb50d36a59427a33f64a266dac83d99"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7cb50d36a59427a33f64a266dac83d99">backtracking::subset_sum::number_of_subsets</a> (int32_t sum, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;in_arr)</td></tr>
<tr class="memdesc:a7cb50d36a59427a33f64a266dac83d99"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements count of subsets. <br /></td></tr>
<tr class="separator:a7cb50d36a59427a33f64a266dac83d99"><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="../../d0/dfe/backtracking_2subset__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="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="../../d0/dfe/backtracking_2subset__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>
@@ -149,8 +151,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>
@@ -159,10 +160,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"> 103</span> {</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_function" href="../../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 104</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"> 105</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 106</span>}</div>
<div class="ttc" id="abacktracking_2subset__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/dfe/backtracking_2subset__sum_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> subset_sum.cpp:57</div></div>
<div class="ttc" id="abacktracking_2subset__sum_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> subset_sum.cpp:57</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -180,19 +181,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">uint64_t backtracking::subset_sum::number_of_subsets </td>
<td>(</td>
<td class="paramtype">int32_t&#160;</td>
<td class="paramname"><em>sum</em>, </td>
<td class="paramtype">int32_t</td> <td class="paramname"><span class="paramname"><em>sum</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;&#160;</td>
<td class="paramname"><em>in_arr</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>in_arr</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -245,7 +239,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>
@@ -316,7 +310,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_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d0/dfe/backtracking_2subset__sum_8cpp.html">subset_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>

16
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map
View File

@@ -1,9 +1,11 @@
<map id="machine_learning::aystar_search::EightPuzzle&lt; N &gt;" name="machine_learning::aystar_search::EightPuzzle&lt; N &gt;">
<area shape="rect" id="Node000001" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="461,37,640,78"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="227,5,370,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="386,34,461,44,460,49,385,39"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="227,71,370,111"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="384,77,460,67,461,72,385,82"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="5,71,122,111"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="138,88,227,88,227,94,138,94"/>
<area shape="rect" id="Node000001" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="662,37,842,78"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="428,5,571,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="587,34,662,44,661,49,587,39"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="429,71,571,111"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="586,77,661,67,662,72,586,82"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="207,71,323,111"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,88,428,88,428,94,339,94"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="5,78,85,104"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="100,88,206,88,206,94,100,94"/>
</map>

2
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5
View File

@@ -1 +1 @@
efdc2070005fea936f2ff1ade3b7aa6d
b610af580288d32f551d2dbb9542c0b1

125
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg
View File

@@ -4,8 +4,7 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
<svg width="484pt" height="88pt"
viewBox="0.00 0.00 484.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<!--zoomable 88 -->
<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[
@@ -14,17 +13,54 @@
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
</g>
</defs>
<script type="application/ecmascript">
var viewWidth = 635;
var viewHeight = 88;
var sectionId = 'dynsection-0';
</script>
<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 83.5)">
<g id="viewport">
<title>machine_learning::aystar_search::EightPuzzle&lt; N &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
<polygon fill="#999999" stroke="#666666" points="476.25,-55.5 341.75,-55.5 341.75,-25 476.25,-25 476.25,-55.5"/>
<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="409" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
<polygon fill="#999999" stroke="#666666" points="627.25,-55.5 492.75,-55.5 492.75,-25 627.25,-25 627.25,-55.5"/>
<text text-anchor="start" x="500.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="560" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
</a>
</g>
</g>
@@ -32,9 +68,9 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.5,-79.5 166,-79.5 166,-49 273.5,-49 273.5,-79.5"/>
<text text-anchor="start" x="174" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
<text text-anchor="middle" x="219.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
<polygon fill="white" stroke="#666666" points="424.5,-79.5 317,-79.5 317,-49 424.5,-49 424.5,-79.5"/>
<text text-anchor="start" x="325" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
<text text-anchor="middle" x="370.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
</a>
</g>
</g>
@@ -42,19 +78,19 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M285.25,-55.98C303.37,-53.66 323.11,-51.13 341.35,-48.79"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="284.88,-52.5 275.41,-57.24 285.77,-59.44 284.88,-52.5"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M436.25,-55.98C454.37,-53.66 474.11,-51.13 492.35,-48.79"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="435.88,-52.5 426.41,-57.24 436.77,-59.44 435.88,-52.5"/>
</a>
</g>
<text text-anchor="middle" x="307.62" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
<text text-anchor="middle" x="458.62" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.12,-30.5 166.38,-30.5 166.38,0 273.12,0 273.12,-30.5"/>
<text text-anchor="start" x="174.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
<polygon fill="white" stroke="#666666" points="424.12,-30.5 317.38,-30.5 317.38,0 424.12,0 424.12,-30.5"/>
<text text-anchor="start" x="325.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
<text text-anchor="middle" x="370.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
</a>
</g>
</g>
@@ -62,19 +98,19 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node3&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M284.56,-23.77C302.87,-26.21 322.89,-28.89 341.36,-31.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="285.28,-20.33 274.91,-22.48 284.36,-27.27 285.28,-20.33"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M435.56,-23.77C453.87,-26.21 473.89,-28.89 492.36,-31.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="436.28,-20.33 425.91,-22.48 435.36,-27.27 436.28,-20.33"/>
</a>
</g>
<text text-anchor="middle" x="307.62" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
<text text-anchor="middle" x="458.62" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="87.25,-30.5 0,-30.5 0,0 87.25,0 87.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
<polygon fill="white" stroke="#666666" points="238.25,-30.5 151,-30.5 151,0 238.25,0 238.25,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
</a>
</g>
</g>
@@ -82,14 +118,55 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M99.15,-15.25C120.46,-15.25 144.8,-15.25 165.94,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="99.18,-11.75 89.18,-15.25 99.18,-18.75 99.18,-11.75"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M250.15,-15.25C271.46,-15.25 295.8,-15.25 316.94,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="250.18,-11.75 240.18,-15.25 250.18,-18.75 250.18,-11.75"/>
</a>
</g>
<text text-anchor="middle" x="126.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="277.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="59.5,-24.88 0,-24.88 0,-5.62 59.5,-5.62 59.5,-24.88"/>
<text text-anchor="middle" x="29.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::int8_t</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M71.16,-15.25C95.34,-15.25 126.05,-15.25 150.67,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="71.38,-11.75 61.38,-15.25 71.38,-18.75 71.38,-11.75"/>
</a>
</g>
<text text-anchor="middle" x="105.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
<text text-anchor="middle" x="105.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
<style type='text/css'>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.1 KiB

After

Width:  |  Height:  |  Size: 9.3 KiB

66
d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
<svg width="484pt" height="88pt"
viewBox="0.00 0.00 484.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="635pt" height="88pt"
viewBox="0.00 0.00 635.25 87.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 83.5)">
<title>machine_learning::aystar_search::EightPuzzle&lt; N &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
<polygon fill="#999999" stroke="#666666" points="476.25,-55.5 341.75,-55.5 341.75,-25 476.25,-25 476.25,-55.5"/>
<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="409" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
<polygon fill="#999999" stroke="#666666" points="627.25,-55.5 492.75,-55.5 492.75,-25 627.25,-25 627.25,-55.5"/>
<text text-anchor="start" x="500.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="560" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
</a>
</g>
</g>
@@ -22,9 +22,9 @@
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.5,-79.5 166,-79.5 166,-49 273.5,-49 273.5,-79.5"/>
<text text-anchor="start" x="174" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
<text text-anchor="middle" x="219.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
<polygon fill="white" stroke="#666666" points="424.5,-79.5 317,-79.5 317,-49 424.5,-49 424.5,-79.5"/>
<text text-anchor="start" x="325" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
<text text-anchor="middle" x="370.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
</a>
</g>
</g>
@@ -32,19 +32,19 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M285.25,-55.98C303.37,-53.66 323.11,-51.13 341.35,-48.79"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="284.88,-52.5 275.41,-57.24 285.77,-59.44 284.88,-52.5"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M436.25,-55.98C454.37,-53.66 474.11,-51.13 492.35,-48.79"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="435.88,-52.5 426.41,-57.24 436.77,-59.44 435.88,-52.5"/>
</a>
</g>
<text text-anchor="middle" x="307.62" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
<text text-anchor="middle" x="458.62" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="273.12,-30.5 166.38,-30.5 166.38,0 273.12,0 273.12,-30.5"/>
<text text-anchor="start" x="174.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
<polygon fill="white" stroke="#666666" points="424.12,-30.5 317.38,-30.5 317.38,0 424.12,0 424.12,-30.5"/>
<text text-anchor="start" x="325.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
<text text-anchor="middle" x="370.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
</a>
</g>
</g>
@@ -52,19 +52,19 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node3&#45;&gt;Node1</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M284.56,-23.77C302.87,-26.21 322.89,-28.89 341.36,-31.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="285.28,-20.33 274.91,-22.48 284.36,-27.27 285.28,-20.33"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M435.56,-23.77C453.87,-26.21 473.89,-28.89 492.36,-31.35"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="436.28,-20.33 425.91,-22.48 435.36,-27.27 436.28,-20.33"/>
</a>
</g>
<text text-anchor="middle" x="307.62" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
<text text-anchor="middle" x="458.62" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="87.25,-30.5 0,-30.5 0,0 87.25,0 87.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
<polygon fill="white" stroke="#666666" points="238.25,-30.5 151,-30.5 151,0 238.25,0 238.25,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
</a>
</g>
</g>
@@ -72,11 +72,31 @@
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node4&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M99.15,-15.25C120.46,-15.25 144.8,-15.25 165.94,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="99.18,-11.75 89.18,-15.25 99.18,-18.75 99.18,-11.75"/>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M250.15,-15.25C271.46,-15.25 295.8,-15.25 316.94,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="250.18,-11.75 240.18,-15.25 250.18,-18.75 250.18,-11.75"/>
</a>
</g>
<text text-anchor="middle" x="126.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
<text text-anchor="middle" x="277.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="59.5,-24.88 0,-24.88 0,-5.62 59.5,-5.62 59.5,-24.88"/>
<text text-anchor="middle" x="29.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::int8_t</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node5&#45;&gt;Node4</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M71.16,-15.25C95.34,-15.25 126.05,-15.25 150.67,-15.25"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="71.38,-11.75 61.38,-15.25 71.38,-18.75 71.38,-11.75"/>
</a>
</g>
<text text-anchor="middle" x="105.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
<text text-anchor="middle" x="105.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 5.5 KiB

12
d0/dff/structlinkedlist.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++: linkedlist 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('d0/dff/structlinkedlist.html','../../'); initResizable(); });
$(function(){initNavTree('d0/dff/structlinkedlist.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -127,7 +129,7 @@ int&#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="../../d0/dff/structlinkedlist.html">linkedlist</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>