mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 12:52:48 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,7 @@
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: operations_on_datastructures/intersection_of_two_arrays.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -124,21 +124,22 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="headertitle"><div class="title">intersection_of_two_arrays.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../de/dc5/intersection__of__two__arrays_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<a href="../../de/dc5/intersection__of__two__arrays_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
||||
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include <algorithm></span> </div>
|
||||
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#include <cassert></span> </div>
|
||||
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <iostream></span> </div>
|
||||
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <vector></span> </div>
|
||||
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
||||
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span></div>
|
||||
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span></div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(<span class="keyword">const</span> std::vector<int32_t> &array) {</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">for</span> (int32_t i : array) {</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> std::cout << i << <span class="stringliteral">" "</span>; </div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> }</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> std::cout << <span class="stringliteral">"\n"</span>; </div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span>}</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span></div>
|
||||
<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e"> 49</a></span>std::vector<int32_t> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(<span class="keyword">const</span> std::vector<int32_t> &first,</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">const</span> std::vector<int32_t> &second) {</div>
|
||||
@@ -167,7 +168,7 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span>} <span class="comment">// namespace operations_on_datastructures</span></div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> </div>
|
||||
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span></div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures::get_intersection</a>;</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a>;</div>
|
||||
@@ -177,9 +178,9 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> std::cout << <span class="stringliteral">"Expected result: {}\n"</span>;</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> std::vector<int32_t> a = {};</div>
|
||||
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> std::vector<int32_t> b = {};</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> assert(result == a); </div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> print(result); </div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span>}</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
|
||||
@@ -188,9 +189,9 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> std::cout << <span class="stringliteral">"Expected result: {}\n"</span>;</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> std::vector<int32_t> a = {};</div>
|
||||
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> std::vector<int32_t> b = {2, 3};</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> assert(result == a); </div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> print(result); </div>
|
||||
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span>}</div>
|
||||
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
|
||||
@@ -199,10 +200,10 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::cout << <span class="stringliteral">"Expected result: {6}\n"</span>;</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> std::vector<int32_t> a = {4, 6};</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> std::vector<int32_t> b = {3, 6};</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> std::vector<int32_t> expected = {6};</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> assert(result == expected); </div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> print(result); </div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span>}</div>
|
||||
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
|
||||
@@ -211,10 +212,10 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> std::cout << <span class="stringliteral">"Expected result: {4, 6}\n"</span>;</div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> std::vector<int32_t> a = {4, 6, 6, 6};</div>
|
||||
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> std::vector<int32_t> b = {2, 4, 4, 6};</div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> std::vector<int32_t> expected = {4, 6};</div>
|
||||
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> assert(result == expected); </div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> print(result); </div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span>}</div>
|
||||
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
|
||||
@@ -223,10 +224,10 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> std::cout << <span class="stringliteral">"Expected result: {2, 3, 4}\n"</span>;</div>
|
||||
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> std::vector<int32_t> a = {1, 2, 3, 4, 6, 7, 9};</div>
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> std::vector<int32_t> b = {2, 3, 4, 5};</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector<int32_t> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> std::vector<int32_t> expected = {2, 3, 4};</div>
|
||||
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> assert(result == expected); </div>
|
||||
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> print(result); </div>
|
||||
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span>}</div>
|
||||
<div class="foldopen" id="foldopen00166" data-start="{" data-end="}">
|
||||
@@ -239,15 +240,15 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> std::vector<int32_t> b = {11, 3, 7, 8, 6};</div>
|
||||
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> std::sort(a.begin(), a.end()); </div>
|
||||
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> std::sort(b.begin(), b.end()); </div>
|
||||
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> std::vector<int32_t> result = get_intersection(a, b);</div>
|
||||
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> std::vector<int32_t> result = <a class="code hl_function" href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(a, b);</div>
|
||||
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> std::vector<int32_t> expected = {3, 7};</div>
|
||||
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> assert(result == expected); </div>
|
||||
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> print(result); </div>
|
||||
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(result); </div>
|
||||
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> std::cout << <span class="stringliteral">"TEST PASSED!\n\n"</span>;</div>
|
||||
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span>} <span class="comment">// namespace tests</span></div>
|
||||
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
|
||||
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span></div>
|
||||
<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 187</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
||||
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
|
||||
@@ -258,7 +259,7 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a>();</div>
|
||||
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> </div>
|
||||
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span></div>
|
||||
<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 200</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
@@ -274,9 +275,11 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
|
||||
<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_a6109193567a5b7e36a27f2b4865fce20"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a6109193567a5b7e36a27f2b4865fce20">tests::print</a></div><div class="ttdeci">void print(const std::vector< int32_t > &array)</div><div class="ttdoc">Prints the values of a vector sequentially, ending with a newline character.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00029">array_left_rotation.cpp:29</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> <a href="#l00166">intersection_of_two_arrays.cpp:166</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_adaf9a06f0c236c2d95c97e441ea2d12e"><div class="ttname"><a href="../../d9/df4/namespacetests.html#adaf9a06f0c236c2d95c97e441ea2d12e">tests::get_intersection</a></div><div class="ttdeci">std::vector< int32_t > get_intersection(const std::vector< int32_t > &first, const std::vector< int32_t > &second)</div><div class="ttdoc">Gets the intersection of two sorted arrays, and returns them in a vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">intersection_of_two_arrays.cpp:49</a></div></div>
|
||||
<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
@@ -284,7 +287,7 @@ $(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html'
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp.html">intersection_of_two_arrays.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user