From 3f7484dee9aedcea1b43e75b93a6e5541d702520 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Fri, 9 Jul 2021 09:49:51 +0000 Subject: [PATCH] Documentation for 34556ad93925310cb8f92a6a0142bdbac4482f8a --- d4/d48/hamming__distance_8cpp.html | 2 +- d5/d88/md__d_i_r_e_c_t_o_r_y.html | 1 + d7/d81/namespacebit__manipulation.html | 7 +- da/db8/count__of__set__bits_8cpp.html | 274 +++++++++ da/db8/count__of__set__bits_8cpp.js | 6 + ...f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map | 3 + ...f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5 | 1 + ...f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg | 29 + ...8dca7b867074164d5f45b0f3851269d_cgraph.map | 4 + ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 1 + ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 37 ++ ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 ++ dd/d9f/count__of__set__bits_8cpp__incl.map | 6 + dd/d9f/count__of__set__bits_8cpp__incl.md5 | 1 + dd/d9f/count__of__set__bits_8cpp__incl.svg | 68 +++ dd/dae/namespacecount__of__set__bits.html | 112 ++++ dir_f3c4fbc4e901afa0a54d0623c5574aa7.html | 3 + dir_f3c4fbc4e901afa0a54d0623c5574aa7.js | 1 + files.html | 3 +- globals_func_m.html | 1 + globals_func_s.html | 6 +- globals_func_t.html | 1 + globals_i.html | 6 +- globals_m.html | 1 + globals_p.html | 6 +- globals_s.html | 6 +- globals_t.html | 1 + namespacemembers.html | 6 +- namespacemembers_func.html | 6 +- namespaces.html | 317 +++++----- namespaces_dup.js | 1 + navtreedata.js | 26 +- navtreeindex0.js | 496 ++++++++-------- navtreeindex1.js | 500 ++++++++-------- navtreeindex10.js | 132 ++--- navtreeindex11.js | 152 ++--- navtreeindex12.js | 123 ++-- navtreeindex2.js | 242 ++++---- navtreeindex3.js | 176 +++--- navtreeindex4.js | 162 +++--- navtreeindex5.js | 192 +++--- navtreeindex6.js | 150 ++--- navtreeindex7.js | 232 ++++---- navtreeindex8.js | 160 ++--- navtreeindex9.js | 146 ++--- search/all_10.js | 154 ++--- search/all_11.js | 264 ++++----- search/all_12.js | 54 +- search/all_13.js | 256 ++++---- search/all_14.js | 546 +++++++++--------- search/all_15.js | 286 ++++----- search/all_16.js | 148 ++--- search/all_17.js | 108 ++-- search/all_18.js | 174 +++--- search/all_19.js | 12 +- search/all_1a.js | 8 +- search/all_1b.js | 6 +- search/all_1c.js | 194 +++---- search/all_4.js | 79 +-- search/all_5.js | 250 ++++---- search/all_6.js | 148 ++--- search/all_7.js | 269 ++++----- search/all_8.js | 208 +++---- search/all_9.js | 94 +-- search/all_a.js | 445 +++++++------- search/all_b.js | 16 +- search/all_c.js | 36 +- search/all_d.js | 188 +++--- search/all_e.js | 291 +++++----- search/all_f.js | 170 +++--- search/classes_0.js | 54 +- search/classes_1.js | 128 ++-- search/classes_10.js | 10 +- search/classes_11.js | 82 +-- search/classes_12.js | 100 ++-- search/classes_13.js | 54 +- search/classes_14.js | 72 +-- search/classes_15.js | 48 +- search/classes_16.js | 62 +- search/classes_17.js | 4 +- search/classes_18.js | 2 +- search/classes_2.js | 74 +-- search/classes_3.js | 32 +- search/classes_4.js | 36 +- search/classes_5.js | 34 +- search/classes_6.js | 12 +- search/classes_7.js | 18 +- search/classes_8.js | 210 +++---- search/classes_9.js | 2 +- search/classes_a.js | 4 +- search/classes_b.js | 36 +- search/classes_c.js | 76 +-- search/classes_d.js | 42 +- search/classes_e.js | 24 +- search/classes_f.js | 38 +- search/defines_0.js | 4 +- search/defines_1.js | 4 +- search/defines_2.js | 4 +- search/defines_3.js | 4 +- search/defines_4.js | 2 +- search/defines_5.js | 4 +- search/defines_6.js | 4 +- search/defines_7.js | 4 +- search/files_0.js | 2 +- search/files_1.js | 10 +- search/files_10.js | 30 +- search/files_11.js | 16 +- search/files_12.js | 14 +- search/files_13.js | 40 +- search/files_14.js | 16 +- search/files_15.js | 4 +- search/files_16.js | 8 +- search/files_17.js | 4 +- search/files_18.js | 2 +- search/files_2.js | 32 +- search/files_3.js | 27 +- search/files_4.js | 20 +- search/files_5.js | 8 +- search/files_6.js | 22 +- search/files_7.js | 16 +- search/files_8.js | 18 +- search/files_9.js | 12 +- search/files_a.js | 6 +- search/files_b.js | 10 +- search/files_c.js | 32 +- search/files_d.js | 24 +- search/files_e.js | 18 +- search/files_f.js | 8 +- search/functions_0.js | 12 +- search/functions_1.js | 172 +++--- search/functions_10.js | 182 +++--- search/functions_11.js | 22 +- search/functions_12.js | 176 +++--- search/functions_13.js | 416 ++++++------- search/functions_14.js | 208 +++---- search/functions_15.js | 96 +-- search/functions_16.js | 46 +- search/functions_17.js | 150 ++--- search/functions_18.js | 6 +- search/functions_19.js | 2 +- search/functions_1a.js | 4 +- search/functions_1b.js | 194 +++---- search/functions_2.js | 132 ++--- search/functions_3.js | 179 +++--- search/functions_4.js | 202 +++---- search/functions_5.js | 120 ++-- search/functions_6.js | 224 +++---- search/functions_7.js | 178 +++--- search/functions_8.js | 46 +- search/functions_9.js | 226 ++++---- search/functions_a.js | 6 +- search/functions_b.js | 18 +- search/functions_c.js | 114 ++-- search/functions_d.js | 194 +++---- search/functions_e.js | 114 ++-- search/functions_f.js | 130 ++--- search/groups_0.js | 2 +- search/groups_1.js | 4 +- search/groups_2.js | 2 +- search/namespaces_0.js | 6 +- search/namespaces_1.js | 10 +- search/namespaces_10.js | 10 +- search/namespaces_11.js | 34 +- search/namespaces_12.js | 6 +- search/namespaces_13.js | 2 +- search/namespaces_14.js | 4 +- search/namespaces_15.js | 4 +- search/namespaces_16.js | 2 +- search/namespaces_2.js | 11 +- search/namespaces_3.js | 10 +- search/namespaces_4.js | 4 +- search/namespaces_5.js | 6 +- search/namespaces_6.js | 6 +- search/namespaces_7.js | 6 +- search/namespaces_8.js | 2 +- search/namespaces_9.js | 4 +- search/namespaces_a.js | 12 +- search/namespaces_b.js | 16 +- search/namespaces_c.js | 12 +- search/namespaces_d.js | 4 +- search/namespaces_e.js | 6 +- search/namespaces_f.js | 6 +- search/pages_0.js | 2 +- search/pages_1.js | 6 +- search/pages_2.js | 2 +- search/pages_3.js | 2 +- search/pages_4.js | 4 +- search/related_0.js | 10 +- search/typedefs_0.js | 2 +- search/typedefs_1.js | 2 +- search/typedefs_2.js | 2 +- search/typedefs_3.js | 4 +- search/typedefs_4.js | 2 +- search/variables_0.js | 4 +- search/variables_1.js | 12 +- search/variables_10.js | 10 +- search/variables_11.js | 22 +- search/variables_12.js | 20 +- search/variables_13.js | 2 +- search/variables_14.js | 8 +- search/variables_15.js | 6 +- search/variables_16.js | 2 +- search/variables_17.js | 2 +- search/variables_2.js | 2 +- search/variables_3.js | 6 +- search/variables_4.js | 6 +- search/variables_5.js | 4 +- search/variables_6.js | 10 +- search/variables_7.js | 2 +- search/variables_8.js | 18 +- search/variables_9.js | 8 +- search/variables_a.js | 2 +- search/variables_b.js | 10 +- search/variables_c.js | 18 +- search/variables_d.js | 10 +- search/variables_e.js | 20 +- search/variables_f.js | 4 +- 219 files changed, 7293 insertions(+), 6664 deletions(-) create mode 100644 da/db8/count__of__set__bits_8cpp.html create mode 100644 da/db8/count__of__set__bits_8cpp.js create mode 100644 da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.map create mode 100644 da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.md5 create mode 100644 da/db8/count__of__set__bits_8cpp_a1f6a583b73a3e85c2d5121ed3d1c7d8a_cgraph.svg create mode 100644 da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map create mode 100644 da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 create mode 100644 da/db8/count__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg create mode 100644 da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/db8/count__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dd/d9f/count__of__set__bits_8cpp__incl.map create mode 100644 dd/d9f/count__of__set__bits_8cpp__incl.md5 create mode 100644 dd/d9f/count__of__set__bits_8cpp__incl.svg create mode 100644 dd/dae/namespacecount__of__set__bits.html diff --git a/d4/d48/hamming__distance_8cpp.html b/d4/d48/hamming__distance_8cpp.html index 3cd026345..2459d4eed 100644 --- a/d4/d48/hamming__distance_8cpp.html +++ b/d4/d48/hamming__distance_8cpp.html @@ -112,7 +112,7 @@ Include dependency graph for hamming_distance.cpp:
for io operations +
for std::vector More...
for io operations
+for std::vector
+for io operations
+for assert for io operations
+Bit manipulation algorithms
for assert
Bit Manipulation algorithms
|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Implementation to count sets bits in an integer. +More...
+#include <cassert>#include <iostream>#include <vector>+Namespaces | |
| bit_manipulation | |
| for std::vector | |
| count_of_set_bits | |
| Functions for the count sets bits implementation. | |
+Functions | |
| std::uint64_t | bit_manipulation::count_of_set_bits::countSetBits (int n) |
| The main function implements set bit count. More... | |
| static void | test () |
| Self-test implementations. More... | |
| int | main () |
| Main function. More... | |
Implementation to count sets bits in an integer.
+We are given an integer number. Let’s say, number. The task is to first calculate the binary digit of a number and then calculate the total set bits of a number.
+Set bits in a binary number is represented by 1. Whenever we calculate the binary number of an integer value it is formed as the combination of 0’s and 1’s. So digit 1 is known as a set bit in computer terms. Time Complexity: O(log n) Space complexity: O(1)
+| std::uint64_t bit_manipulation::count_of_set_bits::countSetBits | +( | +int | +n | ) | ++ |
The main function implements set bit count.
+| n | is the number whose set bit will be counted |
n | int main | +( | +void | +) | ++ |
+
|
+ +static | +
Self-test implementations.
+|
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+ |
+
Functions for the count sets bits implementation. +More...
+Functions for the count sets bits implementation.
+Files | |
| file | count_of_set_bits.cpp |
| Implementation to count sets bits in an integer. | |
| file | hamming_distance.cpp |
| Returns the Hamming distance between two integers. | |
| ► bit_manipulation | |
| ► ciphers | |
| Nbase64_encoding | Functions for Base64 Encoding and Decoding implementation |
| Nbidirectional_dijkstra | Functions for Bidirectional Dijkstra Shortest Path algorithm |
| Nbinomial | Functions for Binomial coefficients implementation |
| Nbit_manipulation | For io operations |
| Nbit_manipulation | For std::vector |
| Ncaesar | Functions for Caesar cipher algorithm |
| ►Nciphers | Base64 Encoding and Decoding |
| Ncut_rod | Implementation of cutting a rod problem |
| Ncycle_sort | Functions for Cycle sort algorithm |
| ►Ndata_structures | Data Structures algorithms |
| Ndepth_first_search | Functions for Depth First Search algorithm |
| Ndisjoint_union | Functions for Disjoint union implementation |
| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| Ndynamic_programming | Dynamic Programming algorithms |
| Nfalse_position | Functions for False Position method |
| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
| ►Ngeometry | Geometry algorithms |
| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
| ►Ngraph | Graph Algorithms |
| Nhamming_distance | Functions for Hamming distance implementation |
| Nheavy_light_decomposition | Heavy light decomposition algorithm |
| Nhorspool | Functions for Horspool's algorithm |
| Ninversion | Functions for counting inversions using Merge Sort algorithm |
| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
| Njarvis | Functions for Jarvis’s algorithm |
| Nkadane | Functions for Kadane algorithm |
| NKnapsack | Implementation of 0-1 Knapsack problem |
| Nlayers | This namespace contains layers used in MLP |
| Nlinear_algebra | For io operations |
| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
| Nlinked_list | Functions for singly linked list algorithm |
| Nlist_array | Functions for Dynamic Array algorithm |
| ►Nmachine_learning | A* search algorithm |
| ►Nmath | For IO operations |
| Nmedian_search | Functions for Median search algorithm |
| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
| Nmincoins_topdown | Functions for minimum coin exchange problem |
| NMinimum | Implementation of Minimum Edit Distance algorithm |
| Nmodular_division | Functions for Modular Division implementation |
| Nmorse | Functions for Morse Code |
| Nn_queens | Functions for Eight Queens puzzle |
| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
| Nncr_modulo_p | Functions for nCr modulo p implementation |
| Nneural_network | Neural Network or Multilayer Perceptron |
| Nnumerical_methods | For io operations |
| ►Noperations_on_datastructures | For std::priority_queue |
| ►Nothers | For assert |
| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
| Npancake_sort | Functions for Pancake sort algorithm |
| Npostfix_expression | Functions for Postfix Expression algorithm |
| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| Nqueue_using_array | Functions for Queue using Array implementation |
| Nradix_sort | Functions for Radix sort algorithm |
| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to- + |
| Ncount_of_set_bits | Functions for the count sets bits implementation |
| Ncut_rod | Implementation of cutting a rod problem |
| Ncycle_sort | Functions for Cycle sort algorithm |
| ►Ndata_structures | Data Structures algorithms |
| Ndepth_first_search | Functions for Depth First Search algorithm |
| Ndisjoint_union | Functions for Disjoint union implementation |
| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
| Ndynamic_programming | Dynamic Programming algorithms |
| Nfalse_position | Functions for False Position method |
| Nfibonacci_sum | Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) |
| ►Ngeometry | Geometry algorithms |
| Ngram_schmidt | Functions for Gram Schmidt Orthogonalisation Process |
| ►Ngraph | Graph Algorithms |
| Nhamming_distance | Functions for Hamming distance implementation |
| Nheavy_light_decomposition | Heavy light decomposition algorithm |
| Nhorspool | Functions for Horspool's algorithm |
| Ninversion | Functions for counting inversions using Merge Sort algorithm |
| Nis_graph_bipartite | Functions for checking whether a graph is bipartite or not |
| Niterative_tree_traversals | Functions for the Traversal of the Tree algorithm |
| Njarvis | Functions for Jarvis’s algorithm |
| Nkadane | Functions for Kadane algorithm |
| NKnapsack | Implementation of 0-1 Knapsack problem |
| Nlayers | This namespace contains layers used in MLP |
| Nlinear_algebra | For io operations |
| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
| Nlinear_recurrence_matrix | Functions for Linear Recurrence Matrix implementation |
| Nlinked_list | Functions for singly linked list algorithm |
| Nlist_array | Functions for Dynamic Array algorithm |
| ►Nmachine_learning | A* search algorithm |
| ►Nmath | For IO operations |
| Nmedian_search | Functions for Median search algorithm |
| Nmerge_insertion | Combined Intersion-Merge sorting algorithm |
| Nmincoins_topdown | Functions for minimum coin exchange problem |
| NMinimum | Implementation of Minimum Edit Distance algorithm |
| Nmodular_division | Functions for Modular Division implementation |
| Nmorse | Functions for Morse Code |
| Nn_queens | Functions for Eight Queens puzzle |
| Nn_queens_all_solutions | Functions for Eight Queens puzzle with all solutions |
| Nn_queens_optimized | Functions for Eight Queens puzzle optimized |
| Nncr_modulo_p | Functions for nCr modulo p implementation |
| Nneural_network | Neural Network or Multilayer Perceptron |
| Nnumerical_methods | For io operations |
| ►Noperations_on_datastructures | For std::priority_queue |
| ►Nothers | For assert |
| Npalindrome_partitioning | Functions for Palindrome Partitioning algorithm |
| Npancake_sort | Functions for Pancake sort algorithm |
| Npostfix_expression | Functions for Postfix Expression algorithm |
| Nqr_algorithm | Functions to compute QR decomposition of any rectangular matrix |
| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| Nqueue_using_array | Functions for Queue using Array implementation |
| Nradix_sort | Functions for Radix sort algorithm |
| Nrandom_pivot_quick_sort | Functions for the Random Pivot Quick Sort implementation |
| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
| Nrat_maze | Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to- solve-a-rat-in-a-maze-c-java-pytho/" |
| Nrunge_kutta | Functions for Runge Kutta fourth order method |
| Nsaddleback | Function for implementing Saddleback Algorithm |
| ►Nsearch | Search algorithms |
| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
| Nsorting | Sorting algorithms |
| Nsparse_table | Functions for Implementation of Sparse Table |
| Nspirograph | |
| ►Nstatistics | Statistical algorithms |
| ►Nstd | STL namespace |
| Nstrand | Functions for Strand Sort algorithm |
| Nstring_search | String search algorithms |
| Nstrings | Algorithms with strings |
| Nsublist_search | Functions for the Sublist Search implementation |
| Ntree_234 | Functions for 2–3–4 tree |
| Ntrie_operations | Functions for Trie datastructure implementation |
| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
| Nutil_functions | Various utility functions used in Neural network |
| Nvector_cross | Functions for Vector Cross Product algorithms |
| Nvigenere | Functions for vigenère cipher algorithm |
| Nwiggle_sort | Functions for Wiggle Sort algorithm |
| Nword_break | Functions for Word Break problem |
| NXOR | Functions for XOR cipher algorithm |
| Nrunge_kutta | Functions for Runge Kutta fourth order method |
| Nsaddleback | Function for implementing Saddleback Algorithm |
| ►Nsearch | Search algorithms |
| Nshortest_common_supersequence | Shortest Common Super Sequence algorithm |
| Nsorting | Sorting algorithms |
| Nsparse_table | Functions for Implementation of Sparse Table |
| Nspirograph | |
| ►Nstatistics | Statistical algorithms |
| ►Nstd | STL namespace |
| Nstrand | Functions for Strand Sort algorithm |
| Nstring_search | String search algorithms |
| Nstrings | Algorithms with strings |
| Nsublist_search | Functions for the Sublist Search implementation |
| Ntree_234 | Functions for 2–3–4 tree |
| Ntrie_operations | Functions for Trie datastructure implementation |
| Ntrie_using_hashmap | Functions for Trie data structure using hashmap implementation |
| Nutil_functions | Various utility functions used in Neural network |
| Nvector_cross | Functions for Vector Cross Product algorithms |
| Nvigenere | Functions for vigenère cipher algorithm |
| Nwiggle_sort | Functions for Wiggle Sort algorithm |
| Nword_break | Functions for Word Break problem |
| NXOR | Functions for XOR cipher algorithm |