diff --git a/d4/db6/reverse__binary__tree_8cpp.html b/d4/db6/reverse__binary__tree_8cpp.html index 578871bc1..07749d8d3 100644 --- a/d4/db6/reverse__binary__tree_8cpp.html +++ b/d4/db6/reverse__binary__tree_8cpp.html @@ -129,19 +129,19 @@ Namespaces  Functions for the Reverse a Binary Tree implementation.
  namespace  tests - Testcases to check Reversal of Binary Tree.
+ Testcases to check Union of Two Arrays.
  - + - + - + @@ -180,7 +180,7 @@ Functions
Here is the call graph for this function:
-
+
@@ -218,13 +218,13 @@ Here is the call graph for this function:
244 tests::test2(); ///< No element test
245 tests::test3(); ///< Correct reversal test
246}
-
tests::test1
void test1()
< Use the BinaryTree
Definition: reverse_binary_tree.cpp:167
-
tests::test3
void test3()
A Test to check correct reversal of a Binary Tree.
Definition: reverse_binary_tree.cpp:212
-
tests::test2
void test2()
A Test to check an edge case (NULL root element)
Definition: reverse_binary_tree.cpp:191
+
tests::test1
void test1()
A Test to check an simple case.
Definition: array_right_rotation.cpp:76
+
tests::test3
void test3()
A Test to check an invalid shift value.
Definition: array_right_rotation.cpp:106
+
tests::test2
void test2()
A Test to check an empty vector.
Definition: array_right_rotation.cpp:91
Here is the call graph for this function:
-
+
diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 2e743903c..4e8de965e 100644 --- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,7 +1,11 @@ - - - - - + + + + + + + + + diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 44cd4087a..068173b44 100644 --- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -032e1fa8d12e347f799acaf916fb3b6d \ No newline at end of file +0b12cbb3dd44f88917bbebc1d3d3dc49 \ No newline at end of file diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 84609a40b..88aaeec6f 100644 --- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,11 +4,11 @@ - - + + test - + Node1 @@ -21,7 +21,7 @@ Node2 - + tests::test1 @@ -33,56 +33,135 @@ - - -Node4 - + + +Node8 + tests::test2 - - -Node1->Node4 + + +Node1->Node8 - - -Node5 - + + +Node9 + tests::test3 - - -Node1->Node5 + + +Node1->Node9 Node3 - - -std::vector::size + + +print Node2->Node3 - - + + - + + +Node6 + + +operations_on_datastructures +::shift_right + + + + + +Node2->Node6 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +is_prime + + + + -Node4->Node3 - - +Node3->Node5 + + + + + +Node7 + + +std::vector::size + + + + + +Node6->Node7 + + + + + +Node8->Node3 + + + + + +Node8->Node6 + + + + + +Node9->Node3 + + + + + +Node9->Node6 + + diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 7a91d8e54..b45ca6637 100644 --- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,8 +1,12 @@ - - - - - - + + + + + + + + + + diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index e7dbfc334..54a1f7591 100644 --- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -81c211f6003bcb1f42078a511f34fc43 \ No newline at end of file +3af65eed55146c7aed5ff4b217ba45b4 \ No newline at end of file diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 69758992d..be4308c03 100644 --- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,11 +4,57 @@ - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + main - + Node1 @@ -36,7 +82,7 @@ Node3 - + tests::test1 @@ -48,56 +94,177 @@ - - -Node5 - + + +Node9 + tests::test2 - - -Node2->Node5 + + +Node2->Node9 - - -Node6 - + + +Node10 + tests::test3 - - -Node2->Node6 + + +Node2->Node10 Node4 - - -std::vector::size + + +print Node3->Node4 - - + + - + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + -Node5->Node4 - - +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..7ec751aed --- /dev/null +++ b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,182 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + diff --git a/d6/d57/array__right__rotation_8cpp.html b/d6/d57/array__right__rotation_8cpp.html new file mode 100644 index 000000000..3ce9e7439 --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp.html @@ -0,0 +1,244 @@ + + + + + + + +Algorithms_in_C++: operations_on_datastructures/array_right_rotation.cpp File Reference + + + + + + + + + + + + + + + +
+
+

Functions

