From 175d83c76417626713be60440f6905fccf27619f Mon Sep 17 00:00:00 2001 From: realstealthninja Date: Fri, 15 Aug 2025 03:54:34 +0000 Subject: [PATCH] Documentation for fb27d4d304cb6e8d2e3d6cbd36a4dfc1db3c00d4 --- d0/d04/qr__decompose_8h__incl.svg | 2 +- d0/d04/qr__decompose_8h__incl_org.svg | 2 +- d0/d08/realtime__stats_8cpp.html | 14 +-- d0/d08/realtime__stats_8cpp.js | 2 +- d0/d08/realtime__stats_8cpp_source.html | 4 +- .../fast__fourier__transform_8cpp__incl.svg | 2 +- ...ast__fourier__transform_8cpp__incl_org.svg | 2 +- d0/d1f/structnode__coll__graph.svg | 2 +- d0/d1f/structnode__coll__graph_org.svg | 2 +- ...lassgraph_1_1_rooted_tree__coll__graph.svg | 2 +- ...graph_1_1_rooted_tree__coll__graph_org.svg | 2 +- d0/d2c/class_r_btree__coll__graph.svg | 2 +- d0/d2c/class_r_btree__coll__graph_org.svg | 2 +- ...ecomposition_1_1_h_l_d__inherit__graph.svg | 2 +- ...position_1_1_h_l_d__inherit__graph_org.svg | 2 +- ...__for__fast__multiplication_8cpp__incl.svg | 2 +- ...r__fast__multiplication_8cpp__incl_org.svg | 2 +- ..._1_1linked__list_1_1_node__coll__graph.svg | 2 +- ...linked__list_1_1_node__coll__graph_org.svg | 2 +- d0/d3c/classvector__coll__graph.svg | 2 +- d0/d3c/classvector__coll__graph_org.svg | 2 +- ...tree__traversals_1_1_node__coll__graph.svg | 2 +- ...__traversals_1_1_node__coll__graph_org.svg | 2 +- d0/d52/duval_8cpp__incl.svg | 2 +- d0/d52/duval_8cpp__incl_org.svg | 2 +- d0/d59/uint256__t_8hpp__dep__incl.svg | 2 +- d0/d59/uint256__t_8hpp__dep__incl_org.svg | 2 +- d0/d5b/windowed__median_8cpp__incl.svg | 2 +- d0/d5b/windowed__median_8cpp__incl_org.svg | 2 +- d0/d5e/exponential__dist_8cpp__incl.svg | 2 +- d0/d5e/exponential__dist_8cpp__incl_org.svg | 2 +- ...ratic__probing__hash__table_8cpp__incl.svg | 2 +- ...c__probing__hash__table_8cpp__incl_org.svg | 2 +- d0/d76/binary__insertion__sort_8cpp__incl.svg | 2 +- ...binary__insertion__sort_8cpp__incl_org.svg | 2 +- d0/d77/linear__search_8cpp__incl.svg | 2 +- d0/d77/linear__search_8cpp__incl_org.svg | 2 +- d0/d83/n__queens_8cpp__incl.svg | 2 +- d0/d83/n__queens_8cpp__incl_org.svg | 2 +- d0/da1/string__fibonacci_8cpp__incl.svg | 2 +- d0/da1/string__fibonacci_8cpp__incl_org.svg | 2 +- d0/db1/check__factorial_8cpp__incl.svg | 2 +- d0/db1/check__factorial_8cpp__incl_org.svg | 2 +- d0/db5/trie__modern_8cpp__incl.svg | 2 +- d0/db5/trie__modern_8cpp__incl_org.svg | 2 +- d0/db6/non__recursive__merge__sort_8cpp.html | 14 +-- ...n__recursive__merge__sort_8cpp_source.html | 2 +- d0/db7/smallest__circle_8cpp__incl.svg | 2 +- d0/db7/smallest__circle_8cpp__incl_org.svg | 2 +- ...tersection__of__two__arrays_8cpp__incl.svg | 2 +- ...ection__of__two__arrays_8cpp__incl_org.svg | 2 +- d0/dcc/modular__division_8cpp__incl.svg | 2 +- d0/dcc/modular__division_8cpp__incl_org.svg | 2 +- .../successive__approximation_8cpp__incl.svg | 2 +- ...ccessive__approximation_8cpp__incl_org.svg | 2 +- d0/dd1/binaryheap_8cpp__incl.svg | 2 +- d0/dd1/binaryheap_8cpp__incl_org.svg | 2 +- d0/dd3/modular__exponentiation_8cpp__incl.svg | 2 +- ...modular__exponentiation_8cpp__incl_org.svg | 2 +- d0/dd5/ode__midpoint__euler_8cpp__incl.svg | 2 +- .../ode__midpoint__euler_8cpp__incl_org.svg | 2 +- ...k__using__queue_1_1_stack__coll__graph.svg | 2 +- ...sing__queue_1_1_stack__coll__graph_org.svg | 2 +- d0/df1/z__function_8cpp__incl.svg | 2 +- d0/df1/z__function_8cpp__incl_org.svg | 2 +- d0/dfc/sqrt__double_8cpp__incl.svg | 2 +- d0/dfc/sqrt__double_8cpp__incl_org.svg | 2 +- ..._first__search__with__stack_8cpp__incl.svg | 2 +- ...st__search__with__stack_8cpp__incl_org.svg | 2 +- ...__search_1_1_eight_puzzle__coll__graph.svg | 2 +- ...arch_1_1_eight_puzzle__coll__graph_org.svg | 2 +- d1/d06/ternary__search_8cpp__incl.svg | 2 +- d1/d06/ternary__search_8cpp__incl_org.svg | 2 +- ...s_1_1linked__list_1_1list__coll__graph.svg | 2 +- ...1linked__list_1_1list__coll__graph_org.svg | 2 +- d1/d1d/pascal__triangle_8cpp__incl.svg | 2 +- d1/d1d/pascal__triangle_8cpp__incl_org.svg | 2 +- d1/d33/caesar__cipher_8cpp__incl.svg | 2 +- d1/d33/caesar__cipher_8cpp__incl_org.svg | 2 +- .../queue__using__two__stacks_8cpp__incl.svg | 2 +- ...eue__using__two__stacks_8cpp__incl_org.svg | 2 +- ...st__increasing__subsequence_8cpp__incl.svg | 2 +- ...increasing__subsequence_8cpp__incl_org.svg | 2 +- ...__of__digits__in__a__number_8cpp__incl.svg | 2 +- ...__digits__in__a__number_8cpp__incl_org.svg | 2 +- ...__least__squares__regressor_8cpp__incl.svg | 2 +- ...ast__squares__regressor_8cpp__incl_org.svg | 2 +- d1/d52/lcm__sum_8cpp__incl.svg | 2 +- d1/d52/lcm__sum_8cpp__incl_org.svg | 2 +- d1/d57/classcll__coll__graph.svg | 2 +- d1/d57/classcll__coll__graph_org.svg | 2 +- ...ic_3_01uint256__t_01_4__inherit__graph.svg | 2 +- ..._01uint256__t_01_4__inherit__graph_org.svg | 2 +- ...ht__decomposition_1_1_s_g__coll__graph.svg | 2 +- ...decomposition_1_1_s_g__coll__graph_org.svg | 2 +- d1/d6c/classstats__computer1__coll__graph.svg | 2 +- ...classstats__computer1__coll__graph_org.svg | 2 +- d1/d6d/lru__cache_8cpp__incl.svg | 2 +- d1/d6d/lru__cache_8cpp__incl_org.svg | 2 +- d1/d6d/queue__using__array_8cpp__incl.svg | 2 +- d1/d6d/queue__using__array_8cpp__incl_org.svg | 2 +- d1/d6f/vector__ops_8hpp__dep__incl.svg | 2 +- d1/d6f/vector__ops_8hpp__dep__incl_org.svg | 2 +- ..._1_lowest_common_ancestor__coll__graph.svg | 2 +- ...owest_common_ancestor__coll__graph_org.svg | 2 +- d1/d73/jarvis__algorithm_8cpp__incl.svg | 2 +- d1/d73/jarvis__algorithm_8cpp__incl_org.svg | 2 +- d1/d7c/fibonacci__bottom__up_8cpp_source.html | 2 +- d1/d7d/gcd__of__n__numbers_8cpp__incl.svg | 2 +- d1/d7d/gcd__of__n__numbers_8cpp__incl_org.svg | 2 +- .../unbounded__0__1__knapsack_8cpp__incl.svg | 2 +- ...bounded__0__1__knapsack_8cpp__incl_org.svg | 2 +- d1/d90/subarray__sum_8cpp__incl.svg | 2 +- d1/d90/subarray__sum_8cpp__incl_org.svg | 2 +- .../decimal__to__hexadecimal_8cpp__incl.svg | 2 +- ...ecimal__to__hexadecimal_8cpp__incl_org.svg | 2 +- d1/daa/random__pivot__quick__sort_8cpp.html | 57 +++++------- d1/daa/random__pivot__quick__sort_8cpp.js | 2 +- ...andom__pivot__quick__sort_8cpp_source.html | 38 ++++---- ...egral_3_01uint128__t_01_4__coll__graph.svg | 2 +- ...l_3_01uint128__t_01_4__coll__graph_org.svg | 2 +- d1/db6/boyer__moore_8cpp__incl.svg | 2 +- d1/db6/boyer__moore_8cpp__incl_org.svg | 2 +- ...1_1_cache_1_1_l_r_u_cache__coll__graph.svg | 2 +- ...cache_1_1_l_r_u_cache__coll__graph_org.svg | 2 +- d1/dbb/k__nearest__neighbors_8cpp__incl.svg | 2 +- .../k__nearest__neighbors_8cpp__incl_org.svg | 2 +- d1/dbb/n__choose__r_8cpp.html | 31 ++----- d1/dbb/n__choose__r_8cpp.js | 2 +- d1/dbb/n__choose__r_8cpp_source.html | 12 +-- ...__ciphers__in__factorial__n_8cpp__incl.svg | 2 +- ...phers__in__factorial__n_8cpp__incl_org.svg | 2 +- d1/dc2/class_graph__coll__graph.svg | 2 +- d1/dc2/class_graph__coll__graph_org.svg | 2 +- d1/dc5/classlarge__number__coll__graph.svg | 2 +- .../classlarge__number__coll__graph_org.svg | 2 +- d1/dce/classuint256__t__coll__graph.svg | 2 +- d1/dce/classuint256__t__coll__graph_org.svg | 2 +- d1/dd7/union__of__two__arrays_8cpp__incl.svg | 2 +- .../union__of__two__arrays_8cpp__incl_org.svg | 2 +- ...hashmap_1_1_trie_1_1_node__coll__graph.svg | 2 +- ...map_1_1_trie_1_1_node__coll__graph_org.svg | 2 +- ..._decomposition_1_1_s_g__inherit__graph.svg | 2 +- ...omposition_1_1_s_g__inherit__graph_org.svg | 2 +- d1/ded/windowed__median_8cpp.html | 89 ++++++++---------- d1/ded/windowed__median_8cpp.js | 2 +- d1/ded/windowed__median_8cpp_source.html | 70 +++++++------- ..._1_1generate__parentheses__coll__graph.svg | 2 +- ...generate__parentheses__coll__graph_org.svg | 2 +- d1/df6/bidirectional__dijkstra_8cpp__incl.svg | 2 +- ...bidirectional__dijkstra_8cpp__incl_org.svg | 2 +- d1/df9/qr__decomposition_8cpp__incl.svg | 2 +- d1/df9/qr__decomposition_8cpp__incl_org.svg | 2 +- d2/d1a/vigenere__cipher_8cpp__incl.svg | 2 +- d2/d1a/vigenere__cipher_8cpp__incl_org.svg | 2 +- d2/d23/neural__network_8cpp__incl.svg | 2 +- d2/d23/neural__network_8cpp__incl_org.svg | 2 +- d2/d26/addition__rule_8cpp__incl.svg | 2 +- d2/d26/addition__rule_8cpp__incl_org.svg | 2 +- d2/d27/approximate__pi_8cpp__incl.svg | 2 +- d2/d27/approximate__pi_8cpp__incl_org.svg | 2 +- d2/d2c/segment__tree_8cpp__incl.svg | 2 +- d2/d2c/segment__tree_8cpp__incl_org.svg | 2 +- d2/d38/pancake__sort_8cpp__incl.svg | 2 +- d2/d38/pancake__sort_8cpp__incl_org.svg | 2 +- .../insertion__sort__recursive_8cpp__incl.svg | 2 +- ...ertion__sort__recursive_8cpp__incl_org.svg | 2 +- d2/d4b/spirograph_8cpp__incl.svg | 2 +- d2/d4b/spirograph_8cpp__incl_org.svg | 2 +- d2/d53/circular__linked__list_8cpp__incl.svg | 2 +- .../circular__linked__list_8cpp__incl_org.svg | 2 +- d2/d5f/merge__sort_8cpp__incl.svg | 2 +- d2/d5f/merge__sort_8cpp__incl_org.svg | 2 +- d2/d68/longest__common__string_8cpp__incl.svg | 2 +- ...longest__common__string_8cpp__incl_org.svg | 2 +- d2/d73/word__break_8cpp__incl.svg | 2 +- d2/d73/word__break_8cpp__incl_org.svg | 2 +- d2/d76/prefix__sum__array_8cpp__incl.svg | 2 +- d2/d76/prefix__sum__array_8cpp__incl_org.svg | 2 +- d2/d77/classadaline__coll__graph.svg | 2 +- d2/d77/classadaline__coll__graph_org.svg | 2 +- ...iptic__curve__key__exchange_8cpp__incl.svg | 2 +- ...c__curve__key__exchange_8cpp__incl_org.svg | 2 +- ...tent__seg__tree__lazy__prop_8cpp__incl.svg | 2 +- ...__seg__tree__lazy__prop_8cpp__incl_org.svg | 2 +- d2/d89/median__search_8cpp__incl.svg | 2 +- d2/d89/median__search_8cpp__incl_org.svg | 2 +- ...edian_1_1_windowed_median__coll__graph.svg | 2 +- ...n_1_1_windowed_median__coll__graph_org.svg | 2 +- ...aversal__of__bst_1_1_node__coll__graph.svg | 2 +- ...sal__of__bst_1_1_node__coll__graph_org.svg | 2 +- ...ctures_1_1treap_1_1_treap__coll__graph.svg | 2 +- ...es_1_1treap_1_1_treap__coll__graph_org.svg | 2 +- ...preemptive__sjf__scheduling_8cpp__incl.svg | 2 +- ...mptive__sjf__scheduling_8cpp__incl_org.svg | 2 +- ...rmstrong__number__templated_8cpp__incl.svg | 2 +- ...rong__number__templated_8cpp__incl_org.svg | 2 +- d2/ddd/gaussian__elimination_8cpp__incl.svg | 2 +- .../gaussian__elimination_8cpp__incl_org.svg | 2 +- ...maximum__circular__subarray_8cpp__incl.svg | 2 +- ...mum__circular__subarray_8cpp__incl_org.svg | 2 +- d2/def/prime__factorization_8cpp__incl.svg | 2 +- .../prime__factorization_8cpp__incl_org.svg | 2 +- d2/df0/kelvin__to__celsius_8cpp__incl.svg | 2 +- d2/df0/kelvin__to__celsius_8cpp__incl_org.svg | 2 +- ...ata__structures_1_1_stack__coll__graph.svg | 2 +- ..._structures_1_1_stack__coll__graph_org.svg | 2 +- d3/d1a/hill__cipher_8cpp__incl.svg | 2 +- d3/d1a/hill__cipher_8cpp__incl_org.svg | 2 +- ...se__fermat__little__theorem_8cpp__incl.svg | 2 +- ...fermat__little__theorem_8cpp__incl_org.svg | 2 +- d3/d28/wiggle__sort_8cpp__incl.svg | 2 +- d3/d28/wiggle__sort_8cpp__incl_org.svg | 2 +- d3/d30/hash__search_8cpp__incl.svg | 2 +- d3/d30/hash__search_8cpp__incl_org.svg | 2 +- d3/d39/check__prime_8cpp__incl.svg | 2 +- d3/d39/check__prime_8cpp__incl_org.svg | 2 +- d3/d3d/complex__numbers_8cpp__incl.svg | 2 +- d3/d3d/complex__numbers_8cpp__incl_org.svg | 2 +- d3/d4c/sha1_8cpp__incl.svg | 2 +- d3/d4c/sha1_8cpp__incl_org.svg | 2 +- d3/d56/binomial__dist_8cpp__incl.svg | 2 +- d3/d56/binomial__dist_8cpp__incl_org.svg | 2 +- ...1_1layers_1_1_dense_layer__coll__graph.svg | 2 +- ...ayers_1_1_dense_layer__coll__graph_org.svg | 2 +- d3/d66/structlinkedlist__coll__graph.svg | 2 +- d3/d66/structlinkedlist__coll__graph_org.svg | 2 +- ...oyd__cycle__detection__algo_8cpp__incl.svg | 2 +- ..._cycle__detection__algo_8cpp__incl_org.svg | 2 +- ...classbinary__search__tree__coll__graph.svg | 2 +- ...sbinary__search__tree__coll__graph_org.svg | 2 +- ...__table_1_1_sparse__table__coll__graph.svg | 2 +- ...ble_1_1_sparse__table__coll__graph_org.svg | 2 +- d3/daf/stooge__sort_8cpp__incl.svg | 2 +- d3/daf/stooge__sort_8cpp__incl_org.svg | 2 +- d3/dbb/kadanes3_8cpp__incl.svg | 2 +- d3/dbb/kadanes3_8cpp__incl_org.svg | 2 +- d3/dbe/comb__sort_8cpp__incl.svg | 2 +- d3/dbe/comb__sort_8cpp__incl_org.svg | 2 +- ...ind__non__repeating__number_8cpp__incl.svg | 2 +- ..._non__repeating__number_8cpp__incl_org.svg | 2 +- d3/dcc/count__bits__flip_8cpp__incl.svg | 2 +- d3/dcc/count__bits__flip_8cpp__incl_org.svg | 2 +- d3/dfd/trie__using__hashmap_8cpp__incl.svg | 2 +- .../trie__using__hashmap_8cpp__incl_org.svg | 2 +- d4/d00/iterative__factorial_8cpp__incl.svg | 2 +- .../iterative__factorial_8cpp__incl_org.svg | 2 +- d4/d08/babylonian__method_8cpp__incl.svg | 2 +- d4/d08/babylonian__method_8cpp__incl_org.svg | 2 +- d4/d0c/binary__search__tree_8cpp__incl.svg | 2 +- .../binary__search__tree_8cpp__incl_org.svg | 2 +- d4/d18/composite__simpson__rule_8cpp.html | 4 +- d4/d1f/merge__insertion__sort_8cpp__incl.svg | 2 +- .../merge__insertion__sort_8cpp__incl_org.svg | 2 +- d4/d25/ncr__modulo__p_8cpp__incl.svg | 2 +- d4/d25/ncr__modulo__p_8cpp__incl_org.svg | 2 +- d4/d26/durand__kerner__roots_8cpp__incl.svg | 2 +- .../durand__kerner__roots_8cpp__incl_org.svg | 2 +- d4/d28/pigeonhole__sort_8cpp__incl.svg | 2 +- d4/d28/pigeonhole__sort_8cpp__incl_org.svg | 2 +- ...struct_trie_1_1_trie_node__coll__graph.svg | 2 +- ...ct_trie_1_1_trie_node__coll__graph_org.svg | 2 +- d4/d2f/fcfs__scheduling_8cpp__incl.svg | 2 +- d4/d2f/fcfs__scheduling_8cpp__incl_org.svg | 2 +- d4/d32/inorder__successor__of__bst_8cpp.html | 85 ++++++++--------- d4/d32/inorder__successor__of__bst_8cpp.js | 2 +- ...order__successor__of__bst_8cpp_source.html | 66 +++++++------- d4/d3e/k__nearest__neighbors_8cpp.html | 31 ++----- d4/d3e/k__nearest__neighbors_8cpp.js | 2 +- d4/d3e/k__nearest__neighbors_8cpp_source.html | 12 +-- d4/d4f/stooge__sort_8cpp.html | 25 ++--- d4/d4f/stooge__sort_8cpp_source.html | 20 ++-- ...1_1_cache_1_1_l_f_u_cache__coll__graph.svg | 2 +- ...cache_1_1_l_f_u_cache__coll__graph_org.svg | 2 +- d4/d59/large__factorial_8cpp__incl.svg | 2 +- d4/d59/large__factorial_8cpp__incl_org.svg | 2 +- d4/d60/classunordered__set__coll__graph.svg | 2 +- .../classunordered__set__coll__graph_org.svg | 2 +- d4/d60/kohonen__som__trace_8cpp__incl.svg | 2 +- d4/d60/kohonen__som__trace_8cpp__incl_org.svg | 2 +- d4/d72/qr__eigen__values_8cpp__incl.svg | 2 +- d4/d72/qr__eigen__values_8cpp__incl_org.svg | 2 +- d4/d75/skip__list_8cpp__incl.svg | 2 +- d4/d75/skip__list_8cpp__incl_org.svg | 2 +- d4/d89/lru__cache2_8cpp__incl.svg | 2 +- d4/d89/lru__cache2_8cpp__incl_org.svg | 2 +- ...ta__structures_1_1_bitset__coll__graph.svg | 2 +- ...structures_1_1_bitset__coll__graph_org.svg | 2 +- d4/da0/area_8cpp__incl.svg | 2 +- d4/da0/area_8cpp__incl_org.svg | 2 +- ...ber__of__positive__divisors_8cpp__incl.svg | 2 +- ..._of__positive__divisors_8cpp__incl_org.svg | 2 +- d4/db4/bayes__theorem_8cpp__incl.svg | 2 +- d4/db4/bayes__theorem_8cpp__incl_org.svg | 2 +- ...extended__euclid__algorithm_8cpp__incl.svg | 2 +- ...nded__euclid__algorithm_8cpp__incl_org.svg | 2 +- d4/dc8/tree__234_8cpp__incl.svg | 2 +- d4/dc8/tree__234_8cpp__incl_org.svg | 2 +- d4/dcb/classstack__coll__graph.svg | 2 +- d4/dcb/classstack__coll__graph_org.svg | 2 +- d4/dd7/house__robber_8cpp__incl.svg | 2 +- d4/dd7/house__robber_8cpp__incl_org.svg | 2 +- .../gcd__iterative__euclidean_8cpp__incl.svg | 2 +- ...d__iterative__euclidean_8cpp__incl_org.svg | 2 +- ...ashing_1_1sha256_1_1_hash__coll__graph.svg | 2 +- ...ng_1_1sha256_1_1_hash__coll__graph_org.svg | 2 +- d4/def/kohonen__som__topology_8cpp.html | 14 +-- d4/def/kohonen__som__topology_8cpp.js | 2 +- .../kohonen__som__topology_8cpp_source.html | 4 +- d4/df4/trie__multiple__search_8cpp__incl.svg | 2 +- .../trie__multiple__search_8cpp__incl_org.svg | 2 +- d4/df8/prime__numbers_8cpp__incl.svg | 2 +- d4/df8/prime__numbers_8cpp__incl_org.svg | 2 +- d5/d08/classgraph_1_1_graph__coll__graph.svg | 2 +- .../classgraph_1_1_graph__coll__graph_org.svg | 2 +- d5/d1b/struct_list_node__coll__graph.svg | 2 +- d5/d1b/struct_list_node__coll__graph_org.svg | 2 +- ...asing__subsequence__nlogn_8cpp_source.html | 2 +- .../selection__sort__recursive_8cpp__incl.svg | 2 +- ...ection__sort__recursive_8cpp__incl_org.svg | 2 +- d5/d45/sublist__search_8cpp.html | 91 ++++++++----------- d5/d45/sublist__search_8cpp.js | 2 +- d5/d45/sublist__search_8cpp_source.html | 72 +++++++-------- ...test__common__supersequence_8cpp__incl.svg | 2 +- ...__common__supersequence_8cpp__incl_org.svg | 2 +- .../random__pivot__quick__sort_8cpp__incl.svg | 2 +- ...dom__pivot__quick__sort_8cpp__incl_org.svg | 2 +- .../integral__approximation2_8cpp__incl.svg | 2 +- ...ntegral__approximation2_8cpp__incl_org.svg | 2 +- d5/d6e/classcatalan__numbers__coll__graph.svg | 2 +- ...classcatalan__numbers__coll__graph_org.svg | 2 +- d5/d79/jump__game_8cpp__incl.svg | 2 +- d5/d79/jump__game_8cpp__incl_org.svg | 2 +- d5/d7f/trapped__rainwater_8cpp__incl.svg | 2 +- d5/d7f/trapped__rainwater_8cpp__incl_org.svg | 2 +- d5/d85/xor__cipher_8cpp__incl.svg | 2 +- d5/d85/xor__cipher_8cpp__incl_org.svg | 2 +- d5/d8b/least__common__multiple_8cpp__incl.svg | 2 +- ...least__common__multiple_8cpp__incl_org.svg | 2 +- d5/d95/binary__addition_8cpp__incl.svg | 2 +- d5/d95/binary__addition_8cpp__incl_org.svg | 2 +- d5/d95/n__bonacci_8cpp__incl.svg | 2 +- d5/d95/n__bonacci_8cpp__incl_org.svg | 2 +- d5/dad/magic__number_8cpp__incl.svg | 2 +- d5/dad/magic__number_8cpp__incl_org.svg | 2 +- d5/dc3/integral__approximation_8cpp__incl.svg | 2 +- ...integral__approximation_8cpp__incl_org.svg | 2 +- ...data__structures_1_1_node__coll__graph.svg | 2 +- ...__structures_1_1_node__coll__graph_org.svg | 2 +- d5/dc8/postfix__evaluation_8cpp__incl.svg | 2 +- d5/dc8/postfix__evaluation_8cpp__incl_org.svg | 2 +- ...ector__important__functions_8cpp__incl.svg | 2 +- ...r__important__functions_8cpp__incl_org.svg | 2 +- d5/dcd/kohonen__som__topology_8cpp__incl.svg | 2 +- .../kohonen__som__topology_8cpp__incl_org.svg | 2 +- d5/dcd/sum__of__digits_8cpp__incl.svg | 2 +- d5/dcd/sum__of__digits_8cpp__incl_org.svg | 2 +- d5/dee/disjoint__set_8cpp__incl.svg | 2 +- d5/dee/disjoint__set_8cpp__incl_org.svg | 2 +- ...multiplication_1_1_matrix__coll__graph.svg | 2 +- ...iplication_1_1_matrix__coll__graph_org.svg | 2 +- ...ence__using__binary__search_8cpp__incl.svg | 2 +- ...__using__binary__search_8cpp__incl_org.svg | 2 +- d6/d1d/bubble__sort_8cpp__incl.svg | 2 +- d6/d1d/bubble__sort_8cpp__incl_org.svg | 2 +- d6/d20/lu__decomposition_8h__incl.svg | 2 +- d6/d20/lu__decomposition_8h__incl_org.svg | 2 +- ...ary__tree_1_1_binary_tree__coll__graph.svg | 2 +- ..._tree_1_1_binary_tree__coll__graph_org.svg | 2 +- ...search__tree_1_1bst__node__coll__graph.svg | 2 +- ...ch__tree_1_1bst__node__coll__graph_org.svg | 2 +- ...stics_1_1stats__computer1__coll__graph.svg | 2 +- ...s_1_1stats__computer1__coll__graph_org.svg | 2 +- d6/d38/newton__raphson__method_8cpp__incl.svg | 2 +- ...newton__raphson__method_8cpp__incl_org.svg | 2 +- ...__queries_1_1per_seg_tree__coll__graph.svg | 2 +- ...eries_1_1per_seg_tree__coll__graph_org.svg | 2 +- d6/d4b/hamming__distance_8cpp__incl.svg | 2 +- d6/d4b/hamming__distance_8cpp__incl_org.svg | 2 +- .../gcd__recursive__euclidean_8cpp__incl.svg | 2 +- ...d__recursive__euclidean_8cpp__incl_org.svg | 2 +- ...avelling__salesman__problem_8cpp__incl.svg | 2 +- ...ling__salesman__problem_8cpp__incl_org.svg | 2 +- d6/d75/catalan__numbers_8cpp__incl.svg | 2 +- d6/d75/catalan__numbers_8cpp__incl_org.svg | 2 +- d6/d93/large__number_8h__dep__incl.svg | 2 +- d6/d93/large__number_8h__dep__incl_org.svg | 2 +- ...1_ay_star_search_1_1_info__coll__graph.svg | 2 +- ..._star_search_1_1_info__coll__graph_org.svg | 2 +- d6/da8/0__1__knapsack_8cpp__incl.svg | 2 +- d6/da8/0__1__knapsack_8cpp__incl_org.svg | 2 +- .../ode__semi__implicit__euler_8cpp__incl.svg | 2 +- ...__semi__implicit__euler_8cpp__incl_org.svg | 2 +- d6/dbc/sparse__matrix_8cpp__incl.svg | 2 +- d6/dbc/sparse__matrix_8cpp__incl_org.svg | 2 +- d6/dbd/jump__search_8cpp__incl.svg | 2 +- d6/dbd/jump__search_8cpp__incl_org.svg | 2 +- ..._queries_1_1fenwick__tree__coll__graph.svg | 2 +- ...ries_1_1fenwick__tree__coll__graph_org.svg | 2 +- d6/dc0/interpolation__search2_8cpp__incl.svg | 2 +- .../interpolation__search2_8cpp__incl_org.svg | 2 +- ..._1_1_circular_linked_list__coll__graph.svg | 2 +- ..._circular_linked_list__coll__graph_org.svg | 2 +- d6/dca/lfu__cache_8cpp__incl.svg | 2 +- d6/dca/lfu__cache_8cpp__incl_org.svg | 2 +- d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 4 +- d6/dd5/atbash__cipher_8cpp__incl.svg | 2 +- d6/dd5/atbash__cipher_8cpp__incl_org.svg | 2 +- d6/dec/breadth__first__search_8cpp__incl.svg | 2 +- .../breadth__first__search_8cpp__incl_org.svg | 2 +- d6/df6/n__choose__r_8cpp__incl.svg | 2 +- d6/df6/n__choose__r_8cpp__incl_org.svg | 2 +- ...al_3_01uint128__t_01_4__inherit__graph.svg | 2 +- ..._01uint128__t_01_4__inherit__graph_org.svg | 2 +- ..._1_1_circular_linked_list__coll__graph.svg | 2 +- ..._circular_linked_list__coll__graph_org.svg | 2 +- ..._structures_1_1_skip_list__coll__graph.svg | 2 +- ...uctures_1_1_skip_list__coll__graph_org.svg | 2 +- d7/d1f/realtime__stats_8cpp__incl.svg | 2 +- d7/d1f/realtime__stats_8cpp__incl_org.svg | 2 +- d7/d2e/avltree_8cpp__incl.svg | 2 +- d7/d2e/avltree_8cpp__incl_org.svg | 2 +- d7/d31/classqueue__coll__graph.svg | 2 +- d7/d31/classqueue__coll__graph_org.svg | 2 +- d7/d39/lu__decomposition_8h__dep__incl.svg | 2 +- .../lu__decomposition_8h__dep__incl_org.svg | 2 +- ...t__implentation__usingarray_8cpp__incl.svg | 2 +- ...mplentation__usingarray_8cpp__incl_org.svg | 2 +- d7/d40/class_solution__coll__graph.svg | 2 +- d7/d40/class_solution__coll__graph_org.svg | 2 +- d7/d41/struct_min_heap_node__coll__graph.svg | 2 +- .../struct_min_heap_node__coll__graph_org.svg | 2 +- d7/d4a/fibonacci__sum_8cpp__incl.svg | 2 +- d7/d4a/fibonacci__sum_8cpp__incl_org.svg | 2 +- d7/d4c/spiral__print_8cpp__incl.svg | 2 +- d7/d4c/spiral__print_8cpp__incl_org.svg | 2 +- d7/d53/inv__sqrt_8cpp__incl.svg | 2 +- d7/d53/inv__sqrt_8cpp__incl_org.svg | 2 +- d7/d53/kadane_8cpp__incl.svg | 2 +- d7/d53/kadane_8cpp__incl_org.svg | 2 +- ...longest__increasing__subsequence_8cpp.html | 59 +++++------- .../longest__increasing__subsequence_8cpp.js | 2 +- ...__increasing__subsequence_8cpp_source.html | 40 ++++---- ...etwork_1_1_neural_network__coll__graph.svg | 2 +- ...rk_1_1_neural_network__coll__graph_org.svg | 2 +- ...inorder__successor__of__bst_8cpp__incl.svg | 2 +- ...der__successor__of__bst_8cpp__incl_org.svg | 2 +- ...igned_3_01uint256__t_01_4__coll__graph.svg | 2 +- ...d_3_01uint256__t_01_4__coll__graph_org.svg | 2 +- .../power__for__huge__numbers_8cpp__incl.svg | 2 +- ...wer__for__huge__numbers_8cpp__incl_org.svg | 2 +- d7/d92/sublist__search_8cpp__incl.svg | 2 +- d7/d92/sublist__search_8cpp__incl_org.svg | 2 +- d7/da4/cut__rod_8cpp__incl.svg | 2 +- d7/da4/cut__rod_8cpp__incl_org.svg | 2 +- d7/da7/adaline__learning_8cpp__incl.svg | 2 +- d7/da7/adaline__learning_8cpp__incl_org.svg | 2 +- ...al_3_01uint256__t_01_4__inherit__graph.svg | 2 +- ..._01uint256__t_01_4__inherit__graph_org.svg | 2 +- d7/dae/decimal__to__binary_8cpp__incl.svg | 2 +- d7/dae/decimal__to__binary_8cpp__incl_org.svg | 2 +- .../composite__simpson__rule_8cpp__incl.svg | 2 +- ...omposite__simpson__rule_8cpp__incl_org.svg | 2 +- ...search_1_1_ay_star_search__coll__graph.svg | 2 +- ...ch_1_1_ay_star_search__coll__graph_org.svg | 2 +- ...res_1_1tree__234_1_1_node__coll__graph.svg | 2 +- ...1_1tree__234_1_1_node__coll__graph_org.svg | 2 +- .../classgraph_1_1_graph__inherit__graph.svg | 2 +- ...assgraph_1_1_graph__inherit__graph_org.svg | 2 +- d7/dce/graph__coloring_8cpp__incl.svg | 2 +- d7/dce/graph__coloring_8cpp__incl_org.svg | 2 +- ...metic_3_01uint128__t_01_4__coll__graph.svg | 2 +- ...c_3_01uint128__t_01_4__coll__graph_org.svg | 2 +- d7/dd9/eratosthenes_8cpp__incl.svg | 2 +- d7/dd9/eratosthenes_8cpp__incl_org.svg | 2 +- d7/dda/dsu__union__rank_8cpp__incl.svg | 2 +- d7/dda/dsu__union__rank_8cpp__incl_org.svg | 2 +- d7/def/trie__multiple__search_8cpp.html | 31 ++----- d7/def/trie__multiple__search_8cpp.js | 2 +- .../trie__multiple__search_8cpp_source.html | 12 +-- ...ructures_1_1_bloom_filter__coll__graph.svg | 2 +- ...ures_1_1_bloom_filter__coll__graph_org.svg | 2 +- d8/d61/class_trie__coll__graph.svg | 2 +- d8/d61/class_trie__coll__graph_org.svg | 2 +- d8/d68/classpriority__queue__coll__graph.svg | 2 +- .../classpriority__queue__coll__graph_org.svg | 2 +- d8/d7c/radix__sort_8cpp_source.html | 2 +- d8/d96/gram__schmidt_8cpp__incl.svg | 2 +- d8/d96/gram__schmidt_8cpp__incl_org.svg | 2 +- ..._tree__traversals_1_1_b_t__coll__graph.svg | 2 +- ...e__traversals_1_1_b_t__coll__graph_org.svg | 2 +- d8/d9a/fast__fourier__transform_8cpp.html | 35 +++---- d8/d9a/fast__fourier__transform_8cpp.js | 2 +- .../fast__fourier__transform_8cpp_source.html | 16 ++-- ...ru__cache_1_1_l_r_u_cache__coll__graph.svg | 2 +- ...cache_1_1_l_r_u_cache__coll__graph_org.svg | 2 +- d8/dab/sparse__table_8cpp.html | 31 ++----- d8/dab/sparse__table_8cpp.js | 2 +- d8/dab/sparse__table_8cpp_source.html | 12 +-- ...heavy__light__decomposition_8cpp__incl.svg | 2 +- ...y__light__decomposition_8cpp__incl_org.svg | 2 +- d8/de0/radix__sort2_8cpp__incl.svg | 2 +- d8/de0/radix__sort2_8cpp__incl_org.svg | 2 +- d8/df4/array__right__rotation_8cpp__incl.svg | 2 +- .../array__right__rotation_8cpp__incl_org.svg | 2 +- d8/df7/quick__sort__3_8cpp__incl.svg | 2 +- d8/df7/quick__sort__3_8cpp__incl_org.svg | 2 +- d8/df9/stack_8hpp__dep__incl.svg | 2 +- d8/df9/stack_8hpp__dep__incl_org.svg | 2 +- d9/d0e/brent__method__extrema_8cpp__incl.svg | 2 +- .../brent__method__extrema_8cpp__incl_org.svg | 2 +- ...s__all__solution__optimised_8cpp__incl.svg | 2 +- ...ll__solution__optimised_8cpp__incl_org.svg | 2 +- d9/d31/recursive__bubble__sort_8cpp__incl.svg | 2 +- ...recursive__bubble__sort_8cpp__incl_org.svg | 2 +- d9/d33/quick__sort__iterative_8cpp__incl.svg | 2 +- .../quick__sort__iterative_8cpp__incl_org.svg | 2 +- ...nverse__fast__fourier__transform_8cpp.html | 35 +++---- .../inverse__fast__fourier__transform_8cpp.js | 2 +- ..._fast__fourier__transform_8cpp_source.html | 16 ++-- d9/d43/hopcroft__karp_8cpp__incl.svg | 2 +- d9/d43/hopcroft__karp_8cpp__incl_org.svg | 2 +- d9/d43/set__kth__bit_8cpp__incl.svg | 2 +- d9/d43/set__kth__bit_8cpp__incl_org.svg | 2 +- d9/d47/digit__separation_8cpp__incl.svg | 2 +- d9/d47/digit__separation_8cpp__incl_org.svg | 2 +- d9/d49/kohonen__som__trace_8cpp.html | 14 +-- d9/d49/kohonen__som__trace_8cpp.js | 2 +- d9/d49/kohonen__som__trace_8cpp_source.html | 4 +- d9/d4e/gnome__sort_8cpp__incl.svg | 2 +- d9/d4e/gnome__sort_8cpp__incl_org.svg | 2 +- d9/d5f/dijkstra_8cpp__incl.svg | 2 +- d9/d5f/dijkstra_8cpp__incl_org.svg | 2 +- d9/d73/median__search2_8cpp__incl.svg | 2 +- d9/d73/median__search2_8cpp__incl_org.svg | 2 +- d9/d78/factorial_8cpp__incl.svg | 2 +- d9/d78/factorial_8cpp__incl_org.svg | 2 +- d9/d7d/primality__test_8cpp__incl.svg | 2 +- d9/d7d/primality__test_8cpp__incl_org.svg | 2 +- ...ed_3_01uint128__t_01_4__inherit__graph.svg | 2 +- ..._01uint128__t_01_4__inherit__graph_org.svg | 2 +- .../palindrome__partitioning_8cpp__incl.svg | 2 +- ...alindrome__partitioning_8cpp__incl_org.svg | 2 +- d9/d94/golden__search__extrema_8cpp__incl.svg | 2 +- ...golden__search__extrema_8cpp__incl_org.svg | 2 +- d9/dae/struct_queue__coll__graph.svg | 2 +- d9/dae/struct_queue__coll__graph_org.svg | 2 +- d9/db7/linked__list_8cpp__incl.svg | 2 +- d9/db7/linked__list_8cpp__incl_org.svg | 2 +- ...e__force__string__searching_8cpp__incl.svg | 2 +- ...orce__string__searching_8cpp__incl_org.svg | 2 +- d9/dcc/miller__rabin_8cpp__incl.svg | 2 +- d9/dcc/miller__rabin_8cpp__incl_org.svg | 2 +- d9/dd9/bisection__method_8cpp__incl.svg | 2 +- d9/dd9/bisection__method_8cpp__incl_org.svg | 2 +- d9/ddb/tower__of__hanoi_8cpp__incl.svg | 2 +- d9/ddb/tower__of__hanoi_8cpp__incl_org.svg | 2 +- d9/deb/cycle__sort_8cpp__incl.svg | 2 +- d9/deb/cycle__sort_8cpp__incl_org.svg | 2 +- ...same__number__of__set__bits_8cpp__incl.svg | 2 +- ...__number__of__set__bits_8cpp__incl_org.svg | 2 +- d9/dfa/fibonacci__search_8cpp__incl.svg | 2 +- d9/dfa/fibonacci__search_8cpp__incl_org.svg | 2 +- d9/dfd/primes__up__to__billion_8cpp__incl.svg | 2 +- ...primes__up__to__billion_8cpp__incl_org.svg | 2 +- d9/dfd/uint128__t_8hpp__incl.svg | 2 +- d9/dfd/uint128__t_8hpp__incl_org.svg | 2 +- da/d01/rat__maze_8cpp__incl.svg | 2 +- da/d01/rat__maze_8cpp__incl_org.svg | 2 +- ...pological__sort_1_1_graph__coll__graph.svg | 2 +- ...gical__sort_1_1_graph__coll__graph_org.svg | 2 +- da/d18/memory__game_8cpp__incl.svg | 2 +- da/d18/memory__game_8cpp__incl_org.svg | 2 +- da/d23/eulers__totient__function_8cpp.html | 31 ++----- da/d23/eulers__totient__function_8cpp.js | 2 +- ...eulers__totient__function_8cpp_source.html | 12 +-- da/d26/strand__sort_8cpp__incl.svg | 2 +- da/d26/strand__sort_8cpp__incl_org.svg | 2 +- ...__using__hashmap_1_1_trie__coll__graph.svg | 2 +- ...ing__hashmap_1_1_trie__coll__graph_org.svg | 2 +- da/d35/sieve__of__eratosthenes_8cpp__incl.svg | 2 +- ...sieve__of__eratosthenes_8cpp__incl_org.svg | 2 +- da/d50/is__graph__bipartite_8cpp__incl.svg | 2 +- .../is__graph__bipartite_8cpp__incl_org.svg | 2 +- da/d52/minimum__edit__distance_8cpp.html | 31 ++----- da/d52/minimum__edit__distance_8cpp.js | 2 +- .../minimum__edit__distance_8cpp_source.html | 12 +-- ...non__recursive__merge__sort_8cpp__incl.svg | 2 +- ..._recursive__merge__sort_8cpp__incl_org.svg | 2 +- ...cted__components__with__dsu_8cpp__incl.svg | 2 +- ...__components__with__dsu_8cpp__incl_org.svg | 2 +- ..._1boyer__moore_1_1pattern__coll__graph.svg | 2 +- ...yer__moore_1_1pattern__coll__graph_org.svg | 2 +- da/d76/abbreviation_8cpp__incl.svg | 2 +- da/d76/abbreviation_8cpp__incl_org.svg | 2 +- da/d7b/perimeter_8cpp__incl.svg | 2 +- da/d7b/perimeter_8cpp__incl_org.svg | 2 +- ..._1_1tree__234_1_1_tree234__coll__graph.svg | 2 +- ...tree__234_1_1_tree234__coll__graph_org.svg | 2 +- da/d8a/paranthesis__matching_8cpp__incl.svg | 2 +- .../paranthesis__matching_8cpp__incl_org.svg | 2 +- da/da2/node_8hpp__dep__incl.svg | 2 +- da/da2/node_8hpp__dep__incl_org.svg | 2 +- da/dc1/generate__parentheses_8cpp__incl.svg | 2 +- .../generate__parentheses_8cpp__incl_org.svg | 2 +- ...t__palindromic__subsequence_8cpp__incl.svg | 2 +- ...alindromic__subsequence_8cpp__incl_org.svg | 2 +- ...igned_3_01uint128__t_01_4__coll__graph.svg | 2 +- ...d_3_01uint128__t_01_4__coll__graph_org.svg | 2 +- ...decomposition_1_1_tree__inherit__graph.svg | 2 +- ...mposition_1_1_tree__inherit__graph_org.svg | 2 +- ...hine__learning_1_1adaline__coll__graph.svg | 2 +- ...__learning_1_1adaline__coll__graph_org.svg | 2 +- da/dd9/happy__number_8cpp__incl.svg | 2 +- da/dd9/happy__number_8cpp__incl_org.svg | 2 +- .../double__hash__hash__table_8cpp__incl.svg | 2 +- ...uble__hash__hash__table_8cpp__incl_org.svg | 2 +- da/de6/treap_8cpp__incl.svg | 2 +- da/de6/treap_8cpp__incl_org.svg | 2 +- da/dfd/buzz__number_8cpp__incl.svg | 2 +- da/dfd/buzz__number_8cpp__incl_org.svg | 2 +- da/dfd/sudoku__solver_8cpp__incl.svg | 2 +- da/dfd/sudoku__solver_8cpp__incl_org.svg | 2 +- db/d0c/check__amicable__pair_8cpp__incl.svg | 2 +- .../check__amicable__pair_8cpp__incl_org.svg | 2 +- ...__array_1_1_queue___array__coll__graph.svg | 2 +- ...ray_1_1_queue___array__coll__graph_org.svg | 2 +- .../modular__inverse__simple_8cpp__incl.svg | 2 +- ...odular__inverse__simple_8cpp__incl_org.svg | 2 +- ..._1_1jarvis_1_1_convexhull__coll__graph.svg | 2 +- ...jarvis_1_1_convexhull__coll__graph_org.svg | 2 +- db/d30/fast__power_8cpp__incl.svg | 2 +- db/d30/fast__power_8cpp__incl_org.svg | 2 +- db/d4a/aliquot__sum_8cpp__incl.svg | 2 +- db/d4a/aliquot__sum_8cpp__incl_org.svg | 2 +- db/d4e/depth__first__search_8cpp__incl.svg | 2 +- .../depth__first__search_8cpp__incl_org.svg | 2 +- db/d51/fibonacci__fast_8cpp__incl.svg | 2 +- db/d51/fibonacci__fast_8cpp__incl_org.svg | 2 +- ...ulo__p_1_1_n_c_r_modulo_p__coll__graph.svg | 2 +- ..._p_1_1_n_c_r_modulo_p__coll__graph_org.svg | 2 +- ...tree__traversals_1_1_node__coll__graph.svg | 2 +- ...__traversals_1_1_node__coll__graph_org.svg | 2 +- db/d6c/count__inversions_8cpp__incl.svg | 2 +- db/d6c/count__inversions_8cpp__incl_org.svg | 2 +- ...ed_3_01uint256__t_01_4__inherit__graph.svg | 2 +- ..._01uint256__t_01_4__inherit__graph_org.svg | 2 +- ...ic_3_01uint128__t_01_4__inherit__graph.svg | 2 +- ..._01uint128__t_01_4__inherit__graph_org.svg | 2 +- .../lowest__common__ancestor_8cpp__incl.svg | 2 +- ...owest__common__ancestor_8cpp__incl_org.svg | 2 +- db/d8f/struct_btree__coll__graph.svg | 2 +- db/d8f/struct_btree__coll__graph_org.svg | 2 +- db/d91/binomial__calculate_8cpp__incl.svg | 2 +- db/d91/binomial__calculate_8cpp__incl_org.svg | 2 +- db/d93/morse__code_8cpp__incl.svg | 2 +- db/d93/morse__code_8cpp__incl_org.svg | 2 +- ...se__binary__tree_1_1_node__coll__graph.svg | 2 +- ...binary__tree_1_1_node__coll__graph_org.svg | 2 +- .../reverse__a__linked__list_8cpp__incl.svg | 2 +- ...everse__a__linked__list_8cpp__incl_org.svg | 2 +- db/da8/subset__sum_8cpp__incl.svg | 2 +- db/da8/subset__sum_8cpp__incl_org.svg | 2 +- ...inear__probing__hash__table_8cpp__incl.svg | 2 +- ...r__probing__hash__table_8cpp__incl_org.svg | 2 +- db/dbc/tree__234_8cpp.html | 4 +- db/dc3/vector__cross__product_8cpp__incl.svg | 2 +- .../vector__cross__product_8cpp__incl_org.svg | 2 +- db/dc8/dijkstra__greedy_8cpp__incl.svg | 2 +- db/dc8/dijkstra__greedy_8cpp__incl_org.svg | 2 +- db/dd4/structlist__coll__graph.svg | 2 +- db/dd4/structlist__coll__graph_org.svg | 2 +- db/ddb/classhash__chain__coll__graph.svg | 2 +- db/ddb/classhash__chain__coll__graph_org.svg | 2 +- db/de3/dsu__path__compression_8cpp__incl.svg | 2 +- .../dsu__path__compression_8cpp__incl_org.svg | 2 +- db/de3/reverse__binary__tree_8cpp__incl.svg | 2 +- .../reverse__binary__tree_8cpp__incl_org.svg | 2 +- ...hout__repeating__characters_8cpp__incl.svg | 2 +- ...__repeating__characters_8cpp__incl_org.svg | 2 +- db/df0/insertion__sort_8cpp__incl.svg | 2 +- db/df0/insertion__sort_8cpp__incl_org.svg | 2 +- db/dfb/maximum__circular__subarray_8cpp.html | 31 ++----- db/dfb/maximum__circular__subarray_8cpp.js | 2 +- ...ximum__circular__subarray_8cpp_source.html | 12 +-- ...ar__linked__list_1_1_node__coll__graph.svg | 2 +- ...linked__list_1_1_node__coll__graph_org.svg | 2 +- dc/d29/coin__change__topdown_8cpp__incl.svg | 2 +- .../coin__change__topdown_8cpp__incl_org.svg | 2 +- dc/d37/lu__decompose_8cpp__incl.svg | 2 +- dc/d37/lu__decompose_8cpp__incl_org.svg | 2 +- dc/d40/fast__integer__input_8cpp__incl.svg | 2 +- .../fast__integer__input_8cpp__incl_org.svg | 2 +- ...decimal__to__roman__numeral_8cpp__incl.svg | 2 +- ...mal__to__roman__numeral_8cpp__incl_org.svg | 2 +- ...egral_3_01uint256__t_01_4__coll__graph.svg | 2 +- ...l_3_01uint256__t_01_4__coll__graph_org.svg | 2 +- ...e__fast__fourier__transform_8cpp__incl.svg | 2 +- ...ast__fourier__transform_8cpp__incl_org.svg | 2 +- ...as__minimum__spanning__tree_8cpp__incl.svg | 2 +- ...minimum__spanning__tree_8cpp__incl_org.svg | 2 +- dc/d5f/qr__decompose_8h__dep__incl.svg | 2 +- dc/d5f/qr__decompose_8h__dep__incl_org.svg | 2 +- dc/d79/wave__sort_8cpp__incl.svg | 2 +- dc/d79/wave__sort_8cpp__incl_org.svg | 2 +- dc/d7e/largest__power_8cpp__incl.svg | 2 +- dc/d7e/largest__power_8cpp__incl_org.svg | 2 +- dc/d9a/class_h_k_graph__coll__graph.svg | 2 +- dc/d9a/class_h_k_graph__coll__graph_org.svg | 2 +- dc/d9c/babylonian__method_8cpp.html | 35 +++---- dc/d9c/babylonian__method_8cpp.js | 2 +- dc/d9c/babylonian__method_8cpp_source.html | 16 ++-- dc/dc5/ode__forward__euler_8cpp__incl.svg | 2 +- dc/dc5/ode__forward__euler_8cpp__incl_org.svg | 2 +- dc/dc7/rungekutta_8cpp__incl.svg | 2 +- dc/dc7/rungekutta_8cpp__incl_org.svg | 2 +- dc/dce/structtests_1_1_node__coll__graph.svg | 2 +- .../structtests_1_1_node__coll__graph_org.svg | 2 +- dc/dcf/vector__ops_8hpp__incl.svg | 2 +- dc/dcf/vector__ops_8hpp__incl_org.svg | 2 +- dc/dd2/sha256_8cpp__incl.svg | 2 +- dc/dd2/sha256_8cpp__incl_org.svg | 2 +- dc/dd7/node_8hpp__incl.svg | 2 +- dc/dd7/node_8hpp__incl_org.svg | 2 +- ...__decomposition_1_1_h_l_d__coll__graph.svg | 2 +- ...composition_1_1_h_l_d__coll__graph_org.svg | 2 +- dc/dda/fenwick__tree_8cpp__incl.svg | 2 +- dc/dda/fenwick__tree_8cpp__incl_org.svg | 2 +- dc/ddf/horspool_8cpp__incl.svg | 2 +- dc/ddf/horspool_8cpp__incl_org.svg | 2 +- dc/de0/fibonacci__large_8cpp__incl.svg | 2 +- dc/de0/fibonacci__large_8cpp__incl_org.svg | 2 +- dc/de2/false__position_8cpp__incl.svg | 2 +- dc/de2/false__position_8cpp__incl_org.svg | 2 +- ...rie__operations_1_1_tnode__coll__graph.svg | 2 +- ..._operations_1_1_tnode__coll__graph_org.svg | 2 +- dc/dfa/heap__sort_8cpp__incl.svg | 2 +- dc/dfa/heap__sort_8cpp__incl_org.svg | 2 +- dd/d05/manacher__algorithm_8cpp__incl.svg | 2 +- dd/d05/manacher__algorithm_8cpp__incl_org.svg | 2 +- dd/d0c/hamiltons__cycle_8cpp.html | 35 +++---- dd/d0c/hamiltons__cycle_8cpp.js | 2 +- dd/d0c/hamiltons__cycle_8cpp_source.html | 16 ++-- dd/d0e/double__factorial_8cpp__incl.svg | 2 +- dd/d0e/double__factorial_8cpp__incl_org.svg | 2 +- dd/d0f/md5_8cpp__incl.svg | 2 +- dd/d0f/md5_8cpp__incl_org.svg | 2 +- dd/d0f/text__search_8cpp__incl.svg | 2 +- dd/d0f/text__search_8cpp__incl_org.svg | 2 +- dd/d2b/array__left__rotation_8cpp__incl.svg | 2 +- .../array__left__rotation_8cpp__incl_org.svg | 2 +- dd/d30/matrix__exponentiation_8cpp__incl.svg | 2 +- .../matrix__exponentiation_8cpp__incl_org.svg | 2 +- dd/d43/uint256__t_8hpp__incl.svg | 2 +- dd/d43/uint256__t_8hpp__incl_org.svg | 2 +- ...__key__exchange_1_1_point__coll__graph.svg | 2 +- ...y__exchange_1_1_point__coll__graph_org.svg | 2 +- dd/d4d/list__array_8cpp__incl.svg | 2 +- dd/d4d/list__array_8cpp__incl_org.svg | 2 +- ...earest__neighbors_1_1_knn__coll__graph.svg | 2 +- ...st__neighbors_1_1_knn__coll__graph_org.svg | 2 +- dd/d59/hamiltons__cycle_8cpp__incl.svg | 2 +- dd/d59/hamiltons__cycle_8cpp__incl_org.svg | 2 +- dd/d5e/volume_8cpp__incl.svg | 2 +- dd/d5e/volume_8cpp__incl_org.svg | 2 +- dd/d65/lu__decompose_8cpp.html | 14 +-- dd/d65/lu__decompose_8cpp.js | 2 +- dd/d65/lu__decompose_8cpp_source.html | 4 +- .../classstack__linked_list__coll__graph.svg | 2 +- ...assstack__linked_list__coll__graph_org.svg | 2 +- dd/d82/large__number_8h__incl.svg | 2 +- dd/d82/large__number_8h__incl_org.svg | 2 +- dd/d86/shell__sort2_8cpp__incl.svg | 2 +- dd/d86/shell__sort2_8cpp__incl_org.svg | 2 +- ...sgraph_1_1_rooted_tree__inherit__graph.svg | 2 +- ...ph_1_1_rooted_tree__inherit__graph_org.svg | 2 +- ...es_1_1list__array_1_1list__coll__graph.svg | 2 +- ..._1list__array_1_1list__coll__graph_org.svg | 2 +- dd/d9f/count__of__set__bits_8cpp__incl.svg | 2 +- .../count__of__set__bits_8cpp__incl_org.svg | 2 +- dd/dab/gale__shapley_8cpp__incl.svg | 2 +- dd/dab/gale__shapley_8cpp__incl_org.svg | 2 +- dd/dad/power__of__two_8cpp__incl.svg | 2 +- dd/dad/power__of__two_8cpp__incl_org.svg | 2 +- .../recursive__tree__traversal_8cpp__incl.svg | 2 +- ...ursive__tree__traversal_8cpp__incl_org.svg | 2 +- ...ueen__print__all__solutions_8cpp__incl.svg | 2 +- ...__print__all__solutions_8cpp__incl_org.svg | 2 +- ...cci__matrix__exponentiation_8cpp__incl.svg | 2 +- ..._matrix__exponentiation_8cpp__incl_org.svg | 2 +- ...line__segment__intersection_8cpp__incl.svg | 2 +- ...__segment__intersection_8cpp__incl_org.svg | 2 +- dd/df5/poisson__dist_8cpp__incl.svg | 2 +- dd/df5/poisson__dist_8cpp__incl_org.svg | 2 +- de/d02/knight__tour_8cpp__incl.svg | 2 +- de/d02/knight__tour_8cpp__incl_org.svg | 2 +- .../midpoint__integral__method_8cpp__incl.svg | 2 +- ...point__integral__method_8cpp__incl_org.svg | 2 +- de/d24/power__of__2_8cpp__incl.svg | 2 +- de/d24/power__of__2_8cpp__incl_org.svg | 2 +- de/d24/sparse__table_8cpp__incl.svg | 2 +- de/d24/sparse__table_8cpp__incl_org.svg | 2 +- de/d33/binary__search__tree2_8cpp__incl.svg | 2 +- .../binary__search__tree2_8cpp__incl_org.svg | 2 +- ...s_1_1linked__list_1_1link__coll__graph.svg | 2 +- ...1linked__list_1_1link__coll__graph_org.svg | 2 +- de/d36/binary__exponent_8cpp__incl.svg | 2 +- de/d36/binary__exponent_8cpp__incl_org.svg | 2 +- de/d3d/minimum__edit__distance_8cpp__incl.svg | 2 +- ...minimum__edit__distance_8cpp__incl_org.svg | 2 +- ...t__decomposition_1_1_tree__coll__graph.svg | 2 +- ...ecomposition_1_1_tree__coll__graph_org.svg | 2 +- de/d4c/saddleback__search_8cpp__incl.svg | 2 +- de/d4c/saddleback__search_8cpp__incl_org.svg | 2 +- de/d57/struct_test_case__coll__graph.svg | 2 +- de/d57/struct_test_case__coll__graph_org.svg | 2 +- ...__of__binomial__coefficient_8cpp__incl.svg | 2 +- ...__binomial__coefficient_8cpp__incl_org.svg | 2 +- .../eulers__totient__function_8cpp__incl.svg | 2 +- ...lers__totient__function_8cpp__incl_org.svg | 2 +- ..._1_1per_seg_tree_1_1_node__coll__graph.svg | 2 +- ...per_seg_tree_1_1_node__coll__graph_org.svg | 2 +- de/d69/knuth__morris__pratt_8cpp__incl.svg | 2 +- .../knuth__morris__pratt_8cpp__incl_org.svg | 2 +- de/d6c/palindrome__of__number_8cpp__incl.svg | 2 +- .../palindrome__of__number_8cpp__incl_org.svg | 2 +- ...rs_1_1_cache_1_1_d___node__coll__graph.svg | 2 +- ..._1_cache_1_1_d___node__coll__graph_org.svg | 2 +- ...metic_3_01uint256__t_01_4__coll__graph.svg | 2 +- ...c_3_01uint256__t_01_4__coll__graph_org.svg | 2 +- ...fix__expression_1_1_stack__coll__graph.svg | 2 +- ..._expression_1_1_stack__coll__graph_org.svg | 2 +- ...iterative__tree__traversals_8cpp__incl.svg | 2 +- ...ative__tree__traversals_8cpp__incl_org.svg | 2 +- de/d99/trie__tree_8cpp__incl.svg | 2 +- de/d99/trie__tree_8cpp__incl_org.svg | 2 +- de/da9/topological__sort_8cpp__incl.svg | 2 +- de/da9/topological__sort_8cpp__incl_org.svg | 2 +- de/db2/quick__sort_8cpp__incl.svg | 2 +- de/db2/quick__sort_8cpp__incl_org.svg | 2 +- de/db6/segtree_8cpp__incl.svg | 2 +- de/db6/segtree_8cpp__incl_org.svg | 2 +- de/dbb/uint128__t_8hpp__dep__incl.svg | 2 +- de/dbb/uint128__t_8hpp__dep__incl_org.svg | 2 +- de/df7/bogo__sort_8cpp__incl.svg | 2 +- de/df7/bogo__sort_8cpp__incl_org.svg | 2 +- ...1sublist__search_1_1_node__coll__graph.svg | 2 +- ...list__search_1_1_node__coll__graph_org.svg | 2 +- df/d0f/fibonacci_8cpp__incl.svg | 2 +- df/d0f/fibonacci_8cpp__incl_org.svg | 2 +- df/d11/midpoint__integral__method_8cpp.html | 4 +- df/d14/dnf__sort_8cpp__incl.svg | 2 +- df/d14/dnf__sort_8cpp__incl_org.svg | 2 +- df/d1f/subset__sum__dynamic_8cpp__incl.svg | 2 +- .../subset__sum__dynamic_8cpp__incl_org.svg | 2 +- ...ls__minimum__spanning__tree_8cpp__incl.svg | 2 +- ...minimum__spanning__tree_8cpp__incl_org.svg | 2 +- df/d2c/geometric__dist_8cpp__incl.svg | 2 +- df/d2c/geometric__dist_8cpp__incl_org.svg | 2 +- df/d2d/bloom__filter_8cpp__incl.svg | 2 +- df/d2d/bloom__filter_8cpp__incl_org.svg | 2 +- df/d36/minimax_8cpp__incl.svg | 2 +- df/d36/minimax_8cpp__incl_org.svg | 2 +- df/d3c/exponential__search_8cpp__incl.svg | 2 +- df/d3c/exponential__search_8cpp__incl_org.svg | 2 +- df/d57/chaining_8cpp__incl.svg | 2 +- df/d57/chaining_8cpp__incl_org.svg | 2 +- df/d72/modular__division_8cpp.html | 31 ++----- df/d72/modular__division_8cpp.js | 2 +- df/d72/modular__division_8cpp_source.html | 12 +-- df/d77/connected__components_8cpp__incl.svg | 2 +- .../connected__components_8cpp__incl_org.svg | 2 +- .../classgraph_1_1_h_k_graph__coll__graph.svg | 2 +- ...ssgraph_1_1_h_k_graph__coll__graph_org.svg | 2 +- df/d86/rabin__karp_8cpp__incl.svg | 2 +- df/d86/rabin__karp_8cpp__incl_org.svg | 2 +- df/d92/wildcard__matching_8cpp__incl.svg | 2 +- df/d92/wildcard__matching_8cpp__incl_org.svg | 2 +- ...equations__complex__numbers_8cpp__incl.svg | 2 +- ...tions__complex__numbers_8cpp__incl_org.svg | 2 +- ...raph__bipartite_1_1_graph__coll__graph.svg | 2 +- ...__bipartite_1_1_graph__coll__graph_org.svg | 2 +- ...n__using__bit__manipulation_8cpp__incl.svg | 2 +- ...sing__bit__manipulation_8cpp__incl_org.svg | 2 +- ...hms_1_1dijkstra_1_1_graph__coll__graph.svg | 2 +- ...1_1dijkstra_1_1_graph__coll__graph_org.svg | 2 +- ..._ground__projectile__motion_8cpp__incl.svg | 2 +- ...und__projectile__motion_8cpp__incl_org.svg | 2 +- df/dd4/stairs__pattern_8cpp__incl.svg | 2 +- df/dd4/stairs__pattern_8cpp__incl_org.svg | 2 +- df/dd6/a1z26__cipher_8cpp__incl.svg | 2 +- df/dd6/a1z26__cipher_8cpp__incl_org.svg | 2 +- df/ddc/struct_node__coll__graph.svg | 2 +- df/ddc/struct_node__coll__graph_org.svg | 2 +- df/deb/stack_8hpp__incl.svg | 2 +- df/deb/stack_8hpp__incl_org.svg | 2 +- dir_4d6e05837bf820fb089a8a8cdf2f42b7_dep.svg | 2 +- ...6e05837bf820fb089a8a8cdf2f42b7_dep_org.svg | 2 +- dir_f1797d0c2a0a12033e7d74efffeb14e1_dep.svg | 2 +- ...797d0c2a0a12033e7d74efffeb14e1_dep_org.svg | 2 +- doxygen_crawl.html | 42 ++++----- globals_func_m.html | 2 +- globals_m.html | 2 +- graph_legend.svg | 2 +- inherit_graph_0.svg | 2 +- inherit_graph_1.svg | 2 +- inherit_graph_10.svg | 2 +- inherit_graph_100.svg | 2 +- inherit_graph_101.svg | 2 +- inherit_graph_102.svg | 2 +- inherit_graph_103.svg | 2 +- inherit_graph_104.svg | 2 +- inherit_graph_105.svg | 2 +- inherit_graph_106.svg | 2 +- inherit_graph_107.svg | 2 +- inherit_graph_108.svg | 2 +- inherit_graph_109.svg | 2 +- inherit_graph_11.svg | 2 +- inherit_graph_110.svg | 2 +- inherit_graph_111.svg | 2 +- inherit_graph_112.svg | 2 +- inherit_graph_113.svg | 2 +- inherit_graph_114.svg | 2 +- inherit_graph_115.svg | 2 +- inherit_graph_116.svg | 2 +- inherit_graph_117.svg | 2 +- inherit_graph_118.svg | 2 +- inherit_graph_119.svg | 2 +- inherit_graph_12.svg | 2 +- inherit_graph_120.svg | 2 +- inherit_graph_121.svg | 2 +- inherit_graph_122.svg | 2 +- inherit_graph_123.svg | 2 +- inherit_graph_124.svg | 2 +- inherit_graph_125.svg | 2 +- inherit_graph_126.svg | 2 +- inherit_graph_127.svg | 2 +- inherit_graph_128.svg | 2 +- inherit_graph_129.svg | 2 +- inherit_graph_13.svg | 2 +- inherit_graph_130.svg | 2 +- inherit_graph_131.svg | 2 +- inherit_graph_132.svg | 2 +- inherit_graph_133.svg | 2 +- inherit_graph_134.svg | 2 +- inherit_graph_14.svg | 2 +- inherit_graph_15.svg | 2 +- inherit_graph_16.svg | 2 +- inherit_graph_17.svg | 2 +- inherit_graph_18.svg | 2 +- inherit_graph_19.svg | 2 +- inherit_graph_2.svg | 2 +- inherit_graph_20.svg | 2 +- inherit_graph_21.svg | 2 +- inherit_graph_22.svg | 2 +- inherit_graph_23.svg | 2 +- inherit_graph_24.svg | 2 +- inherit_graph_25.svg | 2 +- inherit_graph_26.svg | 2 +- inherit_graph_27.svg | 2 +- inherit_graph_28.svg | 2 +- inherit_graph_29.svg | 2 +- inherit_graph_3.svg | 2 +- inherit_graph_30.svg | 2 +- inherit_graph_31.svg | 2 +- inherit_graph_32.svg | 2 +- inherit_graph_33.svg | 2 +- inherit_graph_34.svg | 2 +- inherit_graph_35.svg | 2 +- inherit_graph_36.svg | 2 +- inherit_graph_37.svg | 2 +- inherit_graph_38.svg | 2 +- inherit_graph_39.svg | 2 +- inherit_graph_4.svg | 2 +- inherit_graph_40.svg | 2 +- inherit_graph_41.svg | 2 +- inherit_graph_42.svg | 2 +- inherit_graph_43.svg | 2 +- inherit_graph_44.svg | 2 +- inherit_graph_45.svg | 2 +- inherit_graph_46.svg | 2 +- inherit_graph_47.svg | 2 +- inherit_graph_48.svg | 2 +- inherit_graph_49.svg | 2 +- inherit_graph_5.svg | 2 +- inherit_graph_50.svg | 2 +- inherit_graph_51.svg | 2 +- inherit_graph_52.svg | 2 +- inherit_graph_53.svg | 2 +- inherit_graph_54.svg | 2 +- inherit_graph_55.svg | 2 +- inherit_graph_56.svg | 2 +- inherit_graph_57.svg | 2 +- inherit_graph_58.svg | 2 +- inherit_graph_59.svg | 2 +- inherit_graph_6.svg | 2 +- inherit_graph_60.svg | 2 +- inherit_graph_61.svg | 2 +- inherit_graph_62.svg | 2 +- inherit_graph_63.svg | 2 +- inherit_graph_64.svg | 2 +- inherit_graph_65.svg | 2 +- inherit_graph_66.svg | 2 +- inherit_graph_67.svg | 2 +- inherit_graph_68.svg | 2 +- inherit_graph_69.svg | 2 +- inherit_graph_7.svg | 2 +- inherit_graph_70.svg | 2 +- inherit_graph_71.svg | 2 +- inherit_graph_72.svg | 2 +- inherit_graph_73.svg | 2 +- inherit_graph_74.svg | 2 +- inherit_graph_75.svg | 2 +- inherit_graph_76.svg | 2 +- inherit_graph_77.svg | 2 +- inherit_graph_78.svg | 2 +- inherit_graph_79.svg | 2 +- inherit_graph_8.svg | 2 +- inherit_graph_80.svg | 2 +- inherit_graph_81.svg | 2 +- inherit_graph_82.svg | 2 +- inherit_graph_83.svg | 2 +- inherit_graph_84.svg | 2 +- inherit_graph_85.svg | 2 +- inherit_graph_86.svg | 2 +- inherit_graph_87.svg | 2 +- inherit_graph_88.svg | 2 +- inherit_graph_89.svg | 2 +- inherit_graph_9.svg | 2 +- inherit_graph_90.svg | 2 +- inherit_graph_91.svg | 2 +- inherit_graph_92.svg | 2 +- inherit_graph_93.svg | 2 +- inherit_graph_94.svg | 2 +- inherit_graph_95.svg | 2 +- inherit_graph_96.svg | 2 +- inherit_graph_97.svg | 2 +- inherit_graph_98.svg | 2 +- inherit_graph_99.svg | 2 +- navtreeindex0.js | 2 +- navtreeindex1.js | 6 +- navtreeindex10.js | 4 +- navtreeindex11.js | 2 +- navtreeindex12.js | 2 +- navtreeindex2.js | 4 +- navtreeindex3.js | 2 +- navtreeindex5.js | 4 +- navtreeindex6.js | 4 +- navtreeindex7.js | 2 +- navtreeindex8.js | 4 +- navtreeindex9.js | 2 +- search/all_12.js | 2 +- search/functions_d.js | 2 +- 1053 files changed, 1604 insertions(+), 1820 deletions(-) diff --git a/d0/d04/qr__decompose_8h__incl.svg b/d0/d04/qr__decompose_8h__incl.svg index 9aca201ce..cb76acd49 100644 --- a/d0/d04/qr__decompose_8h__incl.svg +++ b/d0/d04/qr__decompose_8h__incl.svg @@ -1,7 +1,7 @@ - -

Functions

void test_function (const float *test_data, const int number_of_samples) -int main (int argc, char **argv) +int main ()

Detailed Description

Compute statistics for data entered in rreal-time.

@@ -153,8 +153,8 @@ Functions

Definition in file realtime_stats.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -162,19 +162,15 @@ Functions int main ( - int argc, - - - + void ) - char ** argv )

Main function

Definition at line 158 of file realtime_stats.cpp.

-
158 {
+
158 {
159 const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
160 test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
161
diff --git a/d0/d08/realtime__stats_8cpp.js b/d0/d08/realtime__stats_8cpp.js index 27fba871d..bbfb28f5a 100644 --- a/d0/d08/realtime__stats_8cpp.js +++ b/d0/d08/realtime__stats_8cpp.js @@ -4,6 +4,6 @@ var realtime__stats_8cpp = [ "statistics::stats_computer2< T >", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ], [ "stats_computer1< T >", "d2/d0f/classstats__computer1.html", "d2/d0f/classstats__computer1" ], [ "stats_computer2< T >", "dc/d02/classstats__computer2.html", "dc/d02/classstats__computer2" ], - [ "main", "d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "main", "d0/d08/realtime__stats_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test_function", "d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd", null ] ]; \ No newline at end of file diff --git a/d0/d08/realtime__stats_8cpp_source.html b/d0/d08/realtime__stats_8cpp_source.html index e59deedbe..2cfdc4bbb 100644 --- a/d0/d08/realtime__stats_8cpp_source.html +++ b/d0/d08/realtime__stats_8cpp_source.html @@ -244,7 +244,7 @@ $(function(){initNavTree('d0/d08/realtime__stats_8cpp_source.html','../../','');
156
-
158int main(int argc, char **argv) {
+
158int main() {
159 const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
160 test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
161
@@ -293,9 +293,9 @@ $(function(){initNavTree('d0/d08/realtime__stats_8cpp_source.html','../../','');
statistics::stats_computer2::std
double std() const
Definition realtime_stats.cpp:92
statistics::stats_computer2::new_val
void new_val(T x)
Definition realtime_stats.cpp:77
statistics::stats_computer2::variance
double variance() const
Definition realtime_stats.cpp:89
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
statistics
Statistical algorithms.
test_function
void test_function(const float *test_data, const int number_of_samples)
Definition realtime_stats.cpp:118
+
main
int main()
Definition realtime_stats.cpp:158
diff --git a/d0/d15/fast__fourier__transform_8cpp__incl.svg b/d0/d15/fast__fourier__transform_8cpp__incl.svg index 5a9f199e7..6cd9c6d91 100644 --- a/d0/d15/fast__fourier__transform_8cpp__incl.svg +++ b/d0/d15/fast__fourier__transform_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
template<class Iterator>
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last)
 bottom-up merge sort which sorts elements in a non-decreasing order

-int main (int argc, char **argv) +int main () template<class Iterator> void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)  bottom-up merge sort which sorts elements in a non-decreasing order
@@ -157,8 +157,8 @@ Functions

Definition in file non_recursive_merge_sort.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -166,18 +166,14 @@ Functions int main ( - int argc, - - - + void ) - char ** argv )

Definition at line 94 of file non_recursive_merge_sort.cpp.

-
94 {
+
94 {
95 int size;
96 std::cout << "Enter the number of elements : ";
97 std::cin >> size;
diff --git a/d0/db6/non__recursive__merge__sort_8cpp_source.html b/d0/db6/non__recursive__merge__sort_8cpp_source.html index 46a9eaa9b..8d8e980ad 100644 --- a/d0/db6/non__recursive__merge__sort_8cpp_source.html +++ b/d0/db6/non__recursive__merge__sort_8cpp_source.html @@ -191,7 +191,7 @@ $(function(){initNavTree('d0/db6/non__recursive__merge__sort_8cpp_source.html','
91
92using sorting::non_recursive_merge_sort;
93
-
94int main(int argc, char** argv) {
+
94int main() {
95 int size;
96 std::cout << "Enter the number of elements : ";
97 std::cin >> size;
diff --git a/d0/db7/smallest__circle_8cpp__incl.svg b/d0/db7/smallest__circle_8cpp__incl.svg index 4b48752cc..070db1306 100644 --- a/d0/db7/smallest__circle_8cpp__incl.svg +++ b/d0/db7/smallest__circle_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 11 }
12 return res[1];
13}
-
14int main(int argc, char const *argv[]) {
+
14int main() {
15 int n;
16 cout << "Enter n: ";
17 cin >> n;
diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg index 07cc77bbd..336681fb2 100644 --- a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - -
 A function utility to generate unsorted array of given size and range.

static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Implementation of the Random Pivot Quick Sort algorithm.

@@ -289,8 +289,8 @@ template<size_t size>
- -

◆ main()

+ +

◆ main()

@@ -298,44 +298,33 @@ template<size_t size>
int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 323 of file random_pivot_quick_sort.cpp.

-
323 {
-
324 test(); // Executes various test cases.
-
325
-
326 const int64_t inputSize = 10;
-
327 std::array<int64_t, inputSize> unsorted_array =
-
328 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
-
329 50, 1000);
-
330 std::cout << "Unsorted array is : " << std::endl;
-
331 sorting::random_pivot_quick_sort::showArray(unsorted_array);
-
332
-
333 std::array<int64_t, inputSize> sorted_array =
-
334 sorting::random_pivot_quick_sort::quickSortRP(
-
335 unsorted_array, 0, unsorted_array.size() - 1);
-
336 std::cout << "Sorted array is : " << std::endl;
-
337 sorting::random_pivot_quick_sort::showArray(sorted_array);
-
338 return 0;
-
339}
+

Definition at line 321 of file random_pivot_quick_sort.cpp.

+
321 {
+
322 test(); // Executes various test cases.
+
323
+
324 const int64_t inputSize = 10;
+
325 std::array<int64_t, inputSize> unsorted_array =
+
326 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
+
327 50, 1000);
+
328 std::cout << "Unsorted array is : " << std::endl;
+
329 sorting::random_pivot_quick_sort::showArray(unsorted_array);
+
330
+
331 std::array<int64_t, inputSize> sorted_array =
+
332 sorting::random_pivot_quick_sort::quickSortRP(
+
333 unsorted_array, 0, unsorted_array.size() - 1);
+
334 std::cout << "Sorted array is : " << std::endl;
+
335 sorting::random_pivot_quick_sort::showArray(sorted_array);
+
336 return 0;
+
337}
sorting::random_pivot_quick_sort::generateUnsortedArray
std::array< int64_t, size > generateUnsortedArray(int64_t from, int64_t to)
A function utility to generate unsorted array of given size and range.
Definition random_pivot_quick_sort.cpp:160
sorting::random_pivot_quick_sort::quickSortRP
std::array< int64_t, size > quickSortRP(std::array< int64_t, size > arr, int64_t start, int64_t end)
Random pivot quick sort function. This function is the starting point of the algorithm.
Definition random_pivot_quick_sort.cpp:130
test
static void test()
Self-test implementations.
Definition random_pivot_quick_sort.cpp:312
diff --git a/d1/daa/random__pivot__quick__sort_8cpp.js b/d1/daa/random__pivot__quick__sort_8cpp.js index 9c0bb8293..25669aa75 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp.js +++ b/d1/daa/random__pivot__quick__sort_8cpp.js @@ -3,7 +3,7 @@ var random__pivot__quick__sort_8cpp = [ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ], [ "sorting::random_pivot_quick_sort::generateUnsortedArray", "d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d", null ], [ "sorting::random_pivot_quick_sort::getRandomIndex", "d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5", null ], - [ "main", "d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d1/daa/random__pivot__quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "sorting::random_pivot_quick_sort::partition", "d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e", null ], [ "sorting::random_pivot_quick_sort::quickSortRP", "d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5", null ], [ "sorting::random_pivot_quick_sort::showArray", "d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10", null ], diff --git a/d1/daa/random__pivot__quick__sort_8cpp_source.html b/d1/daa/random__pivot__quick__sort_8cpp_source.html index 90571ac1b..10ad3cd59 100644 --- a/d1/daa/random__pivot__quick__sort_8cpp_source.html +++ b/d1/daa/random__pivot__quick__sort_8cpp_source.html @@ -335,24 +335,24 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
315}
316
-
-
323int main(int argc, char *argv[]) {
-
324 test(); // Executes various test cases.
-
325
-
326 const int64_t inputSize = 10;
-
327 std::array<int64_t, inputSize> unsorted_array =
-
328 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
-
329 50, 1000);
-
330 std::cout << "Unsorted array is : " << std::endl;
-
331 sorting::random_pivot_quick_sort::showArray(unsorted_array);
-
332
-
333 std::array<int64_t, inputSize> sorted_array =
-
334 sorting::random_pivot_quick_sort::quickSortRP(
-
335 unsorted_array, 0, unsorted_array.size() - 1);
-
336 std::cout << "Sorted array is : " << std::endl;
-
337 sorting::random_pivot_quick_sort::showArray(sorted_array);
-
338 return 0;
-
339}
+
+
321int main() {
+
322 test(); // Executes various test cases.
+
323
+
324 const int64_t inputSize = 10;
+
325 std::array<int64_t, inputSize> unsorted_array =
+
326 sorting::random_pivot_quick_sort::generateUnsortedArray<inputSize>(
+
327 50, 1000);
+
328 std::cout << "Unsorted array is : " << std::endl;
+
329 sorting::random_pivot_quick_sort::showArray(unsorted_array);
+
330
+
331 std::array<int64_t, inputSize> sorted_array =
+
332 sorting::random_pivot_quick_sort::quickSortRP(
+
333 unsorted_array, 0, unsorted_array.size() - 1);
+
334 std::cout << "Sorted array is : " << std::endl;
+
335 sorting::random_pivot_quick_sort::showArray(sorted_array);
+
336 return 0;
+
337}
TestCases
class encapsulating the necessary test cases
Definition inorder_successor_of_bst.cpp:225
TestCases::log
void log(T msg)
A function to print64_t given message on console.
Definition random_pivot_quick_sort.cpp:189
@@ -360,7 +360,6 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
TestCases::testCase_1
void testCase_1()
A test case contains edge case, printing inorder successor of last node.
Definition inorder_successor_of_bst.cpp:259
TestCases::testCase_3
void testCase_3()
A test case which contains main list of 50 elements and sublist of 20.
Definition inorder_successor_of_bst.cpp:345
TestCases::runTests
void runTests()
Executes test cases.
Definition random_pivot_quick_sort.cpp:199
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
random_pivot_quick_sort
Functions for the Random Pivot Quick Sort implementation.
sorting
for working with vectors
sorting::random_pivot_quick_sort::partition
std::tuple< int64_t, std::array< int64_t, size > > partition(std::array< int64_t, size > arr, int64_t start, int64_t end)
A partition function which handles the partition logic of quick sort.
Definition random_pivot_quick_sort.cpp:103
@@ -369,6 +368,7 @@ $(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','.
test
static void test()
Self-test implementations.
Definition random_pivot_quick_sort.cpp:312
sorting::random_pivot_quick_sort::getRandomIndex
int64_t getRandomIndex(int64_t start, int64_t end)
Takes the start and end indices of an array and returns a random int64_teger between the range of tho...
Definition random_pivot_quick_sort.cpp:88
sorting::random_pivot_quick_sort::showArray
void showArray(std::array< int64_t, T > arr)
Utility function to print the array.
Definition random_pivot_quick_sort.cpp:73
+
main
int main()
Main function.
Definition random_pivot_quick_sort.cpp:321
diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg index adc511118..b4b02e751 100644 --- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg +++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg index e9675a74e..a15d67906 100644 --- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg +++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg @@ -1,7 +1,7 @@ - - -
 This is the function implementation of \( \binom{n}{r} \).

static void test ()  Test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Combinations n choose r function implementation

@@ -152,8 +152,8 @@ Functions

Definition in file n_choose_r.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -161,31 +161,20 @@ Functions int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 80 of file n_choose_r.cpp.

-
80 {
-
81 test(); // executing tests
-
82 return 0;
-
83}
+

Definition at line 78 of file n_choose_r.cpp.

+
78 {
+
79 test(); // executing tests
+
80 return 0;
+
81}
test
static void test()
Test implementations.
Definition n_choose_r.cpp:52
diff --git a/d1/dbb/n__choose__r_8cpp.js b/d1/dbb/n__choose__r_8cpp.js index 749c84d43..80a4962dd 100644 --- a/d1/dbb/n__choose__r_8cpp.js +++ b/d1/dbb/n__choose__r_8cpp.js @@ -1,6 +1,6 @@ var n__choose__r_8cpp = [ - [ "main", "d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d1/dbb/n__choose__r_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "math::n_choose_r", "dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967", null ], [ "test", "d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d1/dbb/n__choose__r_8cpp_source.html b/d1/dbb/n__choose__r_8cpp_source.html index 9e1eb76dc..c339b2a5e 100644 --- a/d1/dbb/n__choose__r_8cpp_source.html +++ b/d1/dbb/n__choose__r_8cpp_source.html @@ -162,14 +162,14 @@ $(function(){initNavTree('d1/dbb/n__choose__r_8cpp_source.html','../../',''); })
72}
73
-
-
80int main(int argc, char *argv[]) {
-
81 test(); // executing tests
-
82 return 0;
-
83}
+
+
78int main() {
+
79 test(); // executing tests
+
80 return 0;
+
81}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Test implementations.
Definition n_choose_r.cpp:52
+
main
int main()
Main function.
Definition n_choose_r.cpp:78
math
for assert
math::n_choose_r
T n_choose_r(T n, T r)
This is the function implementation of .
Definition n_choose_r.cpp:35
diff --git a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg index 4ce6dc1b1..e77074a8b 100644 --- a/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg +++ b/d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg index 1da1b5f27..ce607d219 100644 --- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg +++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg @@ -1,7 +1,7 @@ - - - Functions
static void test (const std::vector< int > &vals, int windowSize)
 Self-test implementations.

-int main (int argc, const char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

An implementation of a median calculation of a sliding window along a data stream.

@@ -200,8 +200,8 @@ Algorithm

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -209,24 +209,13 @@ Algorithm int main ( - int argc, - - - + void ) - const char * argv[] )

Main function.

-
Parameters
- - - -
argccommand line argument count (ignored)
argvcommand line array of arguments (ignored)
-
-
Returns
0 on exit

A few fixed test cases

Array of sorted values; odd window size

@@ -242,41 +231,41 @@ Algorithm

Random array values (positive/negative)

Testing randomized test

-

Definition at line 198 of file windowed_median.cpp.

-
198 {
-
200 test({1, 2, 3, 4, 5, 6, 7, 8, 9},
+

Definition at line 196 of file windowed_median.cpp.

+
196 {
+
198 test({1, 2, 3, 4, 5, 6, 7, 8, 9},
+
199 3);
+
200 test({9, 8, 7, 6, 5, 4, 3, 2, 1},
201 3);
-
202 test({9, 8, 7, 6, 5, 4, 3, 2, 1},
-
203 3);
-
204 test({9, 8, 7, 6, 5, 4, 5, 6}, 4);
-
205 test({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);
-
206 test({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);
-
207 test({4, 3, 3, -5, -5, 1, 3, 4, 5},
-
208 5);
-
209
-
213 test({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,
-
214 1115438165, 1784484492, 74243042, 114807987},
-
215 6);
-
216
-
218 std::srand(static_cast<unsigned int>(std::time(nullptr)));
-
219 std::vector<int> vals;
-
220 for (int i = 8; i < 100; i++) {
-
221 const auto n =
-
222 1 + std::rand() /
-
223 ((RAND_MAX + 5u) / 20);
-
224 auto windowSize =
-
225 1 + std::rand() / ((RAND_MAX + 3u) /
-
226 10);
-
227 vals.clear();
-
228 vals.reserve(n);
-
229 for (int i = 0; i < n; i++) {
-
230 vals.push_back(
-
231 rand() - RAND_MAX);
-
232 }
-
233 test(vals, windowSize);
-
234 }
-
235 return 0;
-
236}
+
202 test({9, 8, 7, 6, 5, 4, 5, 6}, 4);
+
203 test({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);
+
204 test({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);
+
205 test({4, 3, 3, -5, -5, 1, 3, 4, 5},
+
206 5);
+
207
+
211 test({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,
+
212 1115438165, 1784484492, 74243042, 114807987},
+
213 6);
+
214
+
216 std::srand(static_cast<unsigned int>(std::time(nullptr)));
+
217 std::vector<int> vals;
+
218 for (int i = 8; i < 100; i++) {
+
219 const auto n =
+
220 1 + std::rand() /
+
221 ((RAND_MAX + 5u) / 20);
+
222 auto windowSize =
+
223 1 + std::rand() / ((RAND_MAX + 3u) /
+
224 10);
+
225 vals.clear();
+
226 vals.reserve(n);
+
227 for (int i = 0; i < n; i++) {
+
228 vals.push_back(
+
229 rand() - RAND_MAX);
+
230 }
+
231 test(vals, windowSize);
+
232 }
+
233 return 0;
+
234}
test
static void test()
Self-test implementations.
Definition generate_parentheses.cpp:82
diff --git a/d1/ded/windowed__median_8cpp.js b/d1/ded/windowed__median_8cpp.js index e3d1c1be0..19e5cfa63 100644 --- a/d1/ded/windowed__median_8cpp.js +++ b/d1/ded/windowed__median_8cpp.js @@ -1,6 +1,6 @@ var windowed__median_8cpp = [ [ "probability::windowed_median::WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median" ], - [ "main", "d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c", null ], + [ "main", "d1/ded/windowed__median_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601", null ] ]; \ No newline at end of file diff --git a/d1/ded/windowed__median_8cpp_source.html b/d1/ded/windowed__median_8cpp_source.html index 3decb5d39..b75c6e865 100644 --- a/d1/ded/windowed__median_8cpp_source.html +++ b/d1/ded/windowed__median_8cpp_source.html @@ -227,41 +227,41 @@ $(function(){initNavTree('d1/ded/windowed__median_8cpp_source.html','../../','')
190}
191
-
-
198int main(int argc, const char *argv[]) {
-
200 test({1, 2, 3, 4, 5, 6, 7, 8, 9},
+
+
196int main() {
+
198 test({1, 2, 3, 4, 5, 6, 7, 8, 9},
+
199 3);
+
200 test({9, 8, 7, 6, 5, 4, 3, 2, 1},
201 3);
-
202 test({9, 8, 7, 6, 5, 4, 3, 2, 1},
-
203 3);
-
204 test({9, 8, 7, 6, 5, 4, 5, 6}, 4);
-
205 test({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);
-
206 test({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);
-
207 test({4, 3, 3, -5, -5, 1, 3, 4, 5},
-
208 5);
-
209
-
213 test({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,
-
214 1115438165, 1784484492, 74243042, 114807987},
-
215 6);
-
216
-
218 std::srand(static_cast<unsigned int>(std::time(nullptr)));
-
219 std::vector<int> vals;
-
220 for (int i = 8; i < 100; i++) {
-
221 const auto n =
-
222 1 + std::rand() /
-
223 ((RAND_MAX + 5u) / 20);
-
224 auto windowSize =
-
225 1 + std::rand() / ((RAND_MAX + 3u) /
-
226 10);
-
227 vals.clear();
-
228 vals.reserve(n);
-
229 for (int i = 0; i < n; i++) {
-
230 vals.push_back(
-
231 rand() - RAND_MAX);
-
232 }
-
233 test(vals, windowSize);
-
234 }
-
235 return 0;
-
236}
+
202 test({9, 8, 7, 6, 5, 4, 5, 6}, 4);
+
203 test({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);
+
204 test({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);
+
205 test({4, 3, 3, -5, -5, 1, 3, 4, 5},
+
206 5);
+
207
+
211 test({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,
+
212 1115438165, 1784484492, 74243042, 114807987},
+
213 6);
+
214
+
216 std::srand(static_cast<unsigned int>(std::time(nullptr)));
+
217 std::vector<int> vals;
+
218 for (int i = 8; i < 100; i++) {
+
219 const auto n =
+
220 1 + std::rand() /
+
221 ((RAND_MAX + 5u) / 20);
+
222 auto windowSize =
+
223 1 + std::rand() / ((RAND_MAX + 3u) /
+
224 10);
+
225 vals.clear();
+
226 vals.reserve(n);
+
227 for (int i = 0; i < n; i++) {
+
228 vals.push_back(
+
229 rand() - RAND_MAX);
+
230 }
+
231 test(vals, windowSize);
+
232 }
+
233 return 0;
+
234}
probability::windowed_median::WindowedMedian
A class to calculate the median of a leading sliding window at the back of a stream of integer values...
Definition windowed_median.cpp:56
probability::windowed_median::WindowedMedian::insertToSorted
void insertToSorted(int value)
Inserts a value to a sorted multi-value BST.
Definition windowed_median.cpp:69
@@ -275,9 +275,9 @@ $(function(){initNavTree('d1/ded/windowed__median_8cpp_source.html','../../','')
probability::windowed_median::WindowedMedian::_windowSize
const size_type _windowSize
sliding window size
Definition windowed_median.cpp:57
probability::windowed_median::WindowedMedian::eraseFromSorted
void eraseFromSorted(int value)
Erases a value from a sorted multi-value BST.
Definition windowed_median.cpp:95
test
static void test()
Self-test implementations.
Definition generate_parentheses.cpp:82
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
probability
Probability algorithms.
windowed_median
Functions for the Windowed Median algorithm implementation.
+
main
int main()
Main function.
Definition windowed_median.cpp:196
diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg index 19798f6fd..3ecb29a2a 100644 --- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg +++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - diff --git a/d2/d23/neural__network_8cpp__incl_org.svg b/d2/d23/neural__network_8cpp__incl_org.svg index 354268623..ad75026af 100644 --- a/d2/d23/neural__network_8cpp__incl_org.svg +++ b/d2/d23/neural__network_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - diff --git a/d2/d4b/spirograph_8cpp__incl_org.svg b/d2/d4b/spirograph_8cpp__incl_org.svg index f2886ef36..4941ae7d9 100644 --- a/d2/d4b/spirograph_8cpp__incl_org.svg +++ b/d2/d4b/spirograph_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg index 9af611d7e..ceda8b70e 100644 --- a/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg +++ b/d2/dba/non__preemptive__sjf__scheduling_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - diff --git a/d3/d1a/hill__cipher_8cpp__incl_org.svg b/d3/d1a/hill__cipher_8cpp__incl_org.svg index 9880b2f94..1cd0d45ca 100644 --- a/d3/d1a/hill__cipher_8cpp__incl_org.svg +++ b/d3/d1a/hill__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - diff --git a/d3/d4c/sha1_8cpp__incl_org.svg b/d3/d4c/sha1_8cpp__incl_org.svg index 5114c73d1..b6620d4fb 100644 --- a/d3/d4c/sha1_8cpp__incl_org.svg +++ b/d3/d4c/sha1_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Main function.

Parameters
- - + +
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
argccommandline argument count
argvcommandline array of arguments
diff --git a/d4/d1f/merge__insertion__sort_8cpp__incl.svg b/d4/d1f/merge__insertion__sort_8cpp__incl.svg index 958ae75cc..6e1aff48f 100644 --- a/d4/d1f/merge__insertion__sort_8cpp__incl.svg +++ b/d4/d1f/merge__insertion__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - diff --git a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg index 76a800cca..2a91de311 100644 --- a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg +++ b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg index 4e21e42d6..c24a21aee 100644 --- a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg +++ b/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg @@ -1,7 +1,7 @@ -
 This function clears the memory allocated to entire tree recursively. Its just for clean up the memory and not relevant to the actual topic.

static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

An implementation for finding the Inorder successor of a binary search tree Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.

@@ -424,8 +424,8 @@ Method 2: Search from the root node
- -

◆ main()

+ +

◆ main()

@@ -433,24 +433,13 @@ Method 2: Search from the root node int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit

< root node of the bst

< Data to add nodes in BST

@@ -458,39 +447,39 @@ Method 2: Search from the root node

< Making BST

memory cleanup!

-

Definition at line 398 of file inorder_successor_of_bst.cpp.

-
398 {
-
399 test(); // run self-test implementations
-
400
-
401 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
-
402 nullptr;
-
403 std::vector<int64_t> node_data{3, 4, 5,
-
404 89, 1, 2};
-
405
-
406 int64_t targetElement = 4;
-
407 root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(
-
408 root, node_data);
-
409
-
410 operations_on_datastructures::inorder_traversal_of_bst::Node
-
411 *inorderSuccessor = operations_on_datastructures::
-
412 inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);
-
413
-
414 std::cout << "In-order sequence is : ";
-
415 operations_on_datastructures::inorder_traversal_of_bst::printInorder(root);
-
416 std::cout << std::endl;
-
417
-
418 if (inorderSuccessor == nullptr) {
-
419 std::cout << "Inorder successor for last node is NULL" << std::endl;
-
420 } else {
-
421 std::cout << "Target element is : " << targetElement << std::endl;
-
422 std::cout << "Inorder successor for target element is : "
-
423 << inorderSuccessor->data << std::endl;
-
424 }
+

Definition at line 396 of file inorder_successor_of_bst.cpp.

+
396 {
+
397 test(); // run self-test implementations
+
398
+
399 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
+
400 nullptr;
+
401 std::vector<int64_t> node_data{3, 4, 5,
+
402 89, 1, 2};
+
403
+
404 int64_t targetElement = 4;
+
405 root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(
+
406 root, node_data);
+
407
+
408 operations_on_datastructures::inorder_traversal_of_bst::Node
+
409 *inorderSuccessor = operations_on_datastructures::
+
410 inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);
+
411
+
412 std::cout << "In-order sequence is : ";
+
413 operations_on_datastructures::inorder_traversal_of_bst::printInorder(root);
+
414 std::cout << std::endl;
+
415
+
416 if (inorderSuccessor == nullptr) {
+
417 std::cout << "Inorder successor for last node is NULL" << std::endl;
+
418 } else {
+
419 std::cout << "Target element is : " << targetElement << std::endl;
+
420 std::cout << "Inorder successor for target element is : "
+
421 << inorderSuccessor->data << std::endl;
+
422 }
+
423
+
424 deallocate(root);
425
-
426 deallocate(root);
-
427
-
428 return 0;
-
429}
+
426 return 0;
+
427}
operations_on_datastructures::inorder_traversal_of_bst::makeBST
Node * makeBST(Node *root, const std::vector< int64_t > &data)
This function is used in test cases to quickly create BST containing large data instead of hard codin...
Definition inorder_successor_of_bst.cpp:155
operations_on_datastructures::inorder_traversal_of_bst::printInorder
void printInorder(Node *root)
Prints the BST in inorder traversal using recursion.
Definition inorder_successor_of_bst.cpp:136
operations_on_datastructures::inorder_traversal_of_bst::deallocate
void deallocate(Node *rootNode)
This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...
Definition inorder_successor_of_bst.cpp:210
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.js b/d4/d32/inorder__successor__of__bst_8cpp.js index 05a953f1a..7fe300695 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp.js +++ b/d4/d32/inorder__successor__of__bst_8cpp.js @@ -7,7 +7,7 @@ var inorder__successor__of__bst_8cpp = [ "operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor", "d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690", null ], [ "operations_on_datastructures::inorder_traversal_of_bst::getNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95", null ], [ "operations_on_datastructures::inorder_traversal_of_bst::Insert", "d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c", null ], - [ "main", "d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d4/d32/inorder__successor__of__bst_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "operations_on_datastructures::inorder_traversal_of_bst::makeBST", "d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9", null ], [ "operations_on_datastructures::inorder_traversal_of_bst::makeNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702", null ], [ "operations_on_datastructures::inorder_traversal_of_bst::printInorder", "d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4", null ], diff --git a/d4/d32/inorder__successor__of__bst_8cpp_source.html b/d4/d32/inorder__successor__of__bst_8cpp_source.html index 9a1138d65..dba8dee47 100644 --- a/d4/d32/inorder__successor__of__bst_8cpp_source.html +++ b/d4/d32/inorder__successor__of__bst_8cpp_source.html @@ -402,39 +402,39 @@ $(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp_source.html','
390}
391
-
-
398int main(int argc, char *argv[]) {
-
399 test(); // run self-test implementations
-
400
-
401 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
-
402 nullptr;
-
403 std::vector<int64_t> node_data{3, 4, 5,
-
404 89, 1, 2};
-
405
-
406 int64_t targetElement = 4;
-
407 root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(
-
408 root, node_data);
-
409
-
410 operations_on_datastructures::inorder_traversal_of_bst::Node
-
411 *inorderSuccessor = operations_on_datastructures::
-
412 inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);
-
413
-
414 std::cout << "In-order sequence is : ";
-
415 operations_on_datastructures::inorder_traversal_of_bst::printInorder(root);
-
416 std::cout << std::endl;
-
417
-
418 if (inorderSuccessor == nullptr) {
-
419 std::cout << "Inorder successor for last node is NULL" << std::endl;
-
420 } else {
-
421 std::cout << "Target element is : " << targetElement << std::endl;
-
422 std::cout << "Inorder successor for target element is : "
-
423 << inorderSuccessor->data << std::endl;
-
424 }
+
+
396int main() {
+
397 test(); // run self-test implementations
+
398
+
399 operations_on_datastructures::inorder_traversal_of_bst::Node *root =
+
400 nullptr;
+
401 std::vector<int64_t> node_data{3, 4, 5,
+
402 89, 1, 2};
+
403
+
404 int64_t targetElement = 4;
+
405 root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(
+
406 root, node_data);
+
407
+
408 operations_on_datastructures::inorder_traversal_of_bst::Node
+
409 *inorderSuccessor = operations_on_datastructures::
+
410 inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);
+
411
+
412 std::cout << "In-order sequence is : ";
+
413 operations_on_datastructures::inorder_traversal_of_bst::printInorder(root);
+
414 std::cout << std::endl;
+
415
+
416 if (inorderSuccessor == nullptr) {
+
417 std::cout << "Inorder successor for last node is NULL" << std::endl;
+
418 } else {
+
419 std::cout << "Target element is : " << targetElement << std::endl;
+
420 std::cout << "Inorder successor for target element is : "
+
421 << inorderSuccessor->data << std::endl;
+
422 }
+
423
+
424 deallocate(root);
425
-
426 deallocate(root);
-
427
-
428 return 0;
-
429}
+
426 return 0;
+
427}
TestCases
class encapsulating the necessary test cases
Definition inorder_successor_of_bst.cpp:225
TestCases::log
void log(T msg)
A function to print given message on console.
Definition inorder_successor_of_bst.cpp:233
@@ -446,7 +446,6 @@ $(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp_source.html','
operations_on_datastructures::inorder_traversal_of_bst::Node::right
Node * right
Pointer to right child.
Definition inorder_successor_of_bst.cpp:60
operations_on_datastructures::inorder_traversal_of_bst::Node::left
Node * left
Pointer to Left child.
Definition inorder_successor_of_bst.cpp:59
operations_on_datastructures::inorder_traversal_of_bst::Node::data
int64_t data
The key/value of the node.
Definition inorder_successor_of_bst.cpp:58
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
data
int data[MAX]
test data
Definition hash_search.cpp:24
operations_on_datastructures::inorder_traversal_of_bst::makeBST
Node * makeBST(Node *root, const std::vector< int64_t > &data)
This function is used in test cases to quickly create BST containing large data instead of hard codin...
Definition inorder_successor_of_bst.cpp:155
operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor
Node * getInorderSuccessor(Node *root, int64_t data)
Inorder successor of a node is the next node in inorder traversal of the Binary Tree....
Definition inorder_successor_of_bst.cpp:176
@@ -457,6 +456,7 @@ $(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp_source.html','
operations_on_datastructures::inorder_traversal_of_bst::makeNode
Node * makeNode(int64_t data)
Allocates a new node in heap for given data and returns it's pointer.
Definition inorder_successor_of_bst.cpp:68
operations_on_datastructures::inorder_traversal_of_bst::getNode
Node * getNode(Node *root, int64_t data)
Searches the given data in BST and returns the pointer to the node containing that data.
Definition inorder_successor_of_bst.cpp:100
test
static void test()
Self-test implementations.
Definition inorder_successor_of_bst.cpp:387
+
main
int main()
Main function.
Definition inorder_successor_of_bst.cpp:396
operations_on_datastructures
for std::vector
diff --git a/d4/d3e/k__nearest__neighbors_8cpp.html b/d4/d3e/k__nearest__neighbors_8cpp.html index 21e61a8ad..642ebee31 100644 --- a/d4/d3e/k__nearest__neighbors_8cpp.html +++ b/d4/d3e/k__nearest__neighbors_8cpp.html @@ -153,8 +153,8 @@ Functions  Compute the Euclidean distance between two vectors.
static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Implementation of [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm).

@@ -211,8 +211,8 @@ template<typename T>
- -

◆ main()

+ +

◆ main()

@@ -220,31 +220,20 @@ template<typename T>
int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
int 0 on exit
-

Definition at line 193 of file k_nearest_neighbors.cpp.

-
193 {
-
194 test(); // run self-test implementations
-
195 return 0;
-
196}
+

Definition at line 191 of file k_nearest_neighbors.cpp.

+
191 {
+
192 test(); // run self-test implementations
+
193 return 0;
+
194}
test
static void test()
Self-test implementations.
Definition k_nearest_neighbors.cpp:140
diff --git a/d4/d3e/k__nearest__neighbors_8cpp.js b/d4/d3e/k__nearest__neighbors_8cpp.js index b95375b11..907f51a44 100644 --- a/d4/d3e/k__nearest__neighbors_8cpp.js +++ b/d4/d3e/k__nearest__neighbors_8cpp.js @@ -2,6 +2,6 @@ var k__nearest__neighbors_8cpp = [ [ "machine_learning::k_nearest_neighbors::Knn", "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html", "da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn" ], [ "machine_learning::k_nearest_neighbors::euclidean_distance", "d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69", null ], - [ "main", "d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d4/d3e/k__nearest__neighbors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d4/d3e/k__nearest__neighbors_8cpp_source.html b/d4/d3e/k__nearest__neighbors_8cpp_source.html index d17b22edd..fae7df773 100644 --- a/d4/d3e/k__nearest__neighbors_8cpp_source.html +++ b/d4/d3e/k__nearest__neighbors_8cpp_source.html @@ -248,11 +248,11 @@ $(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp_source.html','../../
185}
186
-
-
193int main(int argc, char* argv[]) {
-
194 test(); // run self-test implementations
-
195 return 0;
-
196}
+
+
191int main() {
+
192 test(); // run self-test implementations
+
193 return 0;
+
194}
machine_learning::k_nearest_neighbors::Knn
K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.
Definition k_nearest_neighbors.cpp:55
machine_learning::k_nearest_neighbors::Knn::operator=
Knn & operator=(const Knn &model)=default
@@ -264,9 +264,9 @@ $(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp_source.html','../../
machine_learning::k_nearest_neighbors::Knn::Knn
Knn(const Knn &model)=default
machine_learning::k_nearest_neighbors::Knn::operator=
Knn & operator=(Knn &&)=default
machine_learning::k_nearest_neighbors::Knn::~Knn
~Knn()=default
Destroy the Knn object.
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Self-test implementations.
Definition k_nearest_neighbors.cpp:140
machine_learning::k_nearest_neighbors::euclidean_distance
double euclidean_distance(const std::vector< T > &a, const std::vector< T > &b)
Compute the Euclidean distance between two vectors.
Definition k_nearest_neighbors.cpp:43
+
main
int main()
Main function.
Definition k_nearest_neighbors.cpp:191
k_nearest_neighbors
Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_...
machine_learning
A* search algorithm
diff --git a/d4/d4f/stooge__sort_8cpp.html b/d4/d4f/stooge__sort_8cpp.html index e144f0b08..ac9c521de 100644 --- a/d4/d4f/stooge__sort_8cpp.html +++ b/d4/d4f/stooge__sort_8cpp.html @@ -170,24 +170,17 @@ Functions

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 79 of file stooge_sort.cpp.

-
79 {
-
80 test1();
-
81 test2();
-
82 test3();
-
83
-
84 std::cout << "All tests have successfully passed!\n";
-
85 return 0;
-
86}
+

Definition at line 77 of file stooge_sort.cpp.

+
77 {
+
78 test1();
+
79 test2();
+
80 test3();
+
81
+
82 std::cout << "All tests have successfully passed!\n";
+
83 return 0;
+
84}
test2
void test2()
Function to test sorting algorithm, one element.
Definition stooge_sort.cpp:57
test1
void test1()
Function to test sorting algorithm.
Definition stooge_sort.cpp:47
test3
void test3()
Function to test sorting algorithm, repeating elements.
Definition stooge_sort.cpp:67
diff --git a/d4/d4f/stooge__sort_8cpp_source.html b/d4/d4f/stooge__sort_8cpp_source.html index 9f4b349b7..c519fcd21 100644 --- a/d4/d4f/stooge__sort_8cpp_source.html +++ b/d4/d4f/stooge__sort_8cpp_source.html @@ -164,21 +164,21 @@ $(function(){initNavTree('d4/d4f/stooge__sort_8cpp_source.html','../../',''); })
71}
72
-
-
79int main() {
-
80 test1();
-
81 test2();
-
82 test3();
-
83
-
84 std::cout << "All tests have successfully passed!\n";
-
85 return 0;
-
86}
+
+
77int main() {
+
78 test1();
+
79 test2();
+
80 test3();
+
81
+
82 std::cout << "All tests have successfully passed!\n";
+
83 return 0;
+
84}
test2
void test2()
Function to test sorting algorithm, one element.
Definition stooge_sort.cpp:57
test1
void test1()
Function to test sorting algorithm.
Definition stooge_sort.cpp:47
test3
void test3()
Function to test sorting algorithm, repeating elements.
Definition stooge_sort.cpp:67
stoogeSort
void stoogeSort(std::vector< int > *L, size_t i, size_t j)
for IO operations
Definition stooge_sort.cpp:28
-
main
int main()
Main function.
Definition stooge_sort.cpp:79
+
main
int main()
Main function.
Definition stooge_sort.cpp:77
diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg index 585ca67f5..63a294436 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg @@ -1,7 +1,7 @@ - diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg index cc7354d93..9ab29ecde 100644 --- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg +++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg @@ -1,7 +1,7 @@ - - - - - - diff --git a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg index 94be28ec4..a603e1b7b 100644 --- a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg +++ b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - -
void test_3d_classes2 (std::vector< std::valarray< double > > *data)
void test3 ()
double get_clock_diff (clock_t start_t, clock_t end_t)
-
int main (int argc, char **argv)
+
int main ()
void kohonen_som (const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
 @@ -291,8 +291,8 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with - -

◆ main()

+ +

◆ main()

@@ -300,19 +300,15 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
- - - - + -
int main (int argc,
void ) char ** argv )

Main function

Definition at line 582 of file kohonen_som_topology.cpp.

-
582 {
+
582 {
583#ifdef _OPENMP
584 std::cout << "Using OpenMP based parallelization\n";
585#else
diff --git a/d4/def/kohonen__som__topology_8cpp.js b/d4/def/kohonen__som__topology_8cpp.js index 2507f614d..c4793706a 100644 --- a/d4/def/kohonen__som__topology_8cpp.js +++ b/d4/def/kohonen__som__topology_8cpp.js @@ -5,7 +5,7 @@ var kohonen__som__topology_8cpp = [ "get_min_2d", "d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e", null ], [ "kohonen_som", "d4/def/kohonen__som__topology_8cpp.html#ac43d294e21a0c4fa33c53757df054576", null ], [ "machine_learning::kohonen_som", "d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576", null ], - [ "main", "d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "main", "d4/def/kohonen__som__topology_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "save_2d_data", "d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c", null ], [ "machine_learning::save_u_matrix", "d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07", null ], [ "save_u_matrix", "d4/def/kohonen__som__topology_8cpp.html#aa72a53c88203fde278f1fe6c3afe5b07", null ], diff --git a/d4/def/kohonen__som__topology_8cpp_source.html b/d4/def/kohonen__som__topology_8cpp_source.html index fee2f2ffd..455967a59 100644 --- a/d4/def/kohonen__som__topology_8cpp_source.html +++ b/d4/def/kohonen__som__topology_8cpp_source.html @@ -580,7 +580,7 @@ $(function(){initNavTree('d4/def/kohonen__som__topology_8cpp_source.html','../..
580
-
582int main(int argc, char **argv) {
+
582int main() {
583#ifdef _OPENMP
584 std::cout << "Using OpenMP based parallelization\n";
585#else
@@ -613,7 +613,6 @@ $(function(){initNavTree('d4/def/kohonen__som__topology_8cpp_source.html','../..
612 return 0;
613}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
get_min_2d
void get_min_2d(const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)
Definition kohonen_som_topology.cpp:105
save_2d_data
int save_2d_data(const char *fname, const std::vector< std::valarray< double > > &X)
Definition kohonen_som_topology.cpp:65
_random
double _random(double a, double b)
Definition kohonen_som_topology.cpp:53
@@ -627,6 +626,7 @@ $(function(){initNavTree('d4/def/kohonen__som__topology_8cpp_source.html','../..
test3
void test3()
Definition kohonen_som_topology.cpp:537
save_u_matrix
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double > > > &W)
Definition kohonen_som_topology.cpp:142
kohonen_som
void kohonen_som(const std::vector< std::valarray< double > > &X, std::vector< std::vector< std::valarray< double > > > *W, double alpha_min)
Definition kohonen_som_topology.cpp:269
+
main
int main()
Definition kohonen_som_topology.cpp:582
machine_learning
A* search algorithm
machine_learning::sum
T sum(const std::vector< std::valarray< T > > &A)
Definition vector_ops.hpp:232
machine_learning::MIN_DISTANCE
constexpr double MIN_DISTANCE
Definition kohonen_som_topology.cpp:129
diff --git a/d4/df4/trie__multiple__search_8cpp__incl.svg b/d4/df4/trie__multiple__search_8cpp__incl.svg index 8542d3871..c0a516200 100644 --- a/d4/df4/trie__multiple__search_8cpp__incl.svg +++ b/d4/df4/trie__multiple__search_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - 29 }
30 return active.size(); // size of the LIS.
31}
-
32int main(int argc, char const* argv[]) {
+
32int main() {
33 int n;
34 cout << "Enter size of array: ";
35 cin >> n;
diff --git a/d5/d44/selection__sort__recursive_8cpp__incl.svg b/d5/d44/selection__sort__recursive_8cpp__incl.svg index 581737e06..70cf2d206 100644 --- a/d5/d44/selection__sort__recursive_8cpp__incl.svg +++ b/d5/d44/selection__sort__recursive_8cpp__incl.svg @@ -1,7 +1,7 @@ - -
 Main searching function.

static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Implementation of the Sublist Search Algorithm

@@ -203,8 +203,8 @@ Working
- -

◆ main()

+ +

◆ main()

@@ -212,65 +212,54 @@ Working int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit

< Main list in which sublist is to be searched

< Sublist to be searched

< Main list in which sublist is to be searched

< boolean to check if the sublist exists or not

-

Definition at line 360 of file sublist_search.cpp.

-
360 {
-
361 test(); // run self-test implementations
-
362
-
363 std::vector<uint64_t> mainlistData = {
-
364 2, 5, 6, 7, 8};
-
365 std::vector<uint64_t> sublistData = {6, 8};
-
366
-
367 search::sublist_search::Node *mainlistLL =
-
368 search::sublist_search::makeLinkedList(mainlistData);
-
369 search::sublist_search::Node *sublistLL =
-
370 search::sublist_search::makeLinkedList(
-
371 sublistData);
-
373
-
374 bool exists = search::sublist_search::sublistSearch(
-
375 sublistLL,
-
376 mainlistLL);
-
377
-
378 std::cout << "Sublist: " << std::endl;
-
379 search::sublist_search::printLinkedList(sublistLL);
-
380
-
381 std::cout << "Main list: " << std::endl;
-
382 search::sublist_search::printLinkedList(mainlistLL);
-
383 std::cout << std::endl;
-
384
-
385 if (exists) {
-
386 std::cout << "[TRUE] - sublist found in main list\n";
-
387 } else {
-
388 std::cout << "[FALSE] - sublist NOT found in main list\n";
-
389 }
-
390
-
391 deleteList(mainlistLL);
-
392 deleteList(sublistLL);
-
393 return 0;
-
394}
+

Definition at line 358 of file sublist_search.cpp.

+
358 {
+
359 test(); // run self-test implementations
+
360
+
361 std::vector<uint64_t> mainlistData = {
+
362 2, 5, 6, 7, 8};
+
363 std::vector<uint64_t> sublistData = {6, 8};
+
364
+
365 search::sublist_search::Node *mainlistLL =
+
366 search::sublist_search::makeLinkedList(mainlistData);
+
367 search::sublist_search::Node *sublistLL =
+
368 search::sublist_search::makeLinkedList(
+
369 sublistData);
+
371
+
372 bool exists = search::sublist_search::sublistSearch(
+
373 sublistLL,
+
374 mainlistLL);
+
375
+
376 std::cout << "Sublist: " << std::endl;
+
377 search::sublist_search::printLinkedList(sublistLL);
+
378
+
379 std::cout << "Main list: " << std::endl;
+
380 search::sublist_search::printLinkedList(mainlistLL);
+
381 std::cout << std::endl;
+
382
+
383 if (exists) {
+
384 std::cout << "[TRUE] - sublist found in main list\n";
+
385 } else {
+
386 std::cout << "[FALSE] - sublist NOT found in main list\n";
+
387 }
+
388
+
389 deleteList(mainlistLL);
+
390 deleteList(sublistLL);
+
391 return 0;
+
392}
search::sublist_search::Node
A Node structure representing a single link Node in a linked list.
Definition sublist_search.cpp:48
search::sublist_search::sublistSearch
bool sublistSearch(Node *sublist, Node *mainList)
Main searching function.
Definition sublist_search.cpp:115
search::sublist_search::makeLinkedList
Node * makeLinkedList(const std::vector< uint64_t > &data)
Give a vector of data, it adds each element of vector in the linked list and return the address of he...
Definition sublist_search.cpp:74
diff --git a/d5/d45/sublist__search_8cpp.js b/d5/d45/sublist__search_8cpp.js index d3e000e19..5a0d2f81e 100644 --- a/d5/d45/sublist__search_8cpp.js +++ b/d5/d45/sublist__search_8cpp.js @@ -2,7 +2,7 @@ var sublist__search_8cpp = [ [ "search::sublist_search::Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ], [ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ], - [ "main", "d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d5/d45/sublist__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "search::sublist_search::makeLinkedList", "d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53", null ], [ "search::sublist_search::printLinkedList", "d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2", null ], [ "search::sublist_search::sublistSearch", "d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c", null ], diff --git a/d5/d45/sublist__search_8cpp_source.html b/d5/d45/sublist__search_8cpp_source.html index b4b5953dc..e04fd746c 100644 --- a/d5/d45/sublist__search_8cpp_source.html +++ b/d5/d45/sublist__search_8cpp_source.html @@ -380,41 +380,41 @@ $(function(){initNavTree('d5/d45/sublist__search_8cpp_source.html','../../','');
352}
353
-
-
360int main(int argc, char *argv[]) {
-
361 test(); // run self-test implementations
-
362
-
363 std::vector<uint64_t> mainlistData = {
-
364 2, 5, 6, 7, 8};
-
365 std::vector<uint64_t> sublistData = {6, 8};
-
366
-
367 search::sublist_search::Node *mainlistLL =
-
368 search::sublist_search::makeLinkedList(mainlistData);
-
369 search::sublist_search::Node *sublistLL =
-
370 search::sublist_search::makeLinkedList(
-
371 sublistData);
-
373
-
374 bool exists = search::sublist_search::sublistSearch(
-
375 sublistLL,
-
376 mainlistLL);
-
377
-
378 std::cout << "Sublist: " << std::endl;
-
379 search::sublist_search::printLinkedList(sublistLL);
-
380
-
381 std::cout << "Main list: " << std::endl;
-
382 search::sublist_search::printLinkedList(mainlistLL);
-
383 std::cout << std::endl;
-
384
-
385 if (exists) {
-
386 std::cout << "[TRUE] - sublist found in main list\n";
-
387 } else {
-
388 std::cout << "[FALSE] - sublist NOT found in main list\n";
-
389 }
-
390
-
391 deleteList(mainlistLL);
-
392 deleteList(sublistLL);
-
393 return 0;
-
394}
+
+
358int main() {
+
359 test(); // run self-test implementations
+
360
+
361 std::vector<uint64_t> mainlistData = {
+
362 2, 5, 6, 7, 8};
+
363 std::vector<uint64_t> sublistData = {6, 8};
+
364
+
365 search::sublist_search::Node *mainlistLL =
+
366 search::sublist_search::makeLinkedList(mainlistData);
+
367 search::sublist_search::Node *sublistLL =
+
368 search::sublist_search::makeLinkedList(
+
369 sublistData);
+
371
+
372 bool exists = search::sublist_search::sublistSearch(
+
373 sublistLL,
+
374 mainlistLL);
+
375
+
376 std::cout << "Sublist: " << std::endl;
+
377 search::sublist_search::printLinkedList(sublistLL);
+
378
+
379 std::cout << "Main list: " << std::endl;
+
380 search::sublist_search::printLinkedList(mainlistLL);
+
381 std::cout << std::endl;
+
382
+
383 if (exists) {
+
384 std::cout << "[TRUE] - sublist found in main list\n";
+
385 } else {
+
386 std::cout << "[FALSE] - sublist NOT found in main list\n";
+
387 }
+
388
+
389 deleteList(mainlistLL);
+
390 deleteList(sublistLL);
+
391 return 0;
+
392}
TestCases
class encapsulating the necessary test cases
Definition inorder_successor_of_bst.cpp:225
TestCases::log
void log(T msg)
A function to print given message on console.
Definition sublist_search.cpp:176
@@ -422,7 +422,6 @@ $(function(){initNavTree('d5/d45/sublist__search_8cpp_source.html','../../','');
TestCases::testCase_1
void testCase_1()
A test case contains edge case, printing inorder successor of last node.
Definition inorder_successor_of_bst.cpp:259
TestCases::testCase_3
void testCase_3()
A test case which contains main list of 50 elements and sublist of 20.
Definition inorder_successor_of_bst.cpp:345
TestCases::runTests
void runTests()
Executes test cases.
Definition sublist_search.cpp:186
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
data
int data[MAX]
test data
Definition hash_search.cpp:24
search
for std::assert
Definition binary_search.cpp:47
sublist_search
Functions for the Sublist Search implementation.
@@ -435,6 +434,7 @@ $(function(){initNavTree('d5/d45/sublist__search_8cpp_source.html','../../','');
search::sublist_search::makeLinkedList
Node * makeLinkedList(const std::vector< uint64_t > &data)
Give a vector of data, it adds each element of vector in the linked list and return the address of he...
Definition sublist_search.cpp:74
test
static void test()
Self-test implementations.
Definition sublist_search.cpp:349
search::sublist_search::printLinkedList
void printLinkedList(Node *start)
A simple function to print the linked list.
Definition sublist_search.cpp:58
+
main
int main()
Main function.
Definition sublist_search.cpp:358
diff --git a/d5/d48/shortest__common__supersequence_8cpp__incl.svg b/d5/d48/shortest__common__supersequence_8cpp__incl.svg index 487912ff2..11d68b1f9 100644 --- a/d5/d48/shortest__common__supersequence_8cpp__incl.svg +++ b/d5/d48/shortest__common__supersequence_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg index 3a1c2193f..b18f59301 100644 --- a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg +++ b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg index 7427f90ea..83a53984e 100644 --- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg +++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
 Calculate the longest increasing subsequence for the specified numbers.

static void test ()  Self-test implementations.
-int main (int argc, char const *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Calculate the length of the longest increasing subsequence in an array.

@@ -155,8 +155,8 @@ Functions

Definition in file longest_increasing_subsequence.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -164,46 +164,35 @@ Functions int main ( - int argc, - - - + void ) - char const * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 81 of file longest_increasing_subsequence.cpp.

-
81 {
-
82 uint32_t n = 0;
-
83
-
84 std::cout << "Enter size of array: ";
-
85 std::cin >> n;
+

Definition at line 79 of file longest_increasing_subsequence.cpp.

+
79 {
+
80 uint32_t n = 0;
+
81
+
82 std::cout << "Enter size of array: ";
+
83 std::cin >> n;
+
84
+
85 std::vector<uint64_t> a(n);
86
-
87 std::vector<uint64_t> a(n);
-
88
-
89 std::cout << "Enter array elements: ";
-
90 for (int i = 0; i < n; ++i) {
-
91 std::cin >> a[i];
-
92 }
-
93
-
94 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
-
95 << std::endl;
-
96 test(); // run self-test implementations
-
97
-
98 return 0;
-
99}
+
87 std::cout << "Enter array elements: ";
+
88 for (int i = 0; i < n; ++i) {
+
89 std::cin >> a[i];
+
90 }
+
91
+
92 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
+
93 << std::endl;
+
94 test(); // run self-test implementations
+
95
+
96 return 0;
+
97}
test
static void test()
Self-test implementations.
Definition longest_increasing_subsequence.cpp:64
dynamic_programming::LIS
uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
Calculate the longest increasing subsequence for the specified numbers.
Definition longest_increasing_subsequence.cpp:40
diff --git a/d7/d57/longest__increasing__subsequence_8cpp.js b/d7/d57/longest__increasing__subsequence_8cpp.js index 70ca798dd..d3bc02ab7 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp.js +++ b/d7/d57/longest__increasing__subsequence_8cpp.js @@ -1,6 +1,6 @@ var longest__increasing__subsequence_8cpp = [ [ "dynamic_programming::LIS", "dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079", null ], - [ "main", "d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ], + [ "main", "d7/d57/longest__increasing__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d7/d57/longest__increasing__subsequence_8cpp_source.html b/d7/d57/longest__increasing__subsequence_8cpp_source.html index ef0d2c315..2535e729e 100644 --- a/d7/d57/longest__increasing__subsequence_8cpp_source.html +++ b/d7/d57/longest__increasing__subsequence_8cpp_source.html @@ -160,29 +160,29 @@ $(function(){initNavTree('d7/d57/longest__increasing__subsequence_8cpp_source.ht
73}
74
-
-
81int main(int argc, char const *argv[]) {
-
82 uint32_t n = 0;
-
83
-
84 std::cout << "Enter size of array: ";
-
85 std::cin >> n;
+
+
79int main() {
+
80 uint32_t n = 0;
+
81
+
82 std::cout << "Enter size of array: ";
+
83 std::cin >> n;
+
84
+
85 std::vector<uint64_t> a(n);
86
-
87 std::vector<uint64_t> a(n);
-
88
-
89 std::cout << "Enter array elements: ";
-
90 for (int i = 0; i < n; ++i) {
-
91 std::cin >> a[i];
-
92 }
-
93
-
94 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
-
95 << std::endl;
-
96 test(); // run self-test implementations
-
97
-
98 return 0;
-
99}
+
87 std::cout << "Enter array elements: ";
+
88 for (int i = 0; i < n; ++i) {
+
89 std::cin >> a[i];
+
90 }
+
91
+
92 std::cout << "\nThe result is: " << dynamic_programming::LIS(a, n)
+
93 << std::endl;
+
94 test(); // run self-test implementations
+
95
+
96 return 0;
+
97}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Self-test implementations.
Definition longest_increasing_subsequence.cpp:64
+
main
int main()
Main function.
Definition longest_increasing_subsequence.cpp:79
dynamic_programming
Dynamic Programming algorithms.
dynamic_programming::LIS
uint64_t LIS(const std::vector< uint64_t > &a, const uint32_t &n)
Calculate the longest increasing subsequence for the specified numbers.
Definition longest_increasing_subsequence.cpp:40
diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg index 6a4ea5cb4..f236d45e0 100644 --- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg +++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - diff --git a/d7/da7/adaline__learning_8cpp__incl_org.svg b/d7/da7/adaline__learning_8cpp__incl_org.svg index d8c7a87d6..53a8bf2cc 100644 --- a/d7/da7/adaline__learning_8cpp__incl_org.svg +++ b/d7/da7/adaline__learning_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - Functions
static void test ()
 Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search.

-int main (int argc, char const *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Trie datastructure with search variants

@@ -159,8 +159,8 @@ Functions

Definition in file trie_multiple_search.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -168,31 +168,20 @@ Functions int main ( - int argc, - - - + void ) - char const * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 466 of file trie_multiple_search.cpp.

-
466 {
-
467 test(); // run self-test implementations
-
468 return 0;
-
469}
+

Definition at line 464 of file trie_multiple_search.cpp.

+
464 {
+
465 test(); // run self-test implementations
+
466 return 0;
+
467}
test
static void test()
Function to test a simple search before and after deleting an entry. And to test out the multiple var...
Definition trie_multiple_search.cpp:425
diff --git a/d7/def/trie__multiple__search_8cpp.js b/d7/def/trie__multiple__search_8cpp.js index f6fc274b3..723316859 100644 --- a/d7/def/trie__multiple__search_8cpp.js +++ b/d7/def/trie__multiple__search_8cpp.js @@ -1,6 +1,6 @@ var trie__multiple__search_8cpp = [ [ "operations_on_datastructures::trie_operations::Tnode", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode" ], - [ "main", "d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ], + [ "main", "d7/def/trie__multiple__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d7/def/trie__multiple__search_8cpp_source.html b/d7/def/trie__multiple__search_8cpp_source.html index 54bd0954c..eb80f7cb3 100644 --- a/d7/def/trie__multiple__search_8cpp_source.html +++ b/d7/def/trie__multiple__search_8cpp_source.html @@ -503,11 +503,11 @@ $(function(){initNavTree('d7/def/trie__multiple__search_8cpp_source.html','../..
458}
459
-
-
466int main(int argc, char const *argv[]) {
-
467 test(); // run self-test implementations
-
468 return 0;
-
469}
+
+
464int main() {
+
465 test(); // run self-test implementations
+
466 return 0;
+
467}
operations_on_datastructures::trie_operations::Tnode
Class defining the structure of trie node and containing the methods to perform operations on them.
Definition trie_multiple_search.cpp:37
operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete
void SuggestAutocomplete(Tnode *new_root, const std::string &prefix)
Recursive function to suggest all the entries of trie which have a given common prefix.
Definition trie_multiple_search.cpp:249
@@ -520,11 +520,11 @@ $(function(){initNavTree('d7/def/trie__multiple__search_8cpp_source.html','../..
operations_on_datastructures::trie_operations::Tnode::DeleteFrom
void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)
Function recursively deletes the substring character by character iterating through the string to be ...
Definition trie_multiple_search.cpp:137
operations_on_datastructures::trie_operations::Tnode::Delete
void Delete(std::string entry)
Function to verify presence and hence delete an entry from the trie.
Definition trie_multiple_search.cpp:153
operations_on_datastructures::trie_operations::Tnode::numberOfChildren
uint8_t numberOfChildren(Tnode *node)
Function to count the number of children a node in the trie has.
Definition trie_multiple_search.cpp:72
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
operations_on_datastructures
for std::vector
trie_operations
Functions for Trie datastructure implementation.
test
static void test()
Function to test a simple search before and after deleting an entry. And to test out the multiple var...
Definition trie_multiple_search.cpp:425
+
main
int main()
Main function.
Definition trie_multiple_search.cpp:464
diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg index fef5bac83..aefd8bf76 100644 --- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg +++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - 49 std::cout << std::endl;
50}
51
-
52int main(int argc, char const* argv[]) {
+
52int main() {
53 int a[] = {170, 45, 75, 90, 802, 24, 2, 66};
54 int n = sizeof(a) / sizeof(a[0]);
55 radixsort(a, n);
diff --git a/d8/d96/gram__schmidt_8cpp__incl.svg b/d8/d96/gram__schmidt_8cpp__incl.svg index 7571f0583..dc7327a1d 100644 --- a/d8/d96/gram__schmidt_8cpp__incl.svg +++ b/d8/d96/gram__schmidt_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - -
 FastFourierTransform is a recursive function which returns list of complex numbers.

static void test ()  Self-test implementations.
-int main (int argc, char const *argv[]) - Main function.
+int main () + Main function calls automated test function to test the working of fast fourier transform.

Detailed Description

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT).

@@ -153,8 +153,8 @@ Functions

Definition in file fast_fourier_transform.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -162,32 +162,21 @@ Functions int main ( - int argc, - - - + void ) - char const * argv[] )
-

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored) calls automated test function to test the working of fast fourier transform.
-
-
+

Main function calls automated test function to test the working of fast fourier transform.

Returns
0 on exit
-

Definition at line 163 of file fast_fourier_transform.cpp.

-
163 {
-
164 test(); // run self-test implementations
-
165 // with 2 defined test cases
-
166 return 0;
-
167}
+

Definition at line 161 of file fast_fourier_transform.cpp.

+
161 {
+
162 test(); // run self-test implementations
+
163 // with 2 defined test cases
+
164 return 0;
+
165}
test
static void test()
Self-test implementations.
Definition fast_fourier_transform.cpp:105
diff --git a/d8/d9a/fast__fourier__transform_8cpp.js b/d8/d9a/fast__fourier__transform_8cpp.js index d576d28c4..5b63516b2 100644 --- a/d8/d9a/fast__fourier__transform_8cpp.js +++ b/d8/d9a/fast__fourier__transform_8cpp.js @@ -1,6 +1,6 @@ var fast__fourier__transform_8cpp = [ [ "numerical_methods::FastFourierTransform", "d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150", null ], - [ "main", "d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ], + [ "main", "d8/d9a/fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d8/d9a/fast__fourier__transform_8cpp_source.html b/d8/d9a/fast__fourier__transform_8cpp_source.html index 7e5178dc7..ef40016b0 100644 --- a/d8/d9a/fast__fourier__transform_8cpp_source.html +++ b/d8/d9a/fast__fourier__transform_8cpp_source.html @@ -234,16 +234,16 @@ $(function(){initNavTree('d8/d9a/fast__fourier__transform_8cpp_source.html','../
153}
154
-
162
-
-
163int main(int argc, char const *argv[]) {
-
164 test(); // run self-test implementations
-
165 // with 2 defined test cases
-
166 return 0;
-
167}
+
160
+
+
161int main() {
+
162 test(); // run self-test implementations
+
163 // with 2 defined test cases
+
164 return 0;
+
165}
test
static void test()
Self-test implementations.
Definition fast_fourier_transform.cpp:105
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+
main
int main()
Main function calls automated test function to test the working of fast fourier transform.
Definition fast_fourier_transform.cpp:161
numerical_methods
for assert
numerical_methods::FastFourierTransform
std::complex< double > * FastFourierTransform(std::complex< double > *p, uint8_t n)
FastFourierTransform is a recursive function which returns list of complex numbers.
Definition fast_fourier_transform.cpp:42
diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg index 06d409bdc..cc36285e2 100644 --- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg +++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg @@ -1,7 +1,7 @@ - - Functions
static void test ()
 Self-test implementations.

-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.
@@ -176,8 +176,8 @@ Variables

Definition in file sparse_table.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -185,31 +185,20 @@ Variables
- - - - + -

Variables

int main (int argc,
void ) char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 162 of file sparse_table.cpp.

-
162 {
-
163 test(); // run self-test implementations
-
164 return 0;
-
165}
+

Definition at line 160 of file sparse_table.cpp.

+
160 {
+
161 test(); // run self-test implementations
+
162 return 0;
+
163}
test
static void test()
Self-test implementations.
Definition sparse_table.cpp:129
diff --git a/d8/dab/sparse__table_8cpp.js b/d8/dab/sparse__table_8cpp.js index 933c18126..ee52c3d96 100644 --- a/d8/dab/sparse__table_8cpp.js +++ b/d8/dab/sparse__table_8cpp.js @@ -1,7 +1,7 @@ var sparse__table_8cpp = [ [ "data_structures::sparse_table::Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table" ], - [ "main", "d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "d8/dab/sparse__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ], [ "data_structures::sparse_table::M", "d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e", null ], [ "data_structures::sparse_table::N", "d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d", null ] diff --git a/d8/dab/sparse__table_8cpp_source.html b/d8/dab/sparse__table_8cpp_source.html index a39b71e40..d0deb2b86 100644 --- a/d8/dab/sparse__table_8cpp_source.html +++ b/d8/dab/sparse__table_8cpp_source.html @@ -206,17 +206,17 @@ $(function(){initNavTree('d8/dab/sparse__table_8cpp_source.html','../../',''); }
154}
155
-
-
162int main(int argc, char *argv[]) {
-
163 test(); // run self-test implementations
-
164 return 0;
-
165}
+
+
160int main() {
+
161 test(); // run self-test implementations
+
162 return 0;
+
163}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
data_structures
for IO operations
sparse_table
Functions for Implementation of Sparse Table
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:48
test
static void test()
Self-test implementations.
Definition sparse_table.cpp:129
+
main
int main()
Main function.
Definition sparse_table.cpp:160
data_structures::sparse_table::M
constexpr uint8_t M
ceil(log2(N)).
Definition sparse_table.cpp:49
data_structures::sparse_table::Sparse_table
Definition sparse_table.cpp:51
data_structures::sparse_table::Sparse_table::query
int64_t query(int64_t l, int64_t r)
Queries the sparse table for the value of the interval [l, r] (i.e. from l to r inclusive).
Definition sparse_table.cpp:110
diff --git a/d8/dc0/heavy__light__decomposition_8cpp__incl.svg b/d8/dc0/heavy__light__decomposition_8cpp__incl.svg index 206869af8..71488f352 100644 --- a/d8/dc0/heavy__light__decomposition_8cpp__incl.svg +++ b/d8/dc0/heavy__light__decomposition_8cpp__incl.svg @@ -1,7 +1,7 @@ - diff --git a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg index 217f54e29..f53dac040 100644 --- a/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg +++ b/d8/dc0/heavy__light__decomposition_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - -
 InverseFastFourierTransform is a recursive function which returns list of complex numbers.

static void test ()  Self-test implementations.
-int main (int argc, char const *argv[]) - Main function.
+int main () + Main function calls automated test function to test the working of fast fourier transform.

Detailed Description

An inverse fast Fourier transform (IFFT) is an algorithm that computes the inverse fourier transform.

@@ -153,8 +153,8 @@ Functions

Definition in file inverse_fast_fourier_transform.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -162,32 +162,21 @@ Functions int main ( - int argc, - - - + void ) - char const * argv[] )
-

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored) calls automated test function to test the working of fast fourier transform.
-
-
+

Main function calls automated test function to test the working of fast fourier transform.

Returns
0 on exit
-

Definition at line 157 of file inverse_fast_fourier_transform.cpp.

-
157 {
-
158 test(); // run self-test implementations
-
159 // with 2 defined test cases
-
160 return 0;
-
161}
+

Definition at line 155 of file inverse_fast_fourier_transform.cpp.

+
155 {
+
156 test(); // run self-test implementations
+
157 // with 2 defined test cases
+
158 return 0;
+
159}
test
static void test()
Self-test implementations.
Definition inverse_fast_fourier_transform.cpp:101
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp.js b/d9/d37/inverse__fast__fourier__transform_8cpp.js index cdbfe59ec..48c8deb60 100644 --- a/d9/d37/inverse__fast__fourier__transform_8cpp.js +++ b/d9/d37/inverse__fast__fourier__transform_8cpp.js @@ -1,6 +1,6 @@ var inverse__fast__fourier__transform_8cpp = [ [ "numerical_methods::InverseFastFourierTransform", "d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93", null ], - [ "main", "d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ], + [ "main", "d9/d37/inverse__fast__fourier__transform_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_source.html b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html index 31db60c99..759468d30 100644 --- a/d9/d37/inverse__fast__fourier__transform_8cpp_source.html +++ b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html @@ -236,16 +236,16 @@ $(function(){initNavTree('d9/d37/inverse__fast__fourier__transform_8cpp_source.h
147}
148
-
156
-
-
157int main(int argc, char const *argv[]) {
-
158 test(); // run self-test implementations
-
159 // with 2 defined test cases
-
160 return 0;
-
161}
+
154
+
+
155int main() {
+
156 test(); // run self-test implementations
+
157 // with 2 defined test cases
+
158 return 0;
+
159}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Self-test implementations.
Definition inverse_fast_fourier_transform.cpp:101
+
main
int main()
Main function calls automated test function to test the working of fast fourier transform.
Definition inverse_fast_fourier_transform.cpp:155
numerical_methods
for assert
numerical_methods::InverseFastFourierTransform
std::complex< double > * InverseFastFourierTransform(std::complex< double > *p, uint8_t n)
InverseFastFourierTransform is a recursive function which returns list of complex numbers.
Definition inverse_fast_fourier_transform.cpp:34
diff --git a/d9/d43/hopcroft__karp_8cpp__incl.svg b/d9/d43/hopcroft__karp_8cpp__incl.svg index c4d0be41e..ee2664294 100644 --- a/d9/d43/hopcroft__karp_8cpp__incl.svg +++ b/d9/d43/hopcroft__karp_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - -
void test_3d_classes (std::vector< std::valarray< double > > *data)
void test3 ()
double get_clock_diff (clock_t start_t, clock_t end_t)
-
int main (int argc, char **argv)
+
int main ()
void kohonen_som_tracer (const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)

Detailed Description

@@ -267,8 +267,8 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
- -

◆ main()

+ +

◆ main()

@@ -276,19 +276,15 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with int main ( - int argc, - - - + void ) - char ** argv )

Main function

Definition at line 457 of file kohonen_som_trace.cpp.

-
457 {
+
457 {
458#ifdef _OPENMP
459 std::cout << "Using OpenMP based parallelization\n";
460#else
diff --git a/d9/d49/kohonen__som__trace_8cpp.js b/d9/d49/kohonen__som__trace_8cpp.js index 6e774c5ae..b336dc09d 100644 --- a/d9/d49/kohonen__som__trace_8cpp.js +++ b/d9/d49/kohonen__som__trace_8cpp.js @@ -4,7 +4,7 @@ var kohonen__som__trace_8cpp = [ "get_clock_diff", "d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908", null ], [ "kohonen_som_tracer", "d9/d49/kohonen__som__trace_8cpp.html#a042f435bca0839e721fc1574a61e8da3", null ], [ "machine_learning::kohonen_som_tracer", "d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3", null ], - [ "main", "d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "main", "d9/d49/kohonen__som__trace_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "save_nd_data", "d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67", null ], [ "test1", "d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], [ "test2", "d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ], diff --git a/d9/d49/kohonen__som__trace_8cpp_source.html b/d9/d49/kohonen__som__trace_8cpp_source.html index 11677e983..3e1f7ce9f 100644 --- a/d9/d49/kohonen__som__trace_8cpp_source.html +++ b/d9/d49/kohonen__som__trace_8cpp_source.html @@ -429,7 +429,7 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
455
-
457int main(int argc, char **argv) {
+
457int main() {
458#ifdef _OPENMP
459 std::cout << "Using OpenMP based parallelization\n";
460#else
@@ -462,7 +462,6 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
487 return 0;
488}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
save_nd_data
int save_nd_data(const char *fname, const std::vector< std::valarray< double > > &X)
Definition kohonen_som_trace.cpp:58
_random
double _random(double a, double b)
Definition kohonen_som_topology.cpp:53
data
int data[MAX]
test data
Definition hash_search.cpp:24
@@ -474,6 +473,7 @@ $(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../',
test3
void test3()
Definition kohonen_som_trace.cpp:414
test_3d_classes
void test_3d_classes(std::vector< std::valarray< double > > *data)
Definition kohonen_som_trace.cpp:359
test_circle
void test_circle(std::vector< std::valarray< double > > *data)
Definition kohonen_som_trace.cpp:196
+
main
int main()
Definition kohonen_som_trace.cpp:457
machine_learning
A* search algorithm
machine_learning::kohonen_som_tracer
void kohonen_som_tracer(const std::vector< std::valarray< double > > &X, std::vector< std::valarray< double > > *W, double alpha_min)
Definition kohonen_som_trace.cpp:149
machine_learning::sum
T sum(const std::vector< std::valarray< T > > &A)
Definition vector_ops.hpp:232
diff --git a/d9/d4e/gnome__sort_8cpp__incl.svg b/d9/d4e/gnome__sort_8cpp__incl.svg index 2152d0d45..f0308fecb 100644 --- a/d9/d4e/gnome__sort_8cpp__incl.svg +++ b/d9/d4e/gnome__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
 Function to calculate Euler's Totient.

static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

Implementation of Euler's Totient @description Euler Totient Function is also known as phi function.

@@ -171,8 +171,8 @@ Some known values are:

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -180,31 +180,20 @@ Some known values are:

    int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 79 of file eulers_totient_function.cpp.

-
79 {
-
80 test();
-
81 return 0;
-
82}
+

Definition at line 77 of file eulers_totient_function.cpp.

+
77 {
+
78 test();
+
79 return 0;
+
80}
test
static void test()
Self-test implementations.
Definition eulers_totient_function.cpp:61
diff --git a/da/d23/eulers__totient__function_8cpp.js b/da/d23/eulers__totient__function_8cpp.js index 9f2ff4fb7..d0361f403 100644 --- a/da/d23/eulers__totient__function_8cpp.js +++ b/da/d23/eulers__totient__function_8cpp.js @@ -1,6 +1,6 @@ var eulers__totient__function_8cpp = [ - [ "main", "da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "da/d23/eulers__totient__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "math::phiFunction", "dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5", null ], [ "test", "da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/da/d23/eulers__totient__function_8cpp_source.html b/da/d23/eulers__totient__function_8cpp_source.html index 2c08a4965..90b63a38d 100644 --- a/da/d23/eulers__totient__function_8cpp_source.html +++ b/da/d23/eulers__totient__function_8cpp_source.html @@ -155,14 +155,14 @@ $(function(){initNavTree('da/d23/eulers__totient__function_8cpp_source.html','..
71}
72
-
-
79int main(int argc, char *argv[]) {
-
80 test();
-
81 return 0;
-
82}
+
+
77int main() {
+
78 test();
+
79 return 0;
+
80}
test
static void test()
Self-test implementations.
Definition eulers_totient_function.cpp:61
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+
main
int main()
Main function.
Definition eulers_totient_function.cpp:77
math
for assert
math::phiFunction
uint64_t phiFunction(uint64_t n)
Function to calculate Euler's Totient.
Definition eulers_totient_function.cpp:41
diff --git a/da/d26/strand__sort_8cpp__incl.svg b/da/d26/strand__sort_8cpp__incl.svg index 386fb98c8..8331b452e 100644 --- a/da/d26/strand__sort_8cpp__incl.svg +++ b/da/d26/strand__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg index 0d98a5851..91ddb3c70 100644 --- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg +++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg @@ -1,7 +1,7 @@ - - - - -
 Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the
dp vector.
static void test ()  Self-test implementations.
-int main (int argc, char *argv[]) - main function
+int main () + main function

Detailed Description

Implementation of Minimum Edit Distance using Dynamic Programing.

@@ -251,8 +251,8 @@ Algorithm
- -

◆ main()

+ +

◆ main()

@@ -260,31 +260,20 @@ Algorithm int main ( - int argc, - - - + void ) - char * argv[] )

main function

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 173 of file minimum_edit_distance.cpp.

-
173 {
-
174 test(); // run self-test implementations
-
175 return 0;
-
176}
+

Definition at line 171 of file minimum_edit_distance.cpp.

+
171 {
+
172 test(); // run self-test implementations
+
173 return 0;
+
174}
test
static void test()
Self-test implementations.
Definition minimum_edit_distance.cpp:142
diff --git a/da/d52/minimum__edit__distance_8cpp.js b/da/d52/minimum__edit__distance_8cpp.js index 11b155f2a..88a56f713 100644 --- a/da/d52/minimum__edit__distance_8cpp.js +++ b/da/d52/minimum__edit__distance_8cpp.js @@ -1,7 +1,7 @@ var minimum__edit__distance_8cpp = [ [ "dynamic_programming::minimum_edit_distance::editDistDP", "da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2", null ], - [ "main", "da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "da/d52/minimum__edit__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "dynamic_programming::minimum_edit_distance::min", "da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347", null ], [ "test", "da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/da/d52/minimum__edit__distance_8cpp_source.html b/da/d52/minimum__edit__distance_8cpp_source.html index e032d70fb..c82cb4472 100644 --- a/da/d52/minimum__edit__distance_8cpp_source.html +++ b/da/d52/minimum__edit__distance_8cpp_source.html @@ -206,16 +206,16 @@ $(function(){initNavTree('da/d52/minimum__edit__distance_8cpp_source.html','../.
165}
166
-
-
173int main(int argc, char *argv[]) {
-
174 test(); // run self-test implementations
-
175 return 0;
-
176}
+
+
171int main() {
+
172 test(); // run self-test implementations
+
173 return 0;
+
174}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
dynamic_programming::minimum_edit_distance::min
uint64_t min(uint64_t x, uint64_t y, uint64_t z)
Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost a...
Definition minimum_edit_distance.cpp:68
test
static void test()
Self-test implementations.
Definition minimum_edit_distance.cpp:142
dynamic_programming::minimum_edit_distance::editDistDP
uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)
Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...
Definition minimum_edit_distance.cpp:92
+
main
int main()
main function
Definition minimum_edit_distance.cpp:171
dp
for std::vector
Definition partition_problem.cpp:39
dynamic_programming
Dynamic Programming algorithms.
diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg index b9871b39e..efd7ddecb 100644 --- a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Main function.

Parameters
- - + +
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
argccommandline argument count
argvcommandline array of arguments
diff --git a/db/dc3/vector__cross__product_8cpp__incl.svg b/db/dc3/vector__cross__product_8cpp__incl.svg index 88576cb82..900094279 100644 --- a/db/dc3/vector__cross__product_8cpp__incl.svg +++ b/db/dc3/vector__cross__product_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - -
 returns the maximum contiguous circular sum of an array

static void test ()  Self-test implementation.
-int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

C++ program for maximum contiguous circular sum problem using Kadane's Algorithm

@@ -150,8 +150,8 @@ Functions

Definition in file maximum_circular_subarray.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -159,31 +159,20 @@ Functions int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 86 of file maximum_circular_subarray.cpp.

-
86 {
-
87 test(); // run self-test implementations
-
88 return 0;
-
89}
+

Definition at line 84 of file maximum_circular_subarray.cpp.

+
84 {
+
85 test(); // run self-test implementations
+
86 return 0;
+
87}
test
static void test()
Self-test implementation.
Definition maximum_circular_subarray.cpp:64
diff --git a/db/dfb/maximum__circular__subarray_8cpp.js b/db/dfb/maximum__circular__subarray_8cpp.js index 5e1d1c4ed..aba30084f 100644 --- a/db/dfb/maximum__circular__subarray_8cpp.js +++ b/db/dfb/maximum__circular__subarray_8cpp.js @@ -1,6 +1,6 @@ var maximum__circular__subarray_8cpp = [ - [ "main", "db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "db/dfb/maximum__circular__subarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "dynamic_programming::maxCircularSum", "dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb", null ], [ "test", "db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/db/dfb/maximum__circular__subarray_8cpp_source.html b/db/dfb/maximum__circular__subarray_8cpp_source.html index 98a4a4a84..655d8cc80 100644 --- a/db/dfb/maximum__circular__subarray_8cpp_source.html +++ b/db/dfb/maximum__circular__subarray_8cpp_source.html @@ -178,14 +178,14 @@ $(function(){initNavTree('db/dfb/maximum__circular__subarray_8cpp_source.html','
78
79
-
-
86int main(int argc, char *argv[]) {
-
87 test(); // run self-test implementations
-
88 return 0;
-
89}
+
+
84int main() {
+
85 test(); // run self-test implementations
+
86 return 0;
+
87}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Self-test implementation.
Definition maximum_circular_subarray.cpp:64
+
main
int main()
Main function.
Definition maximum_circular_subarray.cpp:84
dynamic_programming
Dynamic Programming algorithms.
dynamic_programming::maxCircularSum
int maxCircularSum(std::vector< int > &arr)
returns the maximum contiguous circular sum of an array
Definition maximum_circular_subarray.cpp:26
diff --git a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg index df962a3bd..c0ee81246 100644 --- a/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg +++ b/dc/d14/structoperations__on__datastructures_1_1circular__linked__list_1_1_node__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - -
 Babylonian methods is an iterative function which returns square root of radicand.

static void test ()  Self-test implementations.
-int main (int argc, char const *argv[]) - Main function.
+int main () + Main function calls automated test function to test the working of fast fourier transform.

Detailed Description

A babylonian method (BM) is an algorithm that computes the square root.

@@ -150,8 +150,8 @@ Functions

Definition in file babylonian_method.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -159,32 +159,21 @@ Functions int main ( - int argc, - - - + void ) - char const * argv[] )
-

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored) calls automated test function to test the working of fast fourier transform.
-
-
+

Main function calls automated test function to test the working of fast fourier transform.

Returns
0 on exit
-

Definition at line 96 of file babylonian_method.cpp.

-
96 {
-
97 test(); // run self-test implementations
-
98 // with 2 defined test cases
-
99 return 0;
-
100}
+

Definition at line 94 of file babylonian_method.cpp.

+
94 {
+
95 test(); // run self-test implementations
+
96 // with 2 defined test cases
+
97 return 0;
+
98}
test
static void test()
Self-test implementations.
Definition babylonian_method.cpp:62
diff --git a/dc/d9c/babylonian__method_8cpp.js b/dc/d9c/babylonian__method_8cpp.js index 35cfb5803..746634674 100644 --- a/dc/d9c/babylonian__method_8cpp.js +++ b/dc/d9c/babylonian__method_8cpp.js @@ -1,6 +1,6 @@ var babylonian__method_8cpp = [ [ "numerical_methods::babylonian_method", "d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309", null ], - [ "main", "dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ], + [ "main", "dc/d9c/babylonian__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test", "dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] ]; \ No newline at end of file diff --git a/dc/d9c/babylonian__method_8cpp_source.html b/dc/d9c/babylonian__method_8cpp_source.html index 20a7626e8..b10c5d5a2 100644 --- a/dc/d9c/babylonian__method_8cpp_source.html +++ b/dc/d9c/babylonian__method_8cpp_source.html @@ -177,16 +177,16 @@ $(function(){initNavTree('dc/d9c/babylonian__method_8cpp_source.html','../../','
86}
87
-
95
-
-
96int main(int argc, char const *argv[]) {
-
97 test(); // run self-test implementations
-
98 // with 2 defined test cases
-
99 return 0;
-
100}
+
93
+
+
94int main() {
+
95 test(); // run self-test implementations
+
96 // with 2 defined test cases
+
97 return 0;
+
98}
test
static void test()
Self-test implementations.
Definition babylonian_method.cpp:62
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+
main
int main()
Main function calls automated test function to test the working of fast fourier transform.
Definition babylonian_method.cpp:94
numerical_methods
for assert
numerical_methods::babylonian_method
double babylonian_method(double radicand)
Babylonian methods is an iterative function which returns square root of radicand.
Definition babylonian_method.cpp:30
diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.svg b/dc/dc5/ode__forward__euler_8cpp__incl.svg index eea2e02cd..717df73c0 100644 --- a/dc/dc5/ode__forward__euler_8cpp__incl.svg +++ b/dc/dc5/ode__forward__euler_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - diff --git a/dc/dd2/sha256_8cpp__incl_org.svg b/dc/dd2/sha256_8cpp__incl_org.svg index c5b222ef7..877840ba4 100644 --- a/dc/dd2/sha256_8cpp__incl_org.svg +++ b/dc/dd2/sha256_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg index b8c24439c..6d42b3575 100644 --- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg +++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - -
static void test1 ()
static void test2 ()
static void test3 ()
-
int main (int argc, char **argv)
+
int main ()

Detailed Description

The implementation of Hamilton's cycle dynamic solution for vertices number less than 20.

@@ -224,8 +224,8 @@ Functions
- -

◆ main()

+ +

◆ main()

@@ -233,31 +233,20 @@ Functions int main ( - int argc, - - - + void ) - char ** argv )
-

Main function

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
+

Main function

-

Definition at line 142 of file hamiltons_cycle.cpp.

-
142 {
-
143 test1();
-
144 test2();
-
145 test3();
-
146 return 0;
-
147}
+

Definition at line 140 of file hamiltons_cycle.cpp.

+
140 {
+
141 test1();
+
142 test2();
+
143 test3();
+
144 return 0;
+
145}
test3
static void test3()
Definition hamiltons_cycle.cpp:122
test2
static void test2()
Definition hamiltons_cycle.cpp:103
test1
static void test1()
Definition hamiltons_cycle.cpp:81
diff --git a/dd/d0c/hamiltons__cycle_8cpp.js b/dd/d0c/hamiltons__cycle_8cpp.js index 88fc6f52e..2acfb347c 100644 --- a/dd/d0c/hamiltons__cycle_8cpp.js +++ b/dd/d0c/hamiltons__cycle_8cpp.js @@ -1,7 +1,7 @@ var hamiltons__cycle_8cpp = [ [ "hamilton_cycle", "dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4", null ], - [ "main", "dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "main", "dd/d0c/hamiltons__cycle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "test1", "dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243", null ], [ "test2", "dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae", null ], [ "test3", "dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299", null ] diff --git a/dd/d0c/hamiltons__cycle_8cpp_source.html b/dd/d0c/hamiltons__cycle_8cpp_source.html index 734fac297..20d8a62b1 100644 --- a/dd/d0c/hamiltons__cycle_8cpp_source.html +++ b/dd/d0c/hamiltons__cycle_8cpp_source.html @@ -216,19 +216,19 @@ $(function(){initNavTree('dd/d0c/hamiltons__cycle_8cpp_source.html','../../','')
134}
135
-
-
142int main(int argc, char **argv) {
-
143 test1();
-
144 test2();
-
145 test3();
-
146 return 0;
-
147}
+
+
140int main() {
+
141 test1();
+
142 test2();
+
143 test3();
+
144 return 0;
+
145}
height
int height(node *root)
Definition avltree.cpp:38
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test3
static void test3()
Definition hamiltons_cycle.cpp:122
test2
static void test2()
Definition hamiltons_cycle.cpp:103
hamilton_cycle
bool hamilton_cycle(const std::vector< std::vector< bool > > &routes)
Definition hamiltons_cycle.cpp:30
+
main
int main()
Definition hamiltons_cycle.cpp:140
test1
static void test1()
Definition hamiltons_cycle.cpp:81
dp
for std::vector
Definition partition_problem.cpp:39
diff --git a/dd/d0e/double__factorial_8cpp__incl.svg b/dd/d0e/double__factorial_8cpp__incl.svg index d963e53e4..6f54b4a2d 100644 --- a/dd/d0e/double__factorial_8cpp__incl.svg +++ b/dd/d0e/double__factorial_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - diff --git a/dd/d0f/md5_8cpp__incl_org.svg b/dd/d0f/md5_8cpp__incl_org.svg index 06972a895..502874592 100644 --- a/dd/d0f/md5_8cpp__incl_org.svg +++ b/dd/d0f/md5_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - -
std::ostream & operator<< (std::ostream &out, matrix< T > const &v)
void test1 ()
void test2 ()
-
int main (int argc, char **argv)
+
int main ()

Detailed Description

LU decomposition of a square matrix

@@ -146,8 +146,8 @@ Functions

Definition in file lu_decompose.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -155,19 +155,15 @@ Functions int main ( - int argc, - - - + void ) - char ** argv )

Main function

Definition at line 84 of file lu_decompose.cpp.

-
84 {
+
84 {
85 std::srand(std::time(NULL)); // random number initializer
86
87 test1();
diff --git a/dd/d65/lu__decompose_8cpp.js b/dd/d65/lu__decompose_8cpp.js index e2aa693bb..35691461e 100644 --- a/dd/d65/lu__decompose_8cpp.js +++ b/dd/d65/lu__decompose_8cpp.js @@ -1,6 +1,6 @@ var lu__decompose_8cpp = [ - [ "main", "dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "main", "dd/d65/lu__decompose_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "operator<<", "dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e", null ], [ "test1", "dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], [ "test2", "dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ] diff --git a/dd/d65/lu__decompose_8cpp_source.html b/dd/d65/lu__decompose_8cpp_source.html index 282938d1c..4dff231d7 100644 --- a/dd/d65/lu__decompose_8cpp_source.html +++ b/dd/d65/lu__decompose_8cpp_source.html @@ -190,7 +190,7 @@ $(function(){initNavTree('dd/d65/lu__decompose_8cpp_source.html','../../',''); }
82
-
84int main(int argc, char **argv) {
+
84int main() {
85 std::srand(std::time(NULL)); // random number initializer
86
87 test1();
@@ -198,10 +198,10 @@ $(function(){initNavTree('dd/d65/lu__decompose_8cpp_source.html','../../',''); }
89 return 0;
90}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test2
void test2()
Definition lu_decompose.cpp:66
test1
void test1()
Definition lu_decompose.cpp:36
operator<<
std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition lu_decompose.cpp:18
+
main
int main()
Definition lu_decompose.cpp:84
lu_decomposition.h
Functions associated with LU Decomposition of a square matrix.
determinant_lu
double determinant_lu(const matrix< T > &A)
Definition lu_decomposition.h:90
lu_decomposition
int lu_decomposition(const matrix< T > &A, matrix< double > *L, matrix< double > *U)
Definition lu_decomposition.h:29
diff --git a/dd/d7f/classstack__linked_list__coll__graph.svg b/dd/d7f/classstack__linked_list__coll__graph.svg index fc10f879c..1c6a5a9a2 100644 --- a/dd/d7f/classstack__linked_list__coll__graph.svg +++ b/dd/d7f/classstack__linked_list__coll__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Main function.

Parameters
- - + +
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
argccommandline argument count
argvcommandline array of arguments
diff --git a/df/d14/dnf__sort_8cpp__incl.svg b/df/d14/dnf__sort_8cpp__incl.svg index f6194fdb0..0af074e33 100644 --- a/df/d14/dnf__sort_8cpp__incl.svg +++ b/df/d14/dnf__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - -
uint64_t math::modular_division::mod_division (uint64_t a, uint64_t b, uint64_t p)
 This function calculates modular division.

static void test () -int main (int argc, char *argv[]) - Main function.
+int main () + Main function.

Detailed Description

An algorithm to divide two numbers under modulo p Modular Division

@@ -154,8 +154,8 @@ Functions

Definition in file modular_division.cpp.

Function Documentation

- -

◆ main()

+ +

◆ main()

@@ -163,31 +163,20 @@ Functions int main ( - int argc, - - - + void ) - char * argv[] )

Main function.

-
Parameters
- - - -
argccommandline argument count (ignored)
argvcommandline array of arguments (ignored)
-
-
Returns
0 on exit
-

Definition at line 113 of file modular_division.cpp.

-
113 {
-
114 test(); // execute the tests
-
115 return 0;
-
116}
+

Definition at line 111 of file modular_division.cpp.

+
111 {
+
112 test(); // execute the tests
+
113 return 0;
+
114}
test
static void test()
Definition modular_division.cpp:89
diff --git a/df/d72/modular__division_8cpp.js b/df/d72/modular__division_8cpp.js index ce0b0a52f..97cb1db07 100644 --- a/df/d72/modular__division_8cpp.js +++ b/df/d72/modular__division_8cpp.js @@ -1,6 +1,6 @@ var modular__division_8cpp = [ - [ "main", "df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "main", "df/d72/modular__division_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], [ "math::modular_division::mod_division", "df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7", null ], [ "math::modular_division::power", "df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179", null ], [ "test", "df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] diff --git a/df/d72/modular__division_8cpp_source.html b/df/d72/modular__division_8cpp_source.html index 46de401d3..f53870352 100644 --- a/df/d72/modular__division_8cpp_source.html +++ b/df/d72/modular__division_8cpp_source.html @@ -173,16 +173,16 @@ $(function(){initNavTree('df/d72/modular__division_8cpp_source.html','../../',''
105}
106
-
-
113int main(int argc, char *argv[]) {
-
114 test(); // execute the tests
-
115 return 0;
-
116}
+
+
111int main() {
+
112 test(); // execute the tests
+
113 return 0;
+
114}
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
math::modular_division::power
uint64_t power(uint64_t a, uint64_t b, uint64_t c)
This function calculates a raised to exponent b under modulo c using modular exponentiation.
Definition modular_division.cpp:50
math::modular_division::mod_division
uint64_t mod_division(uint64_t a, uint64_t b, uint64_t p)
This function calculates modular division.
Definition modular_division.cpp:75
test
static void test()
Definition modular_division.cpp:89
+
main
int main()
Main function.
Definition modular_division.cpp:111
math
for assert
modular_division
Functions for Modular Division implementation.
diff --git a/df/d77/connected__components_8cpp__incl.svg b/df/d77/connected__components_8cpp__incl.svg index 9b57780b9..0a7197b66 100644 --- a/df/d77/connected__components_8cpp__incl.svg +++ b/df/d77/connected__components_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - diff --git a/df/dd6/a1z26__cipher_8cpp__incl_org.svg b/df/dd6/a1z26__cipher_8cpp__incl_org.svg index ed3cc73ea..6e7d94b0b 100644 --- a/df/dd6/a1z26__cipher_8cpp__incl_org.svg +++ b/df/dd6/a1z26__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - + @@ -294,19 +294,19 @@ - + - + @@ -340,7 +340,7 @@ - + @@ -762,7 +762,6 @@ - @@ -771,6 +770,7 @@ + @@ -780,9 +780,9 @@ - + @@ -917,12 +917,12 @@ - + @@ -979,11 +979,11 @@ - + @@ -1448,7 +1448,7 @@ - + @@ -1535,7 +1535,7 @@ - + @@ -1739,7 +1739,7 @@ - + @@ -1754,9 +1754,9 @@ - + @@ -1909,7 +1909,7 @@ - + @@ -1920,11 +1920,11 @@ - + @@ -2110,8 +2110,8 @@ - + @@ -2153,9 +2153,9 @@ - + @@ -2521,8 +2521,8 @@ - + @@ -2646,7 +2646,7 @@ - + @@ -2711,9 +2711,9 @@ - + @@ -2867,8 +2867,8 @@ - + @@ -3221,10 +3221,10 @@ - + diff --git a/globals_func_m.html b/globals_func_m.html index b2b2a9fa1..4561d762d 100644 --- a/globals_func_m.html +++ b/globals_func_m.html @@ -116,7 +116,7 @@ $(function(){initNavTree('globals_func_m.html','',''); });
Here is a list of all documented functions with links to the documentation:

- m -