+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Namespaces |
+Functions
+ array_left_rotation.cpp File Reference
+
+
+
+
+
+
+
+
+Implementation for the Array Left Rotation algorithm. +More...
+#include <cassert>+
#include <iostream>+
#include <vector>+
+Include dependency graph for array_left_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_left (const std::vector< int32_t > &array, size_t shift) |
| Shifts the given vector to the left 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_left() function. More... | |
| int | main () |
| main function More... | |
Detailed Description
+Implementation for the Array Left Rotation algorithm.
+Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input.
+Function Documentation
+ +◆ main()
+ +
+
+
+
+
+
+
+| int main | +( | +void | +) | ++ |
◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+Function to test the correctness of shift_left() function.
+- Returns
- void
+
+
+
+
+
+
+
+
+
+
+
+
void test3()
A Test to check an invalid shift value.
Definition: array_left_rotation.cpp:105
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
diff --git a/d9/d14/array__left__rotation_8cpp.js b/d9/d14/array__left__rotation_8cpp.js
new file mode 100644
index 000000000..718d90da4
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp.js
@@ -0,0 +1,12 @@
+var array__left__rotation_8cpp =
+[
+ [ "main", "d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "print", "d9/d14/array__left__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20", null ],
+ [ "shift_left", "d9/d14/array__left__rotation_8cpp.html#afce39cf843989a39811a49ebe29dd6d8", null ],
+ [ "test", "d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ],
+ [ "test1", "d9/d14/array__left__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5", null ],
+ [ "test2", "d9/d14/array__left__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669", null ],
+ [ "test3", "d9/d14/array__left__rotation_8cpp.html#aa515639572647508b94986489aab6d76", null ],
+ [ "test4", "d9/d14/array__left__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d", null ],
+ [ "test5", "d9/d14/array__left__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86", null ]
+];
\ No newline at end of file
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..c7afc6e87
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,14 @@
+
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..c3d8b4192
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+9a5272c10fb8e754bbb836f8f6fe630a
\ No newline at end of file
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..bda0fb7db
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,236 @@
+
+
+
+
+
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 000000000..d792393e3
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,15 @@
+
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..74d1cda03
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+3ab353b65fbfe90673ebc951ed098381
\ No newline at end of file
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..93cdfe8b0
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,339 @@
+
+
+
+
+
+
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..4ac00b234
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,251 @@
+
+
+
+
+
diff --git a/d9/df4/namespacetests.html b/d9/df4/namespacetests.html
index 2ee0f6d7f..6ac1b891b 100644
--- a/d9/df4/namespacetests.html
+++ b/d9/df4/namespacetests.html
@@ -145,6 +145,7 @@ Functions
-
+
+
- Generated by
1.9.2
+
A Test to check an edge case (two empty arrays)
- Returns
- void
A Test to check an edge case (single element reversal)
+< Should print 3 4 5 1 2
< Should print 4 5 1 2 3
< Check if result is empty
< Should only print newline
@@ -153,6 +154,7 @@ Functions< Check if both elements are same
< Check if result is empty
< Should only print newline
+< Should print 4 5 1 2 3
< Check if result is empty
< Should only print newline
< Check for equal sizes
@@ -160,19 +162,19 @@ Functions< Check if both elements are same
< Check if result is empty
< Should only print newline
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
-
+
std::vector< int32_t > 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....
Definition: array_right_rotation.cpp:47
std::vector< int32_t > shift_left(const std::vector< int32_t > &array, size_t shift)
Shifts the given vector to the left by the shift amount and returns a new vector with the result....
Definition: array_left_rotation.cpp:46
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
@@ -204,29 +206,31 @@ Here is the call graph for this function:
A Test to check an edge case (one empty array)
- Returns
- void
< Should print empty newline
+< Should print empty newline
< Check if result is equal to a
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if result is equal to b
< Should print 2 3
+< Should print empty newline
< Check if result is equal to a
< Should only print newline
< Check for equal sizes
< Ensure that there is only one element
< Check if result is equal to b
< Should print 2 3
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
-
-
+
+
+
+
+
+
+
+
+
+
+
+
Here is the call graph for this function:
@@ -257,29 +261,33 @@ Here is the call graph for this function:
- Returns
- void
< 7 > 5
< Should print empty newline
+< 7 > 5
+< Should print empty newline
< Check if result is correct
< Should print 6
< Check for equality
< Check for equality
< Check if result is correct
< Should print 2 3 4 6
+< 7 > 5
+< Should print empty newline
< Check if result is correct
< Should print 6
< Check for equality
< Check for equality
< Check if result is correct
< Should print 2 3 4 6
-
-
-
-
-
-
-
-
-
-
-
+
-
-
-
+
+
+
+
+
+
+
+
+
+
Here is the call graph for this function:
@@ -307,34 +315,36 @@ Here is the call graph for this function:
A Test to check a very large input.
A Test to check correct functionality with duplicate values.
- Returns
- void
< Should print {4, 6, ..., 420, 2}
< Should print {420, 2, 4, ..., 418}
< Check if result is correct
< Should print 4 6
< Check if result is correct
< Should print 2 3 4 6 7
+< Should print {420, 2, 4, ..., 418}
< Check if result is correct
< Should print 4 6
< Check if result is correct
< Should print 2 3 4 6 7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
T push_back(T... args)
Here is the call graph for this function:
@@ -364,24 +374,26 @@ Here is the call graph for this function:A Test to check correct functionality with a harder test case.
- Returns
- void
< Should print 1 2 3 4 5
+< Should print 1 2 3 4 5
< Check if result is correct
< Should print 2 3 4
< Check if result is correct
< Should print 1 2 3 4 5 6 7 9
+< Should print 1 2 3 4 5
< Check if result is correct
< Should print 2 3 4
< Check if result is correct
< Should print 1 2 3 4 5 6 7 9
-
-
-
-
-
-
-
-
-
-
+
+
+
+
+
+
+
+
+
+
+
+
Here is the call graph for this function:
diff --git a/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.map b/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.map
index 5ad3fd635..d41bced76 100644
--- a/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.map
+++ b/d9/df4/namespacetests_a167c24bd817469ae47358d12e034f2d5_cgraph.map
@@ -1,7 +1,7 @@
Print newline
Print each value in the array
Print newline
-
-
-
-
-
-
+
+Print each value in the array
+Print newline
+Print each value in the array
+Print newline
+ +◆ shift_left()
+ +
+
diff --git a/da/d6d/namespaceoperations__on__datastructures.js b/da/d6d/namespaceoperations__on__datastructures.js
index 348fd89d5..64813294f 100644
--- a/da/d6d/namespaceoperations__on__datastructures.js
+++ b/da/d6d/namespaceoperations__on__datastructures.js
@@ -21,5 +21,6 @@ var namespaceoperations__on__datastructures =
[ "get_intersection", "da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e", null ],
[ "get_union", "da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74", null ],
[ "print", "da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20", null ],
+ [ "shift_left", "da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8", null ],
[ "shift_right", "da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86", null ]
];
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map
new file mode 100644
index 000000000..bddb0b2b0
--- /dev/null
+++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5
new file mode 100644
index 000000000..915f6e6f8
--- /dev/null
+++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5
@@ -0,0 +1 @@
+620af06cdd5679a92bf5c83c1e58a9d0
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg
new file mode 100644
index 000000000..3b711da3a
--- /dev/null
+++ b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg
@@ -0,0 +1,38 @@
+
+
+
+
+
diff --git a/dd/d2b/array__left__rotation_8cpp__incl.map b/dd/d2b/array__left__rotation_8cpp__incl.map
new file mode 100644
index 000000000..c86c3aa42
--- /dev/null
+++ b/dd/d2b/array__left__rotation_8cpp__incl.map
@@ -0,0 +1,6 @@
+
diff --git a/dd/d2b/array__left__rotation_8cpp__incl.md5 b/dd/d2b/array__left__rotation_8cpp__incl.md5
new file mode 100644
index 000000000..bb9c18fac
--- /dev/null
+++ b/dd/d2b/array__left__rotation_8cpp__incl.md5
@@ -0,0 +1 @@
+6eb48da9580da83174b14728ac367b1f
\ No newline at end of file
diff --git a/dd/d2b/array__left__rotation_8cpp__incl.svg b/dd/d2b/array__left__rotation_8cpp__incl.svg
new file mode 100644
index 000000000..3f1c11c42
--- /dev/null
+++ b/dd/d2b/array__left__rotation_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
diff --git a/de/dc5/intersection__of__two__arrays_8cpp.html b/de/dc5/intersection__of__two__arrays_8cpp.html
index 3f8b59c37..cb08d4813 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp.html
+++ b/de/dc5/intersection__of__two__arrays_8cpp.html
@@ -222,12 +222,12 @@ Here is the call graph for this function:
+
+
+
| std::vector< int32_t > operations_on_datastructures::shift_left | +( | +const std::vector< int32_t > & | +array, | +
| + | + | size_t | +shift | +
| + | ) | ++ |
+
+
Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.
+Shifts the values of the vector, by creating a new vector and adding values from the shift index to the end, then appending the rest of the elements from the start of the vector.
- Parameters
-
+
+
+array A reference to the input std::vector shift The amount to be shifted to the left
+
- Returns
- A std::vector with the shifted values
< We got an invalid shift, return empty array
+< Result array
+< Add values after the shift index
+< Add the values from the start
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Here is the call graph for this function:
+
+
+
+
+void test3()
A Test to check an invalid shift value.
Definition: array_right_rotation.cpp:106
void test3()
A Test to check an invalid shift value.
Definition: array_left_rotation.cpp:105
void test6()
A Test to check correct functionality with an array sorted using std::sort.
Definition: intersection_of_two_arrays.cpp:166
Here is the call graph for this function:
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
index 64dac6b3b..5617d0294 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -7,7 +7,7 @@
-
+
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
index 30b656d85..bb6af84d0 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -1 +1 @@
-d8943a7f71d6edbdca306d1447065b02
\ No newline at end of file
+715046e2bd75f30d0fdc3e248c39742a
\ No newline at end of file
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
index e23eafe7c..bc1625ffa 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -126,10 +126,10 @@
Node6
-
+
operations_on_datastructures
-::shift_right
+::shift_left
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
index 9664dce18..ed9a54d6a 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -8,7 +8,7 @@
-
+
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
index 9b325a8b3..c1a2ea1b5 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -1 +1 @@
-417cd509b94870731902e932bd065945
\ No newline at end of file
+4c4d8b685e626d8b9c470ebf8983c446
\ No newline at end of file
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
index aa9190774..14fcfae8b 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -187,10 +187,10 @@ var sectionId = 'dynsection-1';
Node7
-
+
operations_on_datastructures
-::shift_right
+::shift_left
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
index 81d7bced4..1196cd1de 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -141,10 +141,10 @@
Node7
-
+
operations_on_datastructures
-::shift_right
+::shift_left
diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html
index 9c4713fbf..39aee3433 100644
--- a/dir_35422be6552f1b3672c1b6c4aba2da64.html
+++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html
@@ -96,6 +96,9 @@ $(document).ready(function(){initNavTree('dir_35422be6552f1b3672c1b6c4aba2da64.h
Files | |
| file | array_left_rotation.cpp |
| Implementation for the Array Left Rotation algorithm. | |
| file | array_right_rotation.cpp |
| Implementation for the Array right Rotation algorithm. | |
| ► operations_on_datastructures | |
| ► others | |