void tests::test1 ()
 < Use the BinaryTree More...
 A Test to check an simple case. More...
 
void tests::test2 ()
 A Test to check an edge case (NULL root element) More...
 A Test to check an empty vector. More...
 
void tests::test3 ()
 A Test to check correct reversal of a Binary Tree. More...
 A Test to check an invalid shift value. More...
 
static void test ()
 Function to test the correctness of the Tree Reversal. More...
+ + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+ + + + + + + + + +
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+Namespaces | +Functions
+
array_right_rotation.cpp File Reference
+
+
+ +

Implementation for the Array right Rotation algorithm. +More...

+
#include <cassert>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for array_right_rotation.cpp:
+
+
+
+
+
+ + + + + + + +

+Namespaces

namespace  operations_on_datastructures
 for std::vector
 
namespace  tests
 Testcases to check Union of Two Arrays.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

void operations_on_datastructures::print (const std::vector< int32_t > &array)
 Prints the values of a vector sequentially, ending with a newline character. More...
 
std::vector< int32_t > operations_on_datastructures::shift_right (const std::vector< int32_t > &array, size_t shift)
 Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated. More...
 
void tests::test1 ()
 A Test to check an simple case. More...
 
void tests::test2 ()
 A Test to check an empty vector. More...
 
void tests::test3 ()
 A Test to check an invalid shift value. More...
 
void tests::test4 ()
 A Test to check a very large input. More...
 
void tests::test5 ()
 A Test to check a shift of zero. More...
 
static void test ()
 Function to test the correctness of shift_right() function. More...
 
int main ()
 main function More...
 
+

Detailed Description

+

Implementation for the Array right Rotation algorithm.

+

Shifting an array to the right involves moving each element of the array so that it occupies a position of a certain shift value after its current one. This implementation uses a result vector and does not mutate the input.

See also
array_left_rotation.cpp
+
Author
Alvin
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + +
int main (void )
+
+ +

main function

+
Returns
0 on exit
+
172 {
+
173 test(); // run self-test implementations
+
174 return 0;
+
175}
+
test
static void test()
Function to test the correctness of shift_right() function.
Definition: array_right_rotation.cpp:160
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test()

+ +
+
+ + + + + +
+ + + + + + + +
static void test ()
+ 		+static
+
+ +

Function to test the correctness of shift_right() function.

