From 6fd3d323430262811de4fb49ffb6f7748f40eece Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sun, 24 Oct 2021 00:58:02 +0000 Subject: [PATCH] Documentation for 51e1dda02e6f0e0440647d9ab2ff9e51c7907402 --- d8/ddf/sieve__of__eratosthenes_8cpp.html | 2 +- ...mespaceoperations__on__datastructures.html | 2 +- db/d93/check__prime_8cpp.html | 23 +++++++++---------- 3 files changed, 13 insertions(+), 14 deletions(-) diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html index 54e7075da..bb0e5bf80 100644 --- a/d8/ddf/sieve__of__eratosthenes_8cpp.html +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html @@ -150,7 +150,7 @@ Space Complexity : \(O(N)\)

70 print(N, is_prime);
71 return 0;
72}
-
is_prime
bool is_prime(T num)
for IO operations
Definition: check_prime.cpp:23
+
is_prime
bool is_prime(T num)
for IO operations
Definition: check_prime.cpp:24
data_structures::sparse_table::N
constexpr uint32_t N
A struct to represent sparse table for min() as their invariant function, for the given array A....
Definition: sparse_table.cpp:47
print
void print(uint32_t N, const std::vector< bool > &is_prime)
Definition: sieve_of_eratosthenes.cpp:44
sieve
std::vector< bool > sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:26
diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html index e51699a49..9f507ba80 100644 --- a/da/d6d/namespaceoperations__on__datastructures.html +++ b/da/d6d/namespaceoperations__on__datastructures.html @@ -255,7 +255,7 @@ Here is the call graph for this function:

Print each value in the array

Print newline

30 {
-
31 for (int64_t i : array) {
+
31 for (int32_t i : array) {
32 std::cout << i << " "; /// Print each value in the array
33 }
34 std::cout << "\n"; /// Print newline
diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html index c18d14f49..a5b49ee05 100644 --- a/db/d93/check__prime_8cpp.html +++ b/db/d93/check__prime_8cpp.html @@ -147,18 +147,17 @@ template<typename T >
Returns
if number is prime, it returns @ true, else it returns @ false.
-
23 {
-
24 bool result = true;
-
25 if (num <= 1) {
-
26 return false;
-
27 } else if (num == 2 || num==3) {
-
28 return true;
-
29 } else if ((num%2) == 0 || num%3 == 0) {
-
30 return false;
-
31 }
-
32 else {
+
24 {
+
25 bool result = true;
+
26 if (num <= 1) {
+
27 return false;
+
28 } else if (num == 2 || num == 3) {
+
29 return true;
+
30 } else if ((num % 2) == 0 || num % 3 == 0) {
+
31 return false;
+
32 } else {
33 for (T i = 5; (i * i) <= (num); i = (i + 6)) {
-
34 if ((num % i) == 0 || (num%(i+2)==0 )) {
+
34 if ((num % i) == 0 || (num % (i + 2) == 0)) {
35 result = false;
36 break;
37 }
@@ -205,7 +204,7 @@ template<typename T >
62}
std::cin
std::cout
-
is_prime
bool is_prime(T num)
for IO operations
Definition: check_prime.cpp:23
+
is_prime
bool is_prime(T num)
for IO operations
Definition: check_prime.cpp:24
std::endl
T endl(T... args)
Here is the call graph for this function: