Documentation for b8d0c34126

This commit is contained in:
github-actions
2021-10-24 09:01:43 +00:00
parent 6fd3d32343
commit 4ac07d555d
90 changed files with 4032 additions and 1940 deletions

View File

@@ -96,33 +96,33 @@ $(document).ready(function(){initNavTree('d9/df4/namespacetests.html','../../');
</div><!--header-->
<div class="contents">
<p>Testcases to check Reversal of Binary Tree.
<p>Testcases to check Union of Two Arrays.
<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="memdesc:a167c24bd817469ae47358d12e034f2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an simple case. <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="memdesc:abdd77344d4af8fd56d14a5cabbf2f669"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an empty vector. <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="memdesc:aa515639572647508b94986489aab6d76"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check an invalid shift value. <a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">More...</a><br /></td></tr>
<tr class="separator:aa515639572647508b94986489aab6d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2b9769e44683dcb67fe1083ad91e134d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a> ()</td></tr>
<tr class="memdesc:a2b9769e44683dcb67fe1083ad91e134d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with duplicate values. <a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">More...</a><br /></td></tr>
<tr class="memdesc:a2b9769e44683dcb67fe1083ad91e134d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a very large input. <a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">More...</a><br /></td></tr>
<tr class="separator:a2b9769e44683dcb67fe1083ad91e134d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af7b81d7a1534216af6a36a80135beb86"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a> ()</td></tr>
<tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with a harder test case. <a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">More...</a><br /></td></tr>
<tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero. <a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">More...</a><br /></td></tr>
<tr class="separator:af7b81d7a1534216af6a36a80135beb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aacafde185abd8670abee51157f273dc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">test6</a> ()</td></tr>
<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>. <a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">More...</a><br /></td></tr>
<tr class="separator:aacafde185abd8670abee51157f273dc2"><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>
<p >Testcases to check Union of Two Arrays. </p>
<div class="textblock"><p >Testcases to check Union of Two Arrays. </p>
<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>
@@ -139,45 +139,41 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p>&lt; Use the BinaryTree </p>
<p>A Test to check an simple case. </p>
<p >A Test to check an edge case (two empty arrays)</p>
<p >A Test to check an edge case (single element reversal)</p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; Use the BinaryTree</p>
<dl class="section return"><dt>Returns</dt><dd>void</dd></dl>
<p>A Test to check an edge case (single element reversal) </p>
<p >&lt; Should print 4 5 1 2 3</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>
<p >&lt; Check if result is empty</p>
<p >&lt; Should only print newline</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>
<p >&lt; Check if result is empty</p>
<p >&lt; Should only print newline</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="fragment"><div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> {</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <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="l00078" name="l00078"></a><span class="lineno"> 78</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;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</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;Expected result: {4, 5, 1, 2, 3}\n&quot;</span>;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(arr, 2);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {4, 5, 1, 2, 3};</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> assert(res == expected);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(res); <span class="comment">///&lt; Should print 4 5 1 2 3</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span>}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="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="anamespaceoperations__on__datastructures_html_a1bfb8711f49e591eb168ccaa3df6fb86"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures::shift_right</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; shift_right(const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</div><div class="ttdoc">Shifts the given vector to the right by the shift amount and returns a new vector with the result....</div><div class="ttdef"><b>Definition:</b> array_right_rotation.cpp:47</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector&lt; bool &gt; &amp;is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</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 class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.svg" width="507" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -198,37 +194,34 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>A Test to check an edge case (NULL root element) </p>
<p>A Test to check an empty vector. </p>
<p >A Test to check an edge case (one empty array)</p>
<p >A Test to check an edge case (NULL root element)</p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; Should print empty newline</p>
<p >&lt; Check for equal sizes</p>
<p >&lt; Ensure that there is only one element</p>
<p >&lt; Check if result is equal to b</p>
<p >&lt; Should print 2 3</p>
<p >&lt; Check for equal sizes</p>
<p >&lt; Ensure that there is only one element</p>
<p >&lt; Check if result is equal to b</p>
<p >&lt; Should print 2 3</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 class="fragment"><div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <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="l00093" name="l00093"></a><span class="lineno"> 93</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;Initialized arr = {}\n&quot;</span>;</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</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;Expected result: {}\n&quot;</span>;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {};</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(arr, 2);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {};</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> assert(res == expected);</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(res); <span class="comment">///&lt; Should print empty newline</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</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="l00101" name="l00101"></a><span class="lineno"> 101</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 class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df4/namespacetests_abdd77344d4af8fd56d14a5cabbf2f669_cgraph.svg" width="507" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -249,41 +242,38 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>A Test to check correct reversal of a Binary Tree. </p>
<p>A Test to check an invalid shift value. </p>
<p >A Test to check correct functionality with a simple test case.</p>
<p >A Test to check correct reversal of a Binary Tree.</p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; 7 &gt; 5</p>
<p >&lt; Should print empty newline</p>
<p >&lt; Check for equality</p>
<p >&lt; Check for equality</p>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 2 3 4 6</p>
<p >&lt; Check for equality</p>
<p >&lt; Check for equality</p>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 2 3 4 6</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 class="fragment"><div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</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="l00108" name="l00108"></a><span class="lineno"> 108</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;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</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;Expected result: {}\n&quot;</span>;</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(arr, 7); <span class="comment">///&lt; 7 &gt; 5</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {};</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> assert(res == expected);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(res); <span class="comment">///&lt; Should print empty newline</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</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="l00116" name="l00116"></a><span class="lineno"> 116</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_aa515639572647508b94986489aab6d76_cgraph.svg" width="507" height="151"><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="a2b9769e44683dcb67fe1083ad91e134d" name="a2b9769e44683dcb67fe1083ad91e134d"></a>
@@ -301,29 +291,38 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>A Test to check correct functionality with duplicate values. </p>
<p>A Test to check a very large input. </p>
<p >A Test to check correct functionality with duplicate values.</p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; Should print {420, 2, 4, ..., 418}</p>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 2 3 4 6 7</p>
<div class="fragment"><div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> {</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Intialized a = {4, 6, 6, 7} b = {2, 3, 4}\n&quot;</span>;</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</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;Expected result: {2, 3, 4, 6, 7}\n&quot;</span>;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> a = {4, 6, 6, 7};</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> b = {2, 3, 4};</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">get_union</a>(a, b);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {2, 3, 4, 6, 7};</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> assert(result == expected); <span class="comment">///&lt; Check if result is correct</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(result); <span class="comment">///&lt; Should print 2 3 4 6 7</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</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="l00160" name="l00160"></a><span class="lineno"> 160</span>}</div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="anamespaceoperations__on__datastructures_html_a2b8ff06a84b041457873840bf82e2d74"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; get_union(const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</div><div class="ttdoc">Gets the union of two sorted arrays, and returns them in a vector.</div><div class="ttdef"><b>Definition:</b> union_of_two_arrays.cpp:48</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector&lt; bool &gt; &amp;is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 2 3 4 6 7</p>
<div class="fragment"><div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> {</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</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 4\n&quot;</span>;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {2, 4, ..., 420}\n&quot;</span>;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {420, 2, 4, ..., 418}\n&quot;</span>;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr;</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 210; i++) {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(i * 2);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> }</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(arr);</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(arr, 1);</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected;</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(420);</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 209; i++) {</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(arr[i]);</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> }</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> assert(res == expected);</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(res); <span class="comment">///&lt; Should print {420, 2, 4, ..., 418}</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</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="l00139" name="l00139"></a><span class="lineno"> 139</span>}</div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
</div><!-- 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_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg" width="548" height="240"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg" width="507" height="180"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -344,26 +343,28 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>A Test to check correct functionality with a harder test case. </p>
<p>A Test to check a shift of zero. </p>
<p >A Test to check correct functionality with a harder test case.</p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p >&lt; Should print 1 2 3 4 5</p>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 1 2 3 4 5 6 7 9</p>
<div class="fragment"><div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> {</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <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 5\n&quot;</span>;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</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;Intialized a = {1, 4, 6, 7, 9} b = {2, 3, 5}\n&quot;</span>;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</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;Expected result: {1, 2, 3, 4, 5, 6, 7, 9}\n&quot;</span>;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> a = {1, 4, 6, 7, 9};</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/container/vector.html">std::vector&lt;int32_t&gt;</a> b = {2, 3, 5};</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/container/vector.html">std::vector&lt;int32_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">get_union</a>(a, b);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {1, 2, 3, 4, 5, 6, 7, 9};</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> assert(result == expected); <span class="comment">///&lt; Check if result is correct</span></div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(result); <span class="comment">///&lt; Should print 1 2 3 4 5 6 7 9</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</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="l00176" name="l00176"></a><span class="lineno"> 176</span>}</div>
<p >&lt; Check if result is correct</p>
<p >&lt; Should print 1 2 3 4 5 6 7 9</p>
<div class="fragment"><div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> {</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</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;Expected result: {1, 2, 3, 4, 5}\n&quot;</span>;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(arr, 0);</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> assert(res == arr);</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a>(res); <span class="comment">///&lt; Should print 1 2 3 4 5</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</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="l00153" name="l00153"></a><span class="lineno"> 153</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_af7b81d7a1534216af6a36a80135beb86_cgraph.svg" width="548" height="240"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df4/namespacetests_af7b81d7a1534216af6a36a80135beb86_cgraph.svg" width="507" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
@@ -407,6 +408,8 @@ Here is the call graph for this function:</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span>}</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="anamespaceoperations__on__datastructures_html_a2b8ff06a84b041457873840bf82e2d74"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; get_union(const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</div><div class="ttdoc">Gets the union of two sorted arrays, and returns them in a vector.</div><div class="ttdef"><b>Definition:</b> union_of_two_arrays.cpp:48</div></div>
<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>

View File

@@ -1,4 +1,8 @@
<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"/>
<area shape="rect" id="node1" title="A Test to check an simple case." alt="" coords="5,81,92,108"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,52,263,79"/>
<area shape="rect" id="node5" href="$da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="140,103,339,145"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="408,5,480,32"/>
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="408,56,480,83"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="387,111,501,137"/>
</map>

View File

@@ -1 +1 @@
1344df6d0aeab8af5383cc653b7cfb97
2b6d23453c90e7df113f7e32da7eb056

View File

@@ -4,34 +4,95 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- 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)">
<svg width="380pt" height="113pt"
viewBox="0.00 0.00 380.00 112.50" 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 108.5)">
<title>tests::test1</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 191,-24 191,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-108.5 376,-108.5 376,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>
<g id="a_node1"><a xlink:title="A Test to check an simple case.">
<polygon fill="#bfbfbf" stroke="black" points="0,-28 0,-47 65,-47 65,-28 0,-28"/>
<text text-anchor="middle" x="32.5" y="-35" 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>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-50 157.5,-69 193.5,-69 193.5,-50 157.5,-50"/>
<text text-anchor="middle" x="175.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">print</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"/>
<path fill="none" stroke="midnightblue" d="M65.14,-42.44C89.79,-46.28 123.64,-51.56 147.13,-55.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="146.7,-58.7 157.12,-56.79 147.78,-51.79 146.7,-58.7"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" target="_top" xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
<polygon fill="white" stroke="black" points="101,-0.5 101,-30.5 250,-30.5 250,-0.5 101,-0.5"/>
<text text-anchor="start" x="109" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M65.14,-32.56C73.01,-31.33 81.82,-29.96 90.94,-28.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="91.57,-31.98 100.91,-26.98 90.49,-25.07 91.57,-31.98"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-85 302,-104 356,-104 356,-85 302,-85"/>
<text text-anchor="middle" x="329" y="-92" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M193.58,-63.45C217.29,-68.92 260.76,-78.97 291.84,-86.15"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.33,-89.62 301.87,-88.46 292.91,-82.8 291.33,-89.62"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="302,-47 302,-66 356,-66 356,-47 302,-47"/>
<text text-anchor="middle" x="329" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M193.58,-59.16C217.29,-58.69 260.76,-57.83 291.84,-57.22"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.94,-60.71 301.87,-57.02 291.8,-53.72 291.94,-60.71"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-6 286,-25 372,-25 372,-6 286,-6"/>
<text text-anchor="middle" x="329" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.03,-15.5C258.62,-15.5 267.24,-15.5 275.47,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.63,-19 285.63,-15.5 275.63,-12 275.63,-19"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

View File

@@ -1,10 +1,9 @@
<map id="tests::test4" name="tests::test4">
<area shape="rect" id="node1" title="A Test to check correct functionality with duplicate values." alt="" coords="5,128,92,155"/>
<area shape="rect" id="node2" href="$da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74" title="Gets the union of two sorted arrays, and returns them in a vector." alt="" coords="140,70,339,111"/>
<area shape="rect" id="node6" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,157,263,184"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="405,5,524,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="387,56,543,83"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="407,107,522,133"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="429,157,501,184"/>
<area shape="rect" id="node8" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="429,208,501,235"/>
<area shape="rect" id="node1" title="A Test to check a very large input." alt="" coords="5,81,92,108"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,31,263,57"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="161,81,317,108"/>
<area shape="rect" id="node6" href="$da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="140,133,339,174"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="408,5,480,32"/>
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="408,56,480,83"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="387,140,501,167"/>
</map>

View File

@@ -1 +1 @@
dc5b2b161b4fb4ce25e1d47b6a5e80b4
ae896779a74956320c8a9b318d12dcb4

View File

@@ -4,125 +4,110 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: tests::test4 Pages: 1 -->
<svg width="411pt" height="180pt"
viewBox="0.00 0.00 411.00 180.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 176)">
<svg width="380pt" height="135pt"
viewBox="0.00 0.00 380.00 134.50" 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 130.5)">
<title>tests::test4</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-176 407,-176 407,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-130.5 376,-130.5 376,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Test to check correct functionality with duplicate values.">
<polygon fill="#bfbfbf" stroke="black" points="0,-60.5 0,-79.5 65,-79.5 65,-60.5 0,-60.5"/>
<text text-anchor="middle" x="32.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
<g id="a_node1"><a xlink:title="A Test to check a very large input.">
<polygon fill="#bfbfbf" stroke="black" points="0,-50 0,-69 65,-69 65,-50 0,-50"/>
<text text-anchor="middle" x="32.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74" target="_top" xlink:title="Gets the union of two sorted arrays, and returns them in a vector.">
<polygon fill="white" stroke="black" points="101,-93 101,-123 250,-123 250,-93 101,-93"/>
<text text-anchor="start" x="109" y="-111" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">::get_union</text>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-88 157.5,-107 193.5,-107 193.5,-88 157.5,-88"/>
<text text-anchor="middle" x="175.5" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">print</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.14,-78.53C78.06,-82.01 93.52,-86.18 108.68,-90.26"/>
<polygon fill="midnightblue" stroke="midnightblue" points="108.01,-93.71 118.58,-92.93 109.83,-86.95 108.01,-93.71"/>
<path fill="none" stroke="midnightblue" d="M65.05,-68.53C76.38,-71.73 89.25,-75.33 101,-78.5 116.31,-82.63 133.47,-87.08 147.35,-90.63"/>
<polygon fill="midnightblue" stroke="midnightblue" points="146.69,-94.07 157.25,-93.15 148.42,-87.29 146.69,-94.07"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="117,-50 117,-69 234,-69 234,-50 117,-50"/>
<text text-anchor="middle" x="175.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M65.14,-59.5C77.55,-59.5 92.28,-59.5 106.85,-59.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="106.89,-63 116.89,-59.5 106.89,-56 106.89,-63"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-38.5 157.5,-57.5 193.5,-57.5 193.5,-38.5 157.5,-38.5"/>
<text text-anchor="middle" x="175.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
<g id="a_node6"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" target="_top" xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
<polygon fill="white" stroke="black" points="101,-0.5 101,-30.5 250,-30.5 250,-0.5 101,-0.5"/>
<text text-anchor="start" x="109" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M65.14,-65.06C89.79,-61.22 123.64,-55.94 147.13,-52.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.78,-55.71 157.12,-50.71 146.7,-48.8 147.78,-55.71"/>
<path fill="none" stroke="midnightblue" d="M64.09,-49.95C79.4,-45.18 98.45,-39.23 116.4,-33.63"/>
<polygon fill="midnightblue" stroke="midnightblue" points="117.72,-36.89 126.22,-30.57 115.63,-30.2 117.72,-36.89"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="300,-152.5 300,-171.5 389,-171.5 389,-152.5 300,-152.5"/>
<text text-anchor="middle" x="344.5" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-107 302,-126 356,-126 356,-107 302,-107"/>
<text text-anchor="middle" x="329" y="-114" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M223.02,-123.04C248.64,-131.33 280.07,-141.49 304.41,-149.36"/>
<polygon fill="midnightblue" stroke="midnightblue" points="303.44,-152.72 314.03,-152.47 305.59,-146.06 303.44,-152.72"/>
<path fill="none" stroke="midnightblue" d="M193.58,-99.64C217.29,-102.62 260.76,-108.07 291.84,-111.97"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.51,-115.45 301.87,-113.22 292.38,-108.51 291.51,-115.45"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-114.5 286,-133.5 403,-133.5 403,-114.5 286,-114.5"/>
<text text-anchor="middle" x="344.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_node4"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="302,-69 302,-88 356,-88 356,-69 302,-69"/>
<text text-anchor="middle" x="329" y="-76" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M250.23,-115.06C258.75,-115.88 267.39,-116.71 275.82,-117.52"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.67,-121.02 285.96,-118.49 276.34,-114.05 275.67,-121.02"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="301.5,-76.5 301.5,-95.5 387.5,-95.5 387.5,-76.5 301.5,-76.5"/>
<text text-anchor="middle" x="344.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M250.23,-98.29C264.02,-96.47 278.17,-94.61 291.15,-92.9"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.82,-96.34 301.28,-91.56 290.91,-89.4 291.82,-96.34"/>
<path fill="none" stroke="midnightblue" d="M193.58,-95.36C217.29,-92.38 260.76,-86.93 291.84,-83.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="292.38,-86.49 301.87,-81.78 291.51,-79.55 292.38,-86.49"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="317.5,-38.5 317.5,-57.5 371.5,-57.5 371.5,-38.5 317.5,-38.5"/>
<text text-anchor="middle" x="344.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-6 286,-25 372,-25 372,-6 286,-6"/>
<text text-anchor="middle" x="329" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M193.74,-48C220.33,-48 271.92,-48 307.04,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="307.36,-51.5 317.36,-48 307.36,-44.5 307.36,-51.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="317.5,-0.5 317.5,-19.5 371.5,-19.5 371.5,-0.5 317.5,-0.5"/>
<text text-anchor="middle" x="344.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M193.74,-44.08C220.44,-38 272.36,-26.19 307.49,-18.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.39,-21.58 317.36,-15.95 306.83,-14.75 308.39,-21.58"/>
<path fill="none" stroke="midnightblue" d="M250.03,-15.5C258.62,-15.5 267.24,-15.5 275.47,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.63,-19 285.63,-15.5 275.63,-12 275.63,-19"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 5.5 KiB

View File

@@ -0,0 +1,8 @@
<map id="tests::test3" name="tests::test3">
<area shape="rect" id="node1" title="A Test to check an invalid shift value." alt="" coords="5,81,92,108"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,52,263,79"/>
<area shape="rect" id="node5" href="$da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="140,103,339,145"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="408,5,480,32"/>
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="408,56,480,83"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="387,111,501,137"/>
</map>

View File

@@ -0,0 +1 @@
1cf6f60cc62143f3f10be0d7bac0bd87

View File

@@ -0,0 +1,98 @@
<?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.2 (20211016.1639)
-->
<!-- Title: tests::test3 Pages: 1 -->
<svg width="380pt" height="113pt"
viewBox="0.00 0.00 380.00 112.50" 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 108.5)">
<title>tests::test3</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-108.5 376,-108.5 376,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Test to check an invalid shift value.">
<polygon fill="#bfbfbf" stroke="black" points="0,-28 0,-47 65,-47 65,-28 0,-28"/>
<text text-anchor="middle" x="32.5" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-50 157.5,-69 193.5,-69 193.5,-50 157.5,-50"/>
<text text-anchor="middle" x="175.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">print</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.14,-42.44C89.79,-46.28 123.64,-51.56 147.13,-55.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="146.7,-58.7 157.12,-56.79 147.78,-51.79 146.7,-58.7"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" target="_top" xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
<polygon fill="white" stroke="black" points="101,-0.5 101,-30.5 250,-30.5 250,-0.5 101,-0.5"/>
<text text-anchor="start" x="109" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M65.14,-32.56C73.01,-31.33 81.82,-29.96 90.94,-28.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="91.57,-31.98 100.91,-26.98 90.49,-25.07 91.57,-31.98"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-85 302,-104 356,-104 356,-85 302,-85"/>
<text text-anchor="middle" x="329" y="-92" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M193.58,-63.45C217.29,-68.92 260.76,-78.97 291.84,-86.15"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.33,-89.62 301.87,-88.46 292.91,-82.8 291.33,-89.62"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="302,-47 302,-66 356,-66 356,-47 302,-47"/>
<text text-anchor="middle" x="329" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M193.58,-59.16C217.29,-58.69 260.76,-57.83 291.84,-57.22"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.94,-60.71 301.87,-57.02 291.8,-53.72 291.94,-60.71"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-6 286,-25 372,-25 372,-6 286,-6"/>
<text text-anchor="middle" x="329" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.03,-15.5C258.62,-15.5 267.24,-15.5 275.47,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.63,-19 285.63,-15.5 275.63,-12 275.63,-19"/>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 4.8 KiB

View File

@@ -1,4 +1,8 @@
<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"/>
<area shape="rect" id="node1" title="A Test to check an empty vector." alt="" coords="5,81,92,108"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,52,263,79"/>
<area shape="rect" id="node5" href="$da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="140,103,339,145"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="408,5,480,32"/>
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="408,56,480,83"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="387,111,501,137"/>
</map>

View File

@@ -1 +1 @@
a1bc1bd2103fafa5884d976aee652897
45a5001ed729dbb484fc88562ff5fdf0

View File

@@ -4,34 +4,95 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- 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)">
<svg width="380pt" height="113pt"
viewBox="0.00 0.00 380.00 112.50" 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 108.5)">
<title>tests::test2</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 191,-24 191,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-108.5 376,-108.5 376,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>
<g id="a_node1"><a xlink:title="A Test to check an empty vector.">
<polygon fill="#bfbfbf" stroke="black" points="0,-28 0,-47 65,-47 65,-28 0,-28"/>
<text text-anchor="middle" x="32.5" y="-35" 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>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-50 157.5,-69 193.5,-69 193.5,-50 157.5,-50"/>
<text text-anchor="middle" x="175.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">print</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"/>
<path fill="none" stroke="midnightblue" d="M65.14,-42.44C89.79,-46.28 123.64,-51.56 147.13,-55.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="146.7,-58.7 157.12,-56.79 147.78,-51.79 146.7,-58.7"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" target="_top" xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
<polygon fill="white" stroke="black" points="101,-0.5 101,-30.5 250,-30.5 250,-0.5 101,-0.5"/>
<text text-anchor="start" x="109" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M65.14,-32.56C73.01,-31.33 81.82,-29.96 90.94,-28.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="91.57,-31.98 100.91,-26.98 90.49,-25.07 91.57,-31.98"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-85 302,-104 356,-104 356,-85 302,-85"/>
<text text-anchor="middle" x="329" y="-92" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M193.58,-63.45C217.29,-68.92 260.76,-78.97 291.84,-86.15"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.33,-89.62 301.87,-88.46 292.91,-82.8 291.33,-89.62"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="302,-47 302,-66 356,-66 356,-47 302,-47"/>
<text text-anchor="middle" x="329" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M193.58,-59.16C217.29,-58.69 260.76,-57.83 291.84,-57.22"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.94,-60.71 301.87,-57.02 291.8,-53.72 291.94,-60.71"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-6 286,-25 372,-25 372,-6 286,-6"/>
<text text-anchor="middle" x="329" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.03,-15.5C258.62,-15.5 267.24,-15.5 275.47,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.63,-19 285.63,-15.5 275.63,-12 275.63,-19"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 1.6 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

View File

@@ -1,10 +1,8 @@
<map id="tests::test5" name="tests::test5">
<area shape="rect" id="node1" title="A Test to check correct functionality with a harder test case." alt="" coords="5,128,92,155"/>
<area shape="rect" id="node2" href="$da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74" title="Gets the union of two sorted arrays, and returns them in a vector." alt="" coords="140,70,339,111"/>
<area shape="rect" id="node6" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,157,263,184"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="405,5,524,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="387,56,543,83"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="407,107,522,133"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="429,157,501,184"/>
<area shape="rect" id="node8" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="429,208,501,235"/>
<area shape="rect" id="node1" title="A Test to check a shift of zero." alt="" coords="5,81,92,108"/>
<area shape="rect" id="node2" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" title=" " alt="" coords="215,52,263,79"/>
<area shape="rect" id="node5" href="$da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="140,103,339,145"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="408,5,480,32"/>
<area shape="rect" id="node4" href="$db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" title="for IO operations" alt="" coords="408,56,480,83"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="387,111,501,137"/>
</map>

View File

@@ -1 +1 @@
ad49d2bd2c8d03f3a65bb6297659de3f
311b663244f28abe66316c5c3da212f4

View File

@@ -4,125 +4,95 @@
<!-- Generated by graphviz version 2.49.2 (20211016.1639)
-->
<!-- Title: tests::test5 Pages: 1 -->
<svg width="411pt" height="180pt"
viewBox="0.00 0.00 411.00 180.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 176)">
<svg width="380pt" height="113pt"
viewBox="0.00 0.00 380.00 112.50" 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 108.5)">
<title>tests::test5</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-176 407,-176 407,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-108.5 376,-108.5 376,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Test to check correct functionality with a harder test case.">
<polygon fill="#bfbfbf" stroke="black" points="0,-60.5 0,-79.5 65,-79.5 65,-60.5 0,-60.5"/>
<text text-anchor="middle" x="32.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
<g id="a_node1"><a xlink:title="A Test to check a shift of zero.">
<polygon fill="#bfbfbf" stroke="black" points="0,-28 0,-47 65,-47 65,-28 0,-28"/>
<text text-anchor="middle" x="32.5" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74" target="_top" xlink:title="Gets the union of two sorted arrays, and returns them in a vector.">
<polygon fill="white" stroke="black" points="101,-93 101,-123 250,-123 250,-93 101,-93"/>
<text text-anchor="start" x="109" y="-111" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">::get_union</text>
<g id="a_node2"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-50 157.5,-69 193.5,-69 193.5,-50 157.5,-50"/>
<text text-anchor="middle" x="175.5" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">print</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.14,-78.53C78.06,-82.01 93.52,-86.18 108.68,-90.26"/>
<polygon fill="midnightblue" stroke="midnightblue" points="108.01,-93.71 118.58,-92.93 109.83,-86.95 108.01,-93.71"/>
<path fill="none" stroke="midnightblue" d="M65.14,-42.44C89.79,-46.28 123.64,-51.56 147.13,-55.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="146.7,-58.7 157.12,-56.79 147.78,-51.79 146.7,-58.7"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="157.5,-38.5 157.5,-57.5 193.5,-57.5 193.5,-38.5 157.5,-38.5"/>
<text text-anchor="middle" x="175.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">print</text>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86" target="_top" xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
<polygon fill="white" stroke="black" points="101,-0.5 101,-30.5 250,-30.5 250,-0.5 101,-0.5"/>
<text text-anchor="start" x="109" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="175.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M65.14,-65.06C89.79,-61.22 123.64,-55.94 147.13,-52.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.78,-55.71 157.12,-50.71 146.7,-48.8 147.78,-55.71"/>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M65.14,-32.56C73.01,-31.33 81.82,-29.96 90.94,-28.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="91.57,-31.98 100.91,-26.98 90.49,-25.07 91.57,-31.98"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="300,-152.5 300,-171.5 389,-171.5 389,-152.5 300,-152.5"/>
<text text-anchor="middle" x="344.5" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="302,-85 302,-104 356,-104 356,-85 302,-85"/>
<text text-anchor="middle" x="329" y="-92" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M223.02,-123.04C248.64,-131.33 280.07,-141.49 304.41,-149.36"/>
<polygon fill="midnightblue" stroke="midnightblue" points="303.44,-152.72 314.03,-152.47 305.59,-146.06 303.44,-152.72"/>
<path fill="none" stroke="midnightblue" d="M193.58,-63.45C217.29,-68.92 260.76,-78.97 291.84,-86.15"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.33,-89.62 301.87,-88.46 292.91,-82.8 291.33,-89.62"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-114.5 286,-133.5 403,-133.5 403,-114.5 286,-114.5"/>
<text text-anchor="middle" x="344.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
<g id="a_node4"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="302,-47 302,-66 356,-66 356,-47 302,-47"/>
<text text-anchor="middle" x="329" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M250.23,-115.06C258.75,-115.88 267.39,-116.71 275.82,-117.52"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.67,-121.02 285.96,-118.49 276.34,-114.05 275.67,-121.02"/>
<path fill="none" stroke="midnightblue" d="M193.58,-59.16C217.29,-58.69 260.76,-57.83 291.84,-57.22"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.94,-60.71 301.87,-57.02 291.8,-53.72 291.94,-60.71"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="301.5,-76.5 301.5,-95.5 387.5,-95.5 387.5,-76.5 301.5,-76.5"/>
<text text-anchor="middle" x="344.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="286,-6 286,-25 372,-25 372,-6 286,-6"/>
<text text-anchor="middle" x="329" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M250.23,-98.29C264.02,-96.47 278.17,-94.61 291.15,-92.9"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.82,-96.34 301.28,-91.56 290.91,-89.4 291.82,-96.34"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="317.5,-38.5 317.5,-57.5 371.5,-57.5 371.5,-38.5 317.5,-38.5"/>
<text text-anchor="middle" x="344.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M193.74,-48C220.33,-48 271.92,-48 307.04,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="307.36,-51.5 317.36,-48 307.36,-44.5 307.36,-51.5"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532" target="_top" xlink:title="for IO operations">
<polygon fill="white" stroke="black" points="317.5,-0.5 317.5,-19.5 371.5,-19.5 371.5,-0.5 317.5,-0.5"/>
<text text-anchor="middle" x="344.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">is_prime</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M193.74,-44.08C220.44,-38 272.36,-26.19 307.49,-18.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.39,-21.58 317.36,-15.95 306.83,-14.75 308.39,-21.58"/>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.03,-15.5C258.62,-15.5 267.24,-15.5 275.47,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.63,-19 285.63,-15.5 275.63,-12 275.63,-19"/>
</g>
</g>
</svg>

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB