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

Documentation for 652c2d2650

Browse Source
This commit is contained in:
github-actions
2021-07-18 05:07:11 +00:00
parent 364c891304
commit cbca3ec1a9
374 changed files with 9709 additions and 7357 deletions
Download Patch File Download Diff File Expand all files Collapse all files

381
d5/d58/class_test_cases.html
View File

@@ -108,6 +108,18 @@ Public Member Functions</h2></td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, printing inorder successor of last node. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 100 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">More...</a><br /></td></tr>
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 50 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">More...</a><br /></td></tr>
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, Only contains one element. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
@@ -137,6 +149,10 @@ Private Member Functions</h2></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print64_t given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -145,7 +161,56 @@ Private Member Functions</h2></td></tr>
<p>a class containing the necessary test cases </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::log </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>msg</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A function to print given message on console. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>Type of the given message. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="240" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -182,8 +247,6 @@ template&lt;typename T &gt; </div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -194,7 +257,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -241,7 +304,55 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::runTests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Executes test cases. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; {</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; }</div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:233</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:304</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:259</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:345</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -275,21 +386,17 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:161</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:229</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, Only contains one element.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:186</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:280</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -326,14 +433,98 @@ Here is the call graph for this function:</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case contains edge case, printing inorder successor of last node. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; {</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keyword">const</span> <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; *expectedOutput = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; </div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Printing inorder successor for last node in the &quot;</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="stringliteral">&quot;BST, Output will be nullptr.&quot;</span>);</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; </div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; </div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; root,</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; </div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; root, 78); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; </div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; assert(inorderSuccessor == expectedOutput);</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; </div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; </div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:56</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:136</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:210</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_ad0ca93be4f9576bfb715a4864a30dbee"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:155</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; int64_t &gt;</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -403,7 +594,6 @@ Here is the call graph for this function:</div>
<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:47</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:100</div></div>
<div class="ttc" id="asublist__search_8cpp_html_ab4054b9ab80a5e609b6fcdf70f2e03b9"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:73</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; uint64_t &gt;</a></div></div>
<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:60</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -415,7 +605,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -478,7 +668,83 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case which contains main list of 100 elements and sublist of 20. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160; {</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160; </div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; </div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; </div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; root,</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; </div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; </div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; root, 20); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; </div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; assert(inorderSuccessor-&gt;<a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; </div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160; </div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:58</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -565,7 +831,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -623,7 +889,83 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case which contains main list of 50 elements and sublist of 20. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; {</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; </div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; </div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160; 89, 67, 32, 56, 90, 123, 120,</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; 110, 115, 6, 78, 7, 10}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; </div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; root,</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160; </div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; </div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; root, 90); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; </div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; assert(inorderSuccessor-&gt;<a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; </div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; </div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -707,7 +1049,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -765,6 +1107,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
<li>sorting/<a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></li>
</ul>

5
d5/d58/class_test_cases.js
View File

@@ -2,12 +2,17 @@ var class_test_cases =
[
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ]
];

2
d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
View File

@@ -1 +1 @@
1c08d6b3e3782565f00093e119013062
000c898a3efaff2713f4eddb852e41a5

2
d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
View File

@@ -1 +1 @@
84a86e24872617ba76e94e51175788bf
d234549112c906856fcde395a7e7d284

13
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
View File

@@ -1,9 +1,8 @@
<map id="TestCases::runTests" name="TestCases::runTests">
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,57,148,83"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="607,6,679,33"/>
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="426,57,535,83"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="196,57,355,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,107,355,134"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,158,355,185"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="403,158,559,185"/>
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,56,148,83"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="560,5,632,32"/>
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="403,56,512,83"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="196,56,355,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,107,355,133"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,157,355,184"/>
</map>

2
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
View File

@@ -1 +1 @@
bd8192faa178b06571faac8394dab3ce
bd1bab0f5d5cbce6fcd79c7b2695d544

145
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
View File

@@ -4,57 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: TestCases::runTests Pages: 1 -->
<!--zoomable 143 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 513;
var viewHeight = 143;
var sectionId = 'dynsection-2';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<svg width="478pt" height="142pt"
viewBox="0.00 0.00 478.00 142.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 138)">
<title>TestCases::runTests</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 474,-138 474,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -68,36 +22,36 @@ var sectionId = 'dynsection-2';
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="416,-114.5 416,-133.5 470,-133.5 470,-114.5 416,-114.5"/>
<text text-anchor="middle" x="443" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M72.88,-95.58C90.37,-104.13 117.71,-116.05 143,-121 236.09,-139.22 348.62,-132.96 405.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="406.05,-131.34 415.68,-126.92 405.4,-124.37 406.05,-131.34"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 397.5,-95.5 397.5,-76.5 315.5,-76.5"/>
<text text-anchor="middle" x="356.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="298,-76.5 298,-95.5 380,-95.5 380,-76.5 298,-76.5"/>
<text text-anchor="middle" x="339" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</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="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.38,-110.29 262,-105 277,-103.49 293.15,-100.65 307.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.51,-101.04 317.55,-95.51 307.04,-94.19 308.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.51,-111.46 262,-105 273.69,-103.56 286.17,-100.92 297.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.48,-101.44 307.26,-95.51 296.7,-94.67 298.48,-101.44"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 262,-95.5 262,-76.5 143,-76.5"/>
<text text-anchor="middle" x="202.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -142,83 +96,26 @@ var sectionId = 'dynsection-2';
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M387.65,-95.59C403.95,-100.77 424.18,-107.21 441.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="440.32,-116.01 450.91,-115.7 442.44,-109.34 440.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M365.74,-95.59C378.18,-100.22 393.31,-105.86 406.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="405.68,-114.2 416.27,-114.41 408.12,-107.64 405.68,-114.2"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M262.27,-86C276.38,-86 291.33,-86 305.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="305.23,-89.5 315.22,-86 305.22,-82.5 305.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M262.1,-86C270.56,-86 279.21,-86 287.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.76,-89.5 297.76,-86 287.76,-82.5 287.76,-89.5"/>
</g>
<!-- Node5&#45;&gt;Node3 -->
<g id="edge7" class="edge">
<title>Node5&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M241.86,-57.59C261.82,-62.58 286.43,-68.73 307.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.87,-77.45 317.42,-76.48 308.57,-70.66 306.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M237.44,-57.59C254.72,-62.47 275.93,-68.46 294.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="293.5,-77.06 304.07,-76.41 295.4,-70.33 293.5,-77.06"/>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge9" class="edge">
<title>Node6&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M237.43,-19.54C245.61,-22.24 254.24,-25.43 262,-29 287.83,-40.87 315.39,-58.32 333.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="331.89,-73.69 342.12,-76.45 335.85,-67.92 331.89,-73.69"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="298,-0.5 298,-19.5 415,-19.5 415,-0.5 298,-0.5"/>
<text text-anchor="middle" x="356.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge10" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M262.27,-10C270.58,-10 279.19,-10 287.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.89,-13.5 297.89,-10 287.89,-6.5 287.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M239.22,-19.53C246.93,-22.15 254.89,-25.31 262,-29 283.29,-40.05 304.92,-56.95 319.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="317.6,-72.35 327.44,-76.27 322.2,-67.07 317.6,-72.35"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 12 KiB

After

Width:  |  Height:  |  Size: 6.2 KiB

136
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
View File

@@ -1,136 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: TestCases::runTests Pages: 1 -->
<svg width="513pt" height="143pt"
viewBox="0.00 0.00 513.00 142.53" 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 138.53)">
<title>TestCases::runTests</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Executes test cases.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 107,-95.5 107,-76.5 0,-76.5"/>
<text text-anchor="middle" x="53.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 397.5,-95.5 397.5,-76.5 315.5,-76.5"/>
<text text-anchor="middle" x="356.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</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="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.38,-110.29 262,-105 277,-103.49 293.15,-100.65 307.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.51,-101.04 317.55,-95.51 307.04,-94.19 308.51,-101.04"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 262,-95.5 262,-76.5 143,-76.5"/>
<text text-anchor="middle" x="202.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107.16,-86C115.5,-86 124.24,-86 132.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.98,-89.5 142.98,-86 132.98,-82.5 132.98,-89.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 262,-57.5 262,-38.5 143,-38.5"/>
<text text-anchor="middle" x="202.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M91.59,-76.41C110.82,-71.44 134.49,-65.32 154.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.87,-63.41 164.67,-57.52 154.11,-56.63 155.87,-63.41"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 262,-19.5 262,-0.5 143,-0.5"/>
<text text-anchor="middle" x="202.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge8" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M67.08,-76.4C83.71,-64.07 114.27,-42.63 143,-29 147.64,-26.8 152.61,-24.75 157.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="158.93,-26.12 167.2,-19.5 156.61,-19.52 158.93,-26.12"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M387.65,-95.59C403.95,-100.77 424.18,-107.21 441.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="440.32,-116.01 450.91,-115.7 442.44,-109.34 440.32,-116.01"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M262.27,-86C276.38,-86 291.33,-86 305.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="305.23,-89.5 315.22,-86 305.22,-82.5 305.23,-89.5"/>
</g>
<!-- Node5&#45;&gt;Node3 -->
<g id="edge7" class="edge">
<title>Node5&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M241.86,-57.59C261.82,-62.58 286.43,-68.73 307.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.87,-77.45 317.42,-76.48 308.57,-70.66 306.87,-77.45"/>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge9" class="edge">
<title>Node6&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M237.43,-19.54C245.61,-22.24 254.24,-25.43 262,-29 287.83,-40.87 315.39,-58.32 333.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="331.89,-73.69 342.12,-76.45 335.85,-67.92 331.89,-73.69"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="298,-0.5 298,-19.5 415,-19.5 415,-0.5 298,-0.5"/>
<text text-anchor="middle" x="356.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge10" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M262.27,-10C270.58,-10 279.19,-10 287.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.89,-13.5 297.89,-10 287.89,-6.5 287.89,-13.5"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.0 KiB