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

Documentation for dcf5fa4241

Browse Source
This commit is contained in:
github-actions
2020-07-25 03:02:10 +00:00
parent 705d498d06
commit 7589ff65e6
27 changed files with 218 additions and 206 deletions
Download Patch File Download Diff File Expand all files Collapse all files

157
d0/da2/number__of__positive__divisors_8cpp.html
View File

@@ -97,10 +97,10 @@ $(document).ready(function(){initNavTree('d0/da2/number__of__positive__divisors_
</div><!--header-->
<div class="contents">
<p>C++ Program to calculate number of divisors.
<p>C++ Program to calculate the number of positive divisors.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for number_of_positive_divisors.cpp:</div>
<div class="dyncontent">
@@ -112,26 +112,22 @@ Include dependency graph for number_of_positive_divisors.cpp:</div>
Functions</h2></td></tr>
<tr class="memitem:ad89ccced8504b5116046cfa03066ffeb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a> (int n)</td></tr>
<tr class="separator:ad89ccced8504b5116046cfa03066ffeb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
<tr class="separator:a88ec9ad42717780d6caaff9d3d6977f9"><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="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>C++ Program to calculate number of divisors. </p>
<p>This algorithm use the prime factorization approach. Any number can be written in multiplication of its prime factors. <br />
Let N = P1^E1 * P2^E2 ... Pk^Ek <br />
Therefore. number-of-divisors(N) = (E1+1) * (E2+1) ... (Ek+1). <br />
Where P1, P2 ... Pk are prime factors and E1, E2 ... Ek are exponents respectively.</p>
<p>Example:- <br />
N = 36 <br />
36 = (3^2 * 2^2) <br />
number_of_positive_divisors(36) = (2+1) * (2+1) = 9. <br />
<div class="textblock"><p>C++ Program to calculate the number of positive divisors. </p>
<p>This algorithm uses the prime factorization approach. Any positive integer can be written as a product of its prime factors. <br />
Let \(N = p_1^{e_1} \times p_2^{e_2} \times\cdots\times p_k^{e_k}\) where \(p_1,\, p_2,\, \dots,\, p_k\) are distinct prime factors of \(N\) and \(e_1,\, e_2,\, \dots,\, e_k\) are respective positive integer exponents. <br />
Each positive divisor of \(N\) is in the form \(p_1^{g_1}\times p_2^{g_2}\times\cdots\times p_k^{g_k}\) where \(0\le g_i\le e_i\) are integers for all \(1\le i\le k\). <br />
Finally, there are \((e_1+1) \times (e_2+1)\times\cdots\times (e_k+1)\) positive divisors of \(N\) since we can choose every \(g_i\) independently.</p>
<p>Example: <br />
\(N = 36 = (3^2 \cdot 2^2)\) <br />
\(\mbox{number_of_positive_divisors}(36) = (2+1) \cdot (2+1) = 9\). <br />
list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.</p>
<p>Similarly if N is -36 at that time number of positive divisors remain same.</p>
<p>Example:- <br />
N = -36 <br />
-36 = -1 * (3^2 * 2^2) <br />
number_of_positive_divisors(-36) = (2+1) * (2+1) = 9. <br />
list of positive divisors of -36 = 1, 2, 3, 4, 6, 9, 12, 18, 36. </p>
<p>Similarly, for N = -36 the number of positive divisors remain same. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
@@ -148,23 +144,22 @@ list of positive divisors of -36 = 1, 2, 3, 4, 6, 9, 12, 18, 36. </p>
</table>
</div><div class="memdoc">
<p>Main function </p>
<div class="fragment"><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordtype">int</span> n;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">if</span> (n &lt; 0) {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; n = -n;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; }</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordflow">if</span> (n == 0) {</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All non-zero numbers are divisors of 0 !&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; }</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;}</div>
<div class="fragment"><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordtype">int</span> n;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">if</span> (n == 0) {</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All non-zero numbers are divisors of 0 !&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; }</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160;}</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="../../d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="447" height="122"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="364" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -185,35 +180,75 @@ Here is the call graph for this function:</div>
</tr>
</table>
</div><div class="memdoc">
<p>Algorithm </p>
<div class="fragment"><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> prime_exponent_count;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i * i &lt;= n; i++) {</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; <span class="keywordtype">int</span> prime_count = 0;</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordflow">while</span> (n % i == 0) {</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; prime_count += 1;</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; n /= i;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; }</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordflow">if</span> (prime_count != 0) {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; prime_exponent_count.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(prime_count);</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; }</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; }</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">if</span> (n &gt; 1) {</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; prime_exponent_count.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1);</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; }</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; </div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordtype">int</span> divisors_count = 1;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prime_exponent_count.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; divisors_count = divisors_count * (prime_exponent_count[i] + 1);</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; }</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; </div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">return</span> divisors_count;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;}</div>
<p>Function to compute the number of positive divisors. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>number to compute divisors for </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>number of positive divisors of n (or 1 if n = 0) </dd></dl>
<div class="fragment"><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; {</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <span class="keywordflow">if</span> (n &lt; 0) {</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; n = -n; <span class="comment">// take the absolute value of n</span></div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; }</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordtype">int</span> number_of_divisors = 1;</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; </div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i * i &lt;= n; i++) {</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; <span class="comment">// This part is doing the prime factorization.</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="comment">// Note that we cannot find a composite divisor of n unless we would</span></div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; <span class="comment">// already previously find the corresponding prime divisor and dvided</span></div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="comment">// n by that prime. Therefore, all the divisors found here will</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="comment">// actually be primes.</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="comment">// The loop terminates early when it is left with a number n which</span></div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="comment">// does not have a divisor smaller or equal to sqrt(n) - that means</span></div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="comment">// the remaining number is a prime itself.</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordtype">int</span> prime_exponent = 0;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">while</span> (n % i == 0) {</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="comment">// Repeatedly divide n by the prime divisor n to compute</span></div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="comment">// the exponent (e_i in the algorithm description).</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; prime_exponent++;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; n /= i;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; number_of_divisors *= prime_exponent + 1;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">if</span> (n &gt; 1) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="comment">// In case the remaining number n is a prime number itself</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// (essentially p_k^1) the final answer is also multiplied by (e_k+1).</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; number_of_divisors *= 2;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; </div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">return</span> number_of_divisors;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a88ec9ad42717780d6caaff9d3d6977f9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">&#9670;&nbsp;</a></span>tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Test implementations </p>
<div class="fragment"><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; assert(<a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(36) == 9);</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; assert(<a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(-36) == 9);</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; assert(<a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(1) == 1);</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; assert(<a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(2011) == 2); <span class="comment">// 2011 is a prime</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; assert(<a class="code" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(756) == 24); <span class="comment">// 756 = 2^2 * 3^3 * 7</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;}</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="../../d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg" width="348" height="88"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="244" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -221,12 +256,10 @@ Here is the call graph for this function:</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; int &gt;</a></div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:70</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:34</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:33</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

3
d0/da2/number__of__positive__divisors_8cpp.js
View File

@@ -1,5 +1,6 @@
var number__of__positive__divisors_8cpp =
[
[ "main", "d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "number_of_positive_divisors", "d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb", null ]
[ "number_of_positive_divisors", "d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb", null ],
[ "tests", "d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9", null ]
];

4
d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="tests" name="tests">
<area shape="rect" id="node1" title=" " alt="" coords="5,13,56,39"/>
<area shape="rect" id="node2" href="$d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" title=" " alt="" coords="104,5,239,47"/>
</map>

1
d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
56d874b65b162559a915f068ac098d6b

38
d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg Normal file
View File

@@ -0,0 +1,38 @@
<?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 2.44.1 (20200629.0846)
-->
<!-- Title: tests Pages: 1 -->
<svg width="183pt" height="39pt"
viewBox="0.00 0.00 183.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>tests</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 179,-35 179,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-6 0,-25 38,-25 38,-6 0,-6"/>
<text text-anchor="middle" x="19" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-0.5 74,-30.5 175,-30.5 175,-0.5 74,-0.5"/>
<text text-anchor="start" x="82" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
<text text-anchor="middle" x="124.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.03,-15.5C45.34,-15.5 54.25,-15.5 63.52,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.66,-19 73.66,-15.5 63.66,-12 63.66,-19"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

5
d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map
View File

@@ -1,5 +0,0 @@
<map id="number_of_positive_divisors" name="number_of_positive_divisors">
<area shape="rect" id="node1" title=" " alt="" coords="5,23,140,65"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="188,5,343,32"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="207,56,323,83"/>
</map>

1
d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5
View File

@@ -1 +0,0 @@
895e63ea124357709a5054633cf32fea

53
d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg
View File

@@ -1,53 +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 2.44.1 (20200629.0846)
-->
<!-- Title: number_of_positive_divisors Pages: 1 -->
<svg width="261pt" height="66pt"
viewBox="0.00 0.00 261.00 66.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 62)">
<title>number_of_positive_divisors</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-62 257,-62 257,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-14 0,-44 101,-44 101,-14 0,-14"/>
<text text-anchor="start" x="8" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
<text text-anchor="middle" x="50.5" y="-21" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="137,-38.5 137,-57.5 253,-57.5 253,-38.5 137,-38.5"/>
<text text-anchor="middle" x="195" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M101.34,-35.65C109.53,-36.74 118.14,-37.89 126.67,-39.02"/>
<polygon fill="midnightblue" stroke="midnightblue" points="126.25,-42.5 136.62,-40.35 127.17,-35.56 126.25,-42.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="151.5,-0.5 151.5,-19.5 238.5,-19.5 238.5,-0.5 151.5,-0.5"/>
<text text-anchor="middle" x="195" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M101.34,-22.35C114.13,-20.65 127.94,-18.81 140.89,-17.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="141.61,-20.52 151.06,-15.73 140.68,-13.58 141.61,-20.52"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 2.5 KiB

9
d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,7 +1,6 @@
<map id="main" name="main">
<area shape="rect" id="node1" title=" " alt="" coords="5,35,56,61"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="135,5,207,32"/>
<area shape="rect" id="node3" href="$d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" title=" " alt="" coords="104,57,239,98"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="287,39,441,65"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="306,89,422,116"/>
<area shape="rect" id="node1" title=" " alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,176,32"/>
<area shape="rect" id="node3" href="$d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" title=" " alt="" coords="224,74,359,115"/>
<area shape="rect" id="node4" href="$d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="115,107,165,133"/>
</map>

2
d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
6e5ec65142944c6080e39cf70981f918
1ddf60f3953d9f51e8f82d6aa527fc28

61
d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: main Pages: 1 -->
<svg width="335pt" height="91pt"
viewBox="0.00 0.00 335.00 91.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 87)">
<svg width="273pt" height="104pt"
viewBox="0.00 0.00 273.00 104.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 100)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-87 331,-87 331,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 269,-100 269,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-41.5 0,-60.5 38,-60.5 38,-41.5 0,-41.5"/>
<text text-anchor="middle" x="19" y="-48.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 38,-57.5 38,-38.5 0,-38.5"/>
<text text-anchor="middle" x="19" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
@@ -22,62 +22,53 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="97.5,-63.5 97.5,-82.5 151.5,-82.5 151.5,-63.5 97.5,-63.5"/>
<text text-anchor="middle" x="124.5" y="-70.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 128,-95.5 128,-76.5 74,-76.5"/>
<text text-anchor="middle" x="101" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.03,-54.83C51.55,-57.71 70.52,-61.74 87.16,-65.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="86.63,-68.74 97.14,-67.4 88.09,-61.89 86.63,-68.74"/>
<path fill="none" stroke="midnightblue" d="M38.15,-56.62C47.78,-61.2 59.84,-66.93 70.75,-72.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="69.42,-75.35 79.95,-76.48 72.42,-69.03 69.42,-75.35"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-14 74,-44 175,-44 175,-14 74,-14"/>
<text text-anchor="start" x="82" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
<text text-anchor="middle" x="124.5" y="-21" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
<polygon fill="white" stroke="black" points="164,-14 164,-44 265,-44 265,-14 164,-14"/>
<text text-anchor="start" x="172" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
<text text-anchor="middle" x="214.5" y="-21" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M38.03,-47.17C45.42,-45.6 54.44,-43.68 63.82,-41.69"/>
<polygon fill="midnightblue" stroke="midnightblue" points="64.61,-45.1 73.66,-39.59 63.15,-38.25 64.61,-45.1"/>
<path fill="none" stroke="midnightblue" d="M38.2,-46.21C64.43,-43.64 114.05,-38.76 153.83,-34.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="154.36,-38.32 163.97,-33.86 153.67,-31.36 154.36,-38.32"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="211,-38.5 211,-57.5 327,-57.5 327,-38.5 211,-38.5"/>
<text text-anchor="middle" x="269" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_node4"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="82,-0.5 82,-19.5 120,-19.5 120,-0.5 82,-0.5"/>
<text text-anchor="middle" x="101" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M175.34,-35.65C183.53,-36.74 192.14,-37.89 200.67,-39.02"/>
<polygon fill="midnightblue" stroke="midnightblue" points="200.25,-42.5 210.62,-40.35 201.17,-35.56 200.25,-42.5"/>
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.15,-39.38C48.38,-34.52 61.36,-28.35 72.78,-22.93"/>
<polygon fill="midnightblue" stroke="midnightblue" points="74.39,-26.04 81.92,-18.59 71.38,-19.72 74.39,-26.04"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="225.5,-0.5 225.5,-19.5 312.5,-19.5 312.5,-0.5 225.5,-0.5"/>
<text text-anchor="middle" x="269" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M175.34,-22.35C188.13,-20.65 201.94,-18.81 214.89,-17.08"/>
<polygon fill="midnightblue" stroke="midnightblue" points="215.61,-20.52 225.06,-15.73 214.68,-13.58 215.61,-20.52"/>
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M120.41,-13.14C129.69,-14.72 141.52,-16.73 153.61,-18.8"/>
<polygon fill="midnightblue" stroke="midnightblue" points="153.34,-22.3 163.78,-20.53 154.51,-15.4 153.34,-22.3"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.9 KiB

After

Width:  |  Height:  |  Size: 3.5 KiB

5
d1/dbe/lu__decomposition_8h_source.html
View File

@@ -201,6 +201,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:91</div></div>
<div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:16</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:70</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:43</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:50</div></div>
<div class="ttc" id="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:16</div></div>
@@ -293,7 +294,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:77</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:45</div></div>
<div class="ttc" id="asum__of__digits_8cpp_html_a4619c78b6ad985713024f930f31c4395"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a></div><div class="ttdeci">int sum_of_digits(int num)</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:23</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:62</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:81</div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:183</div></div>
<div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtod</a></div><div class="ttdeci">T strtod(T... args)</div></div>
@@ -320,7 +321,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="astring__fibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:81</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:34</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:33</div></div>
<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:26</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the minima of a function in the given interval. To get the maxima, simply negate the function....</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:29</div></div>
<div class="ttc" id="astring__fibonacci_8cpp_html_ad8055ee368a5d5b24de01bdde6bf8fca"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a></div><div class="ttdeci">void fib_Accurate(uint64_t n)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:68</div></div>

6
d4/da4/number__of__positive__divisors_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="math/number_of_positive_divisors.cpp" name="math/number_of_positive_divisors.cpp">
<area shape="rect" id="node1" title="C++ Program to calculate number of divisors." alt="" coords="5,5,173,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="9,95,81,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="105,95,164,121"/>
<area shape="rect" id="node1" title="C++ Program to calculate the number of positive divisors." alt="" coords="5,5,173,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="10,95,75,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="100,95,172,121"/>
</map>

2
d4/da4/number__of__positive__divisors_8cpp__incl.md5
View File

@@ -1 +1 @@
a9574d13c4fc98e06be35d20b3a84993
c1ee0ec607d2784b77fc0e2c6ce814a1

18
d4/da4/number__of__positive__divisors_8cpp__incl.svg
View File

@@ -12,7 +12,7 @@
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="C++ Program to calculate number of divisors.">
<g id="a_node1"><a xlink:title="C++ Program to calculate the number of positive divisors.">
<polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 126,-86.5 126,-56.5 0,-56.5"/>
<text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/number_of_positive</text>
<text text-anchor="middle" x="63" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors.cpp</text>
@@ -23,31 +23,31 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="3,-0.5 3,-19.5 57,-19.5 57,-0.5 3,-0.5"/>
<text text-anchor="middle" x="30" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
<polygon fill="white" stroke="#bfbfbf" points="3.5,-0.5 3.5,-19.5 52.5,-19.5 52.5,-0.5 3.5,-0.5"/>
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M55.18,-56.4C50.53,-48.02 44.6,-37.33 39.66,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="42.71,-26.71 34.8,-19.66 36.59,-30.1 42.71,-26.71"/>
<path fill="none" stroke="midnightblue" d="M54.71,-56.4C49.78,-48.02 43.49,-37.33 38.25,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="41.18,-26.5 33.09,-19.66 35.15,-30.05 41.18,-26.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="75,-0.5 75,-19.5 119,-19.5 119,-0.5 75,-0.5"/>
<text text-anchor="middle" x="97" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
<polygon fill="white" stroke="#bfbfbf" points="71,-0.5 71,-19.5 125,-19.5 125,-0.5 71,-0.5"/>
<text text-anchor="middle" x="98" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M71.06,-56.4C75.85,-48.02 81.96,-37.33 87.04,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="90.13,-30.08 92.05,-19.66 84.05,-26.6 90.13,-30.08"/>
<path fill="none" stroke="midnightblue" d="M71.29,-56.4C76.22,-48.02 82.51,-37.33 87.75,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="90.85,-30.05 92.91,-19.66 84.82,-26.5 90.85,-30.05"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

2
dir_296d53ceaeaa7e099814a6def439fe8a.html
View File

@@ -159,7 +159,7 @@ Files</h2></td></tr>
<tr class="memdesc:d8/d53/modular__inverse__fermat__little__theorem_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">Fermat's Little Theorem</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/da2/number__of__positive__divisors_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></td></tr>
<tr class="memdesc:d0/da2/number__of__positive__divisors_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to calculate number of divisors. <br /></td></tr>
<tr class="memdesc:d0/da2/number__of__positive__divisors_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to calculate the number of positive divisors. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:df/def/power__for__huge__numbers_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></td></tr>
<tr class="memdesc:df/def/power__for__huge__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute powers of large numbers. <br /></td></tr>

2
files.html
View File

@@ -148,7 +148,7 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
<tr id="row_6_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_6_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_6_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">Fermat's Little Theorem</a> </td></tr>
<tr id="row_6_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate number of divisors </td></tr>
<tr id="row_6_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_6_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_6_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_6_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>

7
globals_func_t.html
View File

@@ -176,13 +176,14 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
</li>
<li>tests()
: <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
: <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
</li>
<li>TH()
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>

13
globals_t.html
View File

@@ -137,10 +137,10 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, <a class="el" href="da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">durand_kerner_roots.cpp</a>
</li>
<li>test3()
: <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">brent_method_extrema.cpp</a>
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">adaline_learning.cpp</a>
: <a class="el" href="d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">adaline_learning.cpp</a>
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.cpp</a>
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.cpp</a>
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">brent_method_extrema.cpp</a>
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">golden_search_extrema.cpp</a>
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">smallest_circle.cpp</a>
</li>
@@ -179,13 +179,14 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
: <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a>
</li>
<li>tests()
: <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
: <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
</li>
<li>TH()
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>

8
navtreedata.js
View File

@@ -107,10 +107,10 @@ var NAVTREE =
var NAVTREEINDEX =
[
"annotated.html",
"d4/da0/gcd__iterative__euclidean_8cpp.html",
"d7/d77/class_edge.html",
"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0",
"de/d75/qr__eigen__values_8cpp.html"
"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377",
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"
];
var SYNCONMSG = 'click to disable panel synchronisation';

4
navtreeindex0.js
View File

@@ -19,6 +19,7 @@ var NAVTREEINDEX0 =
"d0/d5a/skip__list_8cpp.html#a38234f668624bca86341240f34a95193":[8,0,1,9,4],
"d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,1,9,2],
"d0/da2/number__of__positive__divisors_8cpp.html":[8,0,6,21],
"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[8,0,6,21,2],
"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[8,0,6,21,1],
"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,6,21,0],
"d0/db6/non__recursive__merge__sort_8cpp.html":[8,0,12,7],
@@ -248,6 +249,5 @@ var NAVTREEINDEX0 =
"d4/d86/large__number_8h_source.html":[8,0,6,17],
"d4/d9c/primes__up__to__billion_8cpp.html":[8,0,6,25],
"d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[8,0,6,25,1],
"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[8,0,6,25,2],
"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,6,25,0]
"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[8,0,6,25,2]
};

6
navtreeindex1.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX1 =
{
"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,6,25,0],
"d4/da0/gcd__iterative__euclidean_8cpp.html":[8,0,6,13],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[8,0,6,13,0],
"d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,6,13,1],
@@ -167,8 +168,8 @@ var NAVTREEINDEX1 =
"d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d":[8,0,9,0,1],
"d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0":[8,0,9,0,0],
"d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,9,0,2],
"d6/d4e/namespaceciphers.html":[6,0,1],
"d6/d4e/namespaceciphers.html":[7,0,0],
"d6/d4e/namespaceciphers.html":[6,0,1],
"d6/d60/group__ode.html":[5,1],
"d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723":[8,0,7,9,2],
"d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723":[5,1,1],
@@ -248,6 +249,5 @@ var NAVTREEINDEX1 =
"d7/d6a/bisection__method_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[8,0,7,0,0],
"d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14":[8,0,7,0,1],
"d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2":[8,0,7,0,4],
"d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[8,0,7,0,2],
"d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,7,0,3]
"d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[8,0,7,0,2]
};

4
navtreeindex2.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX2 =
{
"d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,7,0,3],
"d7/d77/class_edge.html":[7,0,10],
"d7/d77/class_edge.html#a0a5b6510bcbe63028818f4dc417ba962":[7,0,10,6],
"d7/d77/class_edge.html#a0bc08bf5da251d66412a7dc3e50c6605":[7,0,10,0],
@@ -248,6 +249,5 @@ var NAVTREEINDEX2 =
"da/dd3/namespacespirograph.html":[6,0,6],
"da/de7/decimal__to__hexadecimal_8cpp.html":[8,0,8,2],
"da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[8,0,8,2,0],
"da/df2/durand__kerner__roots_8cpp.html":[8,0,7,2],
"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[8,0,7,2,2]
"da/df2/durand__kerner__roots_8cpp.html":[8,0,7,2]
};

6
navtreeindex3.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX3 =
{
"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[8,0,7,2,2],
"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,7,2,8],
"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,7,2,7],
"da/df2/durand__kerner__roots_8cpp.html#a212979f5fc9dcf0a420e90b9b21d780a":[8,0,7,2,1],
@@ -174,9 +175,9 @@ var NAVTREEINDEX3 =
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[7,0,36,3],
"dd/d3b/struct_entry.html":[7,0,11],
"dd/d3b/struct_entry.html#acef39096ad1bc616755a4c120a713cea":[7,0,11,3],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,2],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,0],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,1],
"dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372":[7,0,11,2],
"dd/d4f/class_solution.html":[7,0,31],
"dd/d4f/class_solution.html#a0a92d4ba2a822ae87e4c8a7c321024c0":[7,0,31,7],
"dd/d4f/class_solution.html#a29d19d87d54fe43d3f22221b8fe1b0bc":[7,0,31,0],
@@ -248,6 +249,5 @@ var NAVTREEINDEX3 =
"de/d48/struct_trie_1_1_trie_node.html#ae13ae4b74d997d3e83d7bb51b204d99e":[7,0,36,0,0],
"de/d6a/knuth__morris__pratt_8cpp.html":[8,0,13,1],
"de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93":[8,0,13,1,1],
"de/d6a/knuth__morris__pratt_8cpp.html#aa422aab133d4ed5e5d6022a7f701271f":[8,0,13,1,0],
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,13,1,2]
"de/d6a/knuth__morris__pratt_8cpp.html#aa422aab133d4ed5e5d6022a7f701271f":[8,0,13,1,0]
};

3
navtreeindex4.js
View File

@@ -1,5 +1,6 @@
var NAVTREEINDEX4 =
{
"de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[8,0,13,1,2],
"de/d75/qr__eigen__values_8cpp.html":[8,0,7,14],
"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0":[8,0,7,14,6],
"de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[8,0,7,14,5],
@@ -75,8 +76,8 @@ var NAVTREEINDEX4 =
"functions_func.html":[7,2,1],
"functions_rela.html":[7,2,3],
"functions_vars.html":[7,2,2],
"globals.html":[8,1,0],
"globals.html":[8,1,0,0],
"globals.html":[8,1,0],
"globals_a.html":[8,1,0,1],
"globals_b.html":[8,1,0,2],
"globals_c.html":[8,1,0,3],

2
search/all_14.js
View File

@@ -29,7 +29,7 @@ var searchData=
['test_5fint_1604',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
['test_5flamniscate_1605',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]],
['test_5fset_1606',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]],
['tests_1607',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp']]],
['tests_1607',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp']]],
['text_5fsearch_2ecpp_1608',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
['tgamma_1609',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
['th_1610',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],

2
search/functions_14.js
View File

@@ -24,7 +24,7 @@ var searchData=
['test_5ffunction_3805',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
['test_5fint_3806',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
['test_5flamniscate_3807',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]],
['tests_3808',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp']]],
['tests_3808',['tests',['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp']]],
['tgamma_3809',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
['th_3810',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
['thousands_5fsep_3811',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],