From e364889a3474f36fe6c2e2451ceeec3e1c9f60a2 Mon Sep 17 00:00:00 2001 From: realstealthninja Date: Thu, 14 Aug 2025 04:29:32 +0000 Subject: [PATCH] Documentation for d4962c3032f61a66eff72e9d6fa19be0ddd0f7ba --- d0/d04/qr__decompose_8h__incl.svg | 2 +- d0/d04/qr__decompose_8h__incl_org.svg | 2 +- .../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/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/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 +- d1/d9a/hopcroft__karp_8cpp.html | 6 +- d1/d9a/hopcroft__karp_8cpp_source.html | 6 +- .../decimal__to__hexadecimal_8cpp__incl.svg | 2 +- ...ecimal__to__hexadecimal_8cpp__incl_org.svg | 2 +- ...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 +- ...__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/dc7/linear__probing__hash__table_8cpp.html | 3 +- ...ear__probing__hash__table_8cpp_source.html | 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 +- ..._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/d53/mo_8cpp_source.html | 3 +- 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/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 +- ...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/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 +- .../selection__sort__recursive_8cpp__incl.svg | 2 +- ...ection__sort__recursive_8cpp__incl_org.svg | 2 +- ...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 +- d6/d26/classciphers_1_1_hill_cipher.html | 101 ++++--- ...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/d80/double__hash__hash__table_8cpp.html | 3 +- ...double__hash__hash__table_8cpp_source.html | 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/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/d35/matrix__exponentiation_8cpp.html | 2 +- .../matrix__exponentiation_8cpp_source.html | 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 +- ...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 +- d7/db9/hill__cipher_8cpp.html | 144 ++++----- d7/db9/hill__cipher_8cpp_source.html | 273 +++++++++--------- .../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 +- ...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/d72/class_r_btree.html | 2 +- d8/d77/namespacemachine__learning.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 +- ...ru__cache_1_1_l_r_u_cache__coll__graph.svg | 2 +- ...cache_1_1_l_r_u_cache__coll__graph_org.svg | 2 +- ...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 +- 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_source.html | 2 +- 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/dad/rb__tree_8cpp_source.html | 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/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 +- ...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 +- .../quadratic__probing__hash__table_8cpp.html | 3 +- ...tic__probing__hash__table_8cpp_source.html | 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/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 | 27 +- ...ximum__circular__subarray_8cpp_source.html | 31 +- ...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 +- ...inary__least__squares__regressor_8cpp.html | 202 +++++++------ ...least__squares__regressor_8cpp_source.html | 206 +++++++------ 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/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/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 +- .../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/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/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 +- df/dc8/successive__approximation_8cpp.html | 2 +- ...successive__approximation_8cpp_source.html | 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 +- 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 +- 986 files changed, 1471 insertions(+), 1483 deletions(-) diff --git a/d0/d04/qr__decompose_8h__incl.svg b/d0/d04/qr__decompose_8h__incl.svg index cb76acd49..9aca201ce 100644 --- a/d0/d04/qr__decompose_8h__incl.svg +++ b/d0/d04/qr__decompose_8h__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Definition at line 255 of file hopcroft_karp.cpp.

