backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-31 01:02:46 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 3406be6d0b

Browse Source
This commit is contained in:
github-actions
2021-10-19 22:01:52 +00:00
parent 419f6e8f4e
commit e4c172f067
232 changed files with 5577 additions and 2786 deletions
Download Patch File Download Diff File Expand all files Collapse all files

271
d9/df4/namespacetests.html Normal file
View File

@@ -0,0 +1,271 @@
<!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">
<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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: tests Namespace 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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d9/df4/namespacetests.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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">tests Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Testcases to check Reversal of Binary Tree.
<a href="../../d9/df4/namespacetests.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a> ()</td></tr>
<tr class="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; Use the BinaryTree <a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">More...</a><br /></td></tr>
<tr class="separator:a167c24bd817469ae47358d12e034f2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a> ()</td></tr>
<tr class="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an edge case (NULL root element) <a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">More...</a><br /></td></tr>
<tr class="separator:abdd77344d4af8fd56d14a5cabbf2f669"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa515639572647508b94986489aab6d76"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a> ()</td></tr>
<tr class="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct reversal of a Binary Tree. <a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">More...</a><br /></td></tr>
<tr class="separator:aa515639572647508b94986489aab6d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Testcases to check Reversal of Binary Tree. </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a167c24bd817469ae47358d12e034f2d5" name="a167c24bd817469ae47358d12e034f2d5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a167c24bd817469ae47358d12e034f2d5">&#9670;&nbsp;</a></span>test1()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void tests::test1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>&lt; Use the BinaryTree </p>
<p >A Test to check an edge case (single element reversal) </p>
<p >&lt; Check for equal sizes</p>
<p >&lt; Ensure that there is only one element</p>
<p >&lt; Check if both elements are same</p>
<div class="fragment"><div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> {</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> BinaryTree bst;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> pre_reversal, post_reversal;</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initializing tree with a single element (5)\n&quot;</span>;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> bst.add(5);</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> pre_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> bst.print();</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> bst.reverse();</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> post_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> assert(pre_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() ==</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> post_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">///&lt; Check for equal sizes</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> assert(pre_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() ==</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> 1); <span class="comment">///&lt; Ensure that there is only one element</span></div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> assert(pre_reversal[0] ==</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> post_reversal[0]); <span class="comment">///&lt; Check if both elements are same</span></div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> bst.print();</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="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="../../d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg" width="260" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="abdd77344d4af8fd56d14a5cabbf2f669" name="abdd77344d4af8fd56d14a5cabbf2f669"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abdd77344d4af8fd56d14a5cabbf2f669">&#9670;&nbsp;</a></span>test2()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void tests::test2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>A Test to check an edge case (NULL root element) </p>
<p >&lt; Check for equal sizes</p>
<p >&lt; Ensure that there is only one element</p>
<div class="fragment"><div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> {</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> BinaryTree bst;</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> pre_reversal, post_reversal;</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Creating empty tree (root points to NULL)\n&quot;</span>;</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> pre_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> bst.print();</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> bst.reverse();</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> post_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> assert(pre_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() ==</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> post_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); <span class="comment">///&lt; Check for equal sizes</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> assert(pre_reversal.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() ==</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> 0); <span class="comment">///&lt; Ensure that there is only one element</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> bst.print();</div>
<div class="line"><a id="l00207" name="l00207"></a><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> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00208" name="l00208"></a><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="../../d9/df4/namespacetests_abdd77344d4af8fd56d14a5cabbf2f669_cgraph.svg" width="260" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa515639572647508b94986489aab6d76" name="aa515639572647508b94986489aab6d76"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa515639572647508b94986489aab6d76">&#9670;&nbsp;</a></span>test3()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void tests::test3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>A Test to check correct reversal of a Binary Tree. </p>
<p >&lt; Check for equality</p>
<p >&lt; Check for equality</p>
<div class="fragment"><div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> {</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> BinaryTree bst;</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> pre_reversal, post_reversal;</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> pre_res = {4, 3, 6, 2, 5, 7, 1};</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> post_res = {4, 6, 3, 7, 5, 2, 1};</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Creating tree with elements (4, 6, 3, 2, 5, 7, 1)\n&quot;</span>;</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> bst.add(4);</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> bst.add(6);</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> bst.add(3);</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> bst.add(2);</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> bst.add(5);</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> bst.add(7);</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> bst.add(1);</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> pre_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> assert(pre_reversal == pre_res); <span class="comment">///&lt; Check for equality</span></div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> bst.print();</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> bst.reverse();</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> post_reversal = bst.get_level_order();</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> assert(post_reversal == post_res); <span class="comment">///&lt; Check for equality</span></div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> bst.print();</div>
<div class="line"><a id="l00235" name="l00235"></a><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> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span>}</div>
</div><!-- fragment -->
</div>
</div>
</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="../../d9/df4/namespacetests.html">tests</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.2 </li>
</ul>
</div>
</body>
</html>

4
d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="tests::test1" name="tests::test1">
<area shape="rect" id="node1" title="&lt; Use the BinaryTree" alt="" coords="5,5,92,32"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="140,5,255,32"/>
</map>

1
d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
1344df6d0aeab8af5383cc653b7cfb97

37
d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg Normal file
View File

@@ -0,0 +1,37 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: tests::test1 Pages: 1 -->
<svg width="195pt" height="28pt"
viewBox="0.00 0.00 195.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>tests::test1</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 191,-24 191,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="&lt; Use the BinaryTree">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 65,-19.5 65,-0.5 0,-0.5"/>
<text text-anchor="middle" x="32.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="101,-0.5 101,-19.5 187,-19.5 187,-0.5 101,-0.5"/>
<text text-anchor="middle" x="144" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M65.17,-10C73.16,-10 81.95,-10 90.67,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="90.8,-13.5 100.8,-10 90.8,-6.5 90.8,-13.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.6 KiB

4
d9/df4/namespacetests_abdd77344d4af8fd56d14a5cabbf2f669_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="tests::test2" name="tests::test2">
<area shape="rect" id="node1" title="A Test to check an edge case (NULL root element)" alt="" coords="5,5,92,32"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="140,5,255,32"/>
</map>

1
d9/df4/namespacetests_abdd77344d4af8fd56d14a5cabbf2f669_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
a1bc1bd2103fafa5884d976aee652897

37
d9/df4/namespacetests_abdd77344d4af8fd56d14a5cabbf2f669_cgraph.svg Normal file
View File

@@ -0,0 +1,37 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: tests::test2 Pages: 1 -->
<svg width="195pt" height="28pt"
viewBox="0.00 0.00 195.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>tests::test2</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 191,-24 191,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Test to check an edge case (NULL root element)">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 65,-19.5 65,-0.5 0,-0.5"/>
<text text-anchor="middle" x="32.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="101,-0.5 101,-19.5 187,-19.5 187,-0.5 101,-0.5"/>
<text text-anchor="middle" x="144" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M65.17,-10C73.16,-10 81.95,-10 90.67,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="90.8,-13.5 100.8,-10 90.8,-6.5 90.8,-13.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.6 KiB