mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
1141 lines
106 KiB
HTML
1141 lines
106 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.9.5"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: TestCases Class Reference</title>
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../resize.js"></script>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/x-mathjax-config">
|
|
MathJax.Hub.Config({
|
|
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
|
jax: ["input/TeX","output/HTML-CSS"],
|
|
});
|
|
</script>
|
|
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectalign">
|
|
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.5 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="summary">
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
<a href="../../d9/d2c/class_test_cases-members.html">List of all members</a> </div>
|
|
<div class="headertitle"><div class="title">TestCases Class Reference</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
|
|
<p>class encapsulating the necessary test cases
|
|
<a href="../../d5/d58/class_test_cases.html#details">More...</a></p>
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
|
|
Public Member Functions</h2></td></tr>
|
|
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void </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"> </td><td class="mdescRight">A test case with single input. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
|
|
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void </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"> </td><td class="mdescRight">A test case with input array of length 500. <a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">More...</a><br /></td></tr>
|
|
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void </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"> </td><td class="mdescRight">A test case with array of length 1000. <a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">More...</a><br /></td></tr>
|
|
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
|
|
Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
|
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void </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"> </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"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><p >class encapsulating the necessary test cases </p>
|
|
<p >a class containing the necessary test cases </p>
|
|
</div><h2 class="groupheader">Member Function Documentation</h2>
|
|
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log() <span class="overload">[1/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T > </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 </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"><span class="lineno"> 233</span> {</div>
|
|
<div class="line"><span class="lineno"> 234</span> <span class="comment">// It's just to avoid writing cout and endl</span></div>
|
|
<div class="line"><span class="lineno"> 235</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TESTS] : ---> "</span> << msg << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 236</span> }</div>
|
|
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
|
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
|
</div><!-- 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="242" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log() <span class="overload">[2/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T > </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 </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"><span class="lineno"> 161</span> {</div>
|
|
<div class="line"><span class="lineno"> 162</span> <span class="comment">// It's just to avoid writing cout and endl</span></div>
|
|
<div class="line"><span class="lineno"> 163</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TESTS] : ---> "</span> << msg << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 164</span> }</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="242" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log() <span class="overload">[3/3]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<typename T > </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 </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 print64_t 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"><span class="lineno"> 189</span> {</div>
|
|
<div class="line"><span class="lineno"> 190</span> <span class="comment">// It's just to avoid writing cout and endl</span></div>
|
|
<div class="line"><span class="lineno"> 191</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TESTS] : ---> "</span> << msg << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 192</span> }</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="242" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</div>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="aeabea90c02f9159e4a784bbf736e1e23" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </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"><span class="lineno"> 243</span> {</div>
|
|
<div class="line"><span class="lineno"> 244</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running Tests..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 245</span> </div>
|
|
<div class="line"><span class="lineno"> 246</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
|
|
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
|
|
<div class="line"><span class="lineno"> 248</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
|
|
<div class="line"><span class="lineno"> 249</span> </div>
|
|
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Test Cases over!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 251</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 252</span> }</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="640" height="223"><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" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </a></span>runTests() <span class="overload">[2/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"><span class="lineno"> 171</span> {</div>
|
|
<div class="line"><span class="lineno"> 172</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running Tests..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 173</span> </div>
|
|
<div class="line"><span class="lineno"> 174</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
|
|
<div class="line"><span class="lineno"> 175</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
|
|
<div class="line"><span class="lineno"> 176</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
|
|
<div class="line"><span class="lineno"> 177</span> </div>
|
|
<div class="line"><span class="lineno"> 178</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Test Cases over!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 179</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 180</span> }</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="640" height="223"><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" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </a></span>runTests() <span class="overload">[3/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"><span class="lineno"> 199</span> {</div>
|
|
<div class="line"><span class="lineno"> 200</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running Tests..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 201</span> </div>
|
|
<div class="line"><span class="lineno"> 202</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
|
|
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
|
|
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
|
|
<div class="line"><span class="lineno"> 205</span> </div>
|
|
<div class="line"><span class="lineno"> 206</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Test Cases over!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 207</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 208</span> }</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="640" height="223"><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" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </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 >< Expected output of this test</p>
|
|
<p >< Data to make nodes in BST</p>
|
|
<p >< Adding nodes to BST</p>
|
|
<p >< Printing inorder to cross-verify.</p>
|
|
<p >< The inorder successor node for given data</p>
|
|
<p >memory cleanup!</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 259</span> {</div>
|
|
<div class="line"><span class="lineno"> 260</span> <span class="keyword">const</span> <a class="code hl_class" 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"><span class="lineno"> 261</span> *expectedOutput = <span class="keyword">nullptr</span>; <span class="comment">///< Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 262</span> </div>
|
|
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 264</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 1 : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" EDGE CASE : Printing inorder successor for last node in the "</span></div>
|
|
<div class="line"><span class="lineno"> 267</span> <span class="stringliteral">"BST, Output will be nullptr."</span>);</div>
|
|
<div class="line"><span class="lineno"> 268</span> </div>
|
|
<div class="line"><span class="lineno"> 269</span> <a class="code hl_class" 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"><span class="lineno"> 270</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><span class="lineno"> 271</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> node_data{</div>
|
|
<div class="line"><span class="lineno"> 272</span> 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///< Data to make nodes in BST</span></div>
|
|
<div class="line"><span class="lineno"> 273</span> </div>
|
|
<div class="line"><span class="lineno"> 274</span> root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
|
|
<div class="line"><span class="lineno"> 275</span> root,</div>
|
|
<div class="line"><span class="lineno"> 276</span> node_data); <span class="comment">///< Adding nodes to BST</span></div>
|
|
<div class="line"><span class="lineno"> 277</span> </div>
|
|
<div class="line"><span class="lineno"> 278</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Inorder sequence is : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 279</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
|
|
<div class="line"><span class="lineno"> 280</span> root); <span class="comment">///< Printing inorder to cross-verify.</span></div>
|
|
<div class="line"><span class="lineno"> 281</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 282</span> </div>
|
|
<div class="line"><span class="lineno"> 283</span> <a class="code hl_class" 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"><span class="lineno"> 284</span> *inorderSuccessor = operations_on_datastructures::</div>
|
|
<div class="line"><span class="lineno"> 285</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
|
|
<div class="line"><span class="lineno"> 286</span> root, 78); <span class="comment">///< The inorder successor node for given data</span></div>
|
|
<div class="line"><span class="lineno"> 287</span> </div>
|
|
<div class="line"><span class="lineno"> 288</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 289</span> assert(inorderSuccessor == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 290</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 291</span> </div>
|
|
<div class="line"><span class="lineno"> 292</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
|
|
<div class="line"><span class="lineno"> 293</span> root); <span class="comment">/// memory cleanup!</span></div>
|
|
<div class="line"><span class="lineno"> 294</span> </div>
|
|
<div class="line"><span class="lineno"> 295</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 1 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 297</span> }</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_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector< int64_t > &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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
|
</div><!-- fragment --><div class="dynheader">
|
|
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="450" height="135"><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" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </a></span>testCase_1() <span class="overload">[2/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, Only contains one element. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
<p >< Expected output of this test</p>
|
|
<p >< Data to make linked list which will be the sublist</p>
|
|
<p >< Data to make linked list which will be the main list</p>
|
|
<p >< Sublist to be searched</p>
|
|
<p >< Main list in which sublist is to be searched</p>
|
|
<p >< boolean, if sublist exist or not</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 186</span> {</div>
|
|
<div class="line"><span class="lineno"> 187</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">///< Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 188</span> </div>
|
|
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 190</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 191</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 1 for sublist search Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" EDGE CASE : Only contains one element"</span>);</div>
|
|
<div class="line"><span class="lineno"> 194</span> </div>
|
|
<div class="line"><span class="lineno"> 195</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData = {</div>
|
|
<div class="line"><span class="lineno"> 196</span> 6}; <span class="comment">///< Data to make linked list which will be the sublist</span></div>
|
|
<div class="line"><span class="lineno"> 197</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData = {</div>
|
|
<div class="line"><span class="lineno"> 198</span> 2, 5, 6, 7,</div>
|
|
<div class="line"><span class="lineno"> 199</span> 8}; <span class="comment">///< Data to make linked list which will be the main list</span></div>
|
|
<div class="line"><span class="lineno"> 200</span> </div>
|
|
<div class="line"><span class="lineno"> 201</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
|
<div class="line"><span class="lineno"> 202</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 203</span> sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 204</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
|
<div class="line"><span class="lineno"> 205</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 206</span> mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 207</span><span class="comment"> ///< searched</span></div>
|
|
<div class="line"><span class="lineno"> 208</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 209</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
|
<div class="line"><span class="lineno"> 210</span> sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
|
<div class="line"><span class="lineno"> 211</span> </div>
|
|
<div class="line"><span class="lineno"> 212</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 213</span> assert(exists == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 214</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 215</span> </div>
|
|
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 1 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 217</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 218</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 219</span> </div>
|
|
<div class="line"><span class="lineno"> 220</span> <span class="keyword">delete</span> (sublistLL);</div>
|
|
<div class="line"><span class="lineno"> 221</span> <span class="keyword">delete</span> (mainlistLL);</div>
|
|
<div class="line"><span class="lineno"> 222</span> }</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_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector< uint64_t > &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="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 &str, const std::unordered_set< std::string > &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>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="450" height="135"><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" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </a></span>testCase_1() <span class="overload">[3/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 with single input. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 214</span> {</div>
|
|
<div class="line"><span class="lineno"> 215</span> <span class="keyword">const</span> int64_t inputSize = 1;</div>
|
|
<div class="line"><span class="lineno"> 216</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 217</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 218</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 1 for Random Pivot Quick Sort Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 219</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" EDGE CASE : Only contains one element"</span>);</div>
|
|
<div class="line"><span class="lineno"> 221</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int64_t, inputSize></a> unsorted_arr{2};</div>
|
|
<div class="line"><span class="lineno"> 222</span> </div>
|
|
<div class="line"><span class="lineno"> 223</span> int64_t start = 0;</div>
|
|
<div class="line"><span class="lineno"> 224</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.size() - 1; <span class="comment">// length - 1</span></div>
|
|
<div class="line"><span class="lineno"> 225</span> </div>
|
|
<div class="line"><span class="lineno"> 226</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running algorithm of data of length 50 ..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 227</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a><int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()> sorted_arr =</div>
|
|
<div class="line"><span class="lineno"> 228</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
|
|
<div class="line"><span class="lineno"> 229</span> end);</div>
|
|
<div class="line"><span class="lineno"> 230</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Algorithm finished!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 231</span> </div>
|
|
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 233</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
|
|
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 235</span> </div>
|
|
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 1 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 238</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 239</span> }</div>
|
|
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
|
|
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
|
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
|
|
<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array< int64_t, size > quickSortRP(std::array< int64_t, size > arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:130</div></div>
|
|
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(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_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="450" height="135"><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" name="abae0148985f159b582a385cf399254e3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </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 >< Expected output of this test</p>
|
|
<p >< Data to make nodes in BST</p>
|
|
<p >< Adding nodes to BST</p>
|
|
<p >< Printing inorder to cross-verify.</p>
|
|
<p >< The inorder successor node for given data</p>
|
|
<p >memory cleanup!</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 304</span> {</div>
|
|
<div class="line"><span class="lineno"> 305</span> <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21; <span class="comment">///< Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 306</span> </div>
|
|
<div class="line"><span class="lineno"> 307</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 308</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 2 : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 309</span> </div>
|
|
<div class="line"><span class="lineno"> 310</span> <a class="code hl_class" 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"><span class="lineno"> 311</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><span class="lineno"> 312</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> node_data{</div>
|
|
<div class="line"><span class="lineno"> 313</span> 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///< Data to make nodes in BST</span></div>
|
|
<div class="line"><span class="lineno"> 314</span> </div>
|
|
<div class="line"><span class="lineno"> 315</span> root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
|
|
<div class="line"><span class="lineno"> 316</span> root,</div>
|
|
<div class="line"><span class="lineno"> 317</span> node_data); <span class="comment">///< Adding nodes to BST</span></div>
|
|
<div class="line"><span class="lineno"> 318</span> </div>
|
|
<div class="line"><span class="lineno"> 319</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Inorder sequence is : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 320</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
|
|
<div class="line"><span class="lineno"> 321</span> root); <span class="comment">///< Printing inorder to cross-verify.</span></div>
|
|
<div class="line"><span class="lineno"> 322</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 323</span> </div>
|
|
<div class="line"><span class="lineno"> 324</span> <a class="code hl_class" 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"><span class="lineno"> 325</span> *inorderSuccessor = operations_on_datastructures::</div>
|
|
<div class="line"><span class="lineno"> 326</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
|
|
<div class="line"><span class="lineno"> 327</span> root, 20); <span class="comment">///< The inorder successor node for given data</span></div>
|
|
<div class="line"><span class="lineno"> 328</span> </div>
|
|
<div class="line"><span class="lineno"> 329</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 330</span> assert(inorderSuccessor-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 331</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 332</span> </div>
|
|
<div class="line"><span class="lineno"> 333</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
|
|
<div class="line"><span class="lineno"> 334</span> root); <span class="comment">/// memory cleanup!</span></div>
|
|
<div class="line"><span class="lineno"> 335</span> </div>
|
|
<div class="line"><span class="lineno"> 336</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 2 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 337</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 338</span> }</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="450" height="135"><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" name="abae0148985f159b582a385cf399254e3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </a></span>testCase_2() <span class="overload">[2/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 >Expected output of this test</p>
|
|
<p >< Data to make linked list which will be the sublist</p>
|
|
<p >< Main list in which sublist is to be searched</p>
|
|
<p >Inserts 100 elements in main list</p>
|
|
<p >Inserts 20 elements in sublist</p>
|
|
<p >< Sublist to be searched</p>
|
|
<p >< Main list in which sublist is to be searched</p>
|
|
<p >< boolean, if sublist exist or not</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 229</span> {</div>
|
|
<div class="line"><span class="lineno"> 230</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">/// Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 231</span> </div>
|
|
<div class="line"><span class="lineno"> 232</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 233</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 234</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 2 for sublist search Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 235</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 236</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" contains main list of 100 elements and sublist of 20"</span>);</div>
|
|
<div class="line"><span class="lineno"> 237</span> </div>
|
|
<div class="line"><span class="lineno"> 238</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData(</div>
|
|
<div class="line"><span class="lineno"> 239</span> 20); <span class="comment">///< Data to make linked list which will be the sublist</span></div>
|
|
<div class="line"><span class="lineno"> 240</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData(</div>
|
|
<div class="line"><span class="lineno"> 241</span> 100); <span class="comment">///< Main list in which sublist is to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 242</span> </div>
|
|
<div class="line"><span class="lineno"> 243</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 100; i++) {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 244</span><span class="comment"> /// Inserts 100 elements in main list</span></div>
|
|
<div class="line"><span class="lineno"> 245</span><span class="comment"></span> mainlistData[i] = i + 1;</div>
|
|
<div class="line"><span class="lineno"> 246</span> }</div>
|
|
<div class="line"><span class="lineno"> 247</span> </div>
|
|
<div class="line"><span class="lineno"> 248</span> <span class="keywordtype">int</span> temp = 0;</div>
|
|
<div class="line"><span class="lineno"> 249</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i < 65; i++) {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 250</span><span class="comment"> /// Inserts 20 elements in sublist</span></div>
|
|
<div class="line"><span class="lineno"> 251</span><span class="comment"></span> sublistData[temp] = i + 1;</div>
|
|
<div class="line"><span class="lineno"> 252</span> temp++;</div>
|
|
<div class="line"><span class="lineno"> 253</span> }</div>
|
|
<div class="line"><span class="lineno"> 254</span> </div>
|
|
<div class="line"><span class="lineno"> 255</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
|
<div class="line"><span class="lineno"> 256</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 257</span> sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 258</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
|
<div class="line"><span class="lineno"> 259</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 260</span> mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 261</span><span class="comment"> ///< searched</span></div>
|
|
<div class="line"><span class="lineno"> 262</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 263</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
|
<div class="line"><span class="lineno"> 264</span> sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
|
<div class="line"><span class="lineno"> 265</span> </div>
|
|
<div class="line"><span class="lineno"> 266</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 267</span> assert(exists == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 268</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 269</span> </div>
|
|
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 2 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 271</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 272</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 273</span> }</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="450" height="135"><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" name="abae0148985f159b582a385cf399254e3"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </a></span>testCase_2() <span class="overload">[3/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 with input array of length 500. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 245</span> {</div>
|
|
<div class="line"><span class="lineno"> 246</span> <span class="keyword">const</span> int64_t inputSize = 500;</div>
|
|
<div class="line"><span class="lineno"> 247</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 248</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 249</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 250</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" BIG INPUT : Contains 500 elements and repeated elements"</span>);</div>
|
|
<div class="line"><span class="lineno"> 251</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 2 for Random Pivot Quick Sort Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 252</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int64_t, inputSize></a> unsorted_arr =</div>
|
|
<div class="line"><span class="lineno"> 253</span> sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(</div>
|
|
<div class="line"><span class="lineno"> 254</span> 1, 10000);</div>
|
|
<div class="line"><span class="lineno"> 255</span> </div>
|
|
<div class="line"><span class="lineno"> 256</span> int64_t start = 0;</div>
|
|
<div class="line"><span class="lineno"> 257</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1; <span class="comment">// length - 1</span></div>
|
|
<div class="line"><span class="lineno"> 258</span> </div>
|
|
<div class="line"><span class="lineno"> 259</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running algorithm of data of length 500 ..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a><int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()> sorted_arr =</div>
|
|
<div class="line"><span class="lineno"> 261</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
|
|
<div class="line"><span class="lineno"> 262</span> end);</div>
|
|
<div class="line"><span class="lineno"> 263</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Algorithm finished!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 264</span> </div>
|
|
<div class="line"><span class="lineno"> 265</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 266</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
|
|
<div class="line"><span class="lineno"> 267</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 268</span> </div>
|
|
<div class="line"><span class="lineno"> 269</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 2 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 270</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 271</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 272</span> }</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="450" height="135"><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" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </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 >< Expected output of this test</p>
|
|
<p >< Data to make nodes in BST</p>
|
|
<p >< Adding nodes to BST</p>
|
|
<p >< Printing inorder to cross-verify.</p>
|
|
<p >< The inorder successor node for given data</p>
|
|
<p >memory cleanup!</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 345</span> {</div>
|
|
<div class="line"><span class="lineno"> 346</span> <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110; <span class="comment">///< Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 347</span> </div>
|
|
<div class="line"><span class="lineno"> 348</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 349</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 3 : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 350</span> </div>
|
|
<div class="line"><span class="lineno"> 351</span> <a class="code hl_class" 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"><span class="lineno"> 352</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><span class="lineno"> 353</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> node_data{</div>
|
|
<div class="line"><span class="lineno"> 354</span> 89, 67, 32, 56, 90, 123, 120,</div>
|
|
<div class="line"><span class="lineno"> 355</span> 110, 115, 6, 78, 7, 10}; <span class="comment">///< Data to make nodes in BST</span></div>
|
|
<div class="line"><span class="lineno"> 356</span> </div>
|
|
<div class="line"><span class="lineno"> 357</span> root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
|
|
<div class="line"><span class="lineno"> 358</span> root,</div>
|
|
<div class="line"><span class="lineno"> 359</span> node_data); <span class="comment">///< Adding nodes to BST</span></div>
|
|
<div class="line"><span class="lineno"> 360</span> </div>
|
|
<div class="line"><span class="lineno"> 361</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Inorder sequence is : "</span>;</div>
|
|
<div class="line"><span class="lineno"> 362</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
|
|
<div class="line"><span class="lineno"> 363</span> root); <span class="comment">///< Printing inorder to cross-verify.</span></div>
|
|
<div class="line"><span class="lineno"> 364</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
|
<div class="line"><span class="lineno"> 365</span> </div>
|
|
<div class="line"><span class="lineno"> 366</span> <a class="code hl_class" 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"><span class="lineno"> 367</span> *inorderSuccessor = operations_on_datastructures::</div>
|
|
<div class="line"><span class="lineno"> 368</span> inorder_traversal_of_bst::getInorderSuccessor(</div>
|
|
<div class="line"><span class="lineno"> 369</span> root, 90); <span class="comment">///< The inorder successor node for given data</span></div>
|
|
<div class="line"><span class="lineno"> 370</span> </div>
|
|
<div class="line"><span class="lineno"> 371</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 372</span> assert(inorderSuccessor-><a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 373</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 374</span> </div>
|
|
<div class="line"><span class="lineno"> 375</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
|
|
<div class="line"><span class="lineno"> 376</span> root); <span class="comment">/// memory cleanup!</span></div>
|
|
<div class="line"><span class="lineno"> 377</span> </div>
|
|
<div class="line"><span class="lineno"> 378</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 3 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 379</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 380</span> }</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="450" height="135"><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" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </a></span>testCase_3() <span class="overload">[2/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 >< Expected output of this test</p>
|
|
<p >< Sublist to be searched</p>
|
|
<p >< Main list in which sublist is to be searched</p>
|
|
<p >Inserts 100 elements in main list</p>
|
|
<p >Inserts 20 elements in sublist</p>
|
|
<p >< Sublist to be searched</p>
|
|
<p >< Main list in which sublist is to be searched</p>
|
|
<p >< boolean, if sublist exist or not</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 280</span> {</div>
|
|
<div class="line"><span class="lineno"> 281</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>; <span class="comment">///< Expected output of this test</span></div>
|
|
<div class="line"><span class="lineno"> 282</span> </div>
|
|
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 284</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 285</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 3 for sublist search Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 286</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 287</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" contains main list of 50 elements and sublist of 20"</span>);</div>
|
|
<div class="line"><span class="lineno"> 288</span> </div>
|
|
<div class="line"><span class="lineno"> 289</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData(20); <span class="comment">///< Sublist to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 290</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData(</div>
|
|
<div class="line"><span class="lineno"> 291</span> 50); <span class="comment">///< Main list in which sublist is to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 292</span> </div>
|
|
<div class="line"><span class="lineno"> 293</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 50; i++) {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 294</span><span class="comment"> /// Inserts 100 elements in main list</span></div>
|
|
<div class="line"><span class="lineno"> 295</span><span class="comment"></span> mainlistData.push_back(i + 1);</div>
|
|
<div class="line"><span class="lineno"> 296</span> }</div>
|
|
<div class="line"><span class="lineno"> 297</span> </div>
|
|
<div class="line"><span class="lineno"> 298</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i < 65; i++) {<span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 299</span><span class="comment"> /// Inserts 20 elements in sublist</span></div>
|
|
<div class="line"><span class="lineno"> 300</span><span class="comment"></span> sublistData.push_back(i + 1);</div>
|
|
<div class="line"><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><span class="lineno"> 302</span> </div>
|
|
<div class="line"><span class="lineno"> 303</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
|
<div class="line"><span class="lineno"> 304</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 305</span> sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
|
<div class="line"><span class="lineno"> 306</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
|
<div class="line"><span class="lineno"> 307</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
|
|
<div class="line"><span class="lineno"> 308</span> mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
|
<div class="line"><span class="lineno"> 309</span><span class="comment"> ///< searched</span></div>
|
|
<div class="line"><span class="lineno"> 310</span><span class="comment"></span> </div>
|
|
<div class="line"><span class="lineno"> 311</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
|
<div class="line"><span class="lineno"> 312</span> sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
|
<div class="line"><span class="lineno"> 313</span> </div>
|
|
<div class="line"><span class="lineno"> 314</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 315</span> assert(exists == expectedOutput);</div>
|
|
<div class="line"><span class="lineno"> 316</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 317</span> </div>
|
|
<div class="line"><span class="lineno"> 318</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 3 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 319</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 320</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 321</span> }</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="450" height="135"><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" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </a></span>testCase_3() <span class="overload">[3/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 with array of length 1000. </p>
|
|
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 278</span> {</div>
|
|
<div class="line"><span class="lineno"> 279</span> <span class="keyword">const</span> int64_t inputSize = 1000;</div>
|
|
<div class="line"><span class="lineno"> 280</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 281</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 282</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 3 for Random Pivot Quick Sort Algorithm : "</span>);</div>
|
|
<div class="line"><span class="lineno"> 283</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
|
<div class="line"><span class="lineno"> 284</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" LARGE INPUT : Contains 1000 elements and repeated elements"</span>);</div>
|
|
<div class="line"><span class="lineno"> 285</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array<int64_t, inputSize></a> unsorted_arr =</div>
|
|
<div class="line"><span class="lineno"> 286</span> sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(</div>
|
|
<div class="line"><span class="lineno"> 287</span> 1, 10000);</div>
|
|
<div class="line"><span class="lineno"> 288</span> </div>
|
|
<div class="line"><span class="lineno"> 289</span> int64_t start = 0;</div>
|
|
<div class="line"><span class="lineno"> 290</span> int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1; <span class="comment">// length - 1</span></div>
|
|
<div class="line"><span class="lineno"> 291</span> </div>
|
|
<div class="line"><span class="lineno"> 292</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running algorithm..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 293</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a><int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()> sorted_arr =</div>
|
|
<div class="line"><span class="lineno"> 294</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
|
|
<div class="line"><span class="lineno"> 295</span> end);</div>
|
|
<div class="line"><span class="lineno"> 296</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Algorithm finished!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 297</span> </div>
|
|
<div class="line"><span class="lineno"> 298</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
|
<div class="line"><span class="lineno"> 299</span> assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
|
|
<div class="line"><span class="lineno"> 300</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 301</span> </div>
|
|
<div class="line"><span class="lineno"> 302</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 3 PASS!"</span>);</div>
|
|
<div class="line"><span class="lineno"> 303</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
|
<div class="line"><span class="lineno"> 304</span> <span class="stringliteral">"~"</span>);</div>
|
|
<div class="line"><span class="lineno"> 305</span> }</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="450" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
|
</div>
|
|
</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>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></li>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.5 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|