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

Documentation for e64e3df18f

Browse Source
This commit is contained in:
github-actions
2021-11-07 17:56:58 +00:00
parent 50598d4e1b
commit 3e71d63380
64 changed files with 545 additions and 570 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d0/d01/smallest__circle_8cpp.html
View File

@@ -226,7 +226,7 @@ The function returns the radius of the circle and prints the coordinated of the
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">return</span> minR;</div> <div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">return</span> minR;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span>}</div> <div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</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="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="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="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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:37</div></div> <div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:37</div></div>

2
d0/d5a/skip__list_8cpp.html
View File

@@ -183,7 +183,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_struc
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:55</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:55</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:90</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:90</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:191</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:191</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:27</div></div> <div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:27</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div> <div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div> <div class="ttc" id="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>

2
d1/d2a/knight__tour_8cpp.html
View File

@@ -344,7 +344,7 @@ template&lt;size_t V&gt; </div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div> <div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> }</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> <div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div> <div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</div></div> <div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</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>

2
d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html
View File

@@ -407,7 +407,7 @@ template&lt;typename X &gt; </div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div> <div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div> <div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae8de7aefcb6635d3dacdd174cd4890c4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">range_queries::heavy_light_decomposition::Tree::dfs_lca</a></div><div class="ttdeci">void dfs_lca(int u, int p=-1)</div><div class="ttdoc">Utility function to populate the t_par vector.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:116</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae8de7aefcb6635d3dacdd174cd4890c4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">range_queries::heavy_light_decomposition::Tree::dfs_lca</a></div><div class="ttdeci">void dfs_lca(int u, int p=-1)</div><div class="ttdoc">Utility function to populate the t_par vector.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:116</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
</div><!-- 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">

2
d1/d83/classuint256__t.html
View File

@@ -847,7 +847,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> tmp &lt;&lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">left</a>;</div> <div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> tmp &lt;&lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">left</a>;</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> quotient(0);</div> <div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> quotient(0);</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);</div> <div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">while</span> (left &gt;= 0 &amp;&amp; tmp2 &gt;= p) {</div> <div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">while</span> (tmp2 &gt;= p) {</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">_lez</a>();</div> <div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">_lez</a>();</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">if</span> (shf) {</div> <div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">if</span> (shf) {</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> tmp &gt;&gt;= shf;</div> <div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> tmp &gt;&gt;= shf;</div>

2
d1/d9a/hopcroft__karp_8cpp.html
View File

@@ -197,7 +197,7 @@ Algorithm</h3>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="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="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:67</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:67</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:255</div></div> <div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:255</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>

4
d1/da6/rungekutta_8cpp.html
View File

@@ -112,7 +112,7 @@ Include dependency graph for rungekutta.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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:d2/de7/namespacerunge__kutta"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></td></tr> <tr class="memitem:d2/de7/namespacerunge__kutta"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></td></tr>
<tr class="memdesc:d2/de7/namespacerunge__kutta"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method. <br /></td></tr> <tr class="memdesc:d2/de7/namespacerunge__kutta"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method. <br /></td></tr>
@@ -307,7 +307,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div> <div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> y;</div> <div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> y;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div> <div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div> <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div> <div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>

2
d1/db3/structcompare.html
View File

@@ -139,7 +139,7 @@ Public Member Functions</h2></td></tr>
<div class="fragment"><div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div> <div class="fragment"><div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>-&gt;freq &gt; r-&gt;freq);</div> <div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>-&gt;freq &gt; r-&gt;freq);</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> }</div> <div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

247
d1/de0/namespacenumerical__methods.html
View File

@@ -96,7 +96,7 @@ $(document).ready(function(){initNavTree('d1/de0/namespacenumerical__methods.htm
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<p>for IO operations <p>for assert
<a href="../../d1/de0/namespacenumerical__methods.html#details">More...</a></p> <a href="../../d1/de0/namespacenumerical__methods.html#details">More...</a></p>
<table class="memberdecls"> <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>
@@ -112,18 +112,21 @@ Functions</h2></td></tr>
<tr class="separator:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:aee56dc85997b8cd42bad71a5d6bd2d93"><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 >for IO operations </p> <div class="textblock"><p >for assert </p>
<p >Numerical Methods.</p> <p >Numerical Methods.</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> container</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p> <p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p >for io operations</p> <p >for io operations</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> container</p> <p >for math functions</p>
<p >for assert</p> <p >for IO operations</p>
<p >Numerical algorithms/methods</p> <p >Numerical algorithms/methods</p>
<p >for assert for math functions for integer allocation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a> for IO operations</p> <p >for assert for integer allocation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a> for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> container</p>
<p >Numerical algorithms/methods</p> <p >Numerical algorithms/methods</p>
<p >for math operations</p> <p >for math operations</p>
<p >Numerical methods</p> <p >Numerical methods</p>
<p >for assert for mathematical-related functions for storing points and coefficents for IO operations</p> <p >for assert for mathematical-related functions for storing points and coefficents for IO operations</p>
<p >Numerical algorithms/methods</p>
<p >for assert for math functions for integer allocation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a> for IO operations</p>
<p >Numerical algorithms/methods </p> <p >Numerical algorithms/methods </p>
</div><h2 class="groupheader">Function Documentation</h2> </div><h2 class="groupheader">Function Documentation</h2>
<a id="a28e67885f8606564cc8335f483f63309" name="a28e67885f8606564cc8335f483f63309"></a> <a id="a28e67885f8606564cc8335f483f63309" name="a28e67885f8606564cc8335f483f63309"></a>
@@ -157,28 +160,28 @@ Functions</h2></td></tr>
<p >Temp variable to x0 and x1</p> <p >Temp variable to x0 and x1</p>
<p >Newly calculated root</p> <p >Newly calculated root</p>
<p >Returning final root</p> <p >Returning final root</p>
<div class="fragment"><div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div> <div class="fragment"><div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordtype">int</span> i = 1; <span class="comment">/// To find initial root or rough approximation</span></div> <div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordtype">int</span> i = 1; <span class="comment">/// To find initial root or rough approximation</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> </div> <div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">while</span> (i * i &lt;= radicand) {</div> <div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordflow">while</span> (i * i &lt;= radicand) {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> i++;</div> <div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> i++;</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> }</div> <div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> }</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div> <div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> i--; <span class="comment">/// Real Initial value will be i-1 as loop stops on +1 value</span></div> <div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> i--; <span class="comment">/// Real Initial value will be i-1 as loop stops on +1 value</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div> <div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">double</span> x0 = i; <span class="comment">/// Storing previous value for comparison</span></div> <div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordtype">double</span> x0 = i; <span class="comment">/// Storing previous value for comparison</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordtype">double</span> x1 =</div> <div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">double</span> x1 =</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> (radicand / x0 + x0) / 2; <span class="comment">/// Storing calculated value for comparison</span></div> <div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> (radicand / x0 + x0) / 2; <span class="comment">/// Storing calculated value for comparison</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordtype">double</span> temp = NAN; <span class="comment">/// Temp variable to x0 and x1</span></div> <div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordtype">double</span> temp = NAN; <span class="comment">/// Temp variable to x0 and x1</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div> <div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">while</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(x0, x1) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(x0, x1) &lt; 0.0001) {</div> <div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">while</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(x0, x1) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(x0, x1) &lt; 0.0001) {</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> temp = (radicand / x1 + x1) / 2; <span class="comment">/// Newly calculated root</span></div> <div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> temp = (radicand / x1 + x1) / 2; <span class="comment">/// Newly calculated root</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> x0 = x1;</div> <div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> x0 = x1;</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> x1 = temp;</div> <div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> x1 = temp;</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div> <div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> }</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div> <div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">return</span> x1; <span class="comment">/// Returning final root</span></div> <div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordflow">return</span> x1; <span class="comment">/// Returning final root</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div> <div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span>}</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="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="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
@@ -241,54 +244,53 @@ y if n!=1 </dd></dl>
<p >Updating the last n/2 elements</p> <p >Updating the last n/2 elements</p>
<p >Deleting dynamic array ye</p> <p >Deleting dynamic array ye</p>
<p >Deleting dynamic array yo</p> <p >Deleting dynamic array yo</p>
<div class="fragment"><div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> {</div> <div class="fragment"><div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">if</span> (n == 1) {</div> <div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">if</span> (n == 1) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keywordflow">return</span> p; <span class="comment">/// Base Case To return</span></div> <div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordflow">return</span> p; <span class="comment">/// Base Case To return</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> }</div> <div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> }</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div> <div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordtype">double</span> pi = 2 * asin(1.0); <span class="comment">/// Declaring value of pi</span></div> <div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordtype">double</span> pi = 2 * asin(1.0); <span class="comment">/// Declaring value of pi</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div> <div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div> <div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> cos(2 * pi / n), sin(2 * pi / n)); <span class="comment">/// Calculating value of omega</span></div> <div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> cos(2 * pi / n), sin(2 * pi / n)); <span class="comment">/// Calculating value of omega</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div> <div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of even power</span></div> <div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of even power</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div> <div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of odd power</span></div> <div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of odd power</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div> <div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div> <div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div> <div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">if</span> (j % 2 == 0) {</div> <div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">if</span> (j % 2 == 0) {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> pe[k1++] = p[j]; <span class="comment">/// Assigning values of even Coefficients</span></div> <div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> pe[k1++] = p[j]; <span class="comment">/// Assigning values of even Coefficients</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div> <div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> } <span class="keywordflow">else</span></div> <div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> po[k2++] = p[j]; <span class="comment">/// Assigning value of odd Coefficients</span></div> <div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> po[k2++] = p[j]; <span class="comment">/// Assigning value of odd Coefficients</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div> <div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> }</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div> <div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> }</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div> <div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(pe, n / 2); <span class="comment">/// Recursive Call</span></div> <div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div> <div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(pe, n / 2); <span class="comment">/// Recursive Call</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div> <div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(po, n / 2); <span class="comment">/// Recursive Call</span></div> <div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(po, n / 2); <span class="comment">/// Recursive Call</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n]; <span class="comment">/// Final value representation list</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> k1 = 0, k2 = 0;</div> <div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n]; <span class="comment">/// Final value representation list</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div> <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div> <div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> k1 = 0, k2 = 0;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> y[i] =</div> <div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the first n/2 elements</span></div> <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> y[i + n / 2] =</div> <div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> y[i] =</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the last n/2 elements</span></div> <div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the first n/2 elements</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div> <div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> y[i + n / 2] =</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> k1++;</div> <div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the last n/2 elements</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> k2++;</div> <div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div> <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> k1++;</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div> <div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> k2++;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">if</span>(n!=2){</div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div> <div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">delete</span>[] pe;</div> <div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (n != 2) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">delete</span>[] po;</div> <div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">delete</span>[] pe;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> </div> <div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keyword">delete</span>[] po;</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div> <div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div> <div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> </div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keyword">delete</span>[] ye; <span class="comment">/// Deleting dynamic array ye</span></div> <div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keyword">delete</span>[] ye; <span class="comment">/// Deleting dynamic array ye</span></div>
@@ -296,7 +298,7 @@ y if n!=1 </dd></dl>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> y;</div> <div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> y;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>}</div> <div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>}</div>
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div> <div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:40</div></div> <div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:41</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(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>
@@ -360,57 +362,56 @@ y if n!=1 </dd></dl>
<p >Updating the last n/2 elements</p> <p >Updating the last n/2 elements</p>
<p >Deleting dynamic array ye</p> <p >Deleting dynamic array ye</p>
<p >Deleting dynamic array yo</p> <p >Deleting dynamic array yo</p>
<div class="fragment"><div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> {</div> <div class="fragment"><div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> {</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">if</span> (n == 1) {</div> <div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">if</span> (n == 1) {</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keywordflow">return</span> p; <span class="comment">/// Base Case To return</span></div> <div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keywordflow">return</span> p; <span class="comment">/// Base Case To return</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> }</div> <div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> }</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div> <div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordtype">double</span> pi = 2 * asin(1.0); <span class="comment">/// Declaring value of pi</span></div> <div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> <span class="keywordtype">double</span> pi = 2 * asin(1.0); <span class="comment">/// Declaring value of pi</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div> <div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div> <div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> cos(2 * pi / n), sin(2 * pi / n)); <span class="comment">/// Calculating value of omega</span></div> <div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> cos(2 * pi / n), sin(2 * pi / n)); <span class="comment">/// Calculating value of omega</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> </div> <div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>()/n); <span class="comment">/// One change in comparison with DFT</span></div> <div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() / n); <span class="comment">/// One change in comparison with DFT</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>()/n); <span class="comment">/// One change in comparison with DFT</span></div> <div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() / n); <span class="comment">/// One change in comparison with DFT</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> </div> <div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of even power</span></div> <div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of even power</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> </div> <div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of odd power</span></div> <div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2]; <span class="comment">/// Coefficients of odd power</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> </div> <div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div> <div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div> <div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keywordflow">if</span> (j % 2 == 0) {</div> <div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keywordflow">if</span> (j % 2 == 0) {</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> pe[k1++] = p[j]; <span class="comment">/// Assigning values of even Coefficients</span></div> <div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> pe[k1++] = p[j]; <span class="comment">/// Assigning values of even Coefficients</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div> <div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> } <span class="keywordflow">else</span></div> <div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> po[k2++] = p[j]; <span class="comment">/// Assigning value of odd Coefficients</span></div> <div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> po[k2++] = p[j]; <span class="comment">/// Assigning value of odd Coefficients</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> }</div> <div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div> <div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div> <div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(pe, n / 2); <span class="comment">/// Recursive Call</span></div> <div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> </div> <div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(pe, n / 2); <span class="comment">/// Recursive Call</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div> <div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(po, n / 2); <span class="comment">/// Recursive Call</span></div> <div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div> <div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(po, n / 2); <span class="comment">/// Recursive Call</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n]; <span class="comment">/// Final value representation list</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div> <div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> k1 = 0, k2 = 0;</div> <div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n]; <span class="comment">/// Final value representation list</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div> <div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> k1 = 0, k2 = 0;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> y[i] =</div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the first n/2 elements</span></div> <div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> y[i + n / 2] =</div> <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> y[i] =</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the last n/2 elements</span></div> <div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the first n/2 elements</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div> <div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> y[i + n / 2] =</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> k1++;</div> <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2]; <span class="comment">/// Updating the last n/2 elements</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> k2++;</div> <div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div> <div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> k1++;</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div> <div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> k2++;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordflow">if</span>(n!=2){</div> <div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div> <div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">delete</span>[] pe;</div> <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">if</span> (n != 2) {</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">delete</span>[] po;</div> <div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">delete</span>[] pe;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keyword">delete</span>[] po;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div> <div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div> <div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">delete</span>[] ye; <span class="comment">/// Deleting dynamic array ye</span></div> <div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keyword">delete</span>[] ye; <span class="comment">/// Deleting dynamic array ye</span></div>

51
d1/def/classdata__structures_1_1linked__list_1_1list.html
View File

@@ -584,19 +584,17 @@ Here is the call graph for this function:</div>
<p>Utility function to find the top element of the list. </p> <p>Utility function to find the top element of the list. </p>
<dl class="section return"><dt>Returns</dt><dd>the top element of the list </dd></dl> <dl class="section return"><dt>Returns</dt><dd>the top element of the list </dd></dl>
<div class="fragment"><div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {</div> <div class="fragment"><div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">try</span> {</div> <div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a">isEmpty</a>()) {</div> <div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">return</span> head-&gt;val;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">return</span> head-&gt;val;</div> <div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div> <div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/logic_error.html">std::logic_error</a>(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a> &amp;e) {</div> <div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;List is empty&quot;</span> &lt;&lt; e.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>() &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div> <div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span>}</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> }</div> <div class="ttc" id="alogic_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/logic_error.html">std::logic_error</a></div></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span>}</div>
<div class="ttc" id="aexception_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception.html">std::exception</a></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="../../d1/def/classdata__structures_1_1linked__list_1_1list_ab2d20da40d800897c31a649799d5e43d_cgraph.svg" width="371" height="104"><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="../../d1/def/classdata__structures_1_1linked__list_1_1list_ab2d20da40d800897c31a649799d5e43d_cgraph.svg" width="371" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div> </div>
</div> </div>
@@ -620,22 +618,23 @@ Here is the call graph for this function:</div>
<p>Utility function to find the i th element of the list. </p> <p>Utility function to find the i th element of the list. </p>
<dl class="section return"><dt>Returns</dt><dd>the i th element of the list </dd></dl> <dl class="section return"><dt>Returns</dt><dd>the i th element of the list </dd></dl>
<div class="fragment"><div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> {</div> <div class="fragment"><div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> {</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = head;</div> <div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = head;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div> <div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> </div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">int</span> count = 0;</div> <div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordtype">int</span> count = 0;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>) {</div> <div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">if</span> (count == index) {</div> <div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">if</span> (count == index) {</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">return</span> (current-&gt;val);</div> <div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keywordflow">return</span> (current-&gt;val);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> }</div> <div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> }</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> count++;</div> <div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> count++;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> current = current-&gt;next;</div> <div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> current = current-&gt;next;</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> }</div> <div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> }</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> </div> <div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> </div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">/* if we get to this line,the caller was asking for a non-existent element</span></div> <div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">/* if we get to this line,the caller was asking for a non-existent element</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span><span class="comment"> so we assert fail */</span></div> <div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span><span class="comment"> so we assert fail */</span></div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> assert(0);</div> <div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(1);</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span>}</div> <div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span>}</div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

3
d1/def/classdata__structures_1_1linked__list_1_1list_ab2d20da40d800897c31a649799d5e43d_cgraph.map
View File

@@ -1,5 +1,4 @@
<map id="data_structures::linked_list::list::top" name="data_structures::linked_list::list::top"> <map id="data_structures::linked_list::list::top" name="data_structures::linked_list::list::top">
<area shape="rect" id="node1" title="Utility function to find the top element of the list." alt="" coords="5,35,161,76"/> <area shape="rect" id="node1" title="Utility function to find the top element of the list." alt="" coords="5,5,161,47"/>
<area shape="rect" id="node2" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="209,5,365,47"/> <area shape="rect" id="node2" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="209,5,365,47"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="217,71,357,98"/>
</map> </map>

2
d1/def/classdata__structures_1_1linked__list_1_1list_ab2d20da40d800897c31a649799d5e43d_cgraph.md5
View File

@@ -1 +1 @@
99819564c3f1df64f69186810114c1fa 7e56dece2cf801910cf5c5ed381175da

39
d1/def/classdata__structures_1_1linked__list_1_1list_ab2d20da40d800897c31a649799d5e43d_cgraph.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002) <!-- Generated by graphviz version 2.49.3 (20211023.0002)
--> -->
<!-- Title: data_structures::linked_list::list::top Pages: 1 --> <!-- Title: data_structures::linked_list::list::top Pages: 1 -->
<svg width="278pt" height="78pt" <svg width="278pt" height="39pt"
viewBox="0.00 0.00 278.00 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 278.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 73.5)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>data_structures::linked_list::list::top</title> <title>data_structures::linked_list::list::top</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-73.5 274,-73.5 274,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-35 274,-35 274,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Utility function to find the top element of the list."> <g id="a_node1"><a xlink:title="Utility function to find the top element of the list.">
<polygon fill="#bfbfbf" stroke="black" points="0,-17 0,-47 117,-47 117,-17 0,-17"/> <polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 117,-30.5 117,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="58.5" y="-24" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text> <text text-anchor="middle" x="58.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
</a> </a>
</g> </g>
</g> </g>
@@ -23,32 +23,17 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty."> <g id="a_node2"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty.">
<polygon fill="white" stroke="black" points="153,-39 153,-69 270,-69 270,-39 153,-39"/> <polygon fill="white" stroke="black" points="153,-0.5 153,-30.5 270,-30.5 270,-0.5 153,-0.5"/>
<text text-anchor="start" x="161" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="161" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="211.5" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text> <text text-anchor="middle" x="211.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M117.02,-40.38C125.46,-41.61 134.23,-42.89 142.86,-44.14"/> <path fill="none" stroke="midnightblue" d="M117.02,-15.5C125.46,-15.5 134.23,-15.5 142.86,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="142.49,-47.63 152.89,-45.61 143.5,-40.7 142.49,-47.63"/> <polygon fill="midnightblue" stroke="midnightblue" points="142.89,-19 152.89,-15.5 142.89,-12 142.89,-19"/>
</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/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="159,-0.5 159,-19.5 264,-19.5 264,-0.5 159,-0.5"/>
<text text-anchor="middle" x="211.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::exception::what</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="M117.02,-23.62C127.38,-22.11 138.21,-20.53 148.69,-19.01"/>
<polygon fill="midnightblue" stroke="midnightblue" points="149.2,-22.47 158.59,-17.56 148.19,-15.54 149.2,-22.47"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.1 KiB

4
d2/d05/class_min_heap.html
View File

@@ -378,7 +378,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div> <div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</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="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
</div><!-- 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">
@@ -448,7 +448,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span>}</div> <div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span>}</div>
<div class="ttc" id="aclass_min_heap_html_aa8c6c141e3de664819686aa637e1afca"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap::left</a></div><div class="ttdeci">int left(int i)</div><div class="ttdef"><b>Definition:</b> binaryheap.cpp:31</div></div> <div class="ttc" id="aclass_min_heap_html_aa8c6c141e3de664819686aa637e1afca"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap::left</a></div><div class="ttdeci">int left(int i)</div><div class="ttdef"><b>Definition:</b> binaryheap.cpp:31</div></div>
<div class="ttc" id="aclass_min_heap_html_ac760b85cf90265b8d674b942a43fb70e"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap::right</a></div><div class="ttdeci">int right(int i)</div><div class="ttdef"><b>Definition:</b> binaryheap.cpp:34</div></div> <div class="ttc" id="aclass_min_heap_html_ac760b85cf90265b8d674b942a43fb70e"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap::right</a></div><div class="ttdeci">int right(int i)</div><div class="ttdef"><b>Definition:</b> binaryheap.cpp:34</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
</div><!-- 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">

2
d2/d26/count__inversions_8cpp.html
View File

@@ -342,7 +342,7 @@ template&lt;typename T &gt; </div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div> <div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> }</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> inv_count;</div> <div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> inv_count;</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>}</div> <div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div> <div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>

2
d2/d3b/namespaceqr__algorithm.html
View File

@@ -466,7 +466,7 @@ template&lt;typename T &gt; </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div> <div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> }</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> }</div> <div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> }</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>}</div> <div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:104</div></div> <div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:104</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:92</div></div> <div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:92</div></div>

2
d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
View File

@@ -318,7 +318,7 @@ template&lt;typename X &gt; </div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:264</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:264</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:88</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:88</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:87</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:87</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div> <div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(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>

2
d3/dfe/horspool_8cpp.html
View File

@@ -266,7 +266,7 @@ false if text string does not contain prototype string </dd></dl>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div> <div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> }</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> <div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div> <div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</div></div> <div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition:</b> horspool.cpp:26</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>

6
d4/d08/babylonian__method_8cpp__incl.map
View File

@@ -1,6 +1,6 @@
<map id="numerical_methods/babylonian_method.cpp" name="numerical_methods/babylonian_method.cpp"> <map id="numerical_methods/babylonian_method.cpp" name="numerical_methods/babylonian_method.cpp">
<area shape="rect" id="node1" title="A babylonian method (BM) is an algorithm that computes the square root." alt="" coords="28,5,235,47"/> <area shape="rect" id="node1" title="A babylonian method (BM) is an algorithm that computes the square root." alt="" coords="21,5,228,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/> <area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,168,121"/> <area shape="rect" id="node3" title=" " alt="" coords="95,95,154,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="192,95,255,121"/> <area shape="rect" id="node4" title=" " alt="" coords="179,95,252,121"/>
</map> </map>

2
d4/d08/babylonian__method_8cpp__incl.md5
View File

@@ -1 +1 @@
006111d22b19eae1139acf05ad55a8b4 f05fe7c29b7d5338e15065a7a3a89e38

32
d4/d08/babylonian__method_8cpp__incl.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002) <!-- Generated by graphviz version 2.49.3 (20211023.0002)
--> -->
<!-- Title: numerical_methods/babylonian_method.cpp Pages: 1 --> <!-- Title: numerical_methods/babylonian_method.cpp Pages: 1 -->
<svg width="195pt" height="95pt" <svg width="193pt" height="95pt"
viewBox="0.00 0.00 195.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 193.00 95.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 91)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>numerical_methods/babylonian_method.cpp</title> <title>numerical_methods/babylonian_method.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 191,-91 191,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-91 189,-91 189,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="A babylonian method (BM) is an algorithm that computes the square root."> <g id="a_node1"><a xlink:title="A babylonian method (BM) is an algorithm that computes the square root.">
<polygon fill="#bfbfbf" stroke="black" points="17,-56.5 17,-86.5 172,-86.5 172,-56.5 17,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="12,-56.5 12,-86.5 167,-86.5 167,-56.5 12,-56.5"/>
<text text-anchor="start" x="25" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/babylonian</text> <text text-anchor="start" x="20" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/babylonian</text>
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_method.cpp</text> <text text-anchor="middle" x="89.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_method.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -31,38 +31,38 @@
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M77.91,-56.4C67.21,-47.31 53.31,-35.49 42.37,-26.19"/> <path fill="none" stroke="midnightblue" d="M74.1,-56.4C64.26,-47.4 51.51,-35.72 41.39,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="44.57,-23.47 34.69,-19.66 40.04,-28.8 44.57,-23.47"/> <polygon fill="midnightblue" stroke="midnightblue" points="43.7,-23.83 33.96,-19.66 38.97,-28.99 43.7,-23.83"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 122,-19.5 122,-0.5 67,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 111.5,-19.5 111.5,-0.5 67.5,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="89.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.5,-56.4C94.5,-48.47 94.5,-38.46 94.5,-29.86"/> <path fill="none" stroke="midnightblue" d="M89.5,-56.4C89.5,-48.47 89.5,-38.46 89.5,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.66 94.5,-19.66 91,-29.66 98,-29.66"/> <polygon fill="midnightblue" stroke="midnightblue" points="93,-29.66 89.5,-19.66 86,-29.66 93,-29.66"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140,-0.5 140,-19.5 187,-19.5 187,-0.5 140,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="130,-0.5 130,-19.5 185,-19.5 185,-0.5 130,-0.5"/>
<text text-anchor="middle" x="163.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">math.h</text> <text text-anchor="middle" x="157.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M110.85,-56.4C121.4,-47.31 135.1,-35.49 145.88,-26.19"/> <path fill="none" stroke="midnightblue" d="M105.62,-56.4C115.9,-47.4 129.25,-35.72 139.83,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="148.17,-28.84 153.46,-19.66 143.6,-23.54 148.17,-28.84"/> <polygon fill="midnightblue" stroke="midnightblue" points="142.38,-28.88 147.61,-19.66 137.77,-23.61 142.38,-28.88"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

227
d4/d18/composite__simpson__rule_8cpp.html
View File

@@ -116,7 +116,7 @@ Include dependency graph for composite_simpson_rule.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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:d3/d6d/namespacesimpson__method"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d6d/namespacesimpson__method.html">simpson_method</a></td></tr> <tr class="memitem:d3/d6d/namespacesimpson__method"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d6d/namespacesimpson__method.html">simpson_method</a></td></tr>
<tr class="memdesc:d3/d6d/namespacesimpson__method"><td class="mdescLeft">&#160;</td><td class="mdescRight">Contains the Simpson's method implementation. <br /></td></tr> <tr class="memdesc:d3/d6d/namespacesimpson__method"><td class="mdescLeft">&#160;</td><td class="mdescRight">Contains the Simpson's method implementation. <br /></td></tr>
@@ -124,8 +124,8 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls"> </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:a8b5934403b0a07e1e4599ee8c869f8ef"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d18/composite__simpson__rule_8cpp.html#a8b5934403b0a07e1e4599ee8c869f8ef">numerical_methods::simpson_method::evaluate_by_simpson</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; func)</td></tr> <tr class="memitem:a6ccc5eddc537dc0293d0ae3d0480f068"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6ccc5eddc537dc0293d0ae3d0480f068">numerical_methods::simpson_method::evaluate_by_simpson</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;func)</td></tr>
<tr class="separator:a8b5934403b0a07e1e4599ee8c869f8ef"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a6ccc5eddc537dc0293d0ae3d0480f068"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4251b4df4748a0b9c43a48f61bdd2397"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a> (double x)</td></tr> <tr class="memitem:a4251b4df4748a0b9c43a48f61bdd2397"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a> (double x)</td></tr>
<tr class="memdesc:a4251b4df4748a0b9c43a48f61bdd2397"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function f(x) that will be used to test the method. <a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">More...</a><br /></td></tr> <tr class="memdesc:a4251b4df4748a0b9c43a48f61bdd2397"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function f(x) that will be used to test the method. <a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">More...</a><br /></td></tr>
<tr class="separator:a4251b4df4748a0b9c43a48f61bdd2397"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a4251b4df4748a0b9c43a48f61bdd2397"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -158,8 +158,8 @@ Functions</h2></td></tr>
<p >Add sample function by replacing one of the f, g, k, l and the assert</p> <p >Add sample function by replacing one of the f, g, k, l and the assert</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ggkogkou" target="_blank">ggkogkou</a> </dd></dl> <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ggkogkou" target="_blank">ggkogkou</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2> </div><h2 class="groupheader">Function Documentation</h2>
<a id="a8b5934403b0a07e1e4599ee8c869f8ef" name="a8b5934403b0a07e1e4599ee8c869f8ef"></a> <a id="a6ccc5eddc537dc0293d0ae3d0480f068" name="a6ccc5eddc537dc0293d0ae3d0480f068"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8b5934403b0a07e1e4599ee8c869f8ef">&#9670;&nbsp;</a></span>evaluate_by_simpson()</h2> <h2 class="memtitle"><span class="permalink"><a href="#a6ccc5eddc537dc0293d0ae3d0480f068">&#9670;&nbsp;</a></span>evaluate_by_simpson()</h2>
<div class="memitem"> <div class="memitem">
<div class="memproto"> <div class="memproto">
@@ -185,7 +185,7 @@ Functions</h2></td></tr>
<tr> <tr>
<td class="paramkey"></td> <td class="paramkey"></td>
<td></td> <td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt;&#160;</td> <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;&#160;</td>
<td class="paramname"><em>func</em>&#160;</td> <td class="paramname"><em>func</em>&#160;</td>
</tr> </tr>
<tr> <tr>
@@ -195,43 +195,44 @@ Functions</h2></td></tr>
</tr> </tr>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<div class="fragment"><div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> {</div> <div class="fragment"><div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> {</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::int32_t, double&gt;</a></div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::int32_t, double&gt;</a></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> data_table; <span class="comment">// Contains the data points. key: i, value: f(xi)</span></div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> data_table; <span class="comment">// Contains the data points. key: i, value: f(xi)</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keywordtype">double</span> xi = a; <span class="comment">// Initialize xi to the starting point x0 = a</span></div> <div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordtype">double</span> xi = a; <span class="comment">// Initialize xi to the starting point x0 = a</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div> <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// Create the data table</span></div> <div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// Create the data table</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">double</span> temp;</div> <div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">double</span> temp = NAN;</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div> <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> temp = func(xi);</div> <div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> temp = func(xi);</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div> <div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;std::int32_t, double&gt;</a>(i, temp)); <span class="comment">// add i and f(xi)</span></div> <div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;std::int32_t, double&gt;</a>(i, temp)); <span class="comment">// add i and f(xi)</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>; <span class="comment">// Get the next point xi for the next iteration</span></div> <div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>; <span class="comment">// Get the next point xi for the next iteration</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div> <div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div> <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// Evaluate the integral.</span></div> <div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Evaluate the integral.</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// Remember: f(x0) + 4*f(x1) + 2*f(x2) + ... + 2*f(xN-2) + 4*f(xN-1) + f(xN)</span></div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// Remember: f(x0) + 4*f(x1) + 2*f(x2) + ... + 2*f(xN-2) + 4*f(xN-1) + f(xN)</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordtype">double</span> evaluate_integral = 0;</div> <div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordtype">double</span> evaluate_integral = 0;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div> <div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (i == 0 || i == N)</div> <div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">if</span> (i == 0 || i == N) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div> <div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i % 2 == 1)</div> <div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i % 2 == 1) {</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> evaluate_integral += 4 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div> <div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> evaluate_integral += 4 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">else</span></div> <div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> evaluate_integral += 2 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div> <div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> evaluate_integral += 2 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> }</div> <div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> }</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div> <div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> }</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// Multiply by the coefficient h/3</span></div> <div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 3;</div> <div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// Multiply by the coefficient h/3</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div> <div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 3;</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div> <div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// interval.</span></div> <div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> assert(!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a>(evaluate_integral) &amp;&amp;</div> <div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// interval.</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div> <div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> assert(!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a>(evaluate_integral) &amp;&amp;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="stringliteral">&quot;your input.\n&quot;</span>);</div> <div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// Else return</span></div> <div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="stringliteral">&quot;your input.\n&quot;</span>);</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> evaluate_integral;</div> <div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// Else return</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span>}</div> <div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> evaluate_integral;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/at.html">std::map::at</a></div><div class="ttdeci">T at(T... args)</div></div> <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/at.html">std::map::at</a></div><div class="ttdeci">T at(T... args)</div></div>
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:47</div></div> <div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:47</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div> <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
@@ -267,7 +268,7 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = f(xi) </dd></dl> <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = f(xi) </dd></dl>
<div class="fragment"><div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(x); }</div> <div class="fragment"><div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(x); }</div>
<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div> <div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div> <div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
@@ -296,7 +297,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Another test function. </p> <p>Another test function. </p>
<div class="fragment"><div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x) * (4 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 2)); }</div> <div class="fragment"><div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x) * (4 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 2)); }</div>
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div> <div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
@@ -327,7 +328,7 @@ Here is the call graph for this function:</div>
<p>Another test function. </p> <p>Another test function. </p>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd> <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
</dl> </dl>
<div class="fragment"><div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 3) + 3); }</div> <div class="fragment"><div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 3) + 3); }</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">
@@ -354,7 +355,7 @@ Here is the call graph for this function:</div>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Another test function. </p> <p>Another test function. </p>
<div class="fragment"><div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span>{ <span class="keywordflow">return</span> x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(2 * x + 1); }</div> <div class="fragment"><div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span>{ <span class="keywordflow">return</span> x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(2 * x + 1); }</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">
@@ -402,45 +403,47 @@ Here is the call graph for this function:</div>
<p >Number of intervals to divide the integration interval. MUST BE EVEN</p> <p >Number of intervals to divide the integration interval. MUST BE EVEN</p>
<p >Starting and ending point of the integration in the real axis</p> <p >Starting and ending point of the integration in the real axis</p>
<p >Step, calculated by a, b and N</p> <p >Step, calculated by a, b and N</p>
<div class="fragment"><div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> {</div> <div class="fragment"><div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> {</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 16; <span class="comment">/// Number of intervals to divide the integration</span><span class="comment"></span></div> <div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 16; <span class="comment">/// Number of intervals to divide the integration</span><span class="comment"></span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span><span class="comment"> /// interval. MUST BE EVEN</span></div> <div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span><span class="comment"> /// interval. MUST BE EVEN</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span><span class="comment"></span> <span class="keywordtype">double</span> a = 1, b = 3; <span class="comment">/// Starting and ending point of the integration in</span><span class="comment"></span></div> <div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span><span class="comment"></span> <span class="keywordtype">double</span> a = 1, b = 3; <span class="comment">/// Starting and ending point of the integration in</span><span class="comment"></span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span><span class="comment"> /// the real axis</span></div> <div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span><span class="comment"> /// the real axis</span></div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span><span class="comment"></span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>; <span class="comment">/// Step, calculated by a, b and N</span></div> <div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span><span class="comment"></span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN; <span class="comment">/// Step, calculated by a, b and N</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> </div> <div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordtype">bool</span> used_argv_parameters =</div> <div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordtype">bool</span> used_argv_parameters =</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keyword">false</span>; <span class="comment">// If argv parameters are used then the assert must be omitted</span></div> <div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">false</span>; <span class="comment">// If argv parameters are used then the assert must be omitted</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// for the tst cases</span></div> <div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// for the tst cases</span></div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div> <div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> </div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// Get user input (by the command line parameters or the console after</span></div> <div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// displaying messages)</span></div> <div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// displaying messages)</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">if</span> (argc == 4) {</div> <div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">if</span> (argc == 4) {</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div> <div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> a = (double)<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[2]);</div> <div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[2]);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> b = (double)<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[3]);</div> <div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> b = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[3]);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// Check if a&lt;b else abort</span></div> <div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// Check if a&lt;b else abort</span></div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div> <div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div> <div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="keywordflow">if</span> (N &lt; 16 || a != 1 || b != 3)</div> <div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="keywordflow">if</span> (N &lt; 16 || a != 1 || b != 3) {</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> used_argv_parameters = <span class="keyword">true</span>;</div> <div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> used_argv_parameters = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</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;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div> <div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> }</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</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"><a id="l00193" name="l00193"></a><span class="lineno"> 193</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;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> } <span class="keywordflow">else</span></div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</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;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</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"><a id="l00194" name="l00194"></a><span class="lineno"> 194</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"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div> <div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// Find the step</span></div> <div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</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;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = (b - a) / N;</div> <div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</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"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> </div> <div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> }</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">test</a>(N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, b, used_argv_parameters); <span class="comment">// run self-test implementations</span></div> <div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> </div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> </div> <div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// Find the step</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = (b - a) / N;</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span>}</div> <div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> </div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">test</a>(N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, b, used_argv_parameters); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> </div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span>}</div>
<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div> <div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div> <div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="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="acomposite__simpson__rule_8cpp_html_a2ae48a41e43dc6ab11b962742349646e"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">test</a></div><div class="ttdeci">static void test(std::int32_t N, double h, double a, double b, bool used_argv_parameters)</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:130</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2ae48a41e43dc6ab11b962742349646e"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">test</a></div><div class="ttdeci">static void test(std::int32_t N, double h, double a, double b, bool used_argv_parameters)</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:132</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><!-- 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>
@@ -514,36 +517,36 @@ Here is the call graph for this function:</div>
</table> </table>
</dd> </dd>
</dl> </dl>
<div class="fragment"><div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> {</div> <div class="fragment"><div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// Call the functions and find the integral of each function</span></div> <div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// Call the functions and find the integral of each function</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordtype">double</span> result_f = numerical_methods::simpson_method::evaluate_by_simpson(</div> <div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keywordtype">double</span> result_f = numerical_methods::simpson_method::evaluate_by_simpson(</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::f);</div> <div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::f);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div> <div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div> <div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div> <div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &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"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &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"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> </div> <div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">double</span> result_g = numerical_methods::simpson_method::evaluate_by_simpson(</div> <div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordtype">double</span> result_g = numerical_methods::simpson_method::evaluate_by_simpson(</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::g);</div> <div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::g);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div> <div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div> <div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div> <div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &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"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &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"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div> <div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordtype">double</span> result_k = numerical_methods::simpson_method::evaluate_by_simpson(</div> <div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordtype">double</span> result_k = numerical_methods::simpson_method::evaluate_by_simpson(</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::k);</div> <div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::k);</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div> <div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div> <div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div> <div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div> <div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> </div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordtype">double</span> result_l = numerical_methods::simpson_method::evaluate_by_simpson(</div> <div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keywordtype">double</span> result_l = numerical_methods::simpson_method::evaluate_by_simpson(</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::l);</div> <div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::l);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div> <div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div> <div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div> <div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &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"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &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"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>}</div> <div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span>}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
d4/def/kohonen__som__topology_8cpp.html
View File

@@ -336,7 +336,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a>(X, &amp;W, 1e-4); <span class="comment">// train the SOM</span></div> <div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a>(X, &amp;W, 1e-4); <span class="comment">// train the SOM</span></div>
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a>(<span class="stringliteral">&quot;w12.csv&quot;</span>, W); <span class="comment">// save the resultant weights</span></div> <div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a>(<span class="stringliteral">&quot;w12.csv&quot;</span>, W); <span class="comment">// save the resultant weights</span></div>
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span>}</div> <div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:47</div></div> <div class="ttc" id="adata__structures_2sparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d6/d42/data__structures_2sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:47</div></div>
<div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:65</div></div> <div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:65</div></div>
<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:53</div></div> <div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:53</div></div>

2
d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html
View File

@@ -452,7 +452,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div> <div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> }</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">return</span> details;</div> <div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="keywordflow">return</span> details;</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> }</div> <div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div> <div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:460</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:460</div></div>
<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:329</div></div> <div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:329</div></div>

4
d5/d33/gram__schmidt_8cpp.html
View File

@@ -366,8 +366,8 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> display(r, c, B); <span class="comment">// for displaying orthogoanlised vectors</span></div> <div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> display(r, c, B); <span class="comment">// for displaying orthogoanlised vectors</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span>}</div> <div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:79</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:79</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>

2
d5/d4c/group__sorting.html
View File

@@ -421,7 +421,7 @@ template&lt;typename T &gt; </div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keyword">delete</span>[] L;</div> <div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keyword">delete</span>[] L;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keyword">delete</span>[] R;</div> <div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keyword">delete</span>[] R;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span>}</div> <div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
d5/d96/md5_8cpp.html
View File

@@ -393,7 +393,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">return</span> sig;</div> <div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">return</span> sig;</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span>}</div> <div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div> <div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
<div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition:</b> md5.cpp:89</div></div> <div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition:</b> md5.cpp:89</div></div>
<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition:</b> md5.cpp:102</div></div> <div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition:</b> md5.cpp:102</div></div>

2
d5/def/stairs__pattern_8cpp.html
View File

@@ -160,7 +160,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span>}</div> <div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span>}</div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="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="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="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><!-- 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>

58
d6/d05/reverse__a__linked__list_8cpp.html
View File

@@ -163,11 +163,11 @@ Algorithm</h3>
<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"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> {</div> <div class="fragment"><div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> {</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div> <div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span>}</div> <div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span>}</div>
<div class="ttc" id="areverse__a__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_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> reverse_a_linked_list.cpp:177</div></div> <div class="ttc" id="areverse__a__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_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> reverse_a_linked_list.cpp:173</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">
@@ -202,36 +202,36 @@ 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"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> {</div> <div class="fragment"><div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> {</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div> <div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// 1st test</span></div> <div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// 1st test</span></div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(11);</div> <div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(11);</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(12);</div> <div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(12);</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(15);</div> <div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(15);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(10);</div> <div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(10);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(-12);</div> <div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(-12);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(-20);</div> <div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(-20);</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(18);</div> <div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">insert</a>(18);</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">top</a>() == 11);</div> <div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">top</a>() == 11);</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">last</a>() == 18);</div> <div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">last</a>() == 18);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70">reverseList</a>();</div> <div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70">reverseList</a>();</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// Reversal Testing</span></div> <div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Reversal Testing</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">top</a>() == 18);</div> <div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">top</a>() == 18);</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(1) == -20);</div> <div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(1) == -20);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(2) == -12);</div> <div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(2) == -12);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(3) == 10);</div> <div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(3) == 10);</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(4) == 15);</div> <div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(4) == 15);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(5) == 12);</div> <div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">traverse</a>(5) == 12);</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">last</a>() == 11);</div> <div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">last</a>() == 11);</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</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"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span>}</div> <div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</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="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:81</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:81</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a4649fc2c5d09dc58608cd9299db9946f"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list::insert</a></div><div class="ttdeci">void insert(int32_t new_elem)</div><div class="ttdoc">Utility function that adds a new element at the end of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:82</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a4649fc2c5d09dc58608cd9299db9946f"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list::insert</a></div><div class="ttdeci">void insert(int32_t new_elem)</div><div class="ttdoc">Utility function that adds a new element at the end of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:82</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a8b20ca89a0346c8d4193936481528c70"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70">data_structures::linked_list::list::reverseList</a></div><div class="ttdeci">void reverseList()</div><div class="ttdoc">Utility function for reversing a list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:107</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a8b20ca89a0346c8d4193936481528c70"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70">data_structures::linked_list::list::reverseList</a></div><div class="ttdeci">void reverseList()</div><div class="ttdoc">Utility function for reversing a list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:107</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ab2d20da40d800897c31a649799d5e43d"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">data_structures::linked_list::list::top</a></div><div class="ttdeci">int32_t top()</div><div class="ttdoc">Utility function to find the top element of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:123</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ab2d20da40d800897c31a649799d5e43d"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d">data_structures::linked_list::list::top</a></div><div class="ttdeci">int32_t top()</div><div class="ttdoc">Utility function to find the top element of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:123</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ab87eecc80068fc5a80e98e83536885f2"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:84</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ab87eecc80068fc5a80e98e83536885f2"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab87eecc80068fc5a80e98e83536885f2">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:84</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af42071da0067130389cb12fc526ea4fe"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">data_structures::linked_list::list::traverse</a></div><div class="ttdeci">int32_t traverse(int32_t index)</div><div class="ttdoc">Utility function to find the i th element of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:153</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af42071da0067130389cb12fc526ea4fe"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe">data_structures::linked_list::list::traverse</a></div><div class="ttdeci">int32_t traverse(int32_t index)</div><div class="ttdoc">Utility function to find the i th element of the list.</div><div class="ttdef"><b>Definition:</b> reverse_a_linked_list.cpp:149</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><!-- 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>

10
d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,10 +1,10 @@
<map id="test" name="test"> <map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,129,49,156"/> <area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,129,49,156"/>
<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="139,5,211,32"/> <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="139,5,211,32"/>
<area shape="rect" id="node3" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" title="Utility function that adds a new element at the end of the list." alt="" coords="97,122,253,163"/> <area shape="rect" id="node3" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" title="Utility function that adds a new element at the end of the list." alt="" coords="97,57,253,98"/>
<area shape="rect" id="node6" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" title="Utility function for reversing a list." alt="" coords="97,187,253,229"/> <area shape="rect" id="node6" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" title="Utility function for reversing a list." alt="" coords="97,122,253,163"/>
<area shape="rect" id="node7" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" title="Utility function to find the top element of the list." alt="" coords="97,57,253,98"/> <area shape="rect" id="node7" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" title="Utility function to find the top element of the list." alt="" coords="97,187,253,229"/>
<area shape="rect" id="node8" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe" title="Utility function to find the i th element of the list." alt="" coords="97,253,253,294"/> <area shape="rect" id="node8" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe" title="Utility function to find the i th element of the list." alt="" coords="97,253,253,294"/>
<area shape="rect" id="node4" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="301,59,457,101"/> <area shape="rect" id="node4" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="301,151,457,193"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="309,127,449,153"/> <area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="309,64,449,91"/>
</map> </map>

2
d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
f1e114e15585fa05c3aba62652f450ee b9bf8c84af8d49acd889c037b6723d64

60
d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -37,49 +37,49 @@
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" target="_top" xlink:title="Utility function that adds a new element at the end of the list."> <g id="a_node3"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
<polygon fill="white" stroke="black" points="69,-98.5 69,-128.5 186,-128.5 186,-98.5 69,-98.5"/> <polygon fill="white" stroke="black" points="69,-147.5 69,-177.5 186,-177.5 186,-147.5 69,-147.5"/>
<text text-anchor="start" x="77" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="77" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="127.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text> <text text-anchor="middle" x="127.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M33.12,-113.5C40.19,-113.5 49.1,-113.5 58.58,-113.5"/> <path fill="none" stroke="midnightblue" d="M33.17,-121.39C43.32,-126.43 56.86,-133.02 69,-138.5 72.61,-140.13 76.37,-141.78 80.16,-143.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.62,-117 68.62,-113.5 58.62,-110 58.62,-117"/> <polygon fill="midnightblue" stroke="midnightblue" points="78.99,-146.73 89.56,-147.44 81.74,-140.29 78.99,-146.73"/>
</g> </g>
<!-- Node6 --> <!-- Node6 -->
<g id="node6" class="node"> <g id="node6" class="node">
<title>Node6</title> <title>Node6</title>
<g id="a_node6"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" target="_top" xlink:title="Utility function for reversing a list."> <g id="a_node6"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" target="_top" xlink:title="Utility function for reversing a list.">
<polygon fill="white" stroke="black" points="69,-49.5 69,-79.5 186,-79.5 186,-49.5 69,-49.5"/> <polygon fill="white" stroke="black" points="69,-98.5 69,-128.5 186,-128.5 186,-98.5 69,-98.5"/>
<text text-anchor="start" x="77" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="77" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="127.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text> <text text-anchor="middle" x="127.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node6 --> <!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge"> <g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title> <title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M33.17,-105.61C43.32,-100.57 56.86,-93.98 69,-88.5 72.61,-86.87 76.37,-85.22 80.16,-83.58"/> <path fill="none" stroke="midnightblue" d="M33.12,-113.5C40.19,-113.5 49.1,-113.5 58.58,-113.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="81.74,-86.71 89.56,-79.56 78.99,-80.27 81.74,-86.71"/> <polygon fill="midnightblue" stroke="midnightblue" points="58.62,-117 68.62,-113.5 58.62,-110 58.62,-117"/>
</g> </g>
<!-- Node7 --> <!-- Node7 -->
<g id="node7" class="node"> <g id="node7" class="node">
<title>Node7</title> <title>Node7</title>
<g id="a_node7"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" target="_top" xlink:title="Utility function to find the top element of the list."> <g id="a_node7"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" target="_top" xlink:title="Utility function to find the top element of the list.">
<polygon fill="white" stroke="black" points="69,-147.5 69,-177.5 186,-177.5 186,-147.5 69,-147.5"/> <polygon fill="white" stroke="black" points="69,-49.5 69,-79.5 186,-79.5 186,-49.5 69,-49.5"/>
<text text-anchor="start" x="77" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="77" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="127.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text> <text text-anchor="middle" x="127.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node7 --> <!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge"> <g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title> <title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M33.23,-120.96C43.4,-125.75 56.95,-132.07 69,-137.5 73.3,-139.44 77.8,-141.44 82.29,-143.42"/> <path fill="none" stroke="midnightblue" d="M33.17,-105.61C43.32,-100.57 56.86,-93.98 69,-88.5 72.61,-86.87 76.37,-85.22 80.16,-83.58"/>
<polygon fill="midnightblue" stroke="midnightblue" points="80.9,-146.63 91.47,-147.44 83.72,-140.22 80.9,-146.63"/> <polygon fill="midnightblue" stroke="midnightblue" points="81.74,-86.71 89.56,-79.56 78.99,-80.27 81.74,-86.71"/>
</g> </g>
<!-- Node8 --> <!-- Node8 -->
<g id="node8" class="node"> <g id="node8" class="node">
@@ -92,7 +92,7 @@
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node8 --> <!-- Node1&#45;&gt;Node8 -->
<g id="edge9" class="edge"> <g id="edge8" class="edge">
<title>Node1&#45;&gt;Node8</title> <title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M22.11,-103.52C29.79,-87.9 46.59,-57.59 69,-39.5 70.58,-38.23 72.23,-37.01 73.95,-35.85"/> <path fill="none" stroke="midnightblue" d="M22.11,-103.52C29.79,-87.9 46.59,-57.59 69,-39.5 70.58,-38.23 72.23,-37.01 73.95,-35.85"/>
<polygon fill="midnightblue" stroke="midnightblue" points="76.1,-38.64 82.9,-30.51 72.52,-32.63 76.1,-38.64"/> <polygon fill="midnightblue" stroke="midnightblue" points="76.1,-38.64 82.9,-30.51 72.52,-32.63 76.1,-38.64"/>
@@ -101,44 +101,38 @@
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty."> <g id="a_node4"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty.">
<polygon fill="white" stroke="black" points="222,-145.5 222,-175.5 339,-175.5 339,-145.5 222,-145.5"/> <polygon fill="white" stroke="black" points="222,-76.5 222,-106.5 339,-106.5 339,-76.5 222,-76.5"/>
<text text-anchor="start" x="230" y="-163.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="230" y="-94.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="280.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text> <text text-anchor="middle" x="280.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node3&#45;&gt;Node4 --> <!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title> <title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M176.69,-128.5C190.99,-132.95 206.81,-137.87 221.66,-142.5"/> <path fill="none" stroke="midnightblue" d="M165.78,-147.39C172.55,-144.52 179.51,-141.48 186,-138.5 204.53,-129.99 224.78,-119.91 241.68,-111.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="220.66,-145.85 231.25,-145.48 222.74,-139.17 220.66,-145.85"/> <polygon fill="midnightblue" stroke="midnightblue" points="243.4,-114.32 250.69,-106.64 240.2,-108.1 243.4,-114.32"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" "> <g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="228,-106 228,-125 333,-125 333,-106 228,-106"/> <polygon fill="white" stroke="black" points="228,-153 228,-172 333,-172 333,-153 228,-153"/>
<text text-anchor="middle" x="280.5" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text> <text text-anchor="middle" x="280.5" y="-160" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node3&#45;&gt;Node5 --> <!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title> <title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M186.02,-114.26C196.27,-114.4 206.99,-114.54 217.36,-114.68"/> <path fill="none" stroke="midnightblue" d="M186.02,-162.5C196.27,-162.5 206.99,-162.5 217.36,-162.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="217.54,-118.18 227.59,-114.81 217.64,-111.18 217.54,-118.18"/> <polygon fill="midnightblue" stroke="midnightblue" points="217.59,-166 227.59,-162.5 217.59,-159 217.59,-166"/>
</g> </g>
<!-- Node7&#45;&gt;Node4 --> <!-- Node7&#45;&gt;Node4 -->
<g id="edge7" class="edge"> <g id="edge7" class="edge">
<title>Node7&#45;&gt;Node4</title> <title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M186.02,-161.74C194.46,-161.63 203.23,-161.51 211.86,-161.4"/> <path fill="none" stroke="midnightblue" d="M186.02,-74.78C194.46,-76.29 203.23,-77.86 211.86,-79.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="211.94,-164.9 221.89,-161.26 211.85,-157.9 211.94,-164.9"/> <polygon fill="midnightblue" stroke="midnightblue" points="211.43,-82.88 221.89,-81.2 212.66,-75.99 211.43,-82.88"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M176.69,-147.5C196.83,-141.23 219.97,-134.03 239.18,-128.05"/>
<polygon fill="midnightblue" stroke="midnightblue" points="240.33,-131.36 248.84,-125.04 238.25,-124.67 240.33,-131.36"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.8 KiB

After

Width:  |  Height:  |  Size: 7.5 KiB

10
d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -2,10 +2,10 @@
<area shape="rect" id="node1" title="Main function." alt="" coords="5,129,56,156"/> <area shape="rect" id="node1" title="Main function." alt="" coords="5,129,56,156"/>
<area shape="rect" id="node2" href="$d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,129,148,156"/> <area shape="rect" id="node2" href="$d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,129,148,156"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="238,5,310,32"/> <area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="238,5,310,32"/>
<area shape="rect" id="node4" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" title="Utility function that adds a new element at the end of the list." alt="" coords="196,122,352,163"/> <area shape="rect" id="node4" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" title="Utility function that adds a new element at the end of the list." alt="" coords="196,57,352,98"/>
<area shape="rect" id="node7" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" title="Utility function for reversing a list." alt="" coords="196,187,352,229"/> <area shape="rect" id="node7" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" title="Utility function for reversing a list." alt="" coords="196,122,352,163"/>
<area shape="rect" id="node8" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" title="Utility function to find the top element of the list." alt="" coords="196,57,352,98"/> <area shape="rect" id="node8" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" title="Utility function to find the top element of the list." alt="" coords="196,187,352,229"/>
<area shape="rect" id="node9" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe" title="Utility function to find the i th element of the list." alt="" coords="196,253,352,294"/> <area shape="rect" id="node9" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#af42071da0067130389cb12fc526ea4fe" title="Utility function to find the i th element of the list." alt="" coords="196,253,352,294"/>
<area shape="rect" id="node5" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="400,59,556,101"/> <area shape="rect" id="node5" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" title="Utility function that checks if the list is empty." alt="" coords="400,151,556,193"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="408,127,548,153"/> <area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="408,64,548,91"/>
</map> </map>

2
d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +1 @@
0e3cda2cc47e596fb649684c4d05a331 220cc9ddae23bd3adb849883aef05ad7

60
d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -52,49 +52,49 @@
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" target="_top" xlink:title="Utility function that adds a new element at the end of the list."> <g id="a_node4"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
<polygon fill="white" stroke="black" points="143,-98.5 143,-128.5 260,-128.5 260,-98.5 143,-98.5"/> <polygon fill="white" stroke="black" points="143,-147.5 143,-177.5 260,-177.5 260,-147.5 143,-147.5"/>
<text text-anchor="start" x="151" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="151" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="201.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text> <text text-anchor="middle" x="201.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node2&#45;&gt;Node4 --> <!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title> <title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107.12,-113.5C114.19,-113.5 123.1,-113.5 132.58,-113.5"/> <path fill="none" stroke="midnightblue" d="M107.17,-121.39C117.32,-126.43 130.86,-133.02 143,-138.5 146.61,-140.13 150.37,-141.78 154.16,-143.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.62,-117 142.62,-113.5 132.62,-110 132.62,-117"/> <polygon fill="midnightblue" stroke="midnightblue" points="152.99,-146.73 163.56,-147.44 155.74,-140.29 152.99,-146.73"/>
</g> </g>
<!-- Node7 --> <!-- Node7 -->
<g id="node7" class="node"> <g id="node7" class="node">
<title>Node7</title> <title>Node7</title>
<g id="a_node7"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" target="_top" xlink:title="Utility function for reversing a list."> <g id="a_node7"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a8b20ca89a0346c8d4193936481528c70" target="_top" xlink:title="Utility function for reversing a list.">
<polygon fill="white" stroke="black" points="143,-49.5 143,-79.5 260,-79.5 260,-49.5 143,-49.5"/> <polygon fill="white" stroke="black" points="143,-98.5 143,-128.5 260,-128.5 260,-98.5 143,-98.5"/>
<text text-anchor="start" x="151" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="151" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="201.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text> <text text-anchor="middle" x="201.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node2&#45;&gt;Node7 --> <!-- Node2&#45;&gt;Node7 -->
<g id="edge6" class="edge"> <g id="edge6" class="edge">
<title>Node2&#45;&gt;Node7</title> <title>Node2&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M107.17,-105.61C117.32,-100.57 130.86,-93.98 143,-88.5 146.61,-86.87 150.37,-85.22 154.16,-83.58"/> <path fill="none" stroke="midnightblue" d="M107.12,-113.5C114.19,-113.5 123.1,-113.5 132.58,-113.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.74,-86.71 163.56,-79.56 152.99,-80.27 155.74,-86.71"/> <polygon fill="midnightblue" stroke="midnightblue" points="132.62,-117 142.62,-113.5 132.62,-110 132.62,-117"/>
</g> </g>
<!-- Node8 --> <!-- Node8 -->
<g id="node8" class="node"> <g id="node8" class="node">
<title>Node8</title> <title>Node8</title>
<g id="a_node8"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" target="_top" xlink:title="Utility function to find the top element of the list."> <g id="a_node8"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ab2d20da40d800897c31a649799d5e43d" target="_top" xlink:title="Utility function to find the top element of the list.">
<polygon fill="white" stroke="black" points="143,-147.5 143,-177.5 260,-177.5 260,-147.5 143,-147.5"/> <polygon fill="white" stroke="black" points="143,-49.5 143,-79.5 260,-79.5 260,-49.5 143,-49.5"/>
<text text-anchor="start" x="151" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="151" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="201.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text> <text text-anchor="middle" x="201.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node2&#45;&gt;Node8 --> <!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge"> <g id="edge7" class="edge">
<title>Node2&#45;&gt;Node8</title> <title>Node2&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M107.23,-120.96C117.4,-125.75 130.95,-132.07 143,-137.5 147.3,-139.44 151.8,-141.44 156.29,-143.42"/> <path fill="none" stroke="midnightblue" d="M107.17,-105.61C117.32,-100.57 130.86,-93.98 143,-88.5 146.61,-86.87 150.37,-85.22 154.16,-83.58"/>
<polygon fill="midnightblue" stroke="midnightblue" points="154.9,-146.63 165.47,-147.44 157.72,-140.22 154.9,-146.63"/> <polygon fill="midnightblue" stroke="midnightblue" points="155.74,-86.71 163.56,-79.56 152.99,-80.27 155.74,-86.71"/>
</g> </g>
<!-- Node9 --> <!-- Node9 -->
<g id="node9" class="node"> <g id="node9" class="node">
@@ -107,7 +107,7 @@
</g> </g>
</g> </g>
<!-- Node2&#45;&gt;Node9 --> <!-- Node2&#45;&gt;Node9 -->
<g id="edge10" class="edge"> <g id="edge9" class="edge">
<title>Node2&#45;&gt;Node9</title> <title>Node2&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M96.11,-103.52C103.79,-87.9 120.59,-57.59 143,-39.5 144.58,-38.23 146.23,-37.01 147.95,-35.85"/> <path fill="none" stroke="midnightblue" d="M96.11,-103.52C103.79,-87.9 120.59,-57.59 143,-39.5 144.58,-38.23 146.23,-37.01 147.95,-35.85"/>
<polygon fill="midnightblue" stroke="midnightblue" points="150.1,-38.64 156.9,-30.51 146.52,-32.63 150.1,-38.64"/> <polygon fill="midnightblue" stroke="midnightblue" points="150.1,-38.64 156.9,-30.51 146.52,-32.63 150.1,-38.64"/>
@@ -116,44 +116,38 @@
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty."> <g id="a_node5"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a" target="_top" xlink:title="Utility function that checks if the list is empty.">
<polygon fill="white" stroke="black" points="296,-145.5 296,-175.5 413,-175.5 413,-145.5 296,-145.5"/> <polygon fill="white" stroke="black" points="296,-76.5 296,-106.5 413,-106.5 413,-76.5 296,-76.5"/>
<text text-anchor="start" x="304" y="-163.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text> <text text-anchor="start" x="304" y="-94.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
<text text-anchor="middle" x="354.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text> <text text-anchor="middle" x="354.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node4&#45;&gt;Node5 --> <!-- Node4&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node4&#45;&gt;Node5</title> <title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M250.69,-128.5C264.99,-132.95 280.81,-137.87 295.66,-142.5"/> <path fill="none" stroke="midnightblue" d="M239.78,-147.39C246.55,-144.52 253.51,-141.48 260,-138.5 278.53,-129.99 298.78,-119.91 315.68,-111.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="294.66,-145.85 305.25,-145.48 296.74,-139.17 294.66,-145.85"/> <polygon fill="midnightblue" stroke="midnightblue" points="317.4,-114.32 324.69,-106.64 314.2,-108.1 317.4,-114.32"/>
</g> </g>
<!-- Node6 --> <!-- Node6 -->
<g id="node6" class="node"> <g id="node6" class="node">
<title>Node6</title> <title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" "> <g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-106 302,-125 407,-125 407,-106 302,-106"/> <polygon fill="white" stroke="black" points="302,-153 302,-172 407,-172 407,-153 302,-153"/>
<text text-anchor="middle" x="354.5" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text> <text text-anchor="middle" x="354.5" y="-160" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node4&#45;&gt;Node6 --> <!-- Node4&#45;&gt;Node6 -->
<g id="edge5" class="edge"> <g id="edge5" class="edge">
<title>Node4&#45;&gt;Node6</title> <title>Node4&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M260.02,-114.26C270.27,-114.4 280.99,-114.54 291.36,-114.68"/> <path fill="none" stroke="midnightblue" d="M260.02,-162.5C270.27,-162.5 280.99,-162.5 291.36,-162.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.54,-118.18 301.59,-114.81 291.64,-111.18 291.54,-118.18"/> <polygon fill="midnightblue" stroke="midnightblue" points="291.59,-166 301.59,-162.5 291.59,-159 291.59,-166"/>
</g> </g>
<!-- Node8&#45;&gt;Node5 --> <!-- Node8&#45;&gt;Node5 -->
<g id="edge8" class="edge"> <g id="edge8" class="edge">
<title>Node8&#45;&gt;Node5</title> <title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M260.02,-161.74C268.46,-161.63 277.23,-161.51 285.86,-161.4"/> <path fill="none" stroke="midnightblue" d="M260.02,-74.78C268.46,-76.29 277.23,-77.86 285.86,-79.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="285.94,-164.9 295.89,-161.26 285.85,-157.9 285.94,-164.9"/> <polygon fill="midnightblue" stroke="midnightblue" points="285.43,-82.88 295.89,-81.2 286.66,-75.99 285.43,-82.88"/>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge9" class="edge">
<title>Node8&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.69,-147.5C270.83,-141.23 293.97,-134.03 313.18,-128.05"/>
<polygon fill="midnightblue" stroke="midnightblue" points="314.33,-131.36 322.84,-125.04 312.25,-124.67 314.33,-131.36"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 8.6 KiB

After

Width:  |  Height:  |  Size: 8.3 KiB

2
d6/d7a/golden__search__extrema_8cpp.html
View File

@@ -233,7 +233,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> prev_mean;</div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> prev_mean;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:111</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:17</div></div> <div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:17</div></div>
<div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div> <div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div> <div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>

2
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html
View File

@@ -292,7 +292,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">return</span> res;</div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> <span class="keywordflow">return</span> res;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div> <div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div> <div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
</div><!-- 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">

2
d8/d72/class_r_btree.html
View File

@@ -575,7 +575,7 @@ Private Attributes</h2></td></tr>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> root-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div> <div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> root-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div> <div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> }</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</div> <div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
d8/d7a/sha1_8cpp.html
View File

@@ -350,7 +350,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">return</span> sig;</div> <div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">return</span> sig;</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span>}</div> <div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span>}</div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div> <div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition:</b> md5.cpp:66</div></div> <div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition:</b> md5.cpp:66</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>

67
d8/d9a/fast__fourier__transform_8cpp.html
View File

@@ -114,7 +114,7 @@ Include dependency graph for fast_fourier_transform.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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>
</table><table class="memberdecls"> </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>
@@ -168,11 +168,11 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<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"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> {</div> <div class="fragment"><div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> {</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <a class="code hl_function" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div> <div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <a class="code hl_function" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// with 2 defined test cases</span></div> <div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span>}</div> <div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span>}</div>
<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:104</div></div> <div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:104</div></div>
</div><!-- 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>
@@ -238,36 +238,37 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {10, 0}, {-2, -2}, {-2, 0}, {-2, 2}}; <span class="comment">/// True Answer for test case 2</span></div> <div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> {10, 0}, {-2, -2}, {-2, 0}, {-2, 2}}; <span class="comment">/// True Answer for test case 2</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div> <div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t1, n1);</div> <div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t1, n1);</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t3=o1; <span class="comment">/// Temporary variable used to delete memory location of o1</span></div> <div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t3 =</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t2, n2);</div> <div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> o1; <span class="comment">/// Temporary variable used to delete memory location of o1</span></div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t4=o2; <span class="comment">/// Temporary variable used to delete memory location of o2</span></div> <div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t2, n2);</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div> <div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t4 =</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> assert((r1[i].real() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div> <div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> o2; <span class="comment">/// Temporary variable used to delete memory location of o2</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> (r1[i].imag() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div> <div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div> <div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> assert((r1[i].real() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment"> /// values for test case 1</span></div> <div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> (r1[i].imag() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment"></span> o1++;</div> <div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div> <div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment"> /// values for test case 1</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> </div> <div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment"></span> o1++;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div> <div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> }</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> assert((r2[i].real() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div> <div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> (r2[i].imag() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div> <div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div> <div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> assert((r2[i].real() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment"> /// values for test case 2</span></div> <div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> (r2[i].imag() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment"></span> o2++;</div> <div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> }</div> <div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment"> /// values for test case 2</span></div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> </div> <div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment"></span> o2++;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> </div> <div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keyword">delete</span>[] t1;</div> <div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keyword">delete</span>[] t2;</div> <div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keyword">delete</span>[] t1;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keyword">delete</span>[] t3;</div> <div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keyword">delete</span>[] t2;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">delete</span>[] t4;</div> <div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">delete</span>[] t3;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div> <div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keyword">delete</span>[] t4;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span>}</div> <div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</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="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div> <div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div> <div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:40</div></div> <div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> fast_fourier_transform.cpp:41</div></div>
<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div> <div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">

2
d8/db1/binomial__calculate_8cpp.html
View File

@@ -187,7 +187,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div> <div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div> <div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>}</div> <div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>

65
d9/d37/inverse__fast__fourier__transform_8cpp.html
View File

@@ -114,7 +114,7 @@ Include dependency graph for inverse_fast_fourier_transform.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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>
</table><table class="memberdecls"> </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>
@@ -168,11 +168,11 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<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"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> {</div> <div class="fragment"><div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> {</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div> <div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// with 2 defined test cases</span></div> <div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span>}</div> <div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>}</div>
<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> inverse_fast_fourier_transform.cpp:100</div></div> <div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> inverse_fast_fourier_transform.cpp:100</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>
@@ -235,33 +235,32 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r2 = {</div> <div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r2 = {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {1, 0}, {2, 0}, {3, 0}, {4, 0}}; <span class="comment">/// True Answer for test case 2</span></div> <div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {1, 0}, {2, 0}, {3, 0}, {4, 0}}; <span class="comment">/// True Answer for test case 2</span></div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div> <div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t1, n1);</div> <div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 =</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div> <div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t1, n1);</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t2, n2);</div> <div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div> <div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 =</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div> <div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t2, n2);</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> assert((r1[i].real() - o1[i].real() &lt; 0.000000000001) &amp;&amp;</div> <div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> </div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> (r1[i].imag() - o1[i].imag() &lt;</div> <div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div> <div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> assert((r1[i].real() - o1[i].real() &lt; 0.000000000001) &amp;&amp;</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span><span class="comment"> /// values for test case 1</span></div> <div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> (r1[i].imag() - o1[i].imag() &lt;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment"></span> </div> <div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> }</div> <div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"> /// values for test case 1</span></div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div> <div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment"></span> }</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div> <div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> assert((r2[i].real() - o2[i].real() &lt; 0.000000000001) &amp;&amp;</div> <div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> (r2[i].imag() - o2[i].imag() &lt;</div> <div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> assert((r2[i].real() - o2[i].real() &lt; 0.000000000001) &amp;&amp;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div> <div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> (r2[i].imag() - o2[i].imag() &lt;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment"> /// values for test case 2</span></div> <div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> 0.000000000001)); <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment"></span> </div> <div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment"> /// values for test case 2</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div> <div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment"></span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> </div> <div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> </div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div> <div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keyword">delete</span>[] t1;</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keyword">delete</span>[] t1;</div> <div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keyword">delete</span>[] t2;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">delete</span>[] t2;</div> <div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">delete</span>[] o1;</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keyword">delete</span>[] o1;</div> <div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keyword">delete</span>[] o2;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keyword">delete</span>[] o2;</div> <div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div> <div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span>}</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</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="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div> <div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> inverse_fast_fourier_transform.cpp:33</div></div> <div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition:</b> inverse_fast_fourier_transform.cpp:33</div></div>

2
d9/d69/median__search_8cpp.html
View File

@@ -267,7 +267,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div> <div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span>}</div> <div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div> <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(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="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>

2
da/d24/sqrt__double_8cpp.html
View File

@@ -195,7 +195,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> }</div> <div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> }</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordflow">return</span> -1;</div> <div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>}</div> <div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
</div><!-- 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">

4
da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html
View File

@@ -181,8 +181,8 @@ size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y); <span class="comment">///&lt; represents minimum value over</span><span class="comment"></span></div> <div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y); <span class="comment">///&lt; represents minimum value over</span><span class="comment"></span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment"> ///&lt; the whole range [l,r]</span></div> <div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment"> ///&lt; the whole range [l,r]</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment"></span> }</div> <div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="comment"></span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a6cf72f93b1551f0d943c585b4f173be3"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">data_structures::sparse_table::Sparse_table::LOG</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; LOG</div><div class="ttdoc">where floor(log2(i)) are precomputed.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:59</div></div> <div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a6cf72f93b1551f0d943c585b4f173be3"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">data_structures::sparse_table::Sparse_table::LOG</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; LOG</div><div class="ttdoc">where floor(log2(i)) are precomputed.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:59</div></div>
<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ab78620742305a35ff2f8d61179f47d3e"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">data_structures::sparse_table::Sparse_table::A</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; A</div><div class="ttdoc">input array to perform RMQ.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:56</div></div> <div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ab78620742305a35ff2f8d61179f47d3e"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">data_structures::sparse_table::Sparse_table::A</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; A</div><div class="ttdoc">input array to perform RMQ.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:56</div></div>
<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad36b9a20fed47b068e407008c04e9f81"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table::ST</a></div><div class="ttdeci">std::array&lt; std::array&lt; int64_t, N &gt;, M &gt; ST</div><div class="ttdoc">the sparse table storing min() values for given interval.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:58</div></div> <div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad36b9a20fed47b068e407008c04e9f81"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table::ST</a></div><div class="ttdeci">std::array&lt; std::array&lt; int64_t, N &gt;, M &gt; ST</div><div class="ttdoc">the sparse table storing min() values for given interval.</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:58</div></div>

2
da/d41/uint128__t_8hpp_source.html
View File

@@ -557,7 +557,7 @@ $(document).ready(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','.
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> tmp &lt;&lt;= left;</div> <div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> tmp &lt;&lt;= left;</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> quotient(0);</div> <div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> quotient(0);</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> zero(0);</div> <div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> zero(0);</div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">while</span> (left &gt;= 0 &amp;&amp; tmp2 &gt;= p) {</div> <div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">while</span> (tmp2 &gt;= p) {</div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div> <div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">if</span> (shf) {</div> <div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">if</span> (shf) {</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> tmp &gt;&gt;= shf;</div> <div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> tmp &gt;&gt;= shf;</div>

2
da/d7b/primality__test_8cpp.html
View File

@@ -153,7 +153,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> }</div> <div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> }</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> <div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>}</div> <div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
da/da3/uint256__t_8hpp_source.html
View File

@@ -524,7 +524,7 @@ $(document).ready(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','.
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> tmp &lt;&lt;= left;</div> <div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> tmp &lt;&lt;= left;</div>
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> quotient(0);</div> <div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> quotient(0);</div>
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);</div> <div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);</div>
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">while</span> (left &gt;= 0 &amp;&amp; tmp2 &gt;= p) {</div> <div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <span class="keywordflow">while</span> (tmp2 &gt;= p) {</div>
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">_lez</a>();</div> <div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">_lez</a>();</div>
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">if</span> (shf) {</div> <div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> <span class="keywordflow">if</span> (shf) {</div>
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> tmp &gt;&gt;= shf;</div> <div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> tmp &gt;&gt;= shf;</div>

2
da/dc3/linked__list_8cpp.html
View File

@@ -261,7 +261,7 @@ Here is the call graph for this function:</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div> <div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:81</div></div> <div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:81</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
<div class="ttc" id="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="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div> <div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div> <div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>

2
da/dc9/fibonacci__matrix__exponentiation_8cpp.html
View File

@@ -217,7 +217,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div> <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> }</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> ((result[0]%mod*Identity[0][0]%mod)%mod+(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[1]%mod*Identity[1][0]%mod)%mod)%mod;</div> <div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> ((result[0]%mod*Identity[0][0]%mod)%mod+(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[1]%mod*Identity[1][0]%mod)%mod)%mod;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>}</div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --> </div><!-- fragment -->

2
da/df2/durand__kerner__roots_8cpp.html
View File

@@ -150,7 +150,7 @@ Functions</h2></td></tr>
<div class="line">1206647803780373360 -3599979517947607200 8037811822645051776</div> <div class="line">1206647803780373360 -3599979517947607200 8037811822645051776</div>
<div class="line">-12870931245150988800 13803759753640704000 -8752948036761600000</div> <div class="line">-12870931245150988800 13803759753640704000 -8752948036761600000</div>
<div class="line">2432902008176640000</div> <div class="line">2432902008176640000</div>
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for IO operations</div></div> <div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
</div><!-- fragment --><p> Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):<br /> </div><!-- fragment --><p> Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):<br />
<img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/numerical_methods/durand_kerner_error.svg" alt="Error evolution during root approximations computed every <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/numerical_methods/durand_kerner_error.svg" alt="Error evolution during root approximations computed every
iteration." style="pointer-events: none;" width="400" class="inline"/> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/numerical_methods/durand_kerner_roots.svg" alt="Roots evolution - shows the initial approximation of the iteration." style="pointer-events: none;" width="400" class="inline"/> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/numerical_methods/durand_kerner_roots.svg" alt="Roots evolution - shows the initial approximation of the

2
db/d01/brent__method__extrema_8cpp.html
View File

@@ -314,7 +314,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span>}</div> <div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:23</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:23</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:111</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div> <div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(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>

2
db/d40/integral__approximation2_8cpp.html
View File

@@ -453,7 +453,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</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"><a id="l00208" name="l00208"></a><span class="lineno"> 208</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"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span>}</div> <div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="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="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:111</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</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="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div> <div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div> <div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>

4
db/d9a/classuint128__t.html
View File

@@ -704,7 +704,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">return</span> r;</div> <div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">return</span> r;</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="preprocessor">#endif</span></div> <div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div> <div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -796,7 +796,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> tmp &lt;&lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">left</a>;</div> <div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> tmp &lt;&lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">left</a>;</div>
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> quotient(0);</div> <div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> quotient(0);</div>
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> zero(0);</div> <div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> zero(0);</div>
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">while</span> (left &gt;= 0 &amp;&amp; tmp2 &gt;= p) {</div> <div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> <span class="keywordflow">while</span> (tmp2 &gt;= p) {</div>
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div> <div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> uint16_t shf = tmp2._lez() - tmp.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div>
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">if</span> (shf) {</div> <div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> <span class="keywordflow">if</span> (shf) {</div>
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> tmp &gt;&gt;= shf;</div> <div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span> tmp &gt;&gt;= shf;</div>

70
dc/d9c/babylonian__method_8cpp.html
View File

@@ -100,19 +100,19 @@ $(document).ready(function(){initNavTree('dc/d9c/babylonian__method_8cpp.html','
<p><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root. <p><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root.
<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;cmath&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
<code>#include &quot;math.h&quot;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for babylonian_method.cpp:</div> Include dependency graph for babylonian_method.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/babylonian__method_8cpp__incl.svg" width="260" height="127"><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="../../d4/d08/babylonian__method_8cpp__incl.svg" width="258" height="127"><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><table class="memberdecls"> </div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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>
</table><table class="memberdecls"> </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>
@@ -166,12 +166,12 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<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"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> {</div> <div class="fragment"><div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> {</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_function" href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div> <div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <a class="code hl_function" href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// with 2 defined test cases</span></div> <div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// with 2 defined test cases</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">return</span> 0;</div> <div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>}</div> <div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span>}</div>
<div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d9c/babylonian__method_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> babylonian_method.cpp:63</div></div> <div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d9c/babylonian__method_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> babylonian_method.cpp:62</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">
@@ -214,35 +214,35 @@ Here is the call graph for this function:</div>
<p >Test result for testcase 2</p> <p >Test result for testcase 2</p>
<p >Testing for test Case 1</p> <p >Testing for test Case 1</p>
<p >Testing for test Case 2</p> <p >Testing for test Case 2</p>
<div class="fragment"><div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> {</div> <div class="fragment"><div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="comment">/* descriptions of the following test */</span></div> <div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">/* descriptions of the following test */</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div> <div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> </div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">auto</span> testcase1 = 125348; <span class="comment">/// Testcase 1</span></div> <div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">auto</span> testcase1 = 125348; <span class="comment">/// Testcase 1</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">auto</span> testcase2 = 752080; <span class="comment">/// Testcase 2</span></div> <div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">auto</span> testcase2 = 752080; <span class="comment">/// Testcase 2</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div> <div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> </div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">auto</span> real_output1 = 354.045194855; <span class="comment">/// Real Output 1</span></div> <div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">auto</span> real_output1 = 354.045194855; <span class="comment">/// Real Output 1</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">auto</span> real_output2 = 867.225460881; <span class="comment">/// Real Output 2</span></div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">auto</span> real_output2 = 867.225460881; <span class="comment">/// Real Output 2</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">auto</span> test_result1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase1);<span class="comment"></span></div> <div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">auto</span> test_result1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase1);<span class="comment"></span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment"> /// Test result for testcase 1</span></div> <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment"> /// Test result for testcase 1</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"></span> <span class="keyword">auto</span> test_result2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase2);<span class="comment"></span></div> <div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment"></span> <span class="keyword">auto</span> test_result2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase2);<span class="comment"></span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"> /// Test result for testcase 2</span></div> <div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> /// Test result for testcase 2</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"></span> </div> <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"></span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result1, real_output1) -</div> <div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result1, real_output1) -</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result1, real_output1) &lt;</div> <div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result1, real_output1) &lt;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> 0.0001);<span class="comment"></span></div> <div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> 0.0001);<span class="comment"></span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"> /// Testing for test Case 1</span></div> <div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment"> /// Testing for test Case 1</span></div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment"></span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result2, real_output2) -</div> <div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"></span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result2, real_output2) -</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result2, real_output2) &lt;</div> <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result2, real_output2) &lt;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> 0.0001);<span class="comment"></span></div> <div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> 0.0001);<span class="comment"></span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"> /// Testing for test Case 2</span></div> <div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment"> /// Testing for test Case 2</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment"></span> </div> <div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"></span> </div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div> <div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span>}</div> <div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</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="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="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="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition:</b> babylonian_method.cpp:31</div></div> <div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition:</b> babylonian_method.cpp:30</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">

4
dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
View File

@@ -228,10 +228,10 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
<div class="line"> <span class="keywordflow">return</span> 0;</div> <div class="line"> <span class="keywordflow">return</span> 0;</div>
<div class="line">}</div> <div class="line">}</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="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:112</div></div> <div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:112</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div> <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for IO operations</div></div> <div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
<div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div> <div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div>
<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_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> rat_maze.cpp:86</div></div> <div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_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> rat_maze.cpp:86</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div> <div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>

2
dd/d29/false__position_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for false_position.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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:df/dea/namespacefalse__position"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dea/namespacefalse__position.html">false_position</a></td></tr> <tr class="memitem:df/dea/namespacefalse__position"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dea/namespacefalse__position.html">false_position</a></td></tr>
<tr class="memdesc:df/dea/namespacefalse__position"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">False Position</a> method. <br /></td></tr> <tr class="memdesc:df/dea/namespacefalse__position"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">False Position</a> method. <br /></td></tr>

2
de/d75/qr__eigen__values_8cpp.html
View File

@@ -361,7 +361,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div> <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> }</div> <div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> }</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span>}</div> <div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div> <div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>

2
de/d9b/prime__numbers_8cpp.html
View File

@@ -193,7 +193,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> }</div> <div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> }</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">return</span> res;</div> <div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">return</span> res;</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span>}</div> <div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div> <div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(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="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><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">

2
df/d11/midpoint__integral__method_8cpp.html
View File

@@ -116,7 +116,7 @@ Include dependency graph for midpoint_integral_method.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr> <tr class="memitem:d1/de0/namespacenumerical__methods"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
<tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr> <tr class="memdesc:d1/de0/namespacenumerical__methods"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert <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:d9/daa/namespacemidpoint__rule"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/daa/namespacemidpoint__rule.html">midpoint_rule</a></td></tr> <tr class="memitem:d9/daa/namespacemidpoint__rule"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/daa/namespacemidpoint__rule.html">midpoint_rule</a></td></tr>
<tr class="memdesc:d9/daa/namespacemidpoint__rule"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">Midpoint Integral</a> method implementation. <br /></td></tr> <tr class="memdesc:d9/daa/namespacemidpoint__rule"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">Midpoint Integral</a> method implementation. <br /></td></tr>

2
df/d82/breadth__first__search_8cpp.html
View File

@@ -198,7 +198,7 @@ Functions</h2></td></tr>
<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="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:139</div></div> <div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:139</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:64</div></div> <div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:64</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:113</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div>
<div class="ttc" id="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><!-- 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>

2
df/dce/namespacegraph.html
View File

@@ -858,7 +858,7 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> min_path;</div> <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> min_path;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div> <div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div> <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:115</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="anext_permutation_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/next_permutation.html">std::next_permutation</a></div><div class="ttdeci">T next_permutation(T... args)</div></div> <div class="ttc" id="anext_permutation_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/next_permutation.html">std::next_permutation</a></div><div class="ttdeci">T next_permutation(T... args)</div></div>

2
df/dd5/binary__search_8cpp.html
View File

@@ -172,7 +172,7 @@ Functions</h2></td></tr>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> }</div> <div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> }</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> -1;</div> <div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>}</div> <div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>}</div>
<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:117</div></div> <div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition:</b> composite_simpson_rule.cpp:119</div></div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>

2
namespaces.html
View File

@@ -233,7 +233,7 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d14/namespacen__queens__optimized.html" target="_self">n_queens_optimized</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized </td></tr> <tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d14/namespacen__queens__optimized.html" target="_self">n_queens_optimized</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle optimized </td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr> <tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr> <tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For IO operations </td></tr> <tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For assert </td></tr>
<tr id="row_75_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_75_" class="arrow" onclick="toggleFolder('75_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr> <tr id="row_75_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_75_" class="arrow" onclick="toggleFolder('75_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_75_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_75_0_" class="arrow" onclick="toggleFolder('75_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</b></td><td class="desc"></td></tr> <tr id="row_75_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_75_0_" class="arrow" onclick="toggleFolder('75_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</b></td><td class="desc"></td></tr>
<tr id="row_75_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr> <tr id="row_75_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>