+
Returns
void
+
160 {
+
161 tests::test1();
+
162 tests::test2();
+
163 tests::test3();
+
164 tests::test4();
+
165 tests::test5();
+
166}
+
tests::test1
void test1()
A Test to check an simple case.
Definition: array_right_rotation.cpp:76
+
tests::test4
void test4()
A Test to check a very large input.
Definition: array_right_rotation.cpp:121
+
tests::test3
void test3()
A Test to check an invalid shift value.
Definition: array_right_rotation.cpp:106
+
tests::test2
void test2()
A Test to check an empty vector.
Definition: array_right_rotation.cpp:91
+
tests::test5
void test5()
A Test to check a shift of zero.
Definition: array_right_rotation.cpp:144
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ + + + diff --git a/d6/d57/array__right__rotation_8cpp.js b/d6/d57/array__right__rotation_8cpp.js new file mode 100644 index 000000000..bdb2aff62 --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp.js @@ -0,0 +1,12 @@ +var array__right__rotation_8cpp = +[ + [ "main", "d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "print", "d6/d57/array__right__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20", null ], + [ "shift_right", "d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86", null ], + [ "test", "d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], + [ "test1", "d6/d57/array__right__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5", null ], + [ "test2", "d6/d57/array__right__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", null ], + [ "test3", "d6/d57/array__right__rotation_8cpp.html#aa515639572647508b94986489aab6d76", null ], + [ "test4", "d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d", null ], + [ "test5", "d6/d57/array__right__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86", null ] +]; \ No newline at end of file diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..241ef70de --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..c4eeac3aa --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +9099a427e9eb30a69ccb1bd373f89a07 \ No newline at end of file diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..cc2e443c0 --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,236 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +tests::test1 + + + + + +Node1->Node2 + + + + + +Node8 + + +tests::test2 + + + + + +Node1->Node8 + + + + + +Node9 + + +tests::test3 + + + + + +Node1->Node9 + + + + + +Node10 + + +tests::test4 + + + + + +Node1->Node10 + + + + + +Node12 + + +tests::test5 + + + + + +Node1->Node12 + + + + + +Node3 + + +print + + + + + +Node2->Node3 + + + + + +Node6 + + +operations_on_datastructures +::shift_right + + + + + +Node2->Node6 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +is_prime + + + + + +Node3->Node5 + + + + + +Node7 + + +std::vector::size + + + + + +Node6->Node7 + + + + + +Node8->Node3 + + + + + +Node8->Node6 + + + + + +Node9->Node3 + + + + + +Node9->Node6 + + + + + +Node10->Node3 + + + + + +Node10->Node6 + + + + + +Node11 + + +std::vector::push_back + + + + + +Node10->Node11 + + + + + +Node12->Node3 + + + + + +Node12->Node6 + + + + + diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..54ae0d31a --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..43db613b5 --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +9e7716b44f4d27a897ef9b6ac9d20032 \ No newline at end of file diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..51da33ac5 --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,339 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..8ea2001be --- /dev/null +++ b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,251 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +tests::test1 + + + + + +Node2->Node3 + + + + + +Node9 + + +tests::test2 + + + + + +Node2->Node9 + + + + + +Node10 + + +tests::test3 + + + + + +Node2->Node10 + + + + + +Node11 + + +tests::test4 + + + + + +Node2->Node11 + + + + + +Node13 + + +tests::test5 + + + + + +Node2->Node13 + + + + + +Node4 + + +print + + + + + +Node3->Node4 + + + + + +Node7 + + +operations_on_datastructures +::shift_right + + + + + +Node3->Node7 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +is_prime + + + + + +Node4->Node6 + + + + + +Node8 + + +std::vector::size + + + + + +Node7->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node7 + + + + + +Node10->Node4 + + + + + +Node10->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node7 + + + + + +Node12 + + +std::vector::push_back + + + + + +Node11->Node12 + + + + + +Node13->Node4 + + + + + +Node13->Node7 + + + + + diff --git a/d8/d9c/union__of__two__arrays_8cpp.html b/d8/d9c/union__of__two__arrays_8cpp.html index aa094febe..6c02a57fd 100644 --- a/d8/d9c/union__of__two__arrays_8cpp.html +++ b/d8/d9c/union__of__two__arrays_8cpp.html @@ -116,7 +116,7 @@ Namespaces  for std::vector
  namespace  tests - Testcases to check Reversal of Binary Tree.
+ Testcases to check Union of Two Arrays.
  - + - + - + - + - + @@ -182,7 +182,7 @@ Functions
Here is the call graph for this function:
-
+
@@ -221,16 +221,16 @@ Here is the call graph for this function:
208 tests::test5();
209 tests::test6();
210}
-
tests::test1
void test1()
< Use the BinaryTree
Definition: reverse_binary_tree.cpp:167
-
tests::test4
void test4()
A Test to check correct functionality with duplicate values.
Definition: union_of_two_arrays.cpp:149
-
tests::test3
void test3()
A Test to check correct reversal of a Binary Tree.
Definition: reverse_binary_tree.cpp:212
+
tests::test1
void test1()
A Test to check an simple case.
Definition: array_right_rotation.cpp:76
+
tests::test4
void test4()
A Test to check a very large input.
Definition: array_right_rotation.cpp:121
+
tests::test3
void test3()
A Test to check an invalid shift value.
Definition: array_right_rotation.cpp:106
tests::test6
void test6()
A Test to check correct functionality with an array sorted using std::sort.
Definition: union_of_two_arrays.cpp:182
-
tests::test2
void test2()
A Test to check an edge case (NULL root element)
Definition: reverse_binary_tree.cpp:191
-
tests::test5
void test5()
A Test to check correct functionality with a harder test case.
Definition: union_of_two_arrays.cpp:165
+
tests::test2
void test2()
A Test to check an empty vector.
Definition: array_right_rotation.cpp:91
+
tests::test5
void test5()
A Test to check a shift of zero.
Definition: array_right_rotation.cpp:144
Here is the call graph for this function:
-
+
diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 73de03a59..2bcc5eebe 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,19 +1,20 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 8769d2c9a..7e374c3b2 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -35506b55f9d68224f3d831d50486bbee \ No newline at end of file +7465d70ce9186e0d3ab1409e0072ca90 \ No newline at end of file diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 9bcac4954..4613c6bbf 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -4,296 +4,342 @@ - - + + test - + Node1 - -test + +test Node2 - - -tests::test1 + + +tests::test1 Node1->Node2 - - + + - - -Node4 - - -tests::test2 + + +Node8 + + +tests::test2 - - -Node1->Node4 - - + + +Node1->Node8 + + - - -Node5 - - -tests::test3 + + +Node9 + + +tests::test3 - - -Node1->Node5 - - + + +Node1->Node9 + + - - -Node6 - - -tests::test4 + + +Node10 + + +tests::test4 - - -Node1->Node6 - - + + +Node1->Node10 + + + + + +Node12 + + +tests::test5 + + + + + +Node1->Node12 + + Node13 - - -tests::test5 + + +tests::test6 - + Node1->Node13 - - - - - -Node14 - - -tests::test6 - - - - - -Node1->Node14 - - + + Node3 - - -std::vector::size + + +print Node2->Node3 - - + + - + + +Node6 + + +operations_on_datastructures +::shift_right + + + + + +Node2->Node6 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +is_prime + + + + -Node4->Node3 - - +Node3->Node5 + + Node7 - - -operations_on_datastructures -::get_union + + +std::vector::size - + Node6->Node7 - - + + - - -Node10 - - -print - - - - - -Node6->Node10 - - - - - -Node7->Node3 - - - - - -Node8 - - -std::vector::back - - - - + -Node7->Node8 - - +Node8->Node3 + + - - -Node9 - - -std::vector::push_back - - - - + -Node7->Node9 - - +Node8->Node6 + + + + + +Node9->Node3 + + + + + +Node9->Node6 + + + + + +Node10->Node3 + + + + + +Node10->Node6 + + Node11 - - -std::endl + + +std::vector::push_back - + Node10->Node11 - - + + - - -Node12 - - -is_prime + + +Node12->Node3 + + + + + +Node12->Node6 + + + + + +Node13->Node3 + + + + + +Node14 + + +std::vector::begin - - -Node10->Node12 - - - - - -Node13->Node7 - - - - - -Node13->Node10 - - - - - -Node14->Node7 - - - - + -Node14->Node10 - - +Node13->Node14 + + Node15 - - -std::vector::begin + + +std::vector::end - - -Node14->Node15 - - + + +Node13->Node15 + + Node16 - - -std::vector::end + + +operations_on_datastructures +::get_union - - -Node14->Node16 - - + + +Node13->Node16 + + + + + +Node18 + + +std::sort + + + + + +Node13->Node18 + + + + + +Node16->Node7 + + + + + +Node16->Node11 + + Node17 - - -std::sort + + +std::vector::back - - -Node14->Node17 - - + + +Node16->Node17 + + diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 012fea24a..4875b727c 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,20 +1,21 @@ - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 7cc4f3a74..a71c3ac2c 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -57684c2816bfd490273435a926fa3e0e \ No newline at end of file +5a1cae760a674142a97e17db348ce68d \ No newline at end of file diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 76d73b445..2f265601f 100644 --- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -4,7 +4,7 @@ - +

@@ -128,19 +128,19 @@ Functions

 Gets the union of two sorted arrays, and returns them in a vector. More...
 
void tests::test1 ()
 < Use the BinaryTree More...
 A Test to check an simple case. More...
 
void tests::test2 ()
 A Test to check an edge case (NULL root element) More...
 A Test to check an empty vector. More...
 
void tests::test3 ()
 A Test to check correct reversal of a Binary Tree. More...
 A Test to check an invalid shift value. More...
 
void tests::test4 ()
 A Test to check correct functionality with duplicate values. More...
 A Test to check a very large input. More...
 
void tests::test5 ()
 A Test to check correct functionality with a harder test case. More...
 A Test to check a shift of zero. More...
 
void tests::test6 ()
 A Test to check correct functionality with an array sorted using std::sort. More...