From fc392ca293618c74f2c9860d0cf4b5f62fc5268e Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Mon, 28 Nov 2022 05:19:09 +0000 Subject: [PATCH] Documentation for e5ca4773e92c37dddd03ee1b98ab7668b6e684f7 --- ...amespacefind__non__repeating__integer.html | 118 +++++ ...ind__non__repeating__number_8cpp__incl.map | 6 + ...ind__non__repeating__number_8cpp__incl.md5 | 1 + ...ind__non__repeating__number_8cpp__incl.svg | 67 +++ d6/d38/find__non__repeating__number_8cpp.html | 288 ++++++++++ d6/d38/find__non__repeating__number_8cpp.js | 6 + ...8dca7b867074164d5f45b0f3851269d_cgraph.map | 4 + ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 1 + ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 36 ++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 51 ++ d7/d81/namespacebit__manipulation.html | 3 + dir_f3c4fbc4e901afa0a54d0623c5574aa7.html | 3 + dir_f3c4fbc4e901afa0a54d0623c5574aa7.js | 1 + files.html | 5 +- globals_func_i.html | 2 +- globals_func_m.html | 2 +- globals_func_s.html | 2 +- globals_func_t.html | 2 +- globals_i.html | 2 +- globals_m.html | 2 +- globals_p.html | 2 +- globals_s.html | 2 +- globals_t.html | 2 +- namespaces.html | 231 ++++---- namespaces_dup.js | 1 + navtreedata.js | 18 +- navtreeindex0.js | 496 ++++++++--------- navtreeindex1.js | 500 +++++++++--------- navtreeindex10.js | 30 +- navtreeindex11.js | 102 ++-- navtreeindex12.js | 56 +- navtreeindex13.js | 5 + navtreeindex2.js | 88 +-- navtreeindex3.js | 44 +- navtreeindex4.js | 62 +-- navtreeindex5.js | 106 ++-- navtreeindex6.js | 60 +-- navtreeindex7.js | 162 +++--- navtreeindex8.js | 102 ++-- navtreeindex9.js | 50 +- search/all_11.js | 4 +- search/all_14.js | 4 +- search/all_15.js | 6 +- search/all_7.js | 148 +++--- search/all_8.js | 4 +- search/all_a.js | 10 +- search/all_e.js | 259 ++++----- search/files_6.js | 5 +- search/functions_13.js | 4 +- search/functions_14.js | 2 +- search/functions_6.js | 127 ++--- search/functions_7.js | 4 +- search/functions_9.js | 8 +- search/functions_d.js | 2 +- search/namespaces_4.js | 3 +- 57 files changed, 1961 insertions(+), 1356 deletions(-) create mode 100644 d2/da7/namespacefind__non__repeating__integer.html create mode 100644 d3/dc0/find__non__repeating__number_8cpp__incl.map create mode 100644 d3/dc0/find__non__repeating__number_8cpp__incl.md5 create mode 100644 d3/dc0/find__non__repeating__number_8cpp__incl.svg create mode 100644 d6/d38/find__non__repeating__number_8cpp.html create mode 100644 d6/d38/find__non__repeating__number_8cpp.js create mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map create mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 create mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg create mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg diff --git a/d2/da7/namespacefind__non__repeating__integer.html b/d2/da7/namespacefind__non__repeating__integer.html new file mode 100644 index 000000000..2cbeb8043 --- /dev/null +++ b/d2/da7/namespacefind__non__repeating__integer.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: find_non_repeating_integer Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
find_non_repeating_integer Namespace Reference
+
+
+ +

Functions to find the non repeating integer in an array of repeating integers. Single Number +More...

+

Detailed Description

+

Functions to find the non repeating integer in an array of repeating integers. Single Number

+
+
+ + + + diff --git a/d3/dc0/find__non__repeating__number_8cpp__incl.map b/d3/dc0/find__non__repeating__number_8cpp__incl.map new file mode 100644 index 000000000..41ef77cd6 --- /dev/null +++ b/d3/dc0/find__non__repeating__number_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d3/dc0/find__non__repeating__number_8cpp__incl.md5 b/d3/dc0/find__non__repeating__number_8cpp__incl.md5 new file mode 100644 index 000000000..361f20c26 --- /dev/null +++ b/d3/dc0/find__non__repeating__number_8cpp__incl.md5 @@ -0,0 +1 @@ +80931053a266c00c1d0d19758ca36d43 \ No newline at end of file diff --git a/d3/dc0/find__non__repeating__number_8cpp__incl.svg b/d3/dc0/find__non__repeating__number_8cpp__incl.svg new file mode 100644 index 000000000..b532354f1 --- /dev/null +++ b/d3/dc0/find__non__repeating__number_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +bit_manipulation/find_non_repeating_number.cpp + + +Node1 + + +bit_manipulation/find +_non_repeating_number.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d6/d38/find__non__repeating__number_8cpp.html b/d6/d38/find__non__repeating__number_8cpp.html new file mode 100644 index 000000000..6f73900de --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp.html @@ -0,0 +1,288 @@ + + + + + + + +Algorithms_in_C++: bit_manipulation/find_non_repeating_number.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+Namespaces | +Functions
+
find_non_repeating_number.cpp File Reference
+
+
+ +

Implementation to find the non repeating integer in an array of repeating integers. Single Number +More...

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

+Namespaces

namespace  bit_manipulation
 for IO operations
 
namespace  find_non_repeating_integer
 Functions to find the non repeating integer in an array of repeating integers. Single Number
 
+ + + + + + + + + + +

+Functions

int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer (const std::vector< int > &nums)
 The main function implements find single number. More...
 
static void test ()
 Self-test implementations. More...
 
int main ()
 Main function. More...
 
+

Detailed Description

+

Implementation to find the non repeating integer in an array of repeating integers. Single Number

+

Given an array of integers in which all of the numbers occur exactly twice except one integer which occurs only once. Find the non-repeating integer.

+

Worst Case Time Complexity: O(n) Space complexity: O(1)

+
Author
Ravidev Pandey
+

Function Documentation

+ +

◆ find_non_repeating_integer()

+ +
+
+ + + + + + + + +
int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer (const std::vector< int > & nums)
+
+ +

The main function implements find single number.

+
Parameters
+ + +
numsvector of integers
+
+
+
Returns
returns the integer that occurs only once
+
39 {
+
40 // The idea is based on the property of XOR.
+
41 // We know that 'a' XOR 'a' is '0' and '0' XOR 'b'
+
42 // is b.
+
43 // Using this, if we XOR all the elements of the array,
+
44 // the repeating elements will give '0' and this '0'
+
45 // with the single number will give the number itself.
+
46
+
47 int _xor = 0;
+
48
+
49 for (const int& num: nums) {
+
50 _xor ^= num;
+
51 }
+
52
+
53 return _xor;
+
54}
+
+
+
+ +

◆ main()

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

Main function.

+
Returns
0 on exit
+
85 {
+
86 test(); // run self-test implementations
+
87 return 0;
+
88}
+
test
static void test()
Self-test implementations.
Definition: find_non_repeating_number.cpp:62
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test()

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

Self-test implementations.

+
Returns
void
+
62 {
+
63 // n = 10,2 return 14
+
64
+
65 std::vector<int> nums_one{1, 1, 2, 2, 4, 5, 5};
+
66 std::vector<int> nums_two{203, 3434, 4545, 3434, 4545};
+
67 std::vector<int> nums_three{90, 1, 3, 90, 3};
+
68
+
69 assert(bit_manipulation::find_non_repeating_integer::
+
70 find_non_repeating_integer(nums_one) ==
+
71 4); // 4 is non repeating
+
72 assert(bit_manipulation::find_non_repeating_integer::
+
73 find_non_repeating_integer(nums_two) ==
+
74 203); // 203 is non repeating
+
75 assert(bit_manipulation::find_non_repeating_integer::
+
76 find_non_repeating_integer(nums_three) ==
+
77 1); // 1 is non repeating
+
78
+
79 std::cout << "All test cases successfully passed!" << std::endl;
+
80}
+ +
std::endl
T endl(T... args)
+
find_non_repeating_integer
Functions to find the non repeating integer in an array of repeating integers. Single Number
+ +
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ + + + diff --git a/d6/d38/find__non__repeating__number_8cpp.js b/d6/d38/find__non__repeating__number_8cpp.js new file mode 100644 index 000000000..ff8e7ab38 --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp.js @@ -0,0 +1,6 @@ +var find__non__repeating__number_8cpp = +[ + [ "find_non_repeating_integer", "d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3", null ], + [ "main", "d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..e1af595fe --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..77de60e3f --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +f486c9c49ba8056684cc8746d21a532f \ No newline at end of file diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..4330d3536 --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,36 @@ + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..c643e09d2 --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..b0faae4cd --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +2d27c96272c095ac07d7b179138bd87a \ No newline at end of file diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..1661a56ee --- /dev/null +++ b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,51 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + diff --git a/d7/d81/namespacebit__manipulation.html b/d7/d81/namespacebit__manipulation.html index 23b028dfa..5965123a8 100644 --- a/d7/d81/namespacebit__manipulation.html +++ b/d7/d81/namespacebit__manipulation.html @@ -106,8 +106,11 @@ $(document).ready(function(){initNavTree('d7/d81/namespacebit__manipulation.html

Detailed Description

for IO operations

for io operations

+

storing the numbers

for assert

Bit manipulation algorithms

+

for assert for IO operations

+

Bit manipulation algorithms

for assert

Bit Manipulation algorithms

diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html index 9e071638d..49db0f41f 100644 --- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html +++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html @@ -112,6 +112,9 @@ Files file  count_of_trailing_ciphers_in_factorial_n.cpp  Count the number of ciphers in n! implementation
  +file  find_non_repeating_number.cpp + Implementation to find the non repeating integer in an array of repeating integers. Single Number
+  file  hamming_distance.cpp  Returns the Hamming distance between two integers.
  diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js index cdc6d7624..1b160f13a 100644 --- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js +++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js @@ -3,6 +3,7 @@ var dir_f3c4fbc4e901afa0a54d0623c5574aa7 = [ "count_bits_flip.cpp", "d7/d56/count__bits__flip_8cpp.html", "d7/d56/count__bits__flip_8cpp" ], [ "count_of_set_bits.cpp", "da/db8/count__of__set__bits_8cpp.html", "da/db8/count__of__set__bits_8cpp" ], [ "count_of_trailing_ciphers_in_factorial_n.cpp", "da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html", "da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp" ], + [ "find_non_repeating_number.cpp", "d6/d38/find__non__repeating__number_8cpp.html", "d6/d38/find__non__repeating__number_8cpp" ], [ "hamming_distance.cpp", "d4/d48/hamming__distance_8cpp.html", "d4/d48/hamming__distance_8cpp" ], [ "set_kth_bit.cpp", "d5/db5/set__kth__bit_8cpp.html", "d5/db5/set__kth__bit_8cpp" ] ]; \ No newline at end of file diff --git a/files.html b/files.html index 820c3dc24..700ccff10 100644 --- a/files.html +++ b/files.html @@ -119,8 +119,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  count_bits_flip.cppImplementation to [Count number of bits to be flipped to convert A to B] (https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/) in an integer  count_of_set_bits.cppImplementation to [count number of set bits of a number] (https://www.geeksforgeeks.org/count-set-bits-in-an-integer/) in an integer  count_of_trailing_ciphers_in_factorial_n.cppCount the number of ciphers in n! implementation - hamming_distance.cppReturns the Hamming distance between two integers - set_kth_bit.cppImplementation to [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) in an integer + find_non_repeating_number.cppImplementation to find the non repeating integer in an array of repeating integers. Single Number + hamming_distance.cppReturns the Hamming distance between two integers + set_kth_bit.cppImplementation to [From the right, set the Kth bit in the binary representation of N] (https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/) in an integer  ► ciphers  a1z26_cipher.cppImplementation of the A1Z26 cipher  atbash_cipher.cppAtbash Cipher implementation diff --git a/globals_func_i.html b/globals_func_i.html index 5adf40f08..08ae4645a 100644 --- a/globals_func_i.html +++ b/globals_func_i.html @@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
  • is_happy() : happy_number.cpp
  • is_prime() : check_prime.cpp
  • is_square() : ordinary_least_squares_regressor.cpp
    • -
  • IsPrime() : primality_test.cpp
  • isPrime() : modular_inverse_fermat_little_theorem.cpp
    • +
  • IsPrime() : primality_test.cpp
  • it_ternary_search() : ternary_search.cpp
    • diff --git a/globals_func_m.html b/globals_func_m.html index bf80324e6..bab3e7e1c 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl  

    - m -