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

Documentation for e3f0551f98

Browse Source
This commit is contained in:
github-actions
2023-06-23 20:15:13 +00:00
parent ea0b8cdbc5
commit 2dacb46e30
61 changed files with 757 additions and 685 deletions
Download Patch File Download Diff File Expand all files Collapse all files

52
d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html
View File

@@ -155,11 +155,11 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 100</span> {</div> <div class="fragment"><div class="line"><span class="lineno"> 97</span> {</div>
<div class="line"><span class="lineno"> 101</span> <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div> <div class="line"><span class="lineno"> 98</span> <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 103</span>}</div> <div class="line"><span class="lineno"> 100</span>}</div>
<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:76</div></div> <div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:73</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -193,29 +193,29 @@ Here is the call graph for this function:</div>
<p>Self-test implementations. </p> <p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 76</span> {</div> <div class="fragment"><div class="line"><span class="lineno"> 73</span> {</div>
<div class="line"><span class="lineno"> 77</span> <span class="comment">// x = 4 return 8</span></div> <div class="line"><span class="lineno"> 74</span> <span class="comment">// x = 4 return 8</span></div>
<div class="line"><span class="lineno"> 78</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(4) == 8);</div> <div class="line"><span class="lineno"> 75</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(4) == 8);</div>
<div class="line"><span class="lineno"> 79</span> <span class="comment">// x = 6 return 9</span></div> <div class="line"><span class="lineno"> 76</span> <span class="comment">// x = 6 return 9</span></div>
<div class="line"><span class="lineno"> 80</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(6) == 9);</div> <div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(6) == 9);</div>
<div class="line"><span class="lineno"> 81</span> <span class="comment">// x = 13 return 14</span></div> <div class="line"><span class="lineno"> 78</span> <span class="comment">// x = 13 return 14</span></div>
<div class="line"><span class="lineno"> 82</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(13) == 14);</div> <div class="line"><span class="lineno"> 79</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(13) == 14);</div>
<div class="line"><span class="lineno"> 83</span> <span class="comment">// x = 64 return 128</span></div> <div class="line"><span class="lineno"> 80</span> <span class="comment">// x = 64 return 128</span></div>
<div class="line"><span class="lineno"> 84</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(64) == 128);</div> <div class="line"><span class="lineno"> 81</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(64) == 128);</div>
<div class="line"><span class="lineno"> 85</span> <span class="comment">// x = 15 return 23</span></div> <div class="line"><span class="lineno"> 82</span> <span class="comment">// x = 15 return 23</span></div>
<div class="line"><span class="lineno"> 86</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(15) == 23);</div> <div class="line"><span class="lineno"> 83</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(15) == 23);</div>
<div class="line"><span class="lineno"> 87</span> <span class="comment">// x= 32 return 64</span></div> <div class="line"><span class="lineno"> 84</span> <span class="comment">// x= 32 return 64</span></div>
<div class="line"><span class="lineno"> 88</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(32) == 64);</div> <div class="line"><span class="lineno"> 85</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(32) == 64);</div>
<div class="line"><span class="lineno"> 89</span> <span class="comment">// x = 97 return 98</span></div> <div class="line"><span class="lineno"> 86</span> <span class="comment">// x = 97 return 98</span></div>
<div class="line"><span class="lineno"> 90</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(97) == 98);</div> <div class="line"><span class="lineno"> 87</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(97) == 98);</div>
<div class="line"><span class="lineno"> 91</span> <span class="comment">// x = 1024 return 2048</span></div> <div class="line"><span class="lineno"> 88</span> <span class="comment">// x = 1024 return 2048</span></div>
<div class="line"><span class="lineno"> 92</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(1024) == 2048);</div> <div class="line"><span class="lineno"> 89</span> assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(1024) == 2048);</div>
<div class="line"><span class="lineno"> 93</span> </div> <div class="line"><span class="lineno"> 90</span> </div>
<div class="line"><span class="lineno"> 94</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 test cases have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><span class="lineno"> 91</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 test cases have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><span class="lineno"> 95</span>}</div> <div class="line"><span class="lineno"> 92</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="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="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="anamespacebit__manipulation_html_a4b76571a2a04fa99c30a96eca9997f0e"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a></div><div class="ttdeci">uint64_t next_higher_number(uint64_t x)</div><div class="ttdoc">The main function implements checking the next number.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:31</div></div> <div class="ttc" id="anamespacebit__manipulation_html_a4b76571a2a04fa99c30a96eca9997f0e"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a></div><div class="ttdeci">uint64_t next_higher_number(uint64_t x)</div><div class="ttdoc">The main function implements checking the next number.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:32</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">

184
d5/df6/check__amicable__pair_8cpp.html
View File

@@ -98,12 +98,13 @@ $(document).ready(function(){initNavTree('d5/df6/check__amicable__pair_8cpp.html
<div class="header"> <div class="header">
<div class="summary"> <div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div> <a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">check_amicable_pair.cpp File Reference</div></div> <div class="headertitle"><div class="title">check_amicable_pair.cpp File Reference</div></div>
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<p>A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. <p>A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not.
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
@@ -113,68 +114,33 @@ Include dependency graph for check_amicable_pair.cpp:</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0c/check__amicable__pair_8cpp__incl.svg" width="171" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div> <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0c/check__amicable__pair_8cpp__incl.svg" width="171" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div> </div>
</div><table class="memberdecls"> </div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr> Functions</h2></td></tr>
<tr class="memitem:ac656a51b4c3bd7d63b7dcc75dc3e5576"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a> (int num)</td></tr> <tr class="memitem:af05567415a9ea36c254b54e3d5a2152a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a> (int num)</td></tr>
<tr class="separator:ac656a51b4c3bd7d63b7dcc75dc3e5576"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="memdesc:af05567415a9ea36c254b54e3d5a2152a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the sum of all the proper divisor of an integer. <br /></td></tr>
<tr class="memitem:afeb67e204ec7de02ad152c11df4d1e01"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a> (int x, int y)</td></tr> <tr class="separator:af05567415a9ea36c254b54e3d5a2152a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="separator:afeb67e204ec7de02ad152c11df4d1e01"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="memitem:a8e6eede206201db0d1dbb618fa969bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a> (int x, int y)</td></tr>
<tr class="memitem:ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr> <tr class="memdesc:a8e6eede206201db0d1dbb618fa969bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check whether the pair is amicable or not. <br /></td></tr>
<tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a8e6eede206201db0d1dbb618fa969bec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#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"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr> <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html#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> <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table> </table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. </p> <div class="textblock"><p>A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. </p>
<p>Amicable Pair are two positive integers such that sum of the proper divisor of each number is equal to the other number. </p><dl class="section author"><dt>Author</dt><dd>iamnambiar </dd></dl> <p>An Amicable Pair is two positive integers such that the sum of the proper divisor for each number is equal to the other number.</p>
<dl class="section note"><dt>Note</dt><dd>Remember that a proper divisor is any positive whole number that divides into a selected number, apart from the selected number itself, and returns a positive integer. for example 1, 2 and 5 are all proper divisors of 10.</dd></dl>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/iamnambiar" target="_blank">iamnambiar</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2> </div><h2 class="groupheader">Function Documentation</h2>
<a id="afeb67e204ec7de02ad152c11df4d1e01" name="afeb67e204ec7de02ad152c11df4d1e01"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afeb67e204ec7de02ad152c11df4d1e01">&#9670;&#160;</a></span>are_amicable()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool are_amicable </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>y</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to check whether the pair is amicable or not. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>First number. </td></tr>
<tr><td class="paramname">y</td><td>Second number. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if the pair is amicable </dd>
<dd>
<code>false</code> if the pair is not amicable </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 48</span> {</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a>(x) == y) &amp;&amp; (<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a>(y) == x);</div>
<div class="line"><span class="lineno"> 50</span>}</div>
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ac656a51b4c3bd7d63b7dcc75dc3e5576"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:21</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph.svg" width="267" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a> <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2> <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -190,97 +156,63 @@ Here is the call graph for this function:</div>
</tr> </tr>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Main Function </p>
<div class="fragment"><div class="line"><span class="lineno"> 68</span> {</div> <p>Main function. </p>
<div class="line"><span class="lineno"> 69</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="line"><span class="lineno"> 70</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;Assertion Success.&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="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// perform self-tests implementations</span></div>
<div class="line"><span class="lineno"> 72</span>}</div> <div class="line"><span class="lineno"> 83</span> <span class="keywordflow">return</span> 0;</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="line"><span class="lineno"> 84</span>}</div>
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:56</div></div> <div class="ttc" id="acheck__amicable__pair_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:67</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="483" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div> <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="536" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div> </div>
</div> </div>
</div> </div>
<a id="ac656a51b4c3bd7d63b7dcc75dc3e5576" name="ac656a51b4c3bd7d63b7dcc75dc3e5576"></a> <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac656a51b4c3bd7d63b7dcc75dc3e5576">&#9670;&#160;</a></span>sum_of_divisor()</h2> <h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">&#9670;&#160;</a></span>tests()</h2>
<div class="memitem"> <div class="memitem">
<div class="memproto"> <div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname"> <table class="memname">
<tr> <tr>
<td class="memname">int sum_of_divisor </td> <td class="memname">static void tests </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to calculate the sum of all the proper divisor of an integer. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">num</td><td>First number. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Sum of the proper divisor of the number. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 21</span> {</div>
<div class="line"><span class="lineno"> 22</span> <span class="comment">// Variable to store the sum of all proper divisors.</span></div>
<div class="line"><span class="lineno"> 23</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
<div class="line"><span class="lineno"> 24</span> <span class="comment">// Below loop condition helps to reduce Time complexity by a factor of</span></div>
<div class="line"><span class="lineno"> 25</span> <span class="comment">// square root of the number.</span></div>
<div class="line"><span class="lineno"> 26</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> div = 2; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> &lt;= num; ++<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>) {</div>
<div class="line"><span class="lineno"> 27</span> <span class="comment">// Check &#39;div&#39; is divisor of &#39;num&#39;.</span></div>
<div class="line"><span class="lineno"> 28</span> <span class="keywordflow">if</span> (num % div == 0) {</div>
<div class="line"><span class="lineno"> 29</span> <span class="comment">// If both divisor are same, add once to &#39;sum&#39;</span></div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">if</span> (div == (num / div)) {</div>
<div class="line"><span class="lineno"> 31</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>;</div>
<div class="line"><span class="lineno"> 32</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 33</span> <span class="comment">// If both divisor are not the same, add both to &#39;sum&#39;.</span></div>
<div class="line"><span class="lineno"> 34</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> + (num / <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a>));</div>
<div class="line"><span class="lineno"> 35</span> }</div>
<div class="line"><span class="lineno"> 36</span> }</div>
<div class="line"><span class="lineno"> 37</span> }</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> + 1;</div>
<div class="line"><span class="lineno"> 39</span>}</div>
<div class="ttc" id="adiv_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/div.html">std::div</a></div><div class="ttdeci">T div(T... args)</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae1a3968e7947464bee7714f6d43b7002">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td>(</td> <td>(</td>
<td class="paramname"></td><td>)</td> <td class="paramname"></td><td>)</td>
<td></td> <td></td>
</tr> </tr>
</table> </table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Function for testing the is_amicable() with all the test cases. </p>
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div> <p>Self-test implementations. </p>
<div class="line"><span class="lineno"> 57</span> <span class="comment">// are_amicable(220, 284) returns true.</span></div> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div> <div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 59</span> <span class="comment">// are_amicable(6232, 6368) returns true.</span></div> <div class="line"><span class="lineno"> 68</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div> <div class="line"><span class="lineno"> 69</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// are_amicable(458, 232) returns false.</span></div> <div class="line"><span class="lineno"> 70</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(458, 232) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 62</span> assert(<a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a>(458, 232) == <span class="keyword">false</span>);</div> <div class="line"><span class="lineno"> 71</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(17296, 18416) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 63</span>}</div> <div class="line"><span class="lineno"> 72</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(18416, 17296) == <span class="keyword">true</span>);</div>
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:48</div></div> <div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</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!&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"> 75</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_a8e6eede206201db0d1dbb618fa969bec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdoc">Function to check whether the pair is amicable or not.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:58</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="358" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div> <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="439" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div> </div>
</div> </div>

6
d5/df6/check__amicable__pair_8cpp.js
View File