255 {
256 // Sample test case 1
-
257 int v1a = 3, v1b = 5, e1 = 2; // vertices of left side, right side and edges
+
257 int v1a = 3, v1b = 5; // vertices of left side, right side and edges
258 HKGraph g1(v1a, v1b); // execute the algorithm
259
260 g1.addEdge(0,1);
@@ -252,7 +252,7 @@ Algorithm
266 assert(res1 == expected_res1); // assert check to ensure that the algorithm executed correctly for test 1
267
268 // Sample test case 2
-
269 int v2a = 4, v2b = 4, e2 = 6; // vertices of left side, right side and edges
+
269 int v2a = 4, v2b = 4; // vertices of left side, right side and edges
270 HKGraph g2(v2a, v2b); // execute the algorithm
271
272 g2.addEdge(1,1);
@@ -268,7 +268,7 @@ Algorithm
282 assert(res2 == expected_res2); // assert check to ensure that the algorithm executed correctly for test 2
283
284 // Sample test case 3
-
285 int v3a = 6, v3b = 6, e3 = 4; // vertices of left side, right side and edges
+
285 int v3a = 6, v3b = 6; // vertices of left side, right side and edges
286 HKGraph g3(v3a, v3b); // execute the algorithm
287
288 g3.addEdge(0,1);
diff --git a/d1/d9a/hopcroft__karp_8cpp_source.html b/d1/d9a/hopcroft__karp_8cpp_source.html index 2442f7dbf..a2a2161e0 100644 --- a/d1/d9a/hopcroft__karp_8cpp_source.html +++ b/d1/d9a/hopcroft__karp_8cpp_source.html @@ -301,7 +301,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
255void tests(){
256 // Sample test case 1
-
257 int v1a = 3, v1b = 5, e1 = 2; // vertices of left side, right side and edges
+
257 int v1a = 3, v1b = 5; // vertices of left side, right side and edges
258 HKGraph g1(v1a, v1b); // execute the algorithm
259
260 g1.addEdge(0,1);
@@ -313,7 +313,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
266 assert(res1 == expected_res1); // assert check to ensure that the algorithm executed correctly for test 1
267
268 // Sample test case 2
-
269 int v2a = 4, v2b = 4, e2 = 6; // vertices of left side, right side and edges
+
269 int v2a = 4, v2b = 4; // vertices of left side, right side and edges
270 HKGraph g2(v2a, v2b); // execute the algorithm
271
272 g2.addEdge(1,1);
@@ -329,7 +329,7 @@ $(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../','');
282 assert(res2 == expected_res2); // assert check to ensure that the algorithm executed correctly for test 2
283
284 // Sample test case 3
-
285 int v3a = 6, v3b = 6, e3 = 4; // vertices of left side, right side and edges
+
285 int v3a = 6, v3b = 6; // vertices of left side, right side and edges
286 HKGraph g3(v3a, v3b); // execute the algorithm
287
288 g3.addEdge(0,1);
diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg index 6e8be548b..df06bbb6b 100644 --- a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.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 a15d67906..e9675a74e 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 @@ - - - - - - - - -

Definition at line 224 of file linear_probing_hash_table.cpp.

224 {
-
225 int cmd = 0, hash = 0, key = 0;
+
225 int cmd = 0, key = 0;
226 std::cout << "Enter the initial size of Hash Table. = ";
227 std::cin >> totalSize;
228 table = std::vector<Entry>(totalSize);
@@ -248,7 +248,6 @@ Variables
275 }
276 return 0;
277}
-
hashing::md5::hash
void * hash(const std::string &message)
Converts the string to bytestring and calls the main algorithm.
Definition md5.cpp:288
linear_probing::addInfo
void addInfo(int key)
Definition linear_probing_hash_table.cpp:186
linear_probing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition linear_probing_hash_table.cpp:46
linear_probing::linearProbe
int linearProbe(int key, bool searching)
Definition linear_probing_hash_table.cpp:55
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_source.html b/d1/dc7/linear__probing__hash__table_8cpp_source.html index ef0c0c935..295590ad4 100644 --- a/d1/dc7/linear__probing__hash__table_8cpp_source.html +++ b/d1/dc7/linear__probing__hash__table_8cpp_source.html @@ -304,7 +304,7 @@ $(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp_source.html',
220
224int main() {
-
225 int cmd = 0, hash = 0, key = 0;
+
225 int cmd = 0, key = 0;
226 std::cout << "Enter the initial size of Hash Table. = ";
227 std::cin >> totalSize;
228 table = std::vector<Entry>(totalSize);
diff --git a/d1/dce/classuint256__t__coll__graph.svg b/d1/dce/classuint256__t__coll__graph.svg index 8beb1b004..3b830d9f9 100644 --- a/d1/dce/classuint256__t__coll__graph.svg +++ b/d1/dce/classuint256__t__coll__graph.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 ce607d219..1da1b5f27 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 @@ - - - - - - - - - - - - diff --git a/d2/d23/neural__network_8cpp__incl_org.svg b/d2/d23/neural__network_8cpp__incl_org.svg index ad75026af..354268623 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 4941ae7d9..f2886ef36 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 ceda8b70e..9af611d7e 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 1cd0d45ca..9880b2f94 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 b6620d4fb..5114c73d1 100644 --- a/d3/d4c/sha1_8cpp__incl_org.svg +++ b/d3/d4c/sha1_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - 29}
30
31int main() {
-
32 int n, t, i, j, k = 0;
+
32 int n, t, i;
33 scanf("%d", &n);
34 for (i = 0; i < n; i++) scanf("%d", &a[i]);
35 bucket_size = ceil(sqrt(n));
@@ -185,7 +185,6 @@ $(function(){initNavTree('d3/d53/mo_8cpp_source.html','../../',''); });
65 for (i = 0; i < t; i++) printf("%d\n", bucket[i]);
66 return 0;
67}
-
numerical_methods::simpson_method::k
double k(double x)
Another test function.
Definition composite_simpson_rule.cpp:117
main
int main()
Main function.
Definition generate_parentheses.cpp:110
query
Definition mo.cpp:9
add
std::string add(const std::string &first, const std::string &second)
Adding two string.
Definition uint128_t.hpp:38
diff --git a/d3/d56/binomial__dist_8cpp__incl.svg b/d3/d56/binomial__dist_8cpp__incl.svg index 81cb08fbf..164c45cc9 100644 --- a/d3/d56/binomial__dist_8cpp__incl.svg +++ b/d3/d56/binomial__dist_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 2a91de311..76a800cca 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 c24a21aee..4e21e42d6 100644 --- a/d4/d2f/fcfs__scheduling_8cpp__incl_org.svg +++ b/d4/d2f/fcfs__scheduling_8cpp__incl_org.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 9ab29ecde..cc7354d93 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 a603e1b7b..94be28ec4 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 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg index b18f59301..3a1c2193f 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 @@ - - - - - - - - - - - - - - -
Returns
decrypted text
-

Definition at line 458 of file hill_cipher.cpp.

-
459 {
-
460 return codec(text, decrypt_key);
-
461 }
+

Definition at line 457 of file hill_cipher.cpp.

+
458 {
+
459 return codec(text, decrypt_key);
+
460 }
ciphers::HillCipher::codec
static const std::string codec(const std::string &text, const matrix< int > &key)
Convenience function to perform block cipher operations. The operations are identical for both encryp...
Definition hill_cipher.cpp:211
@@ -319,10 +319,10 @@ Static Private Member Functions
Returns
encrypted text
-

Definition at line 446 of file hill_cipher.cpp.

-
447 {
-
448 return codec(text, encrypt_key);
-
449 }
+

Definition at line 445 of file hill_cipher.cpp.

+
446 {
+
447 return codec(text, encrypt_key);
+
448 }
@@ -424,37 +424,36 @@ template<typename T>
379 int mat_determinant = det_encrypt < 0 ? det_encrypt % L : det_encrypt;
380
381 matrix<double> tmp_inverse = get_inverse(encrypt_key);
-
382 double d2 = determinant_lu(decrypt_key);
-
383
-
384 // find co-prime factor for inversion
-
385 int det_inv = -1;
-
386 for (int i = 0; i < L; i++) {
-
387 if (modulo(mat_determinant * i, L) == 1) {
-
388 det_inv = i;
-
389 break;
-
390 }
-
391 }
-
392
-
393 if (det_inv == -1) {
-
394 std::cerr << "Could not find a co-prime for inversion\n";
-
395 std::exit(EXIT_FAILURE);
-
396 }
-
397
-
398 mat_determinant = det_inv * det_encrypt;
-
399
-
400 // perform modular inverse of encryption matrix
-
401 int i;
-
402#ifdef _OPENMP
-
403#pragma parallel omp for private(i)
-
404#endif
-
405 for (i = 0; i < size; i++) {
-
406 for (int j = 0; j < size; j++) {
-
407 int temp = std::round(tmp_inverse[i][j] * mat_determinant);
-
408 decrypt_key[i][j] = modulo(temp, L);
-
409 }
-
410 }
-
411 return decrypt_key;
-
412 }
+
382
+
383 // find co-prime factor for inversion
+
384 int det_inv = -1;
+
385 for (int i = 0; i < L; i++) {
+
386 if (modulo(mat_determinant * i, L) == 1) {
+
387 det_inv = i;
+
388 break;
+
389 }
+
390 }
+
391
+
392 if (det_inv == -1) {
+
393 std::cerr << "Could not find a co-prime for inversion\n";
+
394 std::exit(EXIT_FAILURE);
+
395 }
+
396
+
397 mat_determinant = det_inv * det_encrypt;
+
398
+
399 // perform modular inverse of encryption matrix
+
400 int i;
+
401#ifdef _OPENMP
+
402#pragma parallel omp for private(i)
+
403#endif
+
404 for (i = 0; i < size; i++) {
+
405 for (int j = 0; j < size; j++) {
+
406 int temp = std::round(tmp_inverse[i][j] * mat_determinant);
+
407 decrypt_key[i][j] = modulo(temp, L);
+
408 }
+
409 }
+
410 return decrypt_key;
+
411 }
ciphers::HillCipher::get_inverse
static matrix< double > get_inverse(matrix< T > const &A)
Definition hill_cipher.cpp:251
determinant_lu
double determinant_lu(const matrix< T > &A)
Definition lu_decomposition.h:90
matrix
std::vector< std::valarray< T > > matrix
Definition lu_decomposition.h:19
@@ -582,18 +581,18 @@ template<typename T>
Returns
std::pair<matrix<int>, matrix<int>> encryption and decryption keys as a pair
See also
generate_encryption_key
-

Definition at line 425 of file hill_cipher.cpp.

-
427 {
-
428 matrix<int> encrypt_key = generate_encryption_key(size);
-
429 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
-
430 double det2 = determinant_lu(decrypt_key);
-
431 while (std::abs(det2) < 0.1 || std::abs(det2) > 1e3) {
-
432 encrypt_key = generate_encryption_key(size, limit1, limit2);
-
433 decrypt_key = generate_decryption_key(encrypt_key);
-
434 det2 = determinant_lu(decrypt_key);
-
435 }
-
436 return std::make_pair(encrypt_key, decrypt_key);
-
437 }
+

Definition at line 424 of file hill_cipher.cpp.

+
426 {
+
427 matrix<int> encrypt_key = generate_encryption_key(size);
+
428 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
+
429 double det2 = determinant_lu(decrypt_key);
+
430 while (std::abs(det2) < 0.1 || std::abs(det2) > 1e3) {
+
431 encrypt_key = generate_encryption_key(size, limit1, limit2);
+
432 decrypt_key = generate_decryption_key(encrypt_key);
+
433 det2 = determinant_lu(decrypt_key);
+
434 }
+
435 return std::make_pair(encrypt_key, decrypt_key);
+
436 }
ciphers::HillCipher::generate_encryption_key
static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
Definition hill_cipher.cpp:340
ciphers::HillCipher::generate_decryption_key
static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
Generate decryption matrix from an encryption matrix key.
Definition hill_cipher.cpp:372
diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg index 2b6cfbc43..78358f2b1 100644 --- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg +++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.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 83a53984e..7427f90ea 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 @@ - - - - - - - - -

Definition at line 250 of file double_hash_hash_table.cpp.

250 {
-
251 int cmd = 0, hash = 0, key = 0;
+
251 int cmd = 0, key = 0;
252 std::cout << "Enter the initial size of Hash Table. = ";
253 std::cin >> totalSize;
254 table = std::vector<Entry>(totalSize);
@@ -253,7 +253,6 @@ Variables
301 }
302 return 0;
303}
-
hashing::md5::hash
void * hash(const std::string &message)
Converts the string to bytestring and calls the main algorithm.
Definition md5.cpp:288
double_hashing::hashFxn
size_t hashFxn(int key)
Hash a key. Uses the STL library's std::hash() function.
Definition double_hash_hash_table.cpp:47
double_hashing::display
void display()
Definition double_hash_hash_table.cpp:143
double_hashing::removalInfo
void removalInfo(int key)
Definition double_hash_hash_table.cpp:227
diff --git a/d6/d80/double__hash__hash__table_8cpp_source.html b/d6/d80/double__hash__hash__table_8cpp_source.html index fd50dad1a..e2efbe73d 100644 --- a/d6/d80/double__hash__hash__table_8cpp_source.html +++ b/d6/d80/double__hash__hash__table_8cpp_source.html @@ -320,7 +320,7 @@ $(function(){initNavTree('d6/d80/double__hash__hash__table_8cpp_source.html','..
246
250int main() {
-
251 int cmd = 0, hash = 0, key = 0;
+
251 int cmd = 0, key = 0;
252 std::cout << "Enter the initial size of Hash Table. = ";
253 std::cin >> totalSize;
254 table = std::vector<Entry>(totalSize);
diff --git a/d6/d93/large__number_8h__dep__incl.svg b/d6/d93/large__number_8h__dep__incl.svg index 346e1e5a0..1bdd564e1 100644 --- a/d6/d93/large__number_8h__dep__incl.svg +++ b/d6/d93/large__number_8h__dep__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 128 cout.tie(0);
129 ll t;
130 cin >> t;
-
131 ll i, j, x;
+
131 ll i, x;
132 while (t--) {
133 cin >> mat_size;
134 for (i = 0; i < mat_size; i++) {
diff --git a/d7/d35/matrix__exponentiation_8cpp_source.html b/d7/d35/matrix__exponentiation_8cpp_source.html index 461ee99d4..2f67ff19e 100644 --- a/d7/d35/matrix__exponentiation_8cpp_source.html +++ b/d7/d35/matrix__exponentiation_8cpp_source.html @@ -206,7 +206,7 @@ $(function(){initNavTree('d7/d35/matrix__exponentiation_8cpp_source.html','../..
128 cout.tie(0);
129 ll t;
130 cin >> t;
-
131 ll i, j, x;
+
131 ll i, x;
132 while (t--) {
133 cin >> mat_size;
134 for (i = 0; i < mat_size; i++) {
diff --git a/d7/d39/lu__decomposition_8h__dep__incl.svg b/d7/d39/lu__decomposition_8h__dep__incl.svg index a9070e425..f048f4afe 100644 --- a/d7/d39/lu__decomposition_8h__dep__incl.svg +++ b/d7/d39/lu__decomposition_8h__dep__incl.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 53a8bf2cc..d8c7a87d6 100644 --- a/d7/da7/adaline__learning_8cpp__incl_org.svg +++ b/d7/da7/adaline__learning_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - -

Main function

-

Definition at line 533 of file hill_cipher.cpp.

-
533 {
-
534 std::srand(std::time(nullptr));
-
535 std::cout << "Key dictionary: (" << std::strlen(ciphers::STRKEY) << ")\n\t"
-
536 << ciphers::STRKEY << "\n";
-
537
-
538 std::string text = "This is a simple text with numb3r5 and exclamat!0n.";
-
539
-
540 test1(text);
-
541 test2(text);
-
542
-
543 return 0;
-
544}
+

Definition at line 532 of file hill_cipher.cpp.

+
532 {
+
533 std::srand(std::time(nullptr));
+
534 std::cout << "Key dictionary: (" << std::strlen(ciphers::STRKEY) << ")\n\t"
+
535 << ciphers::STRKEY << "\n";
+
536
+
537 std::string text = "This is a simple text with numb3r5 and exclamat!0n.";
+
538
+
539 test1(text);
+
540 test2(text);
+
541
+
542 return 0;
+
543}
test2
static void test2()
Self-implementations, 2nd test.
Definition dsu_path_compression.cpp:187
test1
static void test1()
Self-test implementations, 1st test.
Definition dsu_path_compression.cpp:170
ciphers::STRKEY
static const char * STRKEY
Definition hill_cipher.cpp:74
@@ -281,39 +281,39 @@ template<typename T>
-

Definition at line 471 of file hill_cipher.cpp.

-
471 {
-
472 // std::string text = "Hello world!";
-
473 std::cout << "======Test 1 (3x3 key) ======\nOriginal text:\n\t" << text
-
474 << std::endl;
-
475
-
476 std::pair<matrix<int>, matrix<int>> p =
-
477 ciphers::HillCipher::generate_keys(3, 0, 100);
-
478 matrix<int> ekey = p.first;
-
479 matrix<int> dkey = p.second;
-
480
-
481 // matrix<int> ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};
-
482 // std::cout << "Encryption key: \n" << ekey;
-
483 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
-
484 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
-
485
-
486 // matrix<int> dkey = ciphers::HillCipher::generate_decryption_key(ekey);
-
487 // std::cout << "Decryption key: \n" << dkey;
-
488 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
-
489 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
-
490
-
491 std::ofstream out_file("hill_cipher_test1.txt");
-
492 out_file << "Block size: " << ekey.size() << "\n";
-
493 out_file << "Encryption Key:\n" << ekey;
-
494 out_file << "\nDecryption Key:\n" << dkey;
-
495 out_file.close();
-
496
-
497 assert(txt_back == text);
-
498 std::cout << "Passed :)\n";
-
499}
-
ciphers::HillCipher::generate_keys
static std::pair< matrix< int >, matrix< int > > generate_keys(size_t size, int limit1=0, int limit2=10)
Generate encryption and decryption key pair.
Definition hill_cipher.cpp:425
-
ciphers::HillCipher::decrypt_text
static const std::string decrypt_text(const std::string &text, const matrix< int > &decrypt_key)
Decrypt a given text using a given key.
Definition hill_cipher.cpp:458
-
ciphers::HillCipher::encrypt_text
static const std::string encrypt_text(const std::string &text, const matrix< int > &encrypt_key)
Encrypt a given text using a given key.
Definition hill_cipher.cpp:446
+

Definition at line 470 of file hill_cipher.cpp.

+
470 {
+
471 // std::string text = "Hello world!";
+
472 std::cout << "======Test 1 (3x3 key) ======\nOriginal text:\n\t" << text
+
473 << std::endl;
+
474
+
475 std::pair<matrix<int>, matrix<int>> p =
+
476 ciphers::HillCipher::generate_keys(3, 0, 100);
+
477 matrix<int> ekey = p.first;
+
478 matrix<int> dkey = p.second;
+
479
+
480 // matrix<int> ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};
+
481 // std::cout << "Encryption key: \n" << ekey;
+
482 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
+
483 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
+
484
+
485 // matrix<int> dkey = ciphers::HillCipher::generate_decryption_key(ekey);
+
486 // std::cout << "Decryption key: \n" << dkey;
+
487 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
+
488 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
+
489
+
490 std::ofstream out_file("hill_cipher_test1.txt");
+
491 out_file << "Block size: " << ekey.size() << "\n";
+
492 out_file << "Encryption Key:\n" << ekey;
+
493 out_file << "\nDecryption Key:\n" << dkey;
+
494 out_file.close();
+
495
+
496 assert(txt_back == text);
+
497 std::cout << "Passed :)\n";
+
498}
+
ciphers::HillCipher::generate_keys
static std::pair< matrix< int >, matrix< int > > generate_keys(size_t size, int limit1=0, int limit2=10)
Generate encryption and decryption key pair.
Definition hill_cipher.cpp:424
+
ciphers::HillCipher::decrypt_text
static const std::string decrypt_text(const std::string &text, const matrix< int > &decrypt_key)
Decrypt a given text using a given key.
Definition hill_cipher.cpp:457
+
ciphers::HillCipher::encrypt_text
static const std::string encrypt_text(const std::string &text, const matrix< int > &encrypt_key)
Encrypt a given text using a given key.
Definition hill_cipher.cpp:445
matrix
std::vector< std::valarray< T > > matrix
Definition lu_decomposition.h:19
@@ -341,32 +341,32 @@ template<typename T>
-

Definition at line 506 of file hill_cipher.cpp.

-
506 {
-
507 // std::string text = "Hello world!";
-
508 std::cout << "======Test 2 (8x8 key) ======\nOriginal text:\n\t" << text
-
509 << std::endl;
-
510
-
511 std::pair<matrix<int>, matrix<int>> p =
-
512 ciphers::HillCipher::generate_keys(8, 0, 3);
-
513 matrix<int> ekey = p.first;
-
514 matrix<int> dkey = p.second;
-
515
-
516 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
-
517 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
-
518
-
519 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
-
520 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
-
521
-
522 std::ofstream out_file("hill_cipher_test2.txt");
-
523 out_file << "Block size: " << ekey.size() << "\n";
-
524 out_file << "Encryption Key:\n" << ekey;
-
525 out_file << "\nDecryption Key:\n" << dkey;
-
526 out_file.close();
-
527
-
528 assert(txt_back.compare(0, text.size(), text) == 0);
-
529 std::cout << "Passed :)\n";
-
530}
+

Definition at line 505 of file hill_cipher.cpp.

+
505 {
+
506 // std::string text = "Hello world!";
+
507 std::cout << "======Test 2 (8x8 key) ======\nOriginal text:\n\t" << text
+
508 << std::endl;
+
509
+
510 std::pair<matrix<int>, matrix<int>> p =
+
511 ciphers::HillCipher::generate_keys(8, 0, 3);
+
512 matrix<int> ekey = p.first;
+
513 matrix<int> dkey = p.second;
+
514
+
515 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
+
516 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
+
517
+
518 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
+
519 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
+
520
+
521 std::ofstream out_file("hill_cipher_test2.txt");
+
522 out_file << "Block size: " << ekey.size() << "\n";
+
523 out_file << "Encryption Key:\n" << ekey;
+
524 out_file << "\nDecryption Key:\n" << dkey;
+
525 out_file.close();
+
526
+
527 assert(txt_back.compare(0, text.size(), text) == 0);
+
528 std::cout << "Passed :)\n";
+
529}
diff --git a/d7/db9/hill__cipher_8cpp_source.html b/d7/db9/hill__cipher_8cpp_source.html index 12e447267..27e200601 100644 --- a/d7/db9/hill__cipher_8cpp_source.html +++ b/d7/db9/hill__cipher_8cpp_source.html @@ -383,157 +383,156 @@ $(function(){initNavTree('d7/db9/hill__cipher_8cpp_source.html','../../',''); })
379 int mat_determinant = det_encrypt < 0 ? det_encrypt % L : det_encrypt;
380
381 matrix<double> tmp_inverse = get_inverse(encrypt_key);
-
382 double d2 = determinant_lu(decrypt_key);
-
383
-
384 // find co-prime factor for inversion
-
385 int det_inv = -1;
-
386 for (int i = 0; i < L; i++) {
-
387 if (modulo(mat_determinant * i, L) == 1) {
-
388 det_inv = i;
-
389 break;
-
390 }
-
391 }
-
392
-
393 if (det_inv == -1) {
-
394 std::cerr << "Could not find a co-prime for inversion\n";
-
395 std::exit(EXIT_FAILURE);
-
396 }
-
397
-
398 mat_determinant = det_inv * det_encrypt;
-
399
-
400 // perform modular inverse of encryption matrix
-
401 int i;
-
402#ifdef _OPENMP
-
403#pragma parallel omp for private(i)
-
404#endif
-
405 for (i = 0; i < size; i++) {
-
406 for (int j = 0; j < size; j++) {
-
407 int temp = std::round(tmp_inverse[i][j] * mat_determinant);
-
408 decrypt_key[i][j] = modulo(temp, L);
-
409 }
-
410 }
-
411 return decrypt_key;
-
412 }
+
382
+
383 // find co-prime factor for inversion
+
384 int det_inv = -1;
+
385 for (int i = 0; i < L; i++) {
+
386 if (modulo(mat_determinant * i, L) == 1) {
+
387 det_inv = i;
+
388 break;
+
389 }
+
390 }
+
391
+
392 if (det_inv == -1) {
+
393 std::cerr << "Could not find a co-prime for inversion\n";
+
394 std::exit(EXIT_FAILURE);
+
395 }
+
396
+
397 mat_determinant = det_inv * det_encrypt;
+
398
+
399 // perform modular inverse of encryption matrix
+
400 int i;
+
401#ifdef _OPENMP
+
402#pragma parallel omp for private(i)
+
403#endif
+
404 for (i = 0; i < size; i++) {
+
405 for (int j = 0; j < size; j++) {
+
406 int temp = std::round(tmp_inverse[i][j] * mat_determinant);
+
407 decrypt_key[i][j] = modulo(temp, L);
+
408 }
+
409 }
+
410 return decrypt_key;
+
411 }
-
413
-
-
425 static std::pair<matrix<int>, matrix<int>> generate_keys(size_t size,
-
426 int limit1 = 0,
-
427 int limit2 = 10) {
-
428 matrix<int> encrypt_key = generate_encryption_key(size);
-
429 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
-
430 double det2 = determinant_lu(decrypt_key);
-
431 while (std::abs(det2) < 0.1 || std::abs(det2) > 1e3) {
-
432 encrypt_key = generate_encryption_key(size, limit1, limit2);
-
433 decrypt_key = generate_decryption_key(encrypt_key);
-
434 det2 = determinant_lu(decrypt_key);
-
435 }
-
436 return std::make_pair(encrypt_key, decrypt_key);
-
437 }
+
412
+
+
424 static std::pair<matrix<int>, matrix<int>> generate_keys(size_t size,
+
425 int limit1 = 0,
+
426 int limit2 = 10) {
+
427 matrix<int> encrypt_key = generate_encryption_key(size);
+
428 matrix<int> decrypt_key = generate_decryption_key(encrypt_key);
+
429 double det2 = determinant_lu(decrypt_key);
+
430 while (std::abs(det2) < 0.1 || std::abs(det2) > 1e3) {
+
431 encrypt_key = generate_encryption_key(size, limit1, limit2);
+
432 decrypt_key = generate_decryption_key(encrypt_key);
+
433 det2 = determinant_lu(decrypt_key);
+
434 }
+
435 return std::make_pair(encrypt_key, decrypt_key);
+
436 }
-
438
-
-
446 static const std::string encrypt_text(const std::string &text,
-
447 const matrix<int> &encrypt_key) {
-
448 return codec(text, encrypt_key);
-
449 }
+
437
+
+
445 static const std::string encrypt_text(const std::string &text,
+
446 const matrix<int> &encrypt_key) {
+
447 return codec(text, encrypt_key);
+
448 }
-
450
-
-
458 static const std::string decrypt_text(const std::string &text,
-
459 const matrix<int> &decrypt_key) {
-
460 return codec(text, decrypt_key);
-
461 }
+
449
+
+
457 static const std::string decrypt_text(const std::string &text,
+
458 const matrix<int> &decrypt_key) {
+
459 return codec(text, decrypt_key);
+
460 }
-
462};
+
461};
-
463
-
464} // namespace ciphers
-
465
-
-
471void test1(const std::string &text) {
-
472 // std::string text = "Hello world!";
-
473 std::cout << "======Test 1 (3x3 key) ======\nOriginal text:\n\t" << text
-
474 << std::endl;
-
475
-
476 std::pair<matrix<int>, matrix<int>> p =
-
477 ciphers::HillCipher::generate_keys(3, 0, 100);
-
478 matrix<int> ekey = p.first;
-
479 matrix<int> dkey = p.second;
-
480
-
481 // matrix<int> ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};
-
482 // std::cout << "Encryption key: \n" << ekey;
-
483 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
-
484 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
-
485
-
486 // matrix<int> dkey = ciphers::HillCipher::generate_decryption_key(ekey);
-
487 // std::cout << "Decryption key: \n" << dkey;
-
488 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
-
489 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
-
490
-
491 std::ofstream out_file("hill_cipher_test1.txt");
-
492 out_file << "Block size: " << ekey.size() << "\n";
-
493 out_file << "Encryption Key:\n" << ekey;
-
494 out_file << "\nDecryption Key:\n" << dkey;
-
495 out_file.close();
-
496
-
497 assert(txt_back == text);
-
498 std::cout << "Passed :)\n";
-
499}
+
462
+
463} // namespace ciphers
+
464
+
+
470void test1(const std::string &text) {
+
471 // std::string text = "Hello world!";
+
472 std::cout << "======Test 1 (3x3 key) ======\nOriginal text:\n\t" << text
+
473 << std::endl;
+
474
+
475 std::pair<matrix<int>, matrix<int>> p =
+
476 ciphers::HillCipher::generate_keys(3, 0, 100);
+
477 matrix<int> ekey = p.first;
+
478 matrix<int> dkey = p.second;
+
479
+
480 // matrix<int> ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};
+
481 // std::cout << "Encryption key: \n" << ekey;
+
482 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
+
483 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
+
484
+
485 // matrix<int> dkey = ciphers::HillCipher::generate_decryption_key(ekey);
+
486 // std::cout << "Decryption key: \n" << dkey;
+
487 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
+
488 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
+
489
+
490 std::ofstream out_file("hill_cipher_test1.txt");
+
491 out_file << "Block size: " << ekey.size() << "\n";
+
492 out_file << "Encryption Key:\n" << ekey;
+
493 out_file << "\nDecryption Key:\n" << dkey;
+
494 out_file.close();
+
495
+
496 assert(txt_back == text);
+
497 std::cout << "Passed :)\n";
+
498}
-
500
-
-
506void test2(const std::string &text) {
-
507 // std::string text = "Hello world!";
-
508 std::cout << "======Test 2 (8x8 key) ======\nOriginal text:\n\t" << text
-
509 << std::endl;
-
510
-
511 std::pair<matrix<int>, matrix<int>> p =
-
512 ciphers::HillCipher::generate_keys(8, 0, 3);
-
513 matrix<int> ekey = p.first;
-
514 matrix<int> dkey = p.second;
-
515
-
516 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
-
517 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
-
518
-
519 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
-
520 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
-
521
-
522 std::ofstream out_file("hill_cipher_test2.txt");
-
523 out_file << "Block size: " << ekey.size() << "\n";
-
524 out_file << "Encryption Key:\n" << ekey;
-
525 out_file << "\nDecryption Key:\n" << dkey;
-
526 out_file.close();
-
527
-
528 assert(txt_back.compare(0, text.size(), text) == 0);
-
529 std::cout << "Passed :)\n";
-
530}
+
499
+
+
505void test2(const std::string &text) {
+
506 // std::string text = "Hello world!";
+
507 std::cout << "======Test 2 (8x8 key) ======\nOriginal text:\n\t" << text
+
508 << std::endl;
+
509
+
510 std::pair<matrix<int>, matrix<int>> p =
+
511 ciphers::HillCipher::generate_keys(8, 0, 3);
+
512 matrix<int> ekey = p.first;
+
513 matrix<int> dkey = p.second;
+
514
+
515 std::string gibberish = ciphers::HillCipher::encrypt_text(text, ekey);
+
516 std::cout << "Encrypted text:\n\t" << gibberish << std::endl;
+
517
+
518 std::string txt_back = ciphers::HillCipher::decrypt_text(gibberish, dkey);
+
519 std::cout << "Reconstruct text:\n\t" << txt_back << std::endl;
+
520
+
521 std::ofstream out_file("hill_cipher_test2.txt");
+
522 out_file << "Block size: " << ekey.size() << "\n";
+
523 out_file << "Encryption Key:\n" << ekey;
+
524 out_file << "\nDecryption Key:\n" << dkey;
+
525 out_file.close();
+
526
+
527 assert(txt_back.compare(0, text.size(), text) == 0);
+
528 std::cout << "Passed :)\n";
+
529}
-
531
-
-
533int main() {
-
534 std::srand(std::time(nullptr));
-
535 std::cout << "Key dictionary: (" << std::strlen(ciphers::STRKEY) << ")\n\t"
-
536 << ciphers::STRKEY << "\n";
-
537
-
538 std::string text = "This is a simple text with numb3r5 and exclamat!0n.";
-
539
-
540 test1(text);
-
541 test2(text);
-
542
-
543 return 0;
-
544}
+
530
+
+
532int main() {
+
533 std::srand(std::time(nullptr));
+
534 std::cout << "Key dictionary: (" << std::strlen(ciphers::STRKEY) << ")\n\t"
+
535 << ciphers::STRKEY << "\n";
+
536
+
537 std::string text = "This is a simple text with numb3r5 and exclamat!0n.";
+
538
+
539 test1(text);
+
540 test2(text);
+
541
+
542 return 0;
+
543}
ciphers::HillCipher
Implementation of Hill Cipher algorithm.
Definition hill_cipher.cpp:82
ciphers::HillCipher::get_idx_char
static char get_idx_char(const uint8_t idx)
Get the character at a given index in the STRKEY.
Definition hill_cipher.cpp:183
ciphers::HillCipher::get_inverse
static matrix< double > get_inverse(matrix< T > const &A)
Definition hill_cipher.cpp:251
-
ciphers::HillCipher::generate_keys
static std::pair< matrix< int >, matrix< int > > generate_keys(size_t size, int limit1=0, int limit2=10)
Generate encryption and decryption key pair.
Definition hill_cipher.cpp:425
-
ciphers::HillCipher::decrypt_text
static const std::string decrypt_text(const std::string &text, const matrix< int > &decrypt_key)
Decrypt a given text using a given key.
Definition hill_cipher.cpp:458
+
ciphers::HillCipher::generate_keys
static std::pair< matrix< int >, matrix< int > > generate_keys(size_t size, int limit1=0, int limit2=10)
Generate encryption and decryption key pair.
Definition hill_cipher.cpp:424
+
ciphers::HillCipher::decrypt_text
static const std::string decrypt_text(const std::string &text, const matrix< int > &decrypt_key)
Decrypt a given text using a given key.
Definition hill_cipher.cpp:457
ciphers::HillCipher::rand_range
static const T2 rand_range(T1 a, T1 b)
Function to generate a random integer in a given interval.
Definition hill_cipher.cpp:93
ciphers::HillCipher::generate_encryption_key
static matrix< int > generate_encryption_key(size_t size, int limit1=0, int limit2=10)
Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...
Definition hill_cipher.cpp:340
ciphers::HillCipher::rand_range
static double rand_range(matrix< T2 > *M, T1 a, T1 b)
Function overload to fill a matrix with random integers in a given interval.
Definition hill_cipher.cpp:119
ciphers::HillCipher::gcd
static const T gcd(T a, T b)
Compute GCD of two integers using Euler's algorithm.
Definition hill_cipher.cpp:139
-
ciphers::HillCipher::encrypt_text
static const std::string encrypt_text(const std::string &text, const matrix< int > &encrypt_key)
Encrypt a given text using a given key.
Definition hill_cipher.cpp:446
+
ciphers::HillCipher::encrypt_text
static const std::string encrypt_text(const std::string &text, const matrix< int > &encrypt_key)
Encrypt a given text using a given key.
Definition hill_cipher.cpp:445
ciphers::HillCipher::generate_decryption_key
static matrix< int > generate_decryption_key(matrix< int > const &encrypt_key)
Generate decryption matrix from an encryption matrix key.
Definition hill_cipher.cpp:372
ciphers::HillCipher::mat_mul
static const std::valarray< uint8_t > mat_mul(const std::valarray< uint8_t > &vector, const matrix< int > &key)
helper function to perform vector multiplication with encryption or decryption matrix
Definition hill_cipher.cpp:160
ciphers::HillCipher::codec
static const std::string codec(const std::string &text, const matrix< int > &key)
Convenience function to perform block cipher operations. The operations are identical for both encryp...
Definition hill_cipher.cpp:211
@@ -542,7 +541,7 @@ $(function(){initNavTree('d7/db9/hill__cipher_8cpp_source.html','../../',''); })
test2
static void test2()
Self-implementations, 2nd test.
Definition dsu_path_compression.cpp:187
test1
static void test1()
Self-test implementations, 1st test.
Definition dsu_path_compression.cpp:170
operator<<
static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)
Definition hill_cipher.cpp:55
-
main
int main()
Definition hill_cipher.cpp:533
+
main
int main()
Definition hill_cipher.cpp:532
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
matrix
std::vector< std::valarray< T > > matrix
Definition lu_decomposition.h:19
diff --git a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg index d8f2af75a..dc8bbcd67 100644 --- a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg +++ b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - -

Definition at line 34 of file rb_tree.cpp.

35{
-
36 int z, i = 0;
+
36 int z;
37 cout << "\nEnter key of the node to be inserted: ";
38 cin >> z;
39 node *p, *q;
diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html index fd5f37509..4d7e91798 100644 --- a/d8/d77/namespacemachine__learning.html +++ b/d8/d77/namespacemachine__learning.html @@ -1534,7 +1534,7 @@ template<typename T>

Definition at line 103 of file kohonen_som_trace.cpp.

105 {
-
106 int j = 0, k = 0;
+
106 int j = 0;
107 int num_out = W->size(); // number of SOM output nodes
108 // int num_features = x.size(); // number of data features
109
diff --git a/d8/d96/gram__schmidt_8cpp__incl.svg b/d8/d96/gram__schmidt_8cpp__incl.svg index dc7327a1d..7571f0583 100644 --- a/d8/d96/gram__schmidt_8cpp__incl.svg +++ b/d8/d96/gram__schmidt_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 f53dac040..217f54e29 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 @@ - - - - - - - - - - - - - - - - - - - - - - - 103void update_weights(const std::valarray<double> &x,
104 std::vector<std::valarray<double>> *W,
105 std::valarray<double> *D, double alpha, int R) {
-
106 int j = 0, k = 0;
+
106 int j = 0;
107 int num_out = W->size(); // number of SOM output nodes
108 // int num_features = x.size(); // number of data features
109
diff --git a/d9/d4e/gnome__sort_8cpp__incl.svg b/d9/d4e/gnome__sort_8cpp__incl.svg index f0308fecb..2152d0d45 100644 --- a/d9/d4e/gnome__sort_8cpp__incl.svg +++ b/d9/d4e/gnome__sort_8cpp__incl.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - -
34void RBtree::insert()
35{
-
36 int z, i = 0;
+
36 int z;
37 cout << "\nEnter key of the node to be inserted: ";
38 cin >> z;
39 node *p, *q;
diff --git a/d9/dae/struct_queue__coll__graph.svg b/d9/dae/struct_queue__coll__graph.svg index 7444928ff..9299fc5b9 100644 --- a/d9/dae/struct_queue__coll__graph.svg +++ b/d9/dae/struct_queue__coll__graph.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 91ddb3c70..0d98a5851 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 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Definition at line 246 of file quadratic_probing_hash_table.cpp.

246 {
-
247 int cmd = 0, hash = 0, key = 0;
+
247 int cmd = 0, key = 0;
248 std::cout << "Enter the initial size of Hash Table. = ";
249 std::cin >> totalSize;
250 table = std::vector<Entry>(totalSize);
@@ -251,7 +251,6 @@ Variables
299 }
300 return 0;
301}
-
hashing::md5::hash
void * hash(const std::string &message)
Converts the string to bytestring and calls the main algorithm.
Definition md5.cpp:288
quadratic_probing::hashFxn
size_t hashFxn(int key)
Definition quadratic_probing_hash_table.cpp:46
quadratic_probing::addInfo
void addInfo(int key)
Definition quadratic_probing_hash_table.cpp:207
quadratic_probing::display
void display()
Definition quadratic_probing_hash_table.cpp:142
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_source.html b/db/d71/quadratic__probing__hash__table_8cpp_source.html index aa02891a7..bc00a60dd 100644 --- a/db/d71/quadratic__probing__hash__table_8cpp_source.html +++ b/db/d71/quadratic__probing__hash__table_8cpp_source.html @@ -321,7 +321,7 @@ $(function(){initNavTree('db/d71/quadratic__probing__hash__table_8cpp_source.htm
242
246int main() {
-
247 int cmd = 0, hash = 0, key = 0;
+
247 int cmd = 0, key = 0;
248 std::cout << "Enter the initial size of Hash Table. = ";
249 std::cin >> totalSize;
250 table = std::vector<Entry>(totalSize);
diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg index 1d60ad28d..5cd5e64ec 100644 --- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg +++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Returns
0 on exit
-

Definition at line 87 of file maximum_circular_subarray.cpp.

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

Definition at line 86 of file maximum_circular_subarray.cpp.

+
86 {
+
87 test(); // run self-test implementations
+
88 return 0;
+
89}
test
static void test()
Self-test implementation.
Definition maximum_circular_subarray.cpp:64
@@ -221,15 +221,14 @@ Functions
67 // Output: 22
68 // Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.
69
-
70 int n = 7; // size of the array
-
71 std::vector<int> arr = {8, -8, 9, -9, 10, -11, 12};
-
72 assert(dynamic_programming::maxCircularSum(arr) == 22); // this ensures that the algorithm works as expected
-
73
-
74 arr = {8, -8, 10, -9, 10, -11, 12};
-
75 assert(dynamic_programming::maxCircularSum(arr) == 23);
-
76
-
77 std::cout << "All tests have successfully passed!\n";
-
78}
+
70 std::vector<int> arr = {8, -8, 9, -9, 10, -11, 12};
+
71 assert(dynamic_programming::maxCircularSum(arr) == 22); // this ensures that the algorithm works as expected
+
72
+
73 arr = {8, -8, 10, -9, 10, -11, 12};
+
74 assert(dynamic_programming::maxCircularSum(arr) == 23);
+
75
+
76 std::cout << "All tests have successfully passed!\n";
+
77}
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/db/dfb/maximum__circular__subarray_8cpp_source.html b/db/dfb/maximum__circular__subarray_8cpp_source.html index bc7d7d886..98a4a4a84 100644 --- a/db/dfb/maximum__circular__subarray_8cpp_source.html +++ b/db/dfb/maximum__circular__subarray_8cpp_source.html @@ -167,23 +167,22 @@ $(function(){initNavTree('db/dfb/maximum__circular__subarray_8cpp_source.html','
67 // Output: 22
68 // Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.
69
-
70 int n = 7; // size of the array
-
71 std::vector<int> arr = {8, -8, 9, -9, 10, -11, 12};
-
72 assert(dynamic_programming::maxCircularSum(arr) == 22); // this ensures that the algorithm works as expected
-
73
-
74 arr = {8, -8, 10, -9, 10, -11, 12};
-
75 assert(dynamic_programming::maxCircularSum(arr) == 23);
-
76
-
77 std::cout << "All tests have successfully passed!\n";
-
78}
+
70 std::vector<int> arr = {8, -8, 9, -9, 10, -11, 12};
+
71 assert(dynamic_programming::maxCircularSum(arr) == 22); // this ensures that the algorithm works as expected
+
72
+
73 arr = {8, -8, 10, -9, 10, -11, 12};
+
74 assert(dynamic_programming::maxCircularSum(arr) == 23);
+
75
+
76 std::cout << "All tests have successfully passed!\n";
+
77}
-
79
-
80
-
-
87int main(int argc, char *argv[]) {
-
88 test(); // run self-test implementations
-
89 return 0;
-
90}
+
78
+
79
+
+
86int main(int argc, char *argv[]) {
+
87 test(); // run self-test implementations
+
88 return 0;
+
89}
main
int main()
Main function.
Definition generate_parentheses.cpp:110
test
static void test()
Self-test implementation.
Definition maximum_circular_subarray.cpp:64
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 c0ee81246..df962a3bd 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 @@ - - - - - -

main function

-

Definition at line 423 of file ordinary_least_squares_regressor.cpp.

-
423 {
-
424 ols_test();
+

Definition at line 421 of file ordinary_least_squares_regressor.cpp.

+
421 {
+
422 ols_test();
+
423
+
424 size_t N = 0, F = 0;
425
-
426 size_t N = 0, F = 0;
-
427
-
428 std::cout << "Enter number of features: ";
-
429 // number of features = columns
-
430 std::cin >> F;
-
431 std::cout << "Enter number of samples: ";
-
432 // number of samples = rows
-
433 std::cin >> N;
-
434
-
435 std::vector<std::vector<float>> data(N);
-
436 std::vector<float> Y(N);
-
437
-
438 std::cout
-
439 << "Enter training data. Per sample, provide features and one output."
-
440 << std::endl;
-
441
-
442 for (size_t rows = 0; rows < N; rows++) {
-
443 std::vector<float> v(F);
-
444 std::cout << "Sample# " << rows + 1 << ": ";
-
445 for (size_t cols = 0; cols < F; cols++) {
-
446 // get the F features
-
447 std::cin >> v[cols];
-
448 }
-
449 data[rows] = v;
-
450 // get the corresponding output
-
451 std::cin >> Y[rows];
-
452 }
-
453
-
454 std::vector<float> beta = fit_OLS_regressor(data, Y);
-
455 std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
-
456
-
457 size_t T = 0;
-
458 std::cout << "Enter number of test samples: ";
-
459 // number of test sample inputs
-
460 std::cin >> T;
-
461 std::vector<std::vector<float>> data2(T);
-
462 // vector<float> Y2(T);
-
463
-
464 for (size_t rows = 0; rows < T; rows++) {
-
465 std::cout << "Sample# " << rows + 1 << ": ";
-
466 std::vector<float> v(F);
-
467 for (size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
-
468 data2[rows] = v;
-
469 }
-
470
-
471 std::vector<float> out = predict_OLS_regressor(data2, beta);
-
472 for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
-
473
-
474 return 0;
-
475}
+
426 std::cout << "Enter number of features: ";
+
427 // number of features = columns
+
428 std::cin >> F;
+
429 std::cout << "Enter number of samples: ";
+
430 // number of samples = rows
+
431 std::cin >> N;
+
432
+
433 std::vector<std::vector<float>> data(N);
+
434 std::vector<float> Y(N);
+
435
+
436 std::cout
+
437 << "Enter training data. Per sample, provide features and one output."
+
438 << std::endl;
+
439
+
440 for (size_t rows = 0; rows < N; rows++) {
+
441 std::vector<float> v(F);
+
442 std::cout << "Sample# " << rows + 1 << ": ";
+
443 for (size_t cols = 0; cols < F; cols++) {
+
444 // get the F features
+
445 std::cin >> v[cols];
+
446 }
+
447 data[rows] = v;
+
448 // get the corresponding output
+
449 std::cin >> Y[rows];
+
450 }
+
451
+
452 std::vector<float> beta = fit_OLS_regressor(data, Y);
+
453 std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
+
454
+
455 size_t T = 0;
+
456 std::cout << "Enter number of test samples: ";
+
457 // number of test sample inputs
+
458 std::cin >> T;
+
459 std::vector<std::vector<float>> data2(T);
+
460 // vector<float> Y2(T);
+
461
+
462 for (size_t rows = 0; rows < T; rows++) {
+
463 std::cout << "Sample# " << rows + 1 << ": ";
+
464 std::vector<float> v(F);
+
465 for (size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
+
466 data2[rows] = v;
+
467 }
+
468
+
469 std::vector<float> out = predict_OLS_regressor(data2, beta);
+
470 for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
+
471
+
472 return 0;
+
473}
data
int data[MAX]
test data
Definition hash_search.cpp:24
ols_test
void ols_test()
Definition ordinary_least_squares_regressor.cpp:369
fit_OLS_regressor
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
Definition ordinary_least_squares_regressor.cpp:321
@@ -488,55 +488,53 @@ template<typename T>

Definition at line 369 of file ordinary_least_squares_regressor.cpp.

369 {
-
370 int F = 3, N = 5;
-
371
-
372 /* test function = x^2 -5 */
-
373 std::cout << "Test 1 (quadratic function)....";
-
374 // create training data set with features = x, x^2, x^3
-
375 std::vector<std::vector<float>> data1(
-
376 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
-
377 // create corresponding outputs
-
378 std::vector<float> Y1({20, -4, -5, -4, 31});
-
379 // perform regression modelling
-
380 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
-
381 // create test data set with same features = x, x^2, x^3
-
382 std::vector<std::vector<float>> test_data1(
-
383 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
-
384 // expected regression outputs
-
385 std::vector<float> expected1({-1, -1, 95, 95});
-
386 // predicted regression outputs
-
387 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
-
388 // compare predicted results are within +-0.01 limit of expected
-
389 for (size_t rows = 0; rows < out1.size(); rows++) {
-
390 assert(std::abs(out1[rows] - expected1[rows]) < 0.01);
-
391 }
-
392 std::cout << "passed\n";
-
393
-
394 /* test function = x^3 + x^2 - 100 */
-
395 std::cout << "Test 2 (cubic function)....";
-
396 // create training data set with features = x, x^2, x^3
-
397 std::vector<std::vector<float>> data2(
-
398 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
-
399 // create corresponding outputs
-
400 std::vector<float> Y2({-200, -100, -100, 98, 152});
-
401 // perform regression modelling
-
402 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
-
403 // create test data set with same features = x, x^2, x^3
-
404 std::vector<std::vector<float>> test_data2(
-
405 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
-
406 // expected regression outputs
-
407 std::vector<float> expected2({-104, -88, -1000, 1000});
-
408 // predicted regression outputs
-
409 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
-
410 // compare predicted results are within +-0.01 limit of expected
-
411 for (size_t rows = 0; rows < out2.size(); rows++) {
-
412 assert(std::abs(out2[rows] - expected2[rows]) < 0.01);
-
413 }
-
414 std::cout << "passed\n";
-
415
-
416 std::cout << std::endl; // ensure test results are displayed on screen
-
417 // (flush stdout)
-
418}
+
370 /* test function = x^2 -5 */
+
371 std::cout << "Test 1 (quadratic function)....";
+
372 // create training data set with features = x, x^2, x^3
+
373 std::vector<std::vector<float>> data1(
+
374 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
+
375 // create corresponding outputs
+
376 std::vector<float> Y1({20, -4, -5, -4, 31});
+
377 // perform regression modelling
+
378 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
+
379 // create test data set with same features = x, x^2, x^3
+
380 std::vector<std::vector<float>> test_data1(
+
381 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
+
382 // expected regression outputs
+
383 std::vector<float> expected1({-1, -1, 95, 95});
+
384 // predicted regression outputs
+
385 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
+
386 // compare predicted results are within +-0.01 limit of expected
+
387 for (size_t rows = 0; rows < out1.size(); rows++) {
+
388 assert(std::abs(out1[rows] - expected1[rows]) < 0.01);
+
389 }
+
390 std::cout << "passed\n";
+
391
+
392 /* test function = x^3 + x^2 - 100 */
+
393 std::cout << "Test 2 (cubic function)....";
+
394 // create training data set with features = x, x^2, x^3
+
395 std::vector<std::vector<float>> data2(
+
396 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
+
397 // create corresponding outputs
+
398 std::vector<float> Y2({-200, -100, -100, 98, 152});
+
399 // perform regression modelling
+
400 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
+
401 // create test data set with same features = x, x^2, x^3
+
402 std::vector<std::vector<float>> test_data2(
+
403 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
+
404 // expected regression outputs
+
405 std::vector<float> expected2({-104, -88, -1000, 1000});
+
406 // predicted regression outputs
+
407 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
+
408 // compare predicted results are within +-0.01 limit of expected
+
409 for (size_t rows = 0; rows < out2.size(); rows++) {
+
410 assert(std::abs(out2[rows] - expected2[rows]) < 0.01);
+
411 }
+
412 std::cout << "passed\n";
+
413
+
414 std::cout << std::endl; // ensure test results are displayed on screen
+
415 // (flush stdout)
+
416}
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_source.html b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html index ab289410b..baf9a6de2 100644 --- a/dc/d38/ordinary__least__squares__regressor_8cpp_source.html +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html @@ -437,111 +437,109 @@ $(function(){initNavTree('dc/d38/ordinary__least__squares__regressor_8cpp_source
367
369void ols_test() {
-
370 int F = 3, N = 5;
-
371
-
372 /* test function = x^2 -5 */
-
373 std::cout << "Test 1 (quadratic function)....";
-
374 // create training data set with features = x, x^2, x^3
-
375 std::vector<std::vector<float>> data1(
-
376 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
-
377 // create corresponding outputs
-
378 std::vector<float> Y1({20, -4, -5, -4, 31});
-
379 // perform regression modelling
-
380 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
-
381 // create test data set with same features = x, x^2, x^3
-
382 std::vector<std::vector<float>> test_data1(
-
383 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
-
384 // expected regression outputs
-
385 std::vector<float> expected1({-1, -1, 95, 95});
-
386 // predicted regression outputs
-
387 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
-
388 // compare predicted results are within +-0.01 limit of expected
-
389 for (size_t rows = 0; rows < out1.size(); rows++) {
-
390 assert(std::abs(out1[rows] - expected1[rows]) < 0.01);
-
391 }
-
392 std::cout << "passed\n";
-
393
-
394 /* test function = x^3 + x^2 - 100 */
-
395 std::cout << "Test 2 (cubic function)....";
-
396 // create training data set with features = x, x^2, x^3
-
397 std::vector<std::vector<float>> data2(
-
398 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
-
399 // create corresponding outputs
-
400 std::vector<float> Y2({-200, -100, -100, 98, 152});
-
401 // perform regression modelling
-
402 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
-
403 // create test data set with same features = x, x^2, x^3
-
404 std::vector<std::vector<float>> test_data2(
-
405 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
-
406 // expected regression outputs
-
407 std::vector<float> expected2({-104, -88, -1000, 1000});
-
408 // predicted regression outputs
-
409 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
-
410 // compare predicted results are within +-0.01 limit of expected
-
411 for (size_t rows = 0; rows < out2.size(); rows++) {
-
412 assert(std::abs(out2[rows] - expected2[rows]) < 0.01);
-
413 }
-
414 std::cout << "passed\n";
-
415
-
416 std::cout << std::endl; // ensure test results are displayed on screen
-
417 // (flush stdout)
-
418}
+
370 /* test function = x^2 -5 */
+
371 std::cout << "Test 1 (quadratic function)....";
+
372 // create training data set with features = x, x^2, x^3
+
373 std::vector<std::vector<float>> data1(
+
374 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
+
375 // create corresponding outputs
+
376 std::vector<float> Y1({20, -4, -5, -4, 31});
+
377 // perform regression modelling
+
378 std::vector<float> beta1 = fit_OLS_regressor(data1, Y1);
+
379 // create test data set with same features = x, x^2, x^3
+
380 std::vector<std::vector<float>> test_data1(
+
381 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
+
382 // expected regression outputs
+
383 std::vector<float> expected1({-1, -1, 95, 95});
+
384 // predicted regression outputs
+
385 std::vector<float> out1 = predict_OLS_regressor(test_data1, beta1);
+
386 // compare predicted results are within +-0.01 limit of expected
+
387 for (size_t rows = 0; rows < out1.size(); rows++) {
+
388 assert(std::abs(out1[rows] - expected1[rows]) < 0.01);
+
389 }
+
390 std::cout << "passed\n";
+
391
+
392 /* test function = x^3 + x^2 - 100 */
+
393 std::cout << "Test 2 (cubic function)....";
+
394 // create training data set with features = x, x^2, x^3
+
395 std::vector<std::vector<float>> data2(
+
396 {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});
+
397 // create corresponding outputs
+
398 std::vector<float> Y2({-200, -100, -100, 98, 152});
+
399 // perform regression modelling
+
400 std::vector<float> beta2 = fit_OLS_regressor(data2, Y2);
+
401 // create test data set with same features = x, x^2, x^3
+
402 std::vector<std::vector<float>> test_data2(
+
403 {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});
+
404 // expected regression outputs
+
405 std::vector<float> expected2({-104, -88, -1000, 1000});
+
406 // predicted regression outputs
+
407 std::vector<float> out2 = predict_OLS_regressor(test_data2, beta2);
+
408 // compare predicted results are within +-0.01 limit of expected
+
409 for (size_t rows = 0; rows < out2.size(); rows++) {
+
410 assert(std::abs(out2[rows] - expected2[rows]) < 0.01);
+
411 }
+
412 std::cout << "passed\n";
+
413
+
414 std::cout << std::endl; // ensure test results are displayed on screen
+
415 // (flush stdout)
+
416}
-
419
-
-
423int main() {
-
424 ols_test();
+
417
+
+
421int main() {
+
422 ols_test();
+
423
+
424 size_t N = 0, F = 0;
425
-
426 size_t N = 0, F = 0;
-
427
-
428 std::cout << "Enter number of features: ";
-
429 // number of features = columns
-
430 std::cin >> F;
-
431 std::cout << "Enter number of samples: ";
-
432 // number of samples = rows
-
433 std::cin >> N;
-
434
-
435 std::vector<std::vector<float>> data(N);
-
436 std::vector<float> Y(N);
-
437
-
438 std::cout
-
439 << "Enter training data. Per sample, provide features and one output."
-
440 << std::endl;
-
441
-
442 for (size_t rows = 0; rows < N; rows++) {
-
443 std::vector<float> v(F);
-
444 std::cout << "Sample# " << rows + 1 << ": ";
-
445 for (size_t cols = 0; cols < F; cols++) {
-
446 // get the F features
-
447 std::cin >> v[cols];
-
448 }
-
449 data[rows] = v;
-
450 // get the corresponding output
-
451 std::cin >> Y[rows];
-
452 }
-
453
-
454 std::vector<float> beta = fit_OLS_regressor(data, Y);
-
455 std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
-
456
-
457 size_t T = 0;
-
458 std::cout << "Enter number of test samples: ";
-
459 // number of test sample inputs
-
460 std::cin >> T;
-
461 std::vector<std::vector<float>> data2(T);
-
462 // vector<float> Y2(T);
-
463
-
464 for (size_t rows = 0; rows < T; rows++) {
-
465 std::cout << "Sample# " << rows + 1 << ": ";
-
466 std::vector<float> v(F);
-
467 for (size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
-
468 data2[rows] = v;
-
469 }
-
470
-
471 std::vector<float> out = predict_OLS_regressor(data2, beta);
-
472 for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
-
473
-
474 return 0;
-
475}
+
426 std::cout << "Enter number of features: ";
+
427 // number of features = columns
+
428 std::cin >> F;
+
429 std::cout << "Enter number of samples: ";
+
430 // number of samples = rows
+
431 std::cin >> N;
+
432
+
433 std::vector<std::vector<float>> data(N);
+
434 std::vector<float> Y(N);
+
435
+
436 std::cout
+
437 << "Enter training data. Per sample, provide features and one output."
+
438 << std::endl;
+
439
+
440 for (size_t rows = 0; rows < N; rows++) {
+
441 std::vector<float> v(F);
+
442 std::cout << "Sample# " << rows + 1 << ": ";
+
443 for (size_t cols = 0; cols < F; cols++) {
+
444 // get the F features
+
445 std::cin >> v[cols];
+
446 }
+
447 data[rows] = v;
+
448 // get the corresponding output
+
449 std::cin >> Y[rows];
+
450 }
+
451
+
452 std::vector<float> beta = fit_OLS_regressor(data, Y);
+
453 std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
+
454
+
455 size_t T = 0;
+
456 std::cout << "Enter number of test samples: ";
+
457 // number of test sample inputs
+
458 std::cin >> T;
+
459 std::vector<std::vector<float>> data2(T);
+
460 // vector<float> Y2(T);
+
461
+
462 for (size_t rows = 0; rows < T; rows++) {
+
463 std::cout << "Sample# " << rows + 1 << ": ";
+
464 std::vector<float> v(F);
+
465 for (size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
+
466 data2[rows] = v;
+
467 }
+
468
+
469 std::vector<float> out = predict_OLS_regressor(data2, beta);
+
470 for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
+
471
+
472 return 0;
+
473}
data
int data[MAX]
test data
Definition hash_search.cpp:24
operator+
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition ordinary_least_squares_regressor.cpp:204
@@ -554,7 +552,7 @@ $(function(){initNavTree('dc/d38/ordinary__least__squares__regressor_8cpp_source
fit_OLS_regressor
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< T > const &Y)
Definition ordinary_least_squares_regressor.cpp:321
predict_OLS_regressor
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T > > const &X, std::vector< float > const &beta)
Definition ordinary_least_squares_regressor.cpp:352
operator*
std::vector< std::vector< T > > operator*(std::vector< std::vector< T > > const &A, std::vector< std::vector< T > > const &B)
Definition ordinary_least_squares_regressor.cpp:78
-
main
int main()
Definition ordinary_least_squares_regressor.cpp:423
+
main
int main()
Definition ordinary_least_squares_regressor.cpp:421
get_inverse
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T > > const &A)
Definition ordinary_least_squares_regressor.cpp:226
diff --git a/dc/d40/fast__integer__input_8cpp__incl.svg b/dc/d40/fast__integer__input_8cpp__incl.svg index 19bcb0556..584a52488 100644 --- a/dc/d40/fast__integer__input_8cpp__incl.svg +++ b/dc/d40/fast__integer__input_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 877840ba4..c5b222ef7 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 6d42b3575..b8c24439c 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 @@ - - - - - - - - - - - - - - - - - - diff --git a/dd/d0f/md5_8cpp__incl_org.svg b/dd/d0f/md5_8cpp__incl_org.svg index 502874592..06972a895 100644 --- a/dd/d0f/md5_8cpp__incl_org.svg +++ b/dd/d0f/md5_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

Definition at line 20 of file successive_approximation.cpp.

20 {
-
21 float y, x1, x2, x3, sum, s, a, f1, f2, gd;
+
21 float y, x1, x2, sum;
22 int i, n;
23
24 for (i = 0; i < 10; i++) {
diff --git a/df/dc8/successive__approximation_8cpp_source.html b/df/dc8/successive__approximation_8cpp_source.html index 405dcecd8..49de54111 100644 --- a/df/dc8/successive__approximation_8cpp_source.html +++ b/df/dc8/successive__approximation_8cpp_source.html @@ -126,7 +126,7 @@ $(function(){initNavTree('df/dc8/successive__approximation_8cpp_source.html','..
18
20int main() {
-
21 float y, x1, x2, x3, sum, s, a, f1, f2, gd;
+
21 float y, x1, x2, sum;
22 int i, n;
23
24 for (i = 0; i < 10; i++) {
diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg index 5b711a8e1..1e36ec9a9 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.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 6e7d94b0b..ed3cc73ea 100644 --- a/df/dd6/a1z26__cipher_8cpp__incl_org.svg +++ b/df/dd6/a1z26__cipher_8cpp__incl_org.svg @@ -1,7 +1,7 @@ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -