backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-30 16:51:57 +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

58
d6/d05/reverse__a__linked__list_8cpp.html
View File

@@ -163,11 +163,11 @@ Algorithm</h3>
<p>Main function. </p>
<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="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="l00207" name="l00207"></a><span class="lineno"> 207</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="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="fragment"><div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</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="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keywordflow">return</span> 0;</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:173</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -202,36 +202,36 @@ Here is the call graph for this function:</div>
<p>Self-test implementations. </p>
<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="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="l00179" name="l00179"></a><span class="lineno"> 179</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="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="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="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="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="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="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="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="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="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="l00190" name="l00190"></a><span class="lineno"> 190</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="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="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="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="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="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="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="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="l00199" name="l00199"></a><span class="lineno"> 199</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="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="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// 1st test</span></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="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="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="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="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="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="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="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="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="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="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Reversal Testing</span></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="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="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="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="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="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="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="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="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="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_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_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><!-- fragment --><div class="dynheader">
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">
<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="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="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="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="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,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,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="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="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="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,64,449,91"/>
</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">
<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.">
<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="-116.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>
<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="-165.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::insert</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="M33.12,-113.5C40.19,-113.5 49.1,-113.5 58.58,-113.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.62,-117 68.62,-113.5 58.62,-110 58.62,-117"/>
<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="78.99,-146.73 89.56,-147.44 81.74,-140.29 78.99,-146.73"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<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.">
<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="-67.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>
<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="-116.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::reverseList</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="81.74,-86.71 89.56,-79.56 78.99,-80.27 81.74,-86.71"/>
<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="58.62,-117 68.62,-113.5 58.62,-110 58.62,-117"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<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.">
<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="-165.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>
<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="-67.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::top</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="80.9,-146.63 91.47,-147.44 83.72,-140.22 80.9,-146.63"/>
<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="81.74,-86.71 89.56,-79.56 78.99,-80.27 81.74,-86.71"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
@@ -92,7 +92,7 @@
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge9" class="edge">
<g id="edge8" class="edge">
<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"/>
<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">
<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.">
<polygon fill="white" stroke="black" points="222,-145.5 222,-175.5 339,-175.5 339,-145.5 222,-145.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="middle" x="280.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
<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="-94.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</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>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="220.66,-145.85 231.25,-145.48 222.74,-139.17 220.66,-145.85"/>
<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="243.4,-114.32 250.69,-106.64 240.2,-108.1 243.4,-114.32"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="228,-106 228,-125 333,-125 333,-106 228,-106"/>
<text text-anchor="middle" x="280.5" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
<polygon fill="white" stroke="black" points="228,-153 228,-172 333,-172 333,-153 228,-153"/>
<text text-anchor="middle" x="280.5" y="-160" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="217.54,-118.18 227.59,-114.81 217.64,-111.18 217.54,-118.18"/>
<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.59,-166 227.59,-162.5 217.59,-159 217.59,-166"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge7" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="211.94,-164.9 221.89,-161.26 211.85,-157.9 211.94,-164.9"/>
</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"/>
<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.43,-82.88 221.89,-81.2 212.66,-75.99 211.43,-82.88"/>
</g>
</g>
</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="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="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="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="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="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,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,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="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="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="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,64,548,91"/>
</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">
<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.">
<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="-116.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>
<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="-165.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::insert</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.62,-117 142.62,-113.5 132.62,-110 132.62,-117"/>
<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="152.99,-146.73 163.56,-147.44 155.74,-140.29 152.99,-146.73"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<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.">
<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="-67.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>
<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="-116.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::reverseList</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.74,-86.71 163.56,-79.56 152.99,-80.27 155.74,-86.71"/>
<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="132.62,-117 142.62,-113.5 132.62,-110 132.62,-117"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<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.">
<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="-165.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>
<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="-67.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::top</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="154.9,-146.63 165.47,-147.44 157.72,-140.22 154.9,-146.63"/>
<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="155.74,-86.71 163.56,-79.56 152.99,-80.27 155.74,-86.71"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
@@ -107,7 +107,7 @@
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge10" class="edge">
<g id="edge9" class="edge">
<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"/>
<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">
<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.">
<polygon fill="white" stroke="black" points="296,-145.5 296,-175.5 413,-175.5 413,-145.5 296,-145.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="middle" x="354.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
<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="-94.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</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>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="294.66,-145.85 305.25,-145.48 296.74,-139.17 294.66,-145.85"/>
<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="317.4,-114.32 324.69,-106.64 314.2,-108.1 317.4,-114.32"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</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"/>
<text text-anchor="middle" x="354.5" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
<polygon fill="white" stroke="black" points="302,-153 302,-172 407,-172 407,-153 302,-153"/>
<text text-anchor="middle" x="354.5" y="-160" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.54,-118.18 301.59,-114.81 291.64,-111.18 291.54,-118.18"/>
<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.59,-166 301.59,-162.5 291.59,-159 291.59,-166"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<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"/>
<polygon fill="midnightblue" stroke="midnightblue" points="285.94,-164.9 295.89,-161.26 285.85,-157.9 285.94,-164.9"/>
</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"/>
<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.43,-82.88 295.89,-81.2 286.66,-75.99 285.43,-82.88"/>
</g>
</g>
</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="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="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="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>

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="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="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">
Here is the call graph for this function:</div>
<div class="dyncontent">