@@ -1,7 +1,7 @@
var check__amicable__pair_8cpp = var check__amicable__pair_8cpp =
[ [
[ "are_amicable", "d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01", null ], [ "are_amicable", "d5/df6/check__amicable__pair_8cpp.html#a8e6eede206201db0d1dbb618fa969bec", null ],
[ "main", "d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "main", "d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "sum_of_divisor", "d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576", null ], [ "sum_of_divisor", "d5/df6/check__amicable__pair_8cpp.html#af05567415a9ea36c254b54e3d5a2152a", null ],
[ "test", "d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002", null ] [ "tests", "d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
]; ];

9
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,56,56"/>
<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="104,5,239,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,89,30,90,36,56,42"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="136,55,207,80"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,45,122,56,121,62,55,50"/>
<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="287,5,433,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="239,16,272,16,272,21,239,21"/>
</map>

1
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
91b553d09597618c6169583635e22eff

100
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg Normal file
View File

@@ -0,0 +1,100 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: tests Pages: 1 -->
<svg width="329pt" height="64pt"
viewBox="0.00 0.00 329.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="white" stroke="#666666" points="175.25,-56.25 73.75,-56.25 73.75,-37 175.25,-37 175.25,-56.25"/>
<text text-anchor="middle" x="124.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.09,-32.25 53.79,-33.84 62.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.14,-39.12 72.6,-37.48 63.4,-32.23 62.14,-39.12"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="151.25,-19.25 97.75,-19.25 97.75,0 151.25,0 151.25,-19.25"/>
<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.43,-22.14 70.37,-18.85 86.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.25,-19.3 96.5,-14.14 86.05,-12.4 87.25,-19.3"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="321,-56.25 211.25,-56.25 211.25,-37 321,-37 321,-56.25"/>
<text text-anchor="middle" x="266.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.57,-46.62 192,-46.62 200.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.21,-50.13 210.21,-46.62 200.21,-43.13 200.21,-50.13"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.2 KiB

75
d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,75 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: tests Pages: 1 -->
<svg width="329pt" height="64pt"
viewBox="0.00 0.00 329.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="white" stroke="#666666" points="175.25,-56.25 73.75,-56.25 73.75,-37 175.25,-37 175.25,-56.25"/>
<text text-anchor="middle" x="124.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.09,-32.25 53.79,-33.84 62.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.14,-39.12 72.6,-37.48 63.4,-32.23 62.14,-39.12"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="151.25,-19.25 97.75,-19.25 97.75,0 151.25,0 151.25,-19.25"/>
<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.43,-22.14 70.37,-18.85 86.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.25,-19.3 96.5,-14.14 86.05,-12.4 87.25,-19.3"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="321,-56.25 211.25,-56.25 211.25,-37 321,-37 321,-56.25"/>
<text text-anchor="middle" x="266.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.57,-46.62 192,-46.62 200.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="200.21,-50.13 210.21,-46.62 200.21,-43.13 200.21,-50.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.4 KiB

7
d5/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
View File

@@ -1,7 +0,0 @@
<map id="test" name="test">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
<area shape="rect" id="Node000002" href="$d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" title=" " alt="" coords="97,5,195,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,82,16,82,21,49,21"/>
<area shape="rect" id="Node000003" href="$d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" title=" " alt="" coords="243,5,352,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="196,16,228,16,228,21,196,21"/>
</map>

1
d5/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
View File

@@ -1 +0,0 @@
a5c5224b33c1ee0eca843294cfe7bf39

82
d5/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
View File

@@ -1,82 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test Pages: 1 -->
<svg width="268pt" height="27pt"
viewBox="0.00 0.00 268.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="142.25,-19.25 68.5,-19.25 68.5,0 142.25,0 142.25,-19.25"/>
<text text-anchor="middle" x="105.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.86,-9.62 48.57,-9.62 57.47,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.32,-13.13 67.32,-9.62 57.32,-6.13 57.32,-13.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="260.25,-19.25 178.25,-19.25 178.25,0 260.25,0 260.25,-19.25"/>
<text text-anchor="middle" x="219.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.7,-9.62C150.42,-9.62 158.71,-9.62 166.87,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="166.85,-13.13 176.85,-9.62 166.85,-6.13 166.85,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 3.2 KiB

57
d5/df6/check__amicable__pair_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
View File

@@ -1,57 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test Pages: 1 -->
<svg width="268pt" height="27pt"
viewBox="0.00 0.00 268.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>test</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="142.25,-19.25 68.5,-19.25 68.5,0 142.25,0 142.25,-19.25"/>
<text text-anchor="middle" x="105.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.86,-9.62 48.57,-9.62 57.47,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="57.32,-13.13 67.32,-9.62 57.32,-6.13 57.32,-13.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="260.25,-19.25 178.25,-19.25 178.25,0 260.25,0 260.25,-19.25"/>
<text text-anchor="middle" x="219.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.7,-9.62C150.42,-9.62 158.71,-9.62 166.87,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="166.85,-13.13 176.85,-9.62 166.85,-6.13 166.85,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.5 KiB

18
d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="main" name="main"> <map id="main" name="main">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/> <area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/> <area shape="rect" id="Node000002" href="$d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,31,153,56"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,88,27,89,32,56,40"/> <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
<area shape="rect" id="Node000003" href="$d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="117,55,160,80"/> <area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="201,5,336,31"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,103,57,102,62,55,52"/> <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,36,186,30,187,36,154,42"/>
<area shape="rect" id="Node000004" href="$d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" title=" " alt="" coords="222,55,320,80"/> <area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="233,55,304,80"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="161,65,207,65,207,70,161,70"/> <area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,45,219,56,218,62,153,50"/>
<area shape="rect" id="Node000005" href="$d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" title=" " alt="" coords="368,55,478,80"/> <area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="384,5,531,31"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="321,65,353,65,353,70,321,70"/> <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="337,16,370,16,370,21,337,21"/>
</map> </map>

2
d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
d4a61131aa5e64aef2a6e6062cf89df1 d20519596209338efb9b7411bd2f01be

80
d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,8 +4,8 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635) <!-- Generated by graphviz version 8.0.5 (20230430.1635)
--> -->
<!-- Title: main Pages: 1 --> <!-- Title: main Pages: 1 -->
<svg width="362pt" height="64pt" <svg width="402pt" height="64pt"
viewBox="0.00 0.00 362.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 402.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)"> <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[ <style type="text/css"><![CDATA[
@@ -21,7 +21,7 @@
<!-- Node1 --> <!-- Node1 -->
<g id="Node000001" class="node"> <g id="Node000001" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_Node000001"><a xlink:title=" "> <g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/> <polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text> <text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a> </a>
@@ -30,9 +30,9 @@
<!-- Node2 --> <!-- Node2 -->
<g id="Node000002" class="node"> <g id="Node000002" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" "> <g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/> <polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text> <text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a> </a>
</g> </g>
</g> </g>
@@ -40,35 +40,53 @@
<g id="edge1_Node000001_Node000002" class="edge"> <g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" "> <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.8,-33.69 53.55,-35.79 62.1,-37.84"/> <path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.18,-41.46 71.72,-40.38 62.81,-34.65 61.18,-41.46"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
</a> </a>
</g> </g>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="Node000003" class="node"> <g id="Node000003" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" "> <g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/> <polygon fill="white" stroke="#666666" points="248.25,-56.25 146.75,-56.25 146.75,-37 248.25,-37 248.25,-56.25"/>
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text> <text text-anchor="middle" x="197.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge"> <g id="edge2_Node000002_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" "> <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.93,-21.17 61.28,-18.13 72.85,-15.51"/> <path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.09,-32.25 126.79,-33.84 135.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.27,-18.77 82.24,-13.15 71.72,-11.95 73.27,-18.77"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-39.12 145.6,-37.48 136.4,-32.23 135.14,-39.12"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="224.25,-19.25 170.75,-19.25 170.75,0 224.25,0 224.25,-19.25"/>
<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.43,-22.14 143.37,-18.85 159.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.25,-19.3 169.5,-14.14 159.05,-12.4 160.25,-19.3"/>
</a> </a>
</g> </g>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="Node000004" class="node"> <g id="Node000004" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" target="_top" xlink:title=" "> <g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="236.25,-19.25 162.5,-19.25 162.5,0 236.25,0 236.25,-19.25"/> <polygon fill="white" stroke="#666666" points="394,-56.25 284.25,-56.25 284.25,-37 394,-37 394,-56.25"/>
<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text> <text text-anchor="middle" x="339.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a> </a>
</g> </g>
</g> </g>
@@ -76,26 +94,8 @@
<g id="edge3_Node000003_Node000004" class="edge"> <g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title> <title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" "> <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.44,-9.62C125.94,-9.62 138.62,-9.62 151.16,-9.62"/> <path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.57,-46.62 265,-46.62 273.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.05,-13.13 161.05,-9.62 151.05,-6.13 151.05,-13.13"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="273.21,-50.13 283.21,-46.62 273.21,-43.13 273.21,-50.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="354.25,-19.25 272.25,-19.25 272.25,0 354.25,0 354.25,-19.25"/>
<text text-anchor="middle" x="313.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M236.7,-9.62C244.42,-9.62 252.71,-9.62 260.87,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="260.85,-13.13 270.85,-9.62 260.85,-6.13 260.85,-13.13"/>
</a> </a>
</g> </g>
</g> </g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.8 KiB

After

Width:  |  Height:  |  Size: 5.0 KiB

80
d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -4,14 +4,14 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635) <!-- Generated by graphviz version 8.0.5 (20230430.1635)
--> -->
<!-- Title: main Pages: 1 --> <!-- Title: main Pages: 1 -->
<svg width="362pt" height="64pt" <svg width="402pt" height="64pt"
viewBox="0.00 0.00 362.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 402.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>main</title> <title>main</title>
<!-- Node1 --> <!-- Node1 -->
<g id="Node000001" class="node"> <g id="Node000001" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_Node000001"><a xlink:title=" "> <g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/> <polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text> <text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a> </a>
@@ -20,9 +20,9 @@
<!-- Node2 --> <!-- Node2 -->
<g id="Node000002" class="node"> <g id="Node000002" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" "> <g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/> <polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text> <text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a> </a>
</g> </g>
</g> </g>
@@ -30,35 +30,53 @@
<g id="edge1_Node000001_Node000002" class="edge"> <g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" "> <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.8,-33.69 53.55,-35.79 62.1,-37.84"/> <path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.18,-41.46 71.72,-40.38 62.81,-34.65 61.18,-41.46"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
</a> </a>
</g> </g>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="Node000003" class="node"> <g id="Node000003" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" "> <g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/> <polygon fill="white" stroke="#666666" points="248.25,-56.25 146.75,-56.25 146.75,-37 248.25,-37 248.25,-56.25"/>
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text> <text text-anchor="middle" x="197.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge"> <g id="edge2_Node000002_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" "> <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.93,-21.17 61.28,-18.13 72.85,-15.51"/> <path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.09,-32.25 126.79,-33.84 135.86,-35.51"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.27,-18.77 82.24,-13.15 71.72,-11.95 73.27,-18.77"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-39.12 145.6,-37.48 136.4,-32.23 135.14,-39.12"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="224.25,-19.25 170.75,-19.25 170.75,0 224.25,0 224.25,-19.25"/>
<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.43,-22.14 143.37,-18.85 159.99,-15.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.25,-19.3 169.5,-14.14 159.05,-12.4 160.25,-19.3"/>
</a> </a>
</g> </g>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="Node000004" class="node"> <g id="Node000004" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01" target="_top" xlink:title=" "> <g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="236.25,-19.25 162.5,-19.25 162.5,0 236.25,0 236.25,-19.25"/> <polygon fill="white" stroke="#666666" points="394,-56.25 284.25,-56.25 284.25,-37 394,-37 394,-56.25"/>
<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text> <text text-anchor="middle" x="339.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a> </a>
</g> </g>
</g> </g>
@@ -66,26 +84,8 @@
<g id="edge3_Node000003_Node000004" class="edge"> <g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title> <title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" "> <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M116.44,-9.62C125.94,-9.62 138.62,-9.62 151.16,-9.62"/> <path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.57,-46.62 265,-46.62 273.34,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.05,-13.13 161.05,-9.62 151.05,-6.13 151.05,-13.13"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="273.21,-50.13 283.21,-46.62 273.21,-43.13 273.21,-50.13"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="354.25,-19.25 272.25,-19.25 272.25,0 354.25,0 354.25,-19.25"/>
<text text-anchor="middle" x="313.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M236.7,-9.62C244.42,-9.62 252.71,-9.62 260.87,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="260.85,-13.13 270.85,-9.62 260.85,-6.13 260.85,-13.13"/>
</a> </a>
</g> </g>
</g> </g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

5
d5/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="are_amicable" name="are_amicable">
<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,104,31"/>
<area shape="rect" id="Node000002" href="$d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" title=" " alt="" coords="152,5,261,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,16,136,16,136,21,104,21"/>
</map>

1
d5/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph.md5
View File

@@ -1 +0,0 @@
a226ff1af885e8d3f687cee2d43bc2de

39
d5/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph_org.svg
View File

@@ -1,39 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: are_amicable Pages: 1 -->
<svg width="200pt" height="27pt"
viewBox="0.00 0.00 199.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>are_amicable</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title=" ">
<polygon fill="#999999" stroke="#666666" points="73.75,-19.25 0,-19.25 0,0 73.75,0 73.75,-19.25"/>
<text text-anchor="middle" x="36.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="191.75,-19.25 109.75,-19.25 109.75,0 191.75,0 191.75,-19.25"/>
<text text-anchor="middle" x="150.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M74.2,-9.62C81.92,-9.62 90.21,-9.62 98.37,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.35,-13.13 108.35,-9.62 98.35,-6.13 98.35,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 1.7 KiB

63
d7/d81/namespacebit__manipulation.html
View File

@@ -190,43 +190,40 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>a number </dd></dl> <dl class="section return"><dt>Returns</dt><dd>a number </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 32</span>{</div> <div class="fragment"><div class="line"><span class="lineno"> 32</span> {</div>
<div class="line"><span class="lineno"> 33</span> </div> <div class="line"><span class="lineno"> 33</span> uint64_t rightOne = 0;</div>
<div class="line"><span class="lineno"> 34</span> uint64_t rightOne;</div> <div class="line"><span class="lineno"> 34</span> uint64_t nextHigherOneBit = 0;</div>
<div class="line"><span class="lineno"> 35</span> uint64_t nextHigherOneBit;</div> <div class="line"><span class="lineno"> 35</span> uint64_t rightOnesPattern = 0;</div>
<div class="line"><span class="lineno"> 36</span> uint64_t rightOnesPattern;</div> <div class="line"><span class="lineno"> 36</span> </div>
<div class="line"><span class="lineno"> 37</span> </div> <div class="line"><span class="lineno"> 37</span> uint64_t next = 0;</div>
<div class="line"><span class="lineno"> 38</span> uint64_t next = 0;</div> <div class="line"><span class="lineno"> 38</span> </div>
<div class="line"><span class="lineno"> 39</span> </div> <div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (x) {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span>(x)</div> <div class="line"><span class="lineno"> 40</span> <span class="comment">// right most set bit</span></div>
<div class="line"><span class="lineno"> 41</span> {</div> <div class="line"><span class="lineno"> 41</span> rightOne = x &amp; -<span class="keyword">static_cast&lt;</span><span class="keywordtype">signed</span><span class="keyword">&gt;</span>(x);</div>
<div class="line"><span class="lineno"> 42</span> </div> <div class="line"><span class="lineno"> 42</span> </div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// right most set bit</span></div> <div class="line"><span class="lineno"> 43</span> <span class="comment">// reset the pattern and set next higher bit</span></div>
<div class="line"><span class="lineno"> 44</span> rightOne = x &amp; -(signed)x;</div> <div class="line"><span class="lineno"> 44</span> <span class="comment">// left part of x will be here</span></div>
<div class="line"><span class="lineno"> 45</span> </div> <div class="line"><span class="lineno"> 45</span> nextHigherOneBit = x + rightOne;</div>
<div class="line"><span class="lineno"> 46</span> <span class="comment">// reset the pattern and set next higher bit</span></div> <div class="line"><span class="lineno"> 46</span> </div>
<div class="line"><span class="lineno"> 47</span> <span class="comment">// left part of x will be here</span></div> <div class="line"><span class="lineno"> 47</span> <span class="comment">// nextHigherOneBit is now part [D] of the above explanation.</span></div>
<div class="line"><span class="lineno"> 48</span> nextHigherOneBit = x + rightOne;</div> <div class="line"><span class="lineno"> 48</span> </div>
<div class="line"><span class="lineno"> 49</span> </div> <div class="line"><span class="lineno"> 49</span> <span class="comment">// isolate the pattern</span></div>
<div class="line"><span class="lineno"> 50</span> <span class="comment">// nextHigherOneBit is now part [D] of the above explanation.</span></div> <div class="line"><span class="lineno"> 50</span> rightOnesPattern = x ^ nextHigherOneBit;</div>
<div class="line"><span class="lineno"> 51</span> </div> <div class="line"><span class="lineno"> 51</span> </div>
<div class="line"><span class="lineno"> 52</span> <span class="comment">// isolate the pattern</span></div> <div class="line"><span class="lineno"> 52</span> <span class="comment">// right adjust pattern</span></div>
<div class="line"><span class="lineno"> 53</span> rightOnesPattern = x ^ nextHigherOneBit;</div> <div class="line"><span class="lineno"> 53</span> rightOnesPattern = (rightOnesPattern) / rightOne;</div>
<div class="line"><span class="lineno"> 54</span> </div> <div class="line"><span class="lineno"> 54</span> </div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// right adjust pattern</span></div> <div class="line"><span class="lineno"> 55</span> <span class="comment">// correction factor</span></div>
<div class="line"><span class="lineno"> 56</span> rightOnesPattern = (rightOnesPattern)/rightOne;</div> <div class="line"><span class="lineno"> 56</span> rightOnesPattern &gt;&gt;= 2;</div>
<div class="line"><span class="lineno"> 57</span> </div> <div class="line"><span class="lineno"> 57</span> </div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// correction factor</span></div> <div class="line"><span class="lineno"> 58</span> <span class="comment">// rightOnesPattern is now part [A] of the above explanation.</span></div>
<div class="line"><span class="lineno"> 59</span> rightOnesPattern &gt;&gt;= 2;</div> <div class="line"><span class="lineno"> 59</span> </div>
<div class="line"><span class="lineno"> 60</span> </div> <div class="line"><span class="lineno"> 60</span> <span class="comment">// integrate new pattern (Add [D] and [A])</span></div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// rightOnesPattern is now part [A] of the above explanation.</span></div> <div class="line"><span class="lineno"> 61</span> next = nextHigherOneBit | rightOnesPattern;</div>
<div class="line"><span class="lineno"> 62</span> </div> <div class="line"><span class="lineno"> 62</span> }</div>
<div class="line"><span class="lineno"> 63</span> <span class="comment">// integrate new pattern (Add [D] and [A])</span></div> <div class="line"><span class="lineno"> 63</span> </div>
<div class="line"><span class="lineno"> 64</span> next = nextHigherOneBit | rightOnesPattern;</div> <div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> next;</div>
<div class="line"><span class="lineno"> 65</span> }</div> <div class="line"><span class="lineno"> 65</span>}</div>
<div class="line"><span class="lineno"> 66</span> </div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> next;</div>
<div class="line"><span class="lineno"> 68</span>}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
db/d0c/check__amicable__pair_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="math/check_amicable_pair.cpp" name="math/check_amicable_pair.cpp"> <map id="math/check_amicable_pair.cpp" name="math/check_amicable_pair.cpp">
<area shape="rect" id="Node000001" title="A C++ Program to check whether a pair of number is amicable pair or not." alt="" coords="9,5,157,46"/> <area shape="rect" id="Node000001" title="A C++ Program to check whether a pair of numbers is an amicable pair or not." alt="" coords="9,5,157,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/> <area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="74,48,54,82,49,80,69,45"/> <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="74,48,54,82,49,80,69,45"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/> <area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/>

2
db/d0c/check__amicable__pair_8cpp__incl.md5
View File

@@ -1 +1 @@
4684e61fda9303cfab368facf1252e2b b6c230cc9b579b0df9b9c1bfd9afb41e

2
db/d0c/check__amicable__pair_8cpp__incl.svg
View File

@@ -21,7 +21,7 @@
<!-- Node1 --> <!-- Node1 -->
<g id="Node000001" class="node"> <g id="Node000001" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_Node000001"><a xlink:title="A C++ Program to check whether a pair of number is amicable pair or not."> <g id="a_Node000001"><a xlink:title="A C++ Program to check whether a pair of numbers is an amicable pair or not.">
<polygon fill="#999999" stroke="#666666" points="113.75,-85.75 2.5,-85.75 2.5,-55.25 113.75,-55.25 113.75,-85.75"/> <polygon fill="#999999" stroke="#666666" points="113.75,-85.75 2.5,-85.75 2.5,-55.25 113.75,-55.25 113.75,-85.75"/>
<text text-anchor="start" x="10.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/check_amicable</text> <text text-anchor="start" x="10.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/check_amicable</text>
<text text-anchor="middle" x="58.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pair.cpp</text> <text text-anchor="middle" x="58.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pair.cpp</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

2
db/d0c/check__amicable__pair_8cpp__incl_org.svg
View File

@@ -11,7 +11,7 @@
<!-- Node1 --> <!-- Node1 -->
<g id="Node000001" class="node"> <g id="Node000001" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_Node000001"><a xlink:title="A C++ Program to check whether a pair of number is amicable pair or not."> <g id="a_Node000001"><a xlink:title="A C++ Program to check whether a pair of numbers is an amicable pair or not.">
<polygon fill="#999999" stroke="#666666" points="113.75,-85.75 2.5,-85.75 2.5,-55.25 113.75,-55.25 113.75,-85.75"/> <polygon fill="#999999" stroke="#666666" points="113.75,-85.75 2.5,-85.75 2.5,-55.25 113.75,-55.25 113.75,-85.75"/>
<text text-anchor="start" x="10.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/check_amicable</text> <text text-anchor="start" x="10.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">math/check_amicable</text>
<text text-anchor="middle" x="58.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pair.cpp</text> <text text-anchor="middle" x="58.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_pair.cpp</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.5 KiB

After

Width:  |  Height:  |  Size: 2.5 KiB

101
dd/d47/namespacemath.html
View File

@@ -151,6 +151,12 @@ Functions</h2></td></tr>
<tr class="memitem:ac5803413618fcfb922cb32c6db0fc864"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">cylinder_surface_area</a> (T radius, T height)</td></tr> <tr class="memitem:ac5803413618fcfb922cb32c6db0fc864"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">cylinder_surface_area</a> (T radius, T height)</td></tr>
<tr class="memdesc:ac5803413618fcfb922cb32c6db0fc864"><td class="mdescLeft">&#160;</td><td class="mdescRight">surface area of a <a href="https://en.wikipedia.org/wiki/Cylinder" target="_blank">cylinder</a> (2 * pi * r * h + 2 * pi * r^2) <br /></td></tr> <tr class="memdesc:ac5803413618fcfb922cb32c6db0fc864"><td class="mdescLeft">&#160;</td><td class="mdescRight">surface area of a <a href="https://en.wikipedia.org/wiki/Cylinder" target="_blank">cylinder</a> (2 * pi * r * h + 2 * pi * r^2) <br /></td></tr>
<tr class="separator:ac5803413618fcfb922cb32c6db0fc864"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:ac5803413618fcfb922cb32c6db0fc864"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af05567415a9ea36c254b54e3d5a2152a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a> (int num)</td></tr>
<tr class="memdesc:af05567415a9ea36c254b54e3d5a2152a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the sum of all the proper divisor of an integer. <br /></td></tr>
<tr class="separator:af05567415a9ea36c254b54e3d5a2152a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8e6eede206201db0d1dbb618fa969bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">are_amicable</a> (int x, int y)</td></tr>
<tr class="memdesc:a8e6eede206201db0d1dbb618fa969bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check whether the pair is amicable or not. <br /></td></tr>
<tr class="separator:a8e6eede206201db0d1dbb618fa969bec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">is_factorial</a> (uint64_t n)</td></tr> <tr class="memitem:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">is_factorial</a> (uint64_t n)</td></tr>
<tr class="memdesc:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if the given number is factorial of some number or not. <br /></td></tr> <tr class="memdesc:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if the given number is factorial of some number or not. <br /></td></tr>
<tr class="separator:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a6c72f756a7bf1b9043c357e3fe7814ca"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -388,6 +394,55 @@ Here is the call graph for this function:</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg" width="320" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div> <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg" width="320" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div> </div>
</div>
</div>
<a id="a8e6eede206201db0d1dbb618fa969bec" name="a8e6eede206201db0d1dbb618fa969bec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8e6eede206201db0d1dbb618fa969bec">&#9670;&#160;</a></span>are_amicable()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool math::are_amicable </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>y</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to check whether the pair is amicable or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">x</td><td>First number. </td></tr>
<tr><td class="paramname">y</td><td>Second number. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if the pair is amicable </dd>
<dd>
<code>false</code> if the pair is not amicable </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 58</span> {</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(x) == y) &amp;&amp; (<a class="code hl_function" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(y) == x);</div>
<div class="line"><span class="lineno"> 60</span>}</div>
<div class="ttc" id="anamespacemath_html_af05567415a9ea36c254b54e3d5a2152a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdoc">Function to calculate the sum of all the proper divisor of an integer.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:31</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg" width="340" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div> </div>
</div> </div>
<a id="ae1ca505751f5a6d3977b86372cfe75ea" name="ae1ca505751f5a6d3977b86372cfe75ea"></a> <a id="ae1ca505751f5a6d3977b86372cfe75ea" name="ae1ca505751f5a6d3977b86372cfe75ea"></a>
@@ -1945,6 +2000,52 @@ template&lt;typename T &gt; </div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
<a id="af05567415a9ea36c254b54e3d5a2152a" name="af05567415a9ea36c254b54e3d5a2152a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af05567415a9ea36c254b54e3d5a2152a">&#9670;&#160;</a></span>sum_of_divisor()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int math::sum_of_divisor </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>num</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to calculate the sum of all the proper divisor of an integer. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">num</td><td>selected number. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Sum of the proper divisor of the number. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 31</span> {</div>
<div class="line"><span class="lineno"> 32</span> <span class="comment">// Variable to store the sum of all proper divisors.</span></div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">int</span> sum = 1;</div>
<div class="line"><span class="lineno"> 34</span> <span class="comment">// Below loop condition helps to reduce Time complexity by a factor of</span></div>
<div class="line"><span class="lineno"> 35</span> <span class="comment">// square root of the number.</span></div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> div = 2; div * div &lt;= num; ++div) {</div>
<div class="line"><span class="lineno"> 37</span> <span class="comment">// Check &#39;div&#39; is divisor of &#39;num&#39;.</span></div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (num % div == 0) {</div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// If both divisor are same, add once to &#39;sum&#39;</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">if</span> (div == (num / div)) {</div>
<div class="line"><span class="lineno"> 41</span> sum += div;</div>
<div class="line"><span class="lineno"> 42</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// If both divisor are not the same, add both to &#39;sum&#39;.</span></div>
<div class="line"><span class="lineno"> 44</span> sum += (div + (num / div));</div>
<div class="line"><span class="lineno"> 45</span> }</div>
<div class="line"><span class="lineno"> 46</span> }</div>
<div class="line"><span class="lineno"> 47</span> }</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>;</div>
<div class="line"><span class="lineno"> 49</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a50936ee98f4d40f17823befc65a32aec" name="a50936ee98f4d40f17823befc65a32aec"></a> <a id="a50936ee98f4d40f17823befc65a32aec" name="a50936ee98f4d40f17823befc65a32aec"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a50936ee98f4d40f17823befc65a32aec">&#9670;&#160;</a></span>test_eval()</h2> <h2 class="memtitle"><span class="permalink"><a href="#a50936ee98f4d40f17823befc65a32aec">&#9670;&#160;</a></span>test_eval()</h2>

2
dd/d47/namespacemath.js
View File

@@ -3,6 +3,7 @@ var namespacemath =
[ "Point", "de/d4f/structmath_1_1_point.html", null ], [ "Point", "de/d4f/structmath_1_1_point.html", null ],
[ "aliquot_sum", "dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf", null ], [ "aliquot_sum", "dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf", null ],
[ "approximate_pi", "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188", null ], [ "approximate_pi", "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188", null ],
[ "are_amicable", "dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec", null ],
[ "binomialCoeffSum", "dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea", null ], [ "binomialCoeffSum", "dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea", null ],
[ "circle_area", "dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75", null ], [ "circle_area", "dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75", null ],
[ "circle_perimeter", "dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953", null ], [ "circle_perimeter", "dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953", null ],
@@ -37,6 +38,7 @@ var namespacemath =
[ "sphere_volume", "dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551", null ], [ "sphere_volume", "dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551", null ],
[ "square_area", "dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049", null ], [ "square_area", "dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049", null ],
[ "square_perimeter", "dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14", null ], [ "square_perimeter", "dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14", null ],
[ "sum_of_divisor", "dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a", null ],
[ "test_eval", "dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec", null ], [ "test_eval", "dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec", null ],
[ "triangle_area", "dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc", null ], [ "triangle_area", "dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc", null ],
[ "triangle_perimeter", "dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3", null ], [ "triangle_perimeter", "dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3", null ],

5
dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="math::are_amicable" name="math::are_amicable">
<area shape="rect" id="Node000001" title="Function to check whether the pair is amicable or not." alt="" coords="5,5,141,31"/>
<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="189,5,335,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,16,174,16,174,21,141,21"/>
</map>

1
dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
5a1e76eff5b60a59fdd7eae43d589d1a

24
d5/df6/check__amicable__pair_8cpp_afeb67e204ec7de02ad152c11df4d1e01_cgraph.svg → dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg
View File

@@ -3,9 +3,9 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635) <!-- Generated by graphviz version 8.0.5 (20230430.1635)
--> -->
<!-- Title: are_amicable Pages: 1 --> <!-- Title: math::are_amicable Pages: 1 -->
<svg width="200pt" height="27pt" <svg width="255pt" height="27pt"
viewBox="0.00 0.00 199.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 255.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)"> <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[ <style type="text/css"><![CDATA[
@@ -17,22 +17,22 @@
<script type="application/ecmascript" xlink:href="../../svg.min.js"/> <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph"> <svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>are_amicable</title> <title>math::are_amicable</title>
<!-- Node1 --> <!-- Node1 -->
<g id="Node000001" class="node"> <g id="Node000001" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_Node000001"><a xlink:title=" "> <g id="a_Node000001"><a xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="#999999" stroke="#666666" points="73.75,-19.25 0,-19.25 0,0 73.75,0 73.75,-19.25"/> <polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
<text text-anchor="middle" x="36.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">are_amicable</text> <text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node2 --> <!-- Node2 -->
<g id="Node000002" class="node"> <g id="Node000002" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576" target="_top" xlink:title=" "> <g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="191.75,-19.25 109.75,-19.25 109.75,0 191.75,0 191.75,-19.25"/> <polygon fill="white" stroke="#666666" points="247.25,-19.25 137.5,-19.25 137.5,0 247.25,0 247.25,-19.25"/>
<text text-anchor="middle" x="150.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_divisor</text> <text text-anchor="middle" x="192.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a> </a>
</g> </g>
</g> </g>
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge"> <g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" "> <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M74.2,-9.62C81.92,-9.62 90.21,-9.62 98.37,-9.62"/> <path fill="none" stroke="#63b8ff" d="M101.76,-9.62C109.82,-9.62 118.25,-9.62 126.59,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="98.35,-13.13 108.35,-9.62 98.35,-6.13 98.35,-13.13"/> <polygon fill="#63b8ff" stroke="#63b8ff" points="126.46,-13.13 136.46,-9.62 126.46,-6.13 126.46,-13.13"/>
</a> </a>
</g> </g>
</g> </g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

39
dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph_org.svg Normal file
View File

@@ -0,0 +1,39 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: math::are_amicable Pages: 1 -->
<svg width="255pt" height="27pt"
viewBox="0.00 0.00 255.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>math::are_amicable</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to check whether the pair is amicable or not.">
<polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
<polygon fill="white" stroke="#666666" points="247.25,-19.25 137.5,-19.25 137.5,0 247.25,0 247.25,-19.25"/>
<text text-anchor="middle" x="192.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101.76,-9.62C109.82,-9.62 118.25,-9.62 126.59,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.46,-13.13 136.46,-9.62 126.46,-6.13 126.46,-13.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

2
dir_296d53ceaeaa7e099814a6def439fe8a.html
View File

@@ -119,7 +119,7 @@ Files</h2></td></tr>
<tr class="memdesc:d8/db1/binomial__calculate_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> <br /></td></tr> <tr class="memdesc:d8/db1/binomial__calculate_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr> <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr>
<tr class="memdesc:d5/df6/check__amicable__pair_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. <br /></td></tr> <tr class="memdesc:d5/df6/check__amicable__pair_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></td></tr> <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></td></tr>
<tr class="memdesc:d8/dd5/check__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not. <br /></td></tr> <tr class="memdesc:d8/dd5/check__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not. <br /></td></tr>

2
files.html
View File

@@ -229,7 +229,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr> <tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr> <tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr> <tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr> <tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not </td></tr> <tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not </td></tr>
<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not </td></tr> <tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not </td></tr>
<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr> <tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>

1
globals_a.html
View File

@@ -108,7 +108,6 @@ $(document).ready(function(){initNavTree('globals_a.html',''); initResizable();
<li>and_test()&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li> <li>and_test()&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li>
<li>ans()&#160;:&#160;<a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li> <li>ans()&#160;:&#160;<a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li>
<li>APLHABET_SIZE&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">boyer_moore.cpp</a></li> <li>APLHABET_SIZE&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">boyer_moore.cpp</a></li>
<li>are_amicable()&#160;:&#160;<a class="el" href="d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">check_amicable_pair.cpp</a></li>
<li>assertArray()&#160;:&#160;<a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li> <li>assertArray()&#160;:&#160;<a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li>
<li>AvailArray&#160;:&#160;<a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">linkedlist_implentation_usingarray.cpp</a></li> <li>AvailArray&#160;:&#160;<a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">linkedlist_implentation_usingarray.cpp</a></li>
</ul> </ul>

1
globals_func_a.html
View File

@@ -105,7 +105,6 @@ $(document).ready(function(){initNavTree('globals_func_a.html',''); initResizabl
<li>addition_rule_independent()&#160;:&#160;<a class="el" href="d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule.cpp</a></li> <li>addition_rule_independent()&#160;:&#160;<a class="el" href="d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule.cpp</a></li>
<li>and_test()&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li> <li>and_test()&#160;:&#160;<a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li>
<li>ans()&#160;:&#160;<a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li> <li>ans()&#160;:&#160;<a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li>
<li>are_amicable()&#160;:&#160;<a class="el" href="d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">check_amicable_pair.cpp</a></li>
<li>assertArray()&#160;:&#160;<a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li> <li>assertArray()&#160;:&#160;<a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li>
</ul> </ul>
</div><!-- contents --> </div><!-- contents -->

1
globals_func_s.html
View File

@@ -122,7 +122,6 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
<li>stoogeSort()&#160;:&#160;<a class="el" href="d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stooge_sort.cpp</a></li> <li>stoogeSort()&#160;:&#160;<a class="el" href="d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stooge_sort.cpp</a></li>
<li>struzik_search()&#160;:&#160;<a class="el" href="d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">exponential_search.cpp</a></li> <li>struzik_search()&#160;:&#160;<a class="el" href="d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">exponential_search.cpp</a></li>
<li>sum_of_digits()&#160;:&#160;<a class="el" href="d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits.cpp</a></li> <li>sum_of_digits()&#160;:&#160;<a class="el" href="d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits.cpp</a></li>
<li>sum_of_divisor()&#160;:&#160;<a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">check_amicable_pair.cpp</a></li>
</ul> </ul>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->

4
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

1
globals_s.html
View File

@@ -124,7 +124,6 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
<li>stoogeSort()&#160;:&#160;<a class="el" href="d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stooge_sort.cpp</a></li> <li>stoogeSort()&#160;:&#160;<a class="el" href="d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stooge_sort.cpp</a></li>
<li>struzik_search()&#160;:&#160;<a class="el" href="d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">exponential_search.cpp</a></li> <li>struzik_search()&#160;:&#160;<a class="el" href="d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">exponential_search.cpp</a></li>
<li>sum_of_digits()&#160;:&#160;<a class="el" href="d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits.cpp</a></li> <li>sum_of_digits()&#160;:&#160;<a class="el" href="d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits.cpp</a></li>
<li>sum_of_divisor()&#160;:&#160;<a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">check_amicable_pair.cpp</a></li>
</ul> </ul>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->

4
globals_t.html
View File

File diff suppressed because one or more lines are too long

2
namespacemembers.html
View File

@@ -108,6 +108,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
<li>apply_function()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning</a></li> <li>apply_function()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning</a></li>
<li>approximate_pi()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math</a></li> <li>approximate_pi()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math</a></li>
<li>are_almost_equal()&#160;:&#160;<a class="el" href="d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others</a></li> <li>are_almost_equal()&#160;:&#160;<a class="el" href="d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others</a></li>
<li>are_amicable()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math</a></li>
<li>argmax()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning</a></li> <li>argmax()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning</a></li>
</ul> </ul>
@@ -293,6 +294,7 @@ $(document).ready(function(){initNavTree('namespacemembers.html',''); initResiza
<li>square_perimeter()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math</a></li> <li>square_perimeter()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math</a></li>
<li>STRKEY&#160;:&#160;<a class="el" href="d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers</a></li> <li>STRKEY&#160;:&#160;<a class="el" href="d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers</a></li>
<li>sum()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning</a></li> <li>sum()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning</a></li>
<li>sum_of_divisor()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math</a></li>
</ul> </ul>

2
namespacemembers_func.html
View File

@@ -108,6 +108,7 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
<li>apply_function()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning</a></li> <li>apply_function()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning</a></li>
<li>approximate_pi()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math</a></li> <li>approximate_pi()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math</a></li>
<li>are_almost_equal()&#160;:&#160;<a class="el" href="d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others</a></li> <li>are_almost_equal()&#160;:&#160;<a class="el" href="d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others</a></li>
<li>are_amicable()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math</a></li>
<li>argmax()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning</a></li> <li>argmax()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning</a></li>
</ul> </ul>
@@ -288,6 +289,7 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
<li>square_area()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math</a></li> <li>square_area()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math</a></li>
<li>square_perimeter()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math</a></li> <li>square_perimeter()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math</a></li>
<li>sum()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning</a></li> <li>sum()&#160;:&#160;<a class="el" href="d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning</a></li>
<li>sum_of_divisor()&#160;:&#160;<a class="el" href="dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math</a></li>
</ul> </ul>

6
navtreedata.js
View File

@@ -148,9 +148,9 @@ var NAVTREEINDEX =
"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", "d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99", "da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99",
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e",
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca", "dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb",
"de/dd1/segment__tree_8cpp.html", "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50",
"globals_func_j.html" "globals_func_h.html"
]; ];
var SYNCONMSG = 'click to disable panel synchronisation'; var SYNCONMSG = 'click to disable panel synchronisation';

46
navtreeindex0.js
View File

@@ -5,8 +5,8 @@ var NAVTREEINDEX0 =
"cpp/algorithm/accumulate.html":[9,0,110,15], "cpp/algorithm/accumulate.html":[9,0,110,15],
"cpp/algorithm/adjacent_difference.html":[9,0,110,19], "cpp/algorithm/adjacent_difference.html":[9,0,110,19],
"cpp/algorithm/adjacent_find.html":[9,0,110,20], "cpp/algorithm/adjacent_find.html":[9,0,110,20],
"cpp/algorithm/all_any_none_of.html":[9,0,110,300],
"cpp/algorithm/all_any_none_of.html":[9,0,110,23], "cpp/algorithm/all_any_none_of.html":[9,0,110,23],
"cpp/algorithm/all_any_none_of.html":[9,0,110,300],
"cpp/algorithm/all_any_none_of.html":[9,0,110,25], "cpp/algorithm/all_any_none_of.html":[9,0,110,25],
"cpp/algorithm/binary_search.html":[9,0,110,65], "cpp/algorithm/binary_search.html":[9,0,110,65],
"cpp/algorithm/bsearch.html":[9,0,110,68], "cpp/algorithm/bsearch.html":[9,0,110,68],
@@ -63,16 +63,16 @@ var NAVTREEINDEX0 =
"cpp/algorithm/prev_permutation.html":[9,0,110,322], "cpp/algorithm/prev_permutation.html":[9,0,110,322],
"cpp/algorithm/push_heap.html":[9,0,110,324], "cpp/algorithm/push_heap.html":[9,0,110,324],
"cpp/algorithm/qsort.html":[9,0,110,331], "cpp/algorithm/qsort.html":[9,0,110,331],
"cpp/algorithm/random_shuffle.html":[9,0,110,335],
"cpp/algorithm/random_shuffle.html":[9,0,110,388], "cpp/algorithm/random_shuffle.html":[9,0,110,388],
"cpp/algorithm/random_shuffle.html":[9,0,110,335],
"cpp/algorithm/remove.html":[9,0,110,345], "cpp/algorithm/remove.html":[9,0,110,345],
"cpp/algorithm/remove.html":[9,0,110,342], "cpp/algorithm/remove.html":[9,0,110,342],
"cpp/algorithm/remove_copy.html":[9,0,110,343],
"cpp/algorithm/remove_copy.html":[9,0,110,344], "cpp/algorithm/remove_copy.html":[9,0,110,344],
"cpp/algorithm/remove_copy.html":[9,0,110,343],
"cpp/algorithm/replace.html":[9,0,110,348], "cpp/algorithm/replace.html":[9,0,110,348],
"cpp/algorithm/replace.html":[9,0,110,351], "cpp/algorithm/replace.html":[9,0,110,351],
"cpp/algorithm/replace_copy.html":[9,0,110,349],
"cpp/algorithm/replace_copy.html":[9,0,110,350], "cpp/algorithm/replace_copy.html":[9,0,110,350],
"cpp/algorithm/replace_copy.html":[9,0,110,349],
"cpp/algorithm/reverse.html":[9,0,110,356], "cpp/algorithm/reverse.html":[9,0,110,356],
"cpp/algorithm/reverse_copy.html":[9,0,110,357], "cpp/algorithm/reverse_copy.html":[9,0,110,357],
"cpp/algorithm/rotate.html":[9,0,110,361], "cpp/algorithm/rotate.html":[9,0,110,361],
@@ -93,20 +93,20 @@ var NAVTREEINDEX0 =
"cpp/algorithm/unique.html":[9,0,110,475], "cpp/algorithm/unique.html":[9,0,110,475],
"cpp/algorithm/unique_copy.html":[9,0,110,476], "cpp/algorithm/unique_copy.html":[9,0,110,476],
"cpp/algorithm/upper_bound.html":[9,0,110,478], "cpp/algorithm/upper_bound.html":[9,0,110,478],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,39],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,40], "cpp/atomic/atomic_compare_exchange.html":[9,0,110,40],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,41], "cpp/atomic/atomic_compare_exchange.html":[9,0,110,41],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,42], "cpp/atomic/atomic_compare_exchange.html":[9,0,110,42],
"cpp/atomic/atomic_exchange.html":[9,0,110,44], "cpp/atomic/atomic_compare_exchange.html":[9,0,110,39],
"cpp/atomic/atomic_exchange.html":[9,0,110,43], "cpp/atomic/atomic_exchange.html":[9,0,110,43],
"cpp/atomic/atomic_exchange.html":[9,0,110,44],
"cpp/atomic/atomic_fetch_add.html":[9,0,110,46], "cpp/atomic/atomic_fetch_add.html":[9,0,110,46],
"cpp/atomic/atomic_fetch_add.html":[9,0,110,45], "cpp/atomic/atomic_fetch_add.html":[9,0,110,45],
"cpp/atomic/atomic_fetch_or.html":[9,0,110,50], "cpp/atomic/atomic_fetch_or.html":[9,0,110,50],
"cpp/atomic/atomic_fetch_or.html":[9,0,110,49], "cpp/atomic/atomic_fetch_or.html":[9,0,110,49],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,47], "cpp/atomic/atomic_fetch_sub.html":[9,0,110,52],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,48], "cpp/atomic/atomic_fetch_sub.html":[9,0,110,48],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,51], "cpp/atomic/atomic_fetch_sub.html":[9,0,110,51],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,52], "cpp/atomic/atomic_fetch_sub.html":[9,0,110,47],
"cpp/atomic/atomic_fetch_xor.html":[9,0,110,53], "cpp/atomic/atomic_fetch_xor.html":[9,0,110,53],
"cpp/atomic/atomic_fetch_xor.html":[9,0,110,54], "cpp/atomic/atomic_fetch_xor.html":[9,0,110,54],
"cpp/atomic/atomic_init.html":[9,0,110,55], "cpp/atomic/atomic_init.html":[9,0,110,55],
@@ -157,9 +157,9 @@ var NAVTREEINDEX0 =
"cpp/io/c/fgetwc.html":[9,0,110,131], "cpp/io/c/fgetwc.html":[9,0,110,131],
"cpp/io/c/fgetws.html":[9,0,110,132], "cpp/io/c/fgetws.html":[9,0,110,132],
"cpp/io/c/fopen.html":[9,0,110,147], "cpp/io/c/fopen.html":[9,0,110,147],
"cpp/io/c/fprintf.html":[9,0,110,323],
"cpp/io/c/fprintf.html":[9,0,110,394], "cpp/io/c/fprintf.html":[9,0,110,394],
"cpp/io/c/fprintf.html":[9,0,110,397], "cpp/io/c/fprintf.html":[9,0,110,397],
"cpp/io/c/fprintf.html":[9,0,110,323],
"cpp/io/c/fprintf.html":[9,0,110,152], "cpp/io/c/fprintf.html":[9,0,110,152],
"cpp/io/c/fputc.html":[9,0,110,153], "cpp/io/c/fputc.html":[9,0,110,153],
"cpp/io/c/fputc.html":[9,0,110,327], "cpp/io/c/fputc.html":[9,0,110,327],
@@ -168,15 +168,15 @@ var NAVTREEINDEX0 =
"cpp/io/c/fputws.html":[9,0,110,156], "cpp/io/c/fputws.html":[9,0,110,156],
"cpp/io/c/fread.html":[9,0,110,157], "cpp/io/c/fread.html":[9,0,110,157],
"cpp/io/c/freopen.html":[9,0,110,159], "cpp/io/c/freopen.html":[9,0,110,159],
"cpp/io/c/fscanf.html":[9,0,110,162],
"cpp/io/c/fscanf.html":[9,0,110,366],
"cpp/io/c/fscanf.html":[9,0,110,400], "cpp/io/c/fscanf.html":[9,0,110,400],
"cpp/io/c/fscanf.html":[9,0,110,366],
"cpp/io/c/fscanf.html":[9,0,110,162],
"cpp/io/c/fseek.html":[9,0,110,163], "cpp/io/c/fseek.html":[9,0,110,163],
"cpp/io/c/fsetpos.html":[9,0,110,164], "cpp/io/c/fsetpos.html":[9,0,110,164],
"cpp/io/c/ftell.html":[9,0,110,165], "cpp/io/c/ftell.html":[9,0,110,165],
"cpp/io/c/fwprintf.html":[9,0,110,167],
"cpp/io/c/fwprintf.html":[9,0,110,441], "cpp/io/c/fwprintf.html":[9,0,110,441],
"cpp/io/c/fwprintf.html":[9,0,110,531], "cpp/io/c/fwprintf.html":[9,0,110,531],
"cpp/io/c/fwprintf.html":[9,0,110,167],
"cpp/io/c/fwrite.html":[9,0,110,168], "cpp/io/c/fwrite.html":[9,0,110,168],
"cpp/io/c/fwscanf.html":[9,0,110,442], "cpp/io/c/fwscanf.html":[9,0,110,442],
"cpp/io/c/fwscanf.html":[9,0,110,533], "cpp/io/c/fwscanf.html":[9,0,110,533],
@@ -196,35 +196,35 @@ var NAVTREEINDEX0 =
"cpp/io/c/tmpnam.html":[9,0,110,453], "cpp/io/c/tmpnam.html":[9,0,110,453],
"cpp/io/c/ungetc.html":[9,0,110,469], "cpp/io/c/ungetc.html":[9,0,110,469],
"cpp/io/c/ungetwc.html":[9,0,110,470], "cpp/io/c/ungetwc.html":[9,0,110,470],
"cpp/io/c/vfprintf.html":[9,0,110,488],
"cpp/io/c/vfprintf.html":[9,0,110,487], "cpp/io/c/vfprintf.html":[9,0,110,487],
"cpp/io/c/vfprintf.html":[9,0,110,481], "cpp/io/c/vfprintf.html":[9,0,110,481],
"cpp/io/c/vfprintf.html":[9,0,110,485], "cpp/io/c/vfprintf.html":[9,0,110,485],
"cpp/io/c/vfprintf.html":[9,0,110,488], "cpp/io/c/vfscanf.html":[9,0,110,486],
"cpp/io/c/vfscanf.html":[9,0,110,489], "cpp/io/c/vfscanf.html":[9,0,110,489],
"cpp/io/c/vfscanf.html":[9,0,110,482], "cpp/io/c/vfscanf.html":[9,0,110,482],
"cpp/io/c/vfscanf.html":[9,0,110,486],
"cpp/io/c/vfwprintf.html":[9,0,110,490],
"cpp/io/c/vfwprintf.html":[9,0,110,492], "cpp/io/c/vfwprintf.html":[9,0,110,492],
"cpp/io/c/vfwprintf.html":[9,0,110,490],
"cpp/io/c/vfwprintf.html":[9,0,110,483], "cpp/io/c/vfwprintf.html":[9,0,110,483],
"cpp/io/c/vfwscanf.html":[9,0,110,484],
"cpp/io/c/vfwscanf.html":[9,0,110,491], "cpp/io/c/vfwscanf.html":[9,0,110,491],
"cpp/io/c/vfwscanf.html":[9,0,110,484],
"cpp/io/c/vfwscanf.html":[9,0,110,493], "cpp/io/c/vfwscanf.html":[9,0,110,493],
"cpp/io/manip/boolalpha.html":[9,0,110,67], "cpp/io/manip/boolalpha.html":[9,0,110,67],
"cpp/io/manip/boolalpha.html":[9,0,110,299], "cpp/io/manip/boolalpha.html":[9,0,110,299],
"cpp/io/manip/endl.html":[9,0,110,101], "cpp/io/manip/endl.html":[9,0,110,101],
"cpp/io/manip/ends.html":[9,0,110,102], "cpp/io/manip/ends.html":[9,0,110,102],
"cpp/io/manip/fixed.html":[9,0,110,95], "cpp/io/manip/fixed.html":[9,0,110,140],
"cpp/io/manip/fixed.html":[9,0,110,190], "cpp/io/manip/fixed.html":[9,0,110,190],
"cpp/io/manip/fixed.html":[9,0,110,367], "cpp/io/manip/fixed.html":[9,0,110,367],
"cpp/io/manip/fixed.html":[9,0,110,140], "cpp/io/manip/fixed.html":[9,0,110,95],
"cpp/io/manip/flush.html":[9,0,110,142], "cpp/io/manip/flush.html":[9,0,110,142],
"cpp/io/manip/get_money.html":[9,0,110,174], "cpp/io/manip/get_money.html":[9,0,110,174],
"cpp/io/manip/get_time.html":[9,0,110,179], "cpp/io/manip/get_time.html":[9,0,110,179],
"cpp/io/manip/hex.html":[9,0,110,189],
"cpp/io/manip/hex.html":[9,0,110,311], "cpp/io/manip/hex.html":[9,0,110,311],
"cpp/io/manip/hex.html":[9,0,110,189],
"cpp/io/manip/hex.html":[9,0,110,91], "cpp/io/manip/hex.html":[9,0,110,91],
"cpp/io/manip/left.html":[9,0,110,239],
"cpp/io/manip/left.html":[9,0,110,197], "cpp/io/manip/left.html":[9,0,110,197],
"cpp/io/manip/left.html":[9,0,110,239],
"cpp/io/manip/left.html":[9,0,110,359], "cpp/io/manip/left.html":[9,0,110,359],
"cpp/io/manip/put_money.html":[9,0,110,325], "cpp/io/manip/put_money.html":[9,0,110,325],
"cpp/io/manip/put_time.html":[9,0,110,326], "cpp/io/manip/put_time.html":[9,0,110,326],
@@ -234,14 +234,14 @@ var NAVTREEINDEX0 =
"cpp/io/manip/setiosflags.html":[9,0,110,380], "cpp/io/manip/setiosflags.html":[9,0,110,380],
"cpp/io/manip/setprecision.html":[9,0,110,382], "cpp/io/manip/setprecision.html":[9,0,110,382],
"cpp/io/manip/setw.html":[9,0,110,384], "cpp/io/manip/setw.html":[9,0,110,384],
"cpp/io/manip/showbase.html":[9,0,110,301],
"cpp/io/manip/showbase.html":[9,0,110,385], "cpp/io/manip/showbase.html":[9,0,110,385],
"cpp/io/manip/showbase.html":[9,0,110,301],
"cpp/io/manip/showpoint.html":[9,0,110,302], "cpp/io/manip/showpoint.html":[9,0,110,302],
"cpp/io/manip/showpoint.html":[9,0,110,386], "cpp/io/manip/showpoint.html":[9,0,110,386],
"cpp/io/manip/showpos.html":[9,0,110,303],
"cpp/io/manip/showpos.html":[9,0,110,387], "cpp/io/manip/showpos.html":[9,0,110,387],
"cpp/io/manip/skipws.html":[9,0,110,304], "cpp/io/manip/showpos.html":[9,0,110,303],
"cpp/io/manip/skipws.html":[9,0,110,393], "cpp/io/manip/skipws.html":[9,0,110,393],
"cpp/io/manip/skipws.html":[9,0,110,304],
"cpp/io/manip/unitbuf.html":[9,0,110,308], "cpp/io/manip/unitbuf.html":[9,0,110,308],
"cpp/io/manip/unitbuf.html":[9,0,110,477], "cpp/io/manip/unitbuf.html":[9,0,110,477],
"cpp/io/manip/uppercase.html":[9,0,110,309], "cpp/io/manip/uppercase.html":[9,0,110,309],

24
navtreeindex1.js
View File

@@ -46,9 +46,9 @@ var NAVTREEINDEX1 =
"cpp/numeric/fenv/feround.html":[9,0,110,117], "cpp/numeric/fenv/feround.html":[9,0,110,117],
"cpp/numeric/fenv/fetestexcept.html":[9,0,110,125], "cpp/numeric/fenv/fetestexcept.html":[9,0,110,125],
"cpp/numeric/fenv/feupdateenv.html":[9,0,110,126], "cpp/numeric/fenv/feupdateenv.html":[9,0,110,126],
"cpp/numeric/math/abs.html":[9,0,110,14],
"cpp/numeric/math/abs.html":[9,0,110,242], "cpp/numeric/math/abs.html":[9,0,110,242],
"cpp/numeric/math/abs.html":[9,0,110,236], "cpp/numeric/math/abs.html":[9,0,110,236],
"cpp/numeric/math/abs.html":[9,0,110,14],
"cpp/numeric/math/acos.html":[9,0,110,16], "cpp/numeric/math/acos.html":[9,0,110,16],
"cpp/numeric/math/acosh.html":[9,0,110,17], "cpp/numeric/math/acosh.html":[9,0,110,17],
"cpp/numeric/math/asin.html":[9,0,110,27], "cpp/numeric/math/asin.html":[9,0,110,27],
@@ -61,15 +61,15 @@ var NAVTREEINDEX1 =
"cpp/numeric/math/copysign.html":[9,0,110,83], "cpp/numeric/math/copysign.html":[9,0,110,83],
"cpp/numeric/math/cos.html":[9,0,110,84], "cpp/numeric/math/cos.html":[9,0,110,84],
"cpp/numeric/math/cosh.html":[9,0,110,85], "cpp/numeric/math/cosh.html":[9,0,110,85],
"cpp/numeric/math/div.html":[9,0,110,238],
"cpp/numeric/math/div.html":[9,0,110,98], "cpp/numeric/math/div.html":[9,0,110,98],
"cpp/numeric/math/div.html":[9,0,110,238],
"cpp/numeric/math/erf.html":[9,0,110,105], "cpp/numeric/math/erf.html":[9,0,110,105],
"cpp/numeric/math/erfc.html":[9,0,110,106], "cpp/numeric/math/erfc.html":[9,0,110,106],
"cpp/numeric/math/exp.html":[9,0,110,108], "cpp/numeric/math/exp.html":[9,0,110,108],
"cpp/numeric/math/exp2.html":[9,0,110,109], "cpp/numeric/math/exp2.html":[9,0,110,109],
"cpp/numeric/math/expm1.html":[9,0,110,110], "cpp/numeric/math/expm1.html":[9,0,110,110],
"cpp/numeric/math/fabs.html":[9,0,110,13],
"cpp/numeric/math/fabs.html":[9,0,110,111], "cpp/numeric/math/fabs.html":[9,0,110,111],
"cpp/numeric/math/fabs.html":[9,0,110,13],
"cpp/numeric/math/fdim.html":[9,0,110,113], "cpp/numeric/math/fdim.html":[9,0,110,113],
"cpp/numeric/math/floor.html":[9,0,110,141], "cpp/numeric/math/floor.html":[9,0,110,141],
"cpp/numeric/math/fma.html":[9,0,110,143], "cpp/numeric/math/fma.html":[9,0,110,143],
@@ -91,21 +91,21 @@ var NAVTREEINDEX1 =
"cpp/numeric/math/log1p.html":[9,0,110,250], "cpp/numeric/math/log1p.html":[9,0,110,250],
"cpp/numeric/math/logb.html":[9,0,110,251], "cpp/numeric/math/logb.html":[9,0,110,251],
"cpp/numeric/math/modf.html":[9,0,110,287], "cpp/numeric/math/modf.html":[9,0,110,287],
"cpp/numeric/math/nan.html":[9,0,110,292],
"cpp/numeric/math/nan.html":[9,0,110,293],
"cpp/numeric/math/nan.html":[9,0,110,291], "cpp/numeric/math/nan.html":[9,0,110,291],
"cpp/numeric/math/nan.html":[9,0,110,293],
"cpp/numeric/math/nan.html":[9,0,110,292],
"cpp/numeric/math/nearbyint.html":[9,0,110,294], "cpp/numeric/math/nearbyint.html":[9,0,110,294],
"cpp/numeric/math/nextafter.html":[9,0,110,298], "cpp/numeric/math/nextafter.html":[9,0,110,298],
"cpp/numeric/math/nextafter.html":[9,0,110,297], "cpp/numeric/math/nextafter.html":[9,0,110,297],
"cpp/numeric/math/pow.html":[9,0,110,320], "cpp/numeric/math/pow.html":[9,0,110,320],
"cpp/numeric/math/remainder.html":[9,0,110,341], "cpp/numeric/math/remainder.html":[9,0,110,341],
"cpp/numeric/math/remquo.html":[9,0,110,346], "cpp/numeric/math/remquo.html":[9,0,110,346],
"cpp/numeric/math/rint.html":[9,0,110,254],
"cpp/numeric/math/rint.html":[9,0,110,360], "cpp/numeric/math/rint.html":[9,0,110,360],
"cpp/numeric/math/rint.html":[9,0,110,243], "cpp/numeric/math/rint.html":[9,0,110,243],
"cpp/numeric/math/rint.html":[9,0,110,254], "cpp/numeric/math/round.html":[9,0,110,363],
"cpp/numeric/math/round.html":[9,0,110,244], "cpp/numeric/math/round.html":[9,0,110,244],
"cpp/numeric/math/round.html":[9,0,110,255], "cpp/numeric/math/round.html":[9,0,110,255],
"cpp/numeric/math/round.html":[9,0,110,363],
"cpp/numeric/math/scalbn.html":[9,0,110,364], "cpp/numeric/math/scalbn.html":[9,0,110,364],
"cpp/numeric/math/scalbn.html":[9,0,110,365], "cpp/numeric/math/scalbn.html":[9,0,110,365],
"cpp/numeric/math/signbit.html":[9,0,110,390], "cpp/numeric/math/signbit.html":[9,0,110,390],
@@ -123,9 +123,9 @@ var NAVTREEINDEX1 =
"cpp/regex/regex_replace.html":[9,0,110,339], "cpp/regex/regex_replace.html":[9,0,110,339],
"cpp/regex/regex_search.html":[9,0,110,340], "cpp/regex/regex_search.html":[9,0,110,340],
"cpp/string/basic_string/getline.html":[9,0,110,184], "cpp/string/basic_string/getline.html":[9,0,110,184],
"cpp/string/basic_string/stof.html":[9,0,110,405],
"cpp/string/basic_string/stof.html":[9,0,110,408], "cpp/string/basic_string/stof.html":[9,0,110,408],
"cpp/string/basic_string/stof.html":[9,0,110,404], "cpp/string/basic_string/stof.html":[9,0,110,404],
"cpp/string/basic_string/stof.html":[9,0,110,405],
"cpp/string/basic_string/stol.html":[9,0,110,406], "cpp/string/basic_string/stol.html":[9,0,110,406],
"cpp/string/basic_string/stol.html":[9,0,110,409], "cpp/string/basic_string/stol.html":[9,0,110,409],
"cpp/string/basic_string/stol.html":[9,0,110,407], "cpp/string/basic_string/stol.html":[9,0,110,407],
@@ -175,8 +175,8 @@ var NAVTREEINDEX1 =
"cpp/string/byte/strtoimax.html":[9,0,110,437], "cpp/string/byte/strtoimax.html":[9,0,110,437],
"cpp/string/byte/strtoimax.html":[9,0,110,430], "cpp/string/byte/strtoimax.html":[9,0,110,430],
"cpp/string/byte/strtok.html":[9,0,110,431], "cpp/string/byte/strtok.html":[9,0,110,431],
"cpp/string/byte/strtol.html":[9,0,110,434],
"cpp/string/byte/strtol.html":[9,0,110,432], "cpp/string/byte/strtol.html":[9,0,110,432],
"cpp/string/byte/strtol.html":[9,0,110,434],
"cpp/string/byte/strtoul.html":[9,0,110,436], "cpp/string/byte/strtoul.html":[9,0,110,436],
"cpp/string/byte/strtoul.html":[9,0,110,435], "cpp/string/byte/strtoul.html":[9,0,110,435],
"cpp/string/byte/strxfrm.html":[9,0,110,438], "cpp/string/byte/strxfrm.html":[9,0,110,438],
@@ -228,16 +228,16 @@ var NAVTREEINDEX1 =
"cpp/string/wide/wcsrchr.html":[9,0,110,507], "cpp/string/wide/wcsrchr.html":[9,0,110,507],
"cpp/string/wide/wcsspn.html":[9,0,110,508], "cpp/string/wide/wcsspn.html":[9,0,110,508],
"cpp/string/wide/wcsstr.html":[9,0,110,509], "cpp/string/wide/wcsstr.html":[9,0,110,509],
"cpp/string/wide/wcstof.html":[9,0,110,510],
"cpp/string/wide/wcstof.html":[9,0,110,511], "cpp/string/wide/wcstof.html":[9,0,110,511],
"cpp/string/wide/wcstof.html":[9,0,110,515], "cpp/string/wide/wcstof.html":[9,0,110,515],
"cpp/string/wide/wcstof.html":[9,0,110,510],
"cpp/string/wide/wcstoimax.html":[9,0,110,512],
"cpp/string/wide/wcstoimax.html":[9,0,110,520], "cpp/string/wide/wcstoimax.html":[9,0,110,520],
"cpp/string/wide/wcstoimax.html":[9,0,110,512],
"cpp/string/wide/wcstok.html":[9,0,110,513], "cpp/string/wide/wcstok.html":[9,0,110,513],
"cpp/string/wide/wcstol.html":[9,0,110,514], "cpp/string/wide/wcstol.html":[9,0,110,514],
"cpp/string/wide/wcstol.html":[9,0,110,516], "cpp/string/wide/wcstol.html":[9,0,110,516],
"cpp/string/wide/wcstoul.html":[9,0,110,519],
"cpp/string/wide/wcstoul.html":[9,0,110,518], "cpp/string/wide/wcstoul.html":[9,0,110,518],
"cpp/string/wide/wcstoul.html":[9,0,110,519],
"cpp/string/wide/wcsxfrm.html":[9,0,110,521], "cpp/string/wide/wcsxfrm.html":[9,0,110,521],
"cpp/string/wide/wctrans.html":[9,0,110,524], "cpp/string/wide/wctrans.html":[9,0,110,524],
"cpp/string/wide/wctype.html":[9,0,110,525], "cpp/string/wide/wctype.html":[9,0,110,525],

4
navtreeindex10.js
View File

@@ -39,12 +39,12 @@ var NAVTREEINDEX10 =
"db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1":[11,0,6,0,1], "db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1":[11,0,6,0,1],
"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2], "db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2],
"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0], "db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0],
"db/d19/structlinear__probing_1_1_entry.html":[10,0,8,0],
"db/d19/structlinear__probing_1_1_entry.html":[9,0,55,0], "db/d19/structlinear__probing_1_1_entry.html":[9,0,55,0],
"db/d19/structlinear__probing_1_1_entry.html":[10,0,8,0],
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,8,0,0], "db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,8,0,0],
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,55,0,0], "db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,55,0,0],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,8,0,1],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,55,0,1], "db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,55,0,1],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,8,0,1],
"db/d27/n__bonacci_8cpp.html":[11,0,14,38], "db/d27/n__bonacci_8cpp.html":[11,0,14,38],
"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,38,1], "db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,38,1],
"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,38,2], "db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,38,2],

68
navtreeindex11.js
View File

@@ -34,18 +34,18 @@ var NAVTREEINDEX11 =
"dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,7,2], "dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,7,2],
"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[11,0,0,7,1], "dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[11,0,0,7,1],
"dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,0], "dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,0],
"dc/d61/classgraph_1_1_graph.html":[10,0,6,1],
"dc/d61/classgraph_1_1_graph.html":[9,0,34,0], "dc/d61/classgraph_1_1_graph.html":[9,0,34,0],
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,6,1,2], "dc/d61/classgraph_1_1_graph.html":[10,0,6,1],
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,34,0,2], "dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,34,0,2],
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,34,0,5], "dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,6,1,2],
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,1,5], "dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,1,5],
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,34,0,1], "dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,34,0,5],
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,6,1,1], "dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,6,1,1],
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,34,0,1],
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,34,0,0], "dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,34,0,0],
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,6,1,0], "dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,6,1,0],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,6,1,3],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,34,0,3], "dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,34,0,3],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,6,1,3],
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,6,1,4], "dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,6,1,4],
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,34,0,4], "dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,34,0,4],
"dc/d64/md__coding_guidelines.html":[2], "dc/d64/md__coding_guidelines.html":[2],
@@ -55,8 +55,8 @@ var NAVTREEINDEX11 =
"dc/d6d/power__of__2_8cpp.html#a5032470c9974bbd6ec254bf296530a5f":[11,0,1,6,0], "dc/d6d/power__of__2_8cpp.html#a5032470c9974bbd6ec254bf296530a5f":[11,0,1,6,0],
"dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,6,2], "dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,6,2],
"dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,6,1], "dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,6,1],
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[10,0,18,1],
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,110,6], "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,110,6],
"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[10,0,18,1],
"dc/d82/area_8cpp.html":[11,0,14,2], "dc/d82/area_8cpp.html":[11,0,14,2],
"dc/d82/area_8cpp.html#a40e36c67da78d2131408c57ee091ad75":[11,0,14,2,0], "dc/d82/area_8cpp.html#a40e36c67da78d2131408c57ee091ad75":[11,0,14,2,0],
"dc/d82/area_8cpp.html#a5de184925e68658f15415dd53954df4f":[11,0,14,2,4], "dc/d82/area_8cpp.html#a5de184925e68658f15415dd53954df4f":[11,0,14,2,4],
@@ -96,14 +96,14 @@ var NAVTREEINDEX11 =
"dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095":[11,0,17,12,3], "dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095":[11,0,17,12,3],
"dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21":[11,0,17,12,1], "dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21":[11,0,17,12,1],
"dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f":[11,0,17,12,5], "dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f":[11,0,17,12,5],
"dc/dd4/classdata__structures_1_1_bloom_filter.html":[10,0,2,8],
"dc/dd4/classdata__structures_1_1_bloom_filter.html":[9,0,20,1], "dc/dd4/classdata__structures_1_1_bloom_filter.html":[9,0,20,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html":[10,0,2,8],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[10,0,2,8,2], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[10,0,2,8,2],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,20,1,2], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,20,1,2],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,20,1,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,8,3], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,8,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,20,1,1], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,20,1,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,8,1], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,8,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,20,1,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,8,0], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,8,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,1,0], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,1,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,1,4], "dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,1,4],
@@ -164,10 +164,10 @@ var NAVTREEINDEX11 =
"dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,0,1], "dd/d1e/generate__parentheses_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,0,1],
"dd/d1f/classdsu.html":[10,0,28], "dd/d1f/classdsu.html":[10,0,28],
"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[10,0,28,4], "dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[10,0,28,4],
"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,28,1],
"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,28,0], "dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,28,0],
"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,28,2], "dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,28,1],
"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,28,3], "dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,28,3],
"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,28,2],
"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[10,0,28,10], "dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[10,0,28,10],
"dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[10,0,28,15], "dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[10,0,28,15],
"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[10,0,28,16], "dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[10,0,28,16],
@@ -227,27 +227,27 @@ var NAVTREEINDEX11 =
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,2,5,0,16], "dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,2,5,0,16],
"dd/d43/namespace_m_d5.html":[9,0,64], "dd/d43/namespace_m_d5.html":[9,0,64],
"dd/d47/namespacemath.html":[9,0,63], "dd/d47/namespacemath.html":[9,0,63],
"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,63,17], "dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,63,18],
"dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[9,0,63,22], "dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[9,0,63,23],
"dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73":[9,0,63,11], "dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73":[9,0,63,12],
"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,63,40], "dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,63,42],
"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,63,34], "dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,63,35],
"dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[9,0,63,39], "dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[9,0,63,41],
"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,63,31], "dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,63,32],
"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,63,6], "dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,63,7],
"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,63,4], "dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,63,5],
"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[9,0,63,30], "dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[9,0,63,31],
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,63,37], "dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,63,39],
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,63,21], "dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,63,22],
"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,63,14], "dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,63,15],
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,63,19], "dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,63,20],
"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,63,8], "dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,63,9],
"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,63,25], "dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,63,26],
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,63,18], "dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,63,19],
"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,63,32], "dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[9,0,63,3],
"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,63,36], "dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,63,33],
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,63,27], "dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,63,37],
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,63,35], "dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,63,28],
"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,63,20], "dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,63,36],
"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,63,28] "dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,63,21]
}; };

48
navtreeindex12.js
View File

@@ -1,22 +1,24 @@
var NAVTREEINDEX12 = var NAVTREEINDEX12 =
{ {
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,63,29], "dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,63,29],
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,63,30],
"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,63,1], "dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,63,1],
"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,63,38], "dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,63,40],
"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,63,33], "dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,63,34],
"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,63,7], "dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,63,8],
"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,63,15], "dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,63,16],
"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,63,12], "dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,63,13],
"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[9,0,63,2], "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[9,0,63,2],
"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[9,0,63,23], "dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[9,0,63,24],
"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,63,10], "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,63,11],
"dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[9,0,63,26], "dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[9,0,63,27],
"dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953":[9,0,63,5], "dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953":[9,0,63,6],
"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,63,3], "dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,63,4],
"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,63,9], "dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,63,10],
"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,63,13], "dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,63,14],
"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,63,16], "dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[9,0,63,38],
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,63,24], "dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,63,17],
"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,63,25],
"dd/d4f/class_solution.html":[10,0,51], "dd/d4f/class_solution.html":[10,0,51],
"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[10,0,19,0,0], "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[10,0,19,0,0],
"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[10,0,19,0,0,1], "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[10,0,19,0,0,1],
@@ -48,24 +50,24 @@ var NAVTREEINDEX12 =
"dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214":[11,0,7,0,2], "dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214":[11,0,7,0,2],
"dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b":[11,0,7,0,7], "dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b":[11,0,7,0,7],
"dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,4], "dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,4],
"dd/d95/classdata__structures_1_1_segment_tree.html":[9,0,20,3],
"dd/d95/classdata__structures_1_1_segment_tree.html":[10,0,2,10], "dd/d95/classdata__structures_1_1_segment_tree.html":[10,0,2,10],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[9,0,20,3,6], "dd/d95/classdata__structures_1_1_segment_tree.html":[9,0,20,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,10,6], "dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,10,6],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[9,0,20,3,6],
"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,20,3,7], "dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,20,3,7],
"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[10,0,2,10,7], "dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[10,0,2,10,7],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[9,0,20,3,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,10,3], "dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,10,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[9,0,20,3,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,20,3,4], "dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,20,3,4],
"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[10,0,2,10,4], "dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[10,0,2,10,4],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[9,0,20,3,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,10,1], "dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,10,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[9,0,20,3,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[10,0,2,10,8], "dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[10,0,2,10,8],
"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[9,0,20,3,8], "dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[9,0,20,3,8],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[9,0,20,3,0],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[10,0,2,10,0], "dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[10,0,2,10,0],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,10,2], "dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[9,0,20,3,0],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,20,3,2], "dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,20,3,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,10,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,10,5], "dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,10,5],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,20,3,5], "dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,20,3,5],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,9,0,1], "dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,9,0,1],
@@ -247,7 +249,5 @@ var NAVTREEINDEX12 =
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,11,2,0,5], "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,11,2,0,5],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,11,2,0,8], "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,11,2,0,8],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,11,2,0,1], "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,11,2,0,1],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,11,2,0,0], "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,11,2,0,0]
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,11,2,0,4],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,11,2,0,7]
}; };

10
navtreeindex13.js
View File

@@ -1,5 +1,7 @@
var NAVTREEINDEX13 = var NAVTREEINDEX13 =
{ {
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,11,2,0,4],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,11,2,0,7],
"de/dd1/segment__tree_8cpp.html":[11,0,4,17], "de/dd1/segment__tree_8cpp.html":[11,0,4,17],
"de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,17,2], "de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,17,2],
"de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,17,1], "de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,17,1],
@@ -102,8 +104,8 @@ var NAVTREEINDEX13 =
"df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,8,2], "df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,8,2],
"df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,8,0], "df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,8,0],
"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[11,0,0,8,1], "df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[11,0,0,8,1],
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[10,0,18,5],
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,110,10], "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,110,10],
"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[10,0,18,5],
"df/dc8/successive__approximation_8cpp.html":[11,0,15,22], "df/dc8/successive__approximation_8cpp.html":[11,0,15,22],
"df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,22,0], "df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,22,0],
"df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,22,2], "df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,22,2],
@@ -230,8 +232,8 @@ var NAVTREEINDEX13 =
"functions_x.html":[10,3,0,23], "functions_x.html":[10,3,0,23],
"functions_y.html":[10,3,0,24], "functions_y.html":[10,3,0,24],
"functions_~.html":[10,3,0,25], "functions_~.html":[10,3,0,25],
"globals.html":[11,1,0,0],
"globals.html":[11,1,0], "globals.html":[11,1,0],
"globals.html":[11,1,0,0],
"globals_a.html":[11,1,0,1], "globals_a.html":[11,1,0,1],
"globals_b.html":[11,1,0,2], "globals_b.html":[11,1,0,2],
"globals_c.html":[11,1,0,3], "globals_c.html":[11,1,0,3],
@@ -247,7 +249,5 @@ var NAVTREEINDEX13 =
"globals_func_d.html":[11,1,1,4], "globals_func_d.html":[11,1,1,4],
"globals_func_e.html":[11,1,1,5], "globals_func_e.html":[11,1,1,5],
"globals_func_f.html":[11,1,1,6], "globals_func_f.html":[11,1,1,6],
"globals_func_g.html":[11,1,1,7], "globals_func_g.html":[11,1,1,7]
"globals_func_h.html":[11,1,1,8],
"globals_func_i.html":[11,1,1,9]
}; };

2
navtreeindex14.js
View File

@@ -1,5 +1,7 @@
var NAVTREEINDEX14 = var NAVTREEINDEX14 =
{ {
"globals_func_h.html":[11,1,1,8],
"globals_func_i.html":[11,1,1,9],
"globals_func_j.html":[11,1,1,10], "globals_func_j.html":[11,1,1,10],
"globals_func_l.html":[11,1,1,11], "globals_func_l.html":[11,1,1,11],
"globals_func_m.html":[11,1,1,12], "globals_func_m.html":[11,1,1,12],

14
navtreeindex2.js
View File

@@ -12,8 +12,8 @@ var NAVTREEINDEX2 =
"cpp/utility/functional/mem_fn.html":[9,0,110,274], "cpp/utility/functional/mem_fn.html":[9,0,110,274],
"cpp/utility/functional/not1.html":[9,0,110,305], "cpp/utility/functional/not1.html":[9,0,110,305],
"cpp/utility/functional/not2.html":[9,0,110,306], "cpp/utility/functional/not2.html":[9,0,110,306],
"cpp/utility/functional/ref.html":[9,0,110,337],
"cpp/utility/functional/ref.html":[9,0,110,88], "cpp/utility/functional/ref.html":[9,0,110,88],
"cpp/utility/functional/ref.html":[9,0,110,337],
"cpp/utility/move.html":[9,0,110,288], "cpp/utility/move.html":[9,0,110,288],
"cpp/utility/move_if_noexcept.html":[9,0,110,290], "cpp/utility/move_if_noexcept.html":[9,0,110,290],
"cpp/utility/pair/make_pair.html":[9,0,110,259], "cpp/utility/pair/make_pair.html":[9,0,110,259],
@@ -29,9 +29,9 @@ var NAVTREEINDEX2 =
"cpp/utility/program/signal.html":[9,0,110,389], "cpp/utility/program/signal.html":[9,0,110,389],
"cpp/utility/program/system.html":[9,0,110,443], "cpp/utility/program/system.html":[9,0,110,443],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,2], "cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,2],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,1],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,3], "cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,3],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,0], "cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,0],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,1],
"cpp/utility/tuple/forward_as_tuple.html":[9,0,110,150], "cpp/utility/tuple/forward_as_tuple.html":[9,0,110,150],
"cpp/utility/tuple/make_tuple.html":[9,0,110,261], "cpp/utility/tuple/make_tuple.html":[9,0,110,261],
"cpp/utility/tuple/tie.html":[9,0,110,450], "cpp/utility/tuple/tie.html":[9,0,110,450],
@@ -53,22 +53,22 @@ var NAVTREEINDEX2 =
"d0/d2e/namespaceneural__network.html":[9,0,78], "d0/d2e/namespaceneural__network.html":[9,0,78],
"d0/d3e/classdata__structures_1_1trie.html":[9,0,20,5], "d0/d3e/classdata__structures_1_1trie.html":[9,0,20,5],
"d0/d3e/classdata__structures_1_1trie.html":[10,0,2,12], "d0/d3e/classdata__structures_1_1trie.html":[10,0,2,12],
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,2,12,3],
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,20,5,3], "d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,20,5,3],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,20,5,6], "d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,2,12,3],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,12,6], "d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,12,6],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,20,5,6],
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,12,5], "d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,12,5],
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,20,5,5], "d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,20,5,5],
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,20,5,8],
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,2,12,8], "d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,2,12,8],
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,20,5,8],
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,20,5,7], "d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,20,5,7],
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,2,12,7], "d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,2,12,7],
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,2,12,0], "d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,2,12,0],
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,20,5,0], "d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,20,5,0],
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,20,5,4],
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,12,4], "d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,12,4],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,20,5,1], "d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,20,5,4],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,12,1], "d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,12,1],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,20,5,1],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,20,5,2], "d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,20,5,2],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,2,12,2], "d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,2,12,2],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,20], "d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,20],

4
navtreeindex3.js
View File

@@ -201,8 +201,8 @@ var NAVTREEINDEX3 =
"d2/da7/namespacefind__non__repeating__integer.html":[9,0,30], "d2/da7/namespacefind__non__repeating__integer.html":[9,0,30],
"d2/dc4/classstack__linked_list.html":[10,0,53], "d2/dc4/classstack__linked_list.html":[10,0,53],
"d2/dcf/namespacestatistics.html":[9,0,109], "d2/dcf/namespacestatistics.html":[9,0,109],
"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[9,0,110,7],
"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[10,0,18,2], "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[10,0,18,2],
"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[9,0,110,7],
"d2/de1/namespacehouse__robber.html":[9,0,42], "d2/de1/namespacehouse__robber.html":[9,0,42],
"d2/de7/namespacerunge__kutta.html":[9,0,97], "d2/de7/namespacerunge__kutta.html":[9,0,97],
"d2/de9/heavy__light__decomposition_8cpp.html":[11,0,20,1], "d2/de9/heavy__light__decomposition_8cpp.html":[11,0,20,1],
@@ -210,8 +210,8 @@ var NAVTREEINDEX3 =
"d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,20,1,5], "d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,20,1,5],
"d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,1,3], "d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,1,3],
"d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,20,1,6], "d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,20,1,6],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[10,0,18,0],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,110,5], "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,110,5],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[10,0,18,0],
"d3/d05/sudoku__solver_8cpp.html":[11,0,0,10], "d3/d05/sudoku__solver_8cpp.html":[11,0,0,10],
"d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0":[11,0,0,10,0], "d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0":[11,0,0,10,0],
"d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac":[11,0,0,10,2], "d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac":[11,0,0,10,2],

6
navtreeindex4.js
View File

@@ -242,12 +242,12 @@ var NAVTREEINDEX4 =
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,8,1], "d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,8,1],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1":[11,0,1,8,2], "d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1":[11,0,1,8,2],
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,8,0], "d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,8,0],
"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,20,4],
"d4/d90/classdata__structures_1_1_skip_list.html":[10,0,2,11], "d4/d90/classdata__structures_1_1_skip_list.html":[10,0,2,11],
"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,20,4],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,11,7], "d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,11,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,20,4,7], "d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,20,4,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,11,3], "d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,11,3],
"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[9,0,20,4,3], "d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[9,0,20,4,3],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,11,0], "d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,20,4,0],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,20,4,0] "d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,11,0]
}; };

22
navtreeindex5.js
View File

@@ -1,15 +1,15 @@
var NAVTREEINDEX5 = var NAVTREEINDEX5 =
{ {
"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[9,0,20,4,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,11,2], "d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,11,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[10,0,2,11,1], "d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[9,0,20,4,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[9,0,20,4,1], "d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[9,0,20,4,1],
"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[9,0,20,4,4], "d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[10,0,2,11,1],
"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,11,4], "d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,11,4],
"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[9,0,20,4,6], "d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[9,0,20,4,4],
"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[10,0,2,11,6], "d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[10,0,2,11,6],
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[10,0,2,11,5], "d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[9,0,20,4,6],
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,20,4,5], "d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,20,4,5],
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[10,0,2,11,5],
"d4/d91/namespacevector__cross.html":[9,0,126], "d4/d91/namespacevector__cross.html":[9,0,126],
"d4/d96/range__queries_2sparse__table_8cpp.html":[11,0,20,5], "d4/d96/range__queries_2sparse__table_8cpp.html":[11,0,20,5],
"d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300":[11,0,20,5,1], "d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300":[11,0,20,5,1],
@@ -131,21 +131,21 @@ var NAVTREEINDEX5 =
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,9], "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,9],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,10], "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,10],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,11], "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,11],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,6],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,8], "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,8],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,7], "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,7],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,13], "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,6],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,12],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,14], "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,14],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,5], "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,12],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,4], "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,13],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,3], "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,3],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,4],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,5],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[11,0,20,2], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[11,0,20,2],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,2,3], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,2,3],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,2,2], "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,2,2],
"d5/d5f/namespacegeometry.html":[9,0,32], "d5/d5f/namespacegeometry.html":[9,0,32],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[10,0,15,1,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[9,0,94,0,0], "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[9,0,94,0,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[10,0,15,1,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[10,0,15,1,0,0], "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[10,0,15,1,0,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[9,0,94,0,0,0], "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[9,0,94,0,0,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,15,1,0,1], "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,15,1,0,1],

34
navtreeindex6.js
View File

@@ -13,10 +13,10 @@ var NAVTREEINDEX6 =
"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,20,0], "d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,20,0],
"d5/df4/merge__sort_8cpp.html":[8,3,0], "d5/df4/merge__sort_8cpp.html":[8,3,0],
"d5/df6/check__amicable__pair_8cpp.html":[11,0,14,5], "d5/df6/check__amicable__pair_8cpp.html":[11,0,14,5],
"d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576":[11,0,14,5,2], "d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,5,3],
"d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,5,3], "d5/df6/check__amicable__pair_8cpp.html#a8e6eede206201db0d1dbb618fa969bec":[11,0,14,5,0],
"d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,5,1], "d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,5,1],
"d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01":[11,0,14,5,0], "d5/df6/check__amicable__pair_8cpp.html#af05567415a9ea36c254b54e3d5a2152a":[11,0,14,5,2],
"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html":[10,0,2,2,0], "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html":[10,0,2,2,0],
"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622":[10,0,2,2,0,0], "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622":[10,0,2,2,0,0],
"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e":[10,0,2,2,0,4], "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e":[10,0,2,2,0,4],
@@ -37,32 +37,32 @@ var NAVTREEINDEX6 =
"d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0":[11,0,22,6,0], "d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0":[11,0,22,6,0],
"d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,6,2], "d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,6,2],
"d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,6,1], "d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,6,1],
"d6/d26/classciphers_1_1_hill_cipher.html":[10,0,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html":[9,0,12,1], "d6/d26/classciphers_1_1_hill_cipher.html":[9,0,12,1],
"d6/d26/classciphers_1_1_hill_cipher.html":[10,0,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,12,1,8], "d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,12,1,8],
"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[10,0,1,1,8], "d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[10,0,1,1,8],
"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[9,0,12,1,9], "d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[9,0,12,1,9],
"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[10,0,1,1,9], "d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[10,0,1,1,9],
"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[10,0,1,1,6], "d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[10,0,1,1,6],
"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[9,0,12,1,6], "d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[9,0,12,1,6],
"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[9,0,12,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[10,0,1,1,1], "d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[10,0,1,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[9,0,12,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12], "d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12],
"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[9,0,12,1,12], "d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[9,0,12,1,12],
"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[9,0,12,1,5],
"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[10,0,1,1,5], "d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[10,0,1,1,5],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[9,0,12,1,11], "d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[9,0,12,1,5],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11], "d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[9,0,12,1,11],
"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[10,0,1,1,3], "d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[10,0,1,1,3],
"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[9,0,12,1,3], "d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[9,0,12,1,3],
"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[9,0,12,1,2], "d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[9,0,12,1,2],
"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[10,0,1,1,2], "d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[10,0,1,1,2],
"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[9,0,12,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4], "d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[10,0,1,1,10], "d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[9,0,12,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[9,0,12,1,10], "d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[9,0,12,1,10],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[9,0,12,1,0], "d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[10,0,1,1,10],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0], "d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[9,0,12,1,0],
"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[9,0,12,1,7], "d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[9,0,12,1,7],
"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[10,0,1,1,7], "d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[10,0,1,1,7],
"d6/d26/house__robber_8cpp.html":[11,0,6,4], "d6/d26/house__robber_8cpp.html":[11,0,6,4],
@@ -82,24 +82,24 @@ var NAVTREEINDEX6 =
"d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,0,1], "d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,0,1],
"d6/d30/classmachine__learning_1_1adaline.html":[10,0,9,3], "d6/d30/classmachine__learning_1_1adaline.html":[10,0,9,3],
"d6/d30/classmachine__learning_1_1adaline.html":[9,0,60,0], "d6/d30/classmachine__learning_1_1adaline.html":[9,0,60,0],
"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[10,0,9,3,1],
"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,60,0,1], "d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,60,0,1],
"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,60,0,0], "d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[10,0,9,3,1],
"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,9,3,0], "d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,9,3,0],
"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,60,0,8], "d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,60,0,0],
"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,9,3,8], "d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,9,3,8],
"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,60,0,9], "d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,60,0,8],
"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[10,0,9,3,9], "d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[10,0,9,3,9],
"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,60,0,9],
"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,60,0,3], "d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,60,0,3],
"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[10,0,9,3,3], "d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[10,0,9,3,3],
"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,60,0,4],
"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,9,3,4], "d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,9,3,4],
"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,60,0,7], "d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,60,0,4],
"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[10,0,9,3,7], "d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[10,0,9,3,7],
"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,60,0,7],
"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,9,3,5], "d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,9,3,5],
"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,60,0,5], "d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,60,0,5],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[10,0,9,3,2],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,60,0,2], "d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,60,0,2],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[10,0,9,3,2],
"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[10,0,9,3,6], "d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[10,0,9,3,6],
"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,60,0,6], "d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,60,0,6],
"d6/d38/find__non__repeating__number_8cpp.html":[11,0,1,3], "d6/d38/find__non__repeating__number_8cpp.html":[11,0,1,3],

36
navtreeindex7.js
View File

@@ -76,14 +76,14 @@ var NAVTREEINDEX7 =
"d7/d7c/classstatistics_1_1stats__computer1.html":[9,0,109,0], "d7/d7c/classstatistics_1_1stats__computer1.html":[9,0,109,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[10,0,17,0,3], "d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[10,0,17,0,3],
"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,109,0,3], "d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,109,0,3],
"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[10,0,17,0,4],
"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,109,0,4], "d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,109,0,4],
"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[10,0,17,0,4],
"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,109,0,0], "d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,109,0,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[10,0,17,0,0], "d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[10,0,17,0,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,17,0,1], "d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,17,0,1],
"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,109,0,1], "d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,109,0,1],
"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,109,0,2],
"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[10,0,17,0,2], "d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[10,0,17,0,2],
"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,109,0,2],
"d7/d81/namespacebit__manipulation.html":[9,0,9], "d7/d81/namespacebit__manipulation.html":[9,0,9],
"d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e":[9,0,9,1], "d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e":[9,0,9,1],
"d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f":[9,0,9,0], "d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f":[9,0,9,0],
@@ -128,30 +128,30 @@ var NAVTREEINDEX7 =
"d8/d13/bubble__sort_8cpp.html":[11,0,22,2], "d8/d13/bubble__sort_8cpp.html":[11,0,22,2],
"d8/d14/namespacen__queens__optimized.html":[9,0,76], "d8/d14/namespacen__queens__optimized.html":[9,0,76],
"d8/d1d/namespacestrand.html":[9,0,111], "d8/d1d/namespacestrand.html":[9,0,111],
"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,94,0],
"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,15,1], "d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,15,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,94,0,4], "d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,94,0],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,15,1,4], "d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,15,1,4],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,15,1,7], "d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,94,0,4],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,94,0,7], "d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,94,0,7],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,94,0,10], "d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,15,1,7],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,15,1,10], "d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,15,1,10],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,94,0,10],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,94,0,8], "d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,94,0,8],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[10,0,15,1,8], "d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[10,0,15,1,8],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[10,0,15,1,2],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[9,0,94,0,2], "d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[9,0,94,0,2],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[10,0,15,1,11], "d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[10,0,15,1,2],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,94,0,11], "d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,94,0,11],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[10,0,15,1,1], "d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[10,0,15,1,11],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[9,0,94,0,1], "d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[9,0,94,0,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[10,0,15,1,3], "d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[10,0,15,1,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[9,0,94,0,3], "d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[9,0,94,0,3],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[9,0,94,0,6], "d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[10,0,15,1,3],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[10,0,15,1,6], "d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[10,0,15,1,6],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[9,0,94,0,6],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[10,0,15,1,5], "d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[10,0,15,1,5],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[9,0,94,0,5], "d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[9,0,94,0,5],
"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[10,0,15,1,9],
"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[9,0,94,0,9], "d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[9,0,94,0,9],
"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[10,0,15,1,9],
"d8/d2a/namespacea1z26.html":[9,0,0], "d8/d2a/namespacea1z26.html":[9,0,0],
"d8/d36/namespacecut__rod.html":[9,0,17], "d8/d36/namespacecut__rod.html":[9,0,17],
"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[11,0,14,36], "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[11,0,14,36],
@@ -168,28 +168,28 @@ var NAVTREEINDEX7 =
"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,2], "d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,34,1,1], "d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,34,1,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,2,1], "d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,2,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,2,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,34,1,6], "d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,34,1,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,34,1,2], "d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,2,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,2,2], "d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,2,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,34,1,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,34,1,8], "d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,34,1,8],
"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[10,0,6,2,8], "d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[10,0,6,2,8],
"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,34,1,7], "d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,34,1,7],
"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[10,0,6,2,7], "d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[10,0,6,2,7],
"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,34,1,9], "d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,34,1,9],
"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[10,0,6,2,9], "d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[10,0,6,2,9],
"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[10,0,6,2,3],
"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,34,1,3], "d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,34,1,3],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,34,1,10], "d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[10,0,6,2,3],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,2,10], "d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,2,10],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,34,1,10],
"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,34,1,11], "d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,34,1,11],
"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[10,0,6,2,11], "d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[10,0,6,2,11],
"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[10,0,6,2,5],
"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,34,1,5], "d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,34,1,5],
"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[10,0,6,2,5],
"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[10,0,6,2,4], "d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[10,0,6,2,4],
"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,34,1,4], "d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,34,1,4],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,34,1,0],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,2,0], "d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,2,0],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,34,1,0],
"d8/d6c/line__segment__intersection_8cpp.html":[11,0,8,2], "d8/d6c/line__segment__intersection_8cpp.html":[11,0,8,2],
"d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,2,2], "d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,2,2],
"d8/d72/class_r_btree.html":[10,0,49], "d8/d72/class_r_btree.html":[10,0,49],

14
navtreeindex8.js
View File

@@ -79,14 +79,14 @@ var NAVTREEINDEX8 =
"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,109,1], "d8/dab/classstatistics_1_1stats__computer2.html":[9,0,109,1],
"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,17,1,0], "d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,17,1,0],
"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,109,1,0], "d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,109,1,0],
"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,17,1,4],
"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,109,1,4], "d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,109,1,4],
"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[10,0,17,1,2], "d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,17,1,4],
"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,109,1,2], "d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,109,1,2],
"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[10,0,17,1,1], "d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[10,0,17,1,2],
"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,109,1,1], "d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,109,1,1],
"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,109,1,3], "d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[10,0,17,1,1],
"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[10,0,17,1,3], "d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[10,0,17,1,3],
"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,109,1,3],
"d8/db1/binomial__calculate_8cpp.html":[11,0,14,4], "d8/db1/binomial__calculate_8cpp.html":[11,0,14,4],
"d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,4,2], "d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,4,2],
"d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978":[11,0,14,4,0], "d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978":[11,0,14,4,0],
@@ -172,8 +172,8 @@ var NAVTREEINDEX8 =
"d9/d21/namespacewave__sort.html":[9,0,128], "d9/d21/namespacewave__sort.html":[9,0,128],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[10,0,6,3], "d9/d23/classgraph_1_1_lowest_common_ancestor.html":[10,0,6,3],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[9,0,34,2], "d9/d23/classgraph_1_1_lowest_common_ancestor.html":[9,0,34,2],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[10,0,6,3,2],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[9,0,34,2,2], "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[9,0,34,2,2],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[10,0,6,3,2],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[10,0,6,3,3], "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[10,0,6,3,3],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[9,0,34,2,3], "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[9,0,34,2,3],
"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[10,0,6,3,1], "d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[10,0,6,3,1],
@@ -223,10 +223,10 @@ var NAVTREEINDEX8 =
"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[10,0,2,9,0], "d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[10,0,2,9,0],
"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[9,0,20,2,3], "d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[9,0,20,2,3],
"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[10,0,2,9,3], "d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[10,0,2,9,3],
"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[10,0,2,9,2],
"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[9,0,20,2,2], "d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[9,0,20,2,2],
"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[10,0,2,9,1], "d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[10,0,2,9,2],
"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[9,0,20,2,1], "d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[9,0,20,2,1],
"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[10,0,2,9,1],
"d9/d55/namespacesparse__table.html":[9,0,106], "d9/d55/namespacesparse__table.html":[9,0,106],
"d9/d5a/structgeometry_1_1jarvis_1_1_point.html":[10,0,5,1,1], "d9/d5a/structgeometry_1_1jarvis_1_1_point.html":[10,0,5,1,1],
"d9/d5d/extended__euclid__algorithm_8cpp.html":[11,0,14,12], "d9/d5d/extended__euclid__algorithm_8cpp.html":[11,0,14,12],

14
navtreeindex9.js
View File

@@ -16,8 +16,8 @@ var NAVTREEINDEX9 =
"d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,5,6], "d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,5,6],
"d9/dae/classdata__structures_1_1_bitset.html":[10,0,2,7], "d9/dae/classdata__structures_1_1_bitset.html":[10,0,2,7],
"d9/dae/classdata__structures_1_1_bitset.html":[9,0,20,0], "d9/dae/classdata__structures_1_1_bitset.html":[9,0,20,0],
"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[9,0,20,0,0],
"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[10,0,2,7,0], "d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[10,0,2,7,0],
"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[9,0,20,0,0],
"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[10,0,2,7,1], "d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[10,0,2,7,1],
"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[9,0,20,0,1], "d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[9,0,20,0,1],
"d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[10,0,2,7,3], "d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[10,0,2,7,3],
@@ -52,12 +52,12 @@ var NAVTREEINDEX9 =
"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,20,7], "d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,20,7],
"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,20,13], "d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,20,13],
"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,20,6], "d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,20,6],
"d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0],
"d9/dde/structdouble__hashing_1_1_entry.html":[9,0,25,0], "d9/dde/structdouble__hashing_1_1_entry.html":[9,0,25,0],
"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0], "d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0],
"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,25,0,0], "d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,25,0,0],
"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,25,0,1], "d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0],
"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1], "d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1],
"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,25,0,1],
"d9/dee/classdouble__linked__list.html":[10,0,27], "d9/dee/classdouble__linked__list.html":[10,0,27],
"d9/def/namespacesublist__search.html":[9,0,116], "d9/def/namespacesublist__search.html":[9,0,116],
"d9/df0/fast__integer__input_8cpp.html":[11,0,17,4], "d9/df0/fast__integer__input_8cpp.html":[11,0,17,4],
@@ -237,12 +237,12 @@ var NAVTREEINDEX9 =
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[11,0,14,18,0], "da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[11,0,14,18,0],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,18,2], "da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,18,2],
"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,18,1], "da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,18,1],
"da/dd1/structquadratic__probing_1_1_entry.html":[10,0,14,0],
"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,89,0], "da/dd1/structquadratic__probing_1_1_entry.html":[9,0,89,0],
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,14,0,1], "da/dd1/structquadratic__probing_1_1_entry.html":[10,0,14,0],
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,89,0,1], "da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,89,0,1],
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,14,0,0], "da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,14,0,1],
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,89,0,0], "da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,89,0,0],
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,14,0,0],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0], "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1], "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,4], "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,4],

2
search/all_14.js
View File

@@ -304,7 +304,7 @@ var searchData=
['sum_5fof_5fbinomial_5fcoefficient_2ecpp_301',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]], ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_301',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]],
['sum_5fof_5fdigits_302',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], ['sum_5fof_5fdigits_302',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
['sum_5fof_5fdigits_2ecpp_303',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]], ['sum_5fof_5fdigits_2ecpp_303',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]],
['sum_5fof_5fdivisor_304',['sum_of_divisor',['../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576',1,'check_amicable_pair.cpp']]], ['sum_5fof_5fdivisor_304',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
['sum_5frange_305',['sum_range',['../dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9',1,'FenwickTree']]], ['sum_5frange_305',['sum_range',['../dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9',1,'FenwickTree']]],
['summary_306',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], ['summary_306',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]],
['sungetc_307',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], ['sungetc_307',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]],

8
search/all_15.js
View File

File diff suppressed because one or more lines are too long

2
search/all_2.js
View File

@@ -73,7 +73,7 @@ var searchData=
['approximate_5fpi_70',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]], ['approximate_5fpi_70',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
['approximate_5fpi_2ecpp_71',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]], ['approximate_5fpi_2ecpp_71',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]],
['are_5falmost_5fequal_72',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]], ['are_5falmost_5fequal_72',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
['are_5famicable_73',['are_amicable',['../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01',1,'check_amicable_pair.cpp']]], ['are_5famicable_73',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
['area_2ecpp_74',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]], ['area_2ecpp_74',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]],
['arg_75',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], ['arg_75',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
['argmax_76',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]], ['argmax_76',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],

2
search/functions_1.js
View File

@@ -46,7 +46,7 @@ var searchData=
['apply_5ffunction_43',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]], ['apply_5ffunction_43',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]],
['approximate_5fpi_44',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]], ['approximate_5fpi_44',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
['are_5falmost_5fequal_45',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]], ['are_5falmost_5fequal_45',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
['are_5famicable_46',['are_amicable',['../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01',1,'check_amicable_pair.cpp']]], ['are_5famicable_46',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
['arg_47',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]], ['arg_47',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
['argmax_48',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]], ['argmax_48',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],
['asctime_49',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], ['asctime_49',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]],

2
search/functions_13.js
View File

@@ -219,7 +219,7 @@ var searchData=
['suggestfreqautocomplete_216',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]], ['suggestfreqautocomplete_216',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]],
['sum_217',['sum',['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()'],['../dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699',1,'FenwickTree::sum()']]], ['sum_217',['sum',['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()'],['../dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699',1,'FenwickTree::sum()']]],
['sum_5fof_5fdigits_218',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]], ['sum_5fof_5fdigits_218',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
['sum_5fof_5fdivisor_219',['sum_of_divisor',['../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576',1,'check_amicable_pair.cpp']]], ['sum_5fof_5fdivisor_219',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
['sum_5frange_220',['sum_range',['../dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9',1,'FenwickTree']]], ['sum_5frange_220',['sum_range',['../dd/d91/class_fenwick_tree.html#a115ff5c548b429b737ea09f75817d1f9',1,'FenwickTree']]],
['summary_221',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]], ['summary_221',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]],
['sungetc_222',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], ['sungetc_222',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]],

12
search/functions_14.js
View File

File diff suppressed because one or more lines